Muirhead’s theorem

Let $0\le s_1\le \mathrm{\cdots }\le s_n$ and $0\le t_1\le \mathrm{\dots }\le t_n$ be real numbers such that

$$\sum _{i=1}^n{s}_i=\sum _{i=1}^n{t}_i\text{and}\sum _{i=1}^k{s}_i\le \sum _{i=1}^k{t}_i(k=1,\mathrm{\dots },n-1)$$

Then for any nonnegative numbers $x_1,\mathrm{\dots },x_n$,

$$\sum _{\sigma }{x}_1^{s_{\sigma (1)}}\mathrm{\dots }{x}_n^{s_{\sigma (n)}}\ge \sum _{\sigma }{x}_1^{t_{\sigma (1)}}\mathrm{\dots }{x}_n^{t_{\sigma (n)}}$$

where the sums run over all permutations $\sigma$ of $\{1,2,\mathrm{\dots },n\}$.

Title	Muirhead’s theorem
Canonical name	MuirheadsTheorem
Date of creation	2013-03-22 13:15:25
Last modified on	2013-03-22 13:15:25
Owner	Koro (127)
Last modified by	Koro (127)
Numerical id	7
Author	Koro (127)
Entry type	Theorem
Classification	msc 26D15
Synonym	Muirhead’s inequality
Related topic	CharacterizationsOfMajorization