Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Muirhead's Inequality"

m (→‎Example)
(A Proof of Muirhead's Inequality)
Line 1: Line 1:
 
'''Muirhead's Inequality''' states that if a sequence <math>A</math> [[Majorization|majorizes]] a sequence <math>B</math>, then given a set of positive reals <math>x_1,x_2,\cdots,x_n</math>:
 
'''Muirhead's Inequality''' states that if a sequence <math>A</math> [[Majorization|majorizes]] a sequence <math>B</math>, then given a set of positive reals <math>x_1,x_2,\cdots,x_n</math>:
−
<center><math>\sum_{\text{sym}} {x_1}^{a_1}{x_2}^{a_2}\cdots {x_n}^{a_n}\geq \sum_{\text{sym}} {x_1}^{b_1}{x_2}^{b_2}\cdots {x_n}^{b_n}</math></center>
+
<cmath>\sum_{\text{sym}} {x_1}^{a_1}{x_2}^{a_2}\cdots {x_n}^{a_n}\geq \sum_{\text{sym}} {x_1}^{b_1}{x_2}^{b_2}\cdots {x_n}^{b_n}</cmath>
  
 
== Example ==
 
== Example ==
Line 6: Line 6:
  
 
<math>x^5y^1+y^5x^1\geq x^4y^2+y^4x^2</math>.
 
<math>x^5y^1+y^5x^1\geq x^4y^2+y^4x^2</math>.
 +
 +
==Proof==
 +
We will first prove an important fact. If we have a sequence <math>C</math> such that <math>\sum_{i=1}^{n} c_i = 0</math>, then the following result holds:
 +
<cmath>\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}\geq n!</cmath>
 +
for any positive reals <math>x_1, x_2, ..., x_n</math>.
 +
 +
Proof: By AM-GM, we know:
 +
<cmath>\frac{\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}{n!}\geq \sqrt[n!]{\prod_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}</cmath>
 +
 +
However, expanding the right hand side, we see
 +
<cmath>\sqrt[n!]{\prod_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}=\sqrt[n!]{\prod_{i=1}^{n} x_i^{(n-1)!c_1+c_2+\cdots +c_n}}=1</cmath>
 +
or
 +
<cmath>\frac{\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}{n!}\geq 1 \Rightarrow \sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}\geq n!</cmath>
 +
 +
We define our sequence <math>C</math> such that
 +
<cmath>c_i=a_i-b_i \hspace{1cm} \forall \hspace{2mm}1\leq i\leq n</cmath>
 +
 +
Note that
 +
<cmath>\sum_{i=1}^{n} c_i = \sum_{i=1}^{n} a_i-b_i=\sum_{i=1}^{n} a_i - \sum_{i=1}^{n} b_i=0</cmath>
 +
 +
Therefore, we get that
 +
<cmath>\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n} -n!\geq 0</cmath>
 +
 +
We multiply this by <math>\sum_{\text{sym}} \prod_{i=1}^{n}x_i^{b_i}</math> to get:
 +
<cmath>(\sum_{\text{sym}} \prod_{i=1}^{n}x_i^{b_i})(\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}-1)=\sum_{\text{sym}} \prod_{i=1}^{n} x_i^{b_i+c_i}-\prod_{i=1}^{n} x_i^{b_i}\geq 0</cmath>
 +
 +
Since <math>b_i+c_i=b_i+a_i-b_i=a_i</math>, we get
 +
<cmath>\sum_{\text{sym}} \prod_{i=1}^{n} x_i^{a_i}-\prod_{i=1}^{n} x_i^{b_i}\geq 0</cmath>
 +
or
 +
<cmath>\sum_{\text{sym}} {x_1}^{a_1}{x_2}^{a_2}\cdots {x_n}^{a_n}\geq \sum_{\text{sym}} {x_1}^{b_1}{x_2}^{b_2}\cdots {x_n}^{b_n}</cmath>
  
 
== Usage on Olympiad Problems ==
 
== Usage on Olympiad Problems ==

Revision as of 12:49, 14 August 2018

Muirhead's Inequality states that if a sequence $A$ majorizes a sequence $B$, then given a set of positive reals $x_1,x_2,\cdots,x_n$: \[\sum_{\text{sym}} {x_1}^{a_1}{x_2}^{a_2}\cdots {x_n}^{a_n}\geq \sum_{\text{sym}} {x_1}^{b_1}{x_2}^{b_2}\cdots {x_n}^{b_n}\]

Example

The inequality is easier to understand given an example. Since the sequence $(5,1)$ majorizes $(4,2)$ (as $5>1, 5+1=4+2$), Muirhead's inequality states that for any positive $x,y$,

$x^5y^1+y^5x^1\geq x^4y^2+y^4x^2$.

Proof

We will first prove an important fact. If we have a sequence $C$ such that $\sum_{i=1}^{n} c_i = 0$, then the following result holds: \[\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}\geq n!\] for any positive reals $x_1, x_2, ..., x_n$.

Proof: By AM-GM, we know: \[\frac{\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}{n!}\geq \sqrt[n!]{\prod_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}\]

However, expanding the right hand side, we see \[\sqrt[n!]{\prod_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}=\sqrt[n!]{\prod_{i=1}^{n} x_i^{(n-1)!c_1+c_2+\cdots +c_n}}=1\] or \[\frac{\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}}{n!}\geq 1 \Rightarrow \sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}\geq n!\]

We define our sequence $C$ such that \[c_i=a_i-b_i \hspace{1cm} \forall \hspace{2mm}1\leq i\leq n\]

Note that \[\sum_{i=1}^{n} c_i = \sum_{i=1}^{n} a_i-b_i=\sum_{i=1}^{n} a_i - \sum_{i=1}^{n} b_i=0\]

Therefore, we get that \[\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n} -n!\geq 0\]

We multiply this by $\sum_{\text{sym}} \prod_{i=1}^{n}x_i^{b_i}$ to get: \[(\sum_{\text{sym}} \prod_{i=1}^{n}x_i^{b_i})(\sum_{\text{sym}}{x_1}^{c_1}{x_2}^{c_2}\cdots {x_n}^{c_n}-1)=\sum_{\text{sym}} \prod_{i=1}^{n} x_i^{b_i+c_i}-\prod_{i=1}^{n} x_i^{b_i}\geq 0\]

Since $b_i+c_i=b_i+a_i-b_i=a_i$, we get \[\sum_{\text{sym}} \prod_{i=1}^{n} x_i^{a_i}-\prod_{i=1}^{n} x_i^{b_i}\geq 0\] or \[\sum_{\text{sym}} {x_1}^{a_1}{x_2}^{a_2}\cdots {x_n}^{a_n}\geq \sum_{\text{sym}} {x_1}^{b_1}{x_2}^{b_2}\cdots {x_n}^{b_n}\]

Usage on Olympiad Problems

A common bruteforce technique with inequalities is to clear denominators, multiply everything out, and apply Muirhead's or Schur's. However, it is worth noting that any inequality that can be proved directly with Muirhead can also be proved using the Arithmetic Mean-Geometric Mean inequality. In fact, IMO gold medalist Thomas Mildorf says it is unwise to use Muirhead in an Olympiad solution; one should use an application of AM-GM instead. Thus, it is suggested that Muirhead be used only to verify that an inequality can be proved with AM-GM before demonstrating the full AM-GM proof.

As an example, the above inequality can be proved using AM-GM as follows:

$\frac{x^4+x^4+x^4+y^4}{4}\geq\sqrt[4]{x^{12}y^4}=x^3y$

$\frac{x^4+y^4+y^4+y^4}{4}\geq\sqrt[4]{x^4y^{12}}=xy^3$

Adding these,

$x^4+y^4\geq x^3y+xy^3$.

Multiplying both sides by $xy$ (as both $x$ and $y$ are positive),

$x^5y+xy^5\geq x^4y^2+x^2y^4$

as desired.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Muirhead%27s_Inequality&oldid=97223"