### A proof of Muirhead’s Inequality

I’ve been reading Thomas Mildorf’s Olympiad Inequalities, and trying to prove the 12 Theorems stated at the beginning. I’m recording my proof of Muirhead’s Inequality below. Although it is probably known to people working in this area, I could not find it on the internet.

Muirhead’s Inequality states the following: if the sequence majorizes the sequence , then for nonnegative numbers , we have the following inequality

We will derive it as an easy consequence of the fact that for a convex function , if the sequence majorizes the sequence , then . This is theorem 9 in Mildorf’s document (the Majorization Theorem).

We will prove the Muirhead Inequality by induction on the number of ‘s. For just one such , this is true by the Majorization Inequality. Now assume that it is true for number of ‘s. Then the statement of Muirhead’s Inequality is equivalent to the statement

The above is true because is a convex function, as it is an exponential function. Hence, . Therefore, .

It follows that

A note on the induction: Consider the base case, where we just have . Then the inequality is equivalent to proving that

, which is true by Muirhead inequality.

Now if we have two ‘s, say and , then this is equivalent to the inequality .

We get the above inequality + terms of the form , which we know from the Majorization Inequality is

The induction will work similarly for higher numbers of ‘s.