The Muirhead-Rado inequality, 2: Symmetric means and inequalities
Melvyn B. Nathanson
TL;DR
The work develops a unified framework for monomial inequalities driven by symmetry, using symmetric means $[\mathbf x^{\mathbf a}]_G$ and majorization to classify when $[\mathbf x^{\mathbf b}]_G<[\mathbf x^{\mathbf a}]_G$ holds. It provides two proofs of Muirhead's inequality (and its converse) and extends the ideas to subgroups via Rado's inequality, leveraging permutohedra $K_G(\mathbf a)$ and convex separation. The approach links discrete majorization with continuous optimization and geometric objects, yielding a comprehensive theory for comparing symmetric sums of monomials in $n$ variables. This has foundational implications for inequalities across symmetric means and their generalizations to subgroup actions.
Abstract
Preliminary results from Nathanson [5] are used to prove the Muirhead and Rado inequalities.
