Difference between revisions of "Power Mean Inequality"
(Added proof) |
|||
| Line 24: | Line 24: | ||
</cmath> | </cmath> | ||
| − | We can see that the function <math>f(x)=x^{\frac{k_1}{k_2}}</math> is convex for all <math>x | + | We can see that the function <math>f(x)=x^{\frac{k_1}{k_2}}</math> is convex for all <math>x > 0</math>, and so we can apply [[Jensen's Inequality]]. Therefore, |
<cmath> | <cmath> | ||
| − | \left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)^{\frac{k_1}{k_2}}= f\left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)\le \sum_{i=1}^n f\left(\frac{a_i}{n}\right)= \sum_{i=1}^n \frac{a_{i}^{k_1}}{n} | + | \left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)^{\frac{k_1}{k_2}}= f\left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)\le \sum_{i=1}^n f\left(\frac{a_i^{k_2}}{n}\right)= \sum_{i=1}^n \frac{a_{i}^{k_1}}{n} |
</cmath> | </cmath> | ||
{{stub}} | {{stub}} | ||
[[Category:Inequality]] | [[Category:Inequality]] | ||
[[Category:Theorems]] | [[Category:Theorems]] | ||
Revision as of 21:52, 10 June 2017
The Power Mean Inequality is a generalized form of the multi-variable Arithmetic Mean-Geometric Mean Inequality.
Inequality
For real numbers 
and positive real numbers 
, 
implies the 
th power mean is greater than or equal to the 
th.
Algebraically, implies that
![\[\sqrt[k_1]{\frac{a_{1}^{k_1}+a_{2}^{k_1}+\cdots +a_{n}^{k_1}}{n}}\ge \sqrt[k_2]{\frac{a_{1}^{k_2}+a_{2}^{k_2}+\cdots +a_{n}^{k_2}}{n}}\]](http://latex.artofproblemsolving.com/5/1/c/51ca907a73ebeaf6f520c77f7281c0c0b5f662ec.png)
which can be written more concisely as
![\[\sqrt[k_1]{\frac{\sum\limits_{i=1}^n a_{i}^{k_1}}{n}}\ge \sqrt[k_2]{\frac{\sum\limits_{i=1}^n a_{i}^{k_2}}{n}}\]](http://latex.artofproblemsolving.com/6/f/b/6fb4cbf03b94f3e494719f49c0cf2504c93add08.png)
The Power Mean Inequality follows from the fact that 
(where 
is the 
th power mean) together with Jensen's Inequality.
Proof
![\[\left(\sum_{i=1}^n \frac{a_{i}^{k_1}}{n}\right)^{\frac{1}{k_1}}\ge \left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)^{\frac{1}{k_2}}\]](http://latex.artofproblemsolving.com/0/5/9/059dcc989c9c5b8bdd5c2388a1aec7ba518b8948.png)
Raising both sides to the th power, we get
![\[\sum_{i=1}^n \frac{a_{i}^{k_1}}{n}\ge \left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)^{\frac{k_1}{k_2}}\]](http://latex.artofproblemsolving.com/1/2/2/122c41965c1491041edd9c9426eba00acf1922bd.png)
We can see that the function 
is convex for all 
, and so we can apply Jensen's Inequality. Therefore,
![\[\left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)^{\frac{k_1}{k_2}}= f\left(\sum_{i=1}^n \frac{a_{i}^{k_2}}{n}\right)\le \sum_{i=1}^n f\left(\frac{a_i^{k_2}}{n}\right)= \sum_{i=1}^n \frac{a_{i}^{k_1}}{n}\]](http://latex.artofproblemsolving.com/7/4/c/74c6d65c06345ebc9572c0d9e624ac7761d59d71.png)
This article is a stub. Help us out by expanding it.
