# Difference between revisions of "Muirhead's Inequality"

m (→Example) |
m (→Usage on Olympiad Problems) |
||

Line 21: | Line 21: | ||

Adding these, | Adding these, | ||

− | <math>x^4+y^4\geq x^3y+xy^3</math> | + | <math>x^4+y^4\geq x^3y+xy^3</math>. |

Multiplying both sides by <math>xy</math> (as both <math>x</math> and <math>y</math> are positive), | Multiplying both sides by <math>xy</math> (as both <math>x</math> and <math>y</math> are positive), |

## Revision as of 14:13, 27 October 2007

**Muirhead's Inequality** states that if a sequence majorizes a sequence , then given a set of positive integers :

## Example

The inequality is easier to understand given an example. Since the sequence majorizes , Muirhead's inequality states that for any positive ,

.

## 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:

Adding these,

.

Multiplying both sides by (as both and are positive),

as desired.