J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
P r e l i m i n a r y d e f i n i t i o n s
T o g g l e P r e l i m i n a r y d e f i n i t i o n s s u b s e c t i o n
1 . 1
a - m e a n
1 . 2
D o u b l y s t o c h a s t i c m a t r i c e s
2
S t a t e m e n t
T o g g l e S t a t e m e n t s u b s e c t i o n
2 . 1
A n o t h e r e q u i v a l e n t c o n d i t i o n
3
S y m m e t r i c s u m n o t a t i o n
4
E x a m p l e s
T o g g l e E x a m p l e s s u b s e c t i o n
4 . 1
A r i t h m e t i c - g e o m e t r i c m e a n i n e q u a l i t y
4 . 2
O t h e r e x a m p l e s
5
S e e a l s o
6
N o t e s
7
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
M u i r h e a d ' s i n e q u a l i t y
9 l a n g u a g e s
● D e u t s c h
● F r a n ç a i s
● 한 국 어
● I t a l i a n o
● M a g y a r
● P o l s k i
● Р у с с к и й
● S u o m i
● У к р а ї н с ь к а
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
Preliminary definitions [ edit ]
For any real vector
a
=
(
a
1
,
…
,
a
n
)
{\displaystyle a=(a_{1},\dots ,a_{n})}
define the "a -mean" [a ] of positive real numbers x 1 , ..., x n by
[
a
]
=
1
n
!
∑
σ
x
σ
1
a
1
⋯
x
σ
n
a
n
,
{\displaystyle [a ]={\frac {1}{n!}}\sum _{\sigma }x_{\sigma _{1}}^{a_{1}}\cdots x_{\sigma _{n}}^{a_{n}},}
where the sum extends over all permutations σ of { 1, ..., n }.
When the elements of a are nonnegative integers, the a -mean can be equivalently defined via the monomial symmetric polynomial
m
a
(
x
1
,
…
,
x
n
)
{\displaystyle m_{a}(x_{1},\dots ,x_{n})}
as
[
a
]
=
k
1
!
⋯
k
l
!
n
!
m
a
(
x
1
,
…
,
x
n
)
,
{\displaystyle [a ]={\frac {k_{1}!\cdots k_{l}!}{n!}}m_{a}(x_{1},\dots ,x_{n}),}
where ℓ is the number of distinct elements in a , and k 1 , ..., k ℓ are their multiplicities.
Notice that the a -mean as defined above only has the usual properties of a mean (e.g., if the mean of equal numbers is equal to them) if
a
1
+
⋯
+
a
n
=
1
{\displaystyle a_{1}+\cdots +a_{n}=1}
. In the general case, one can consider instead
[
a
]
1
/
(
a
1
+
⋯
+
a
n
)
{\displaystyle [a ]^{1/(a_{1}+\cdots +a_{n})}}
, which is called a Muirhead mean .[1]
Examples
For a = (1, 0, ..., 0), the a -mean is just the ordinary arithmetic mean of x 1 , ..., x n .
For a = (1/n , ..., 1/n ), the a -mean is the geometric mean of x 1 , ..., x n .
For a = (x , 1 − x ), the a -mean is the Heinz mean .
The Muirhead mean for a = (−1, 0, ..., 0) is the harmonic mean .
Doubly stochastic matrices [ edit ]
An n × n matrix P is doubly stochastic precisely if both P and its transpose P T are stochastic matrices . A stochastic matrix is a square matrix of nonnegative real entries in which the sum of the entries in each column is 1. Thus, a doubly stochastic matrix is a square matrix of nonnegative real entries in which the sum of the entries in each row and the sum of the entries in each column is 1.
Statement [ edit ]
Muirhead's inequality states that [a ] ≤ [b ] for all x such that x i > 0 for every i ∈ { 1, ..., n } if and only if there is some doubly stochastic matrix P for which a = Pb .
Furthermore, in that case we have [a ] = [b ] if and only if a = b or all x i are equal.
The latter condition can be expressed in several equivalent ways; one of them is given below.
The proof makes use of the fact that every doubly stochastic matrix is a weighted average of permutation matrices (Birkhoff-von Neumann theorem ).
Another equivalent condition [ edit ]
Because of the symmetry of the sum, no generality is lost by sorting the exponents into decreasing order:
a
1
≥
a
2
≥
⋯
≥
a
n
{\displaystyle a_{1}\geq a_{2}\geq \cdots \geq a_{n}}
b
1
≥
b
2
≥
⋯
≥
b
n
.
{\displaystyle b_{1}\geq b_{2}\geq \cdots \geq b_{n}.}
Then the existence of a doubly stochastic matrix P such that a = Pb is equivalent to the following system of inequalities:
a
1
≤
b
1
a
1
+
a
2
≤
b
1
+
b
2
a
1
+
a
2
+
a
3
≤
b
1
+
b
2
+
b
3
⋮
a
1
+
⋯
+
a
n
−
1
≤
b
1
+
⋯
+
b
n
−
1
a
1
+
⋯
+
a
n
=
b
1
+
⋯
+
b
n
.
{\displaystyle {\begin{aligned}a_{1}&\leq b_{1}\\a_{1}+a_{2}&\leq b_{1}+b_{2}\\a_{1}+a_{2}+a_{3}&\leq b_{1}+b_{2}+b_{3}\\&\,\,\,\vdots \\a_{1}+\cdots +a_{n-1}&\leq b_{1}+\cdots +b_{n-1}\\a_{1}+\cdots +a_{n}&=b_{1}+\cdots +b_{n}.\end{aligned}}}
(The last one is an equality; the others are weak inequalities.)
The sequence
b
1
,
…
,
b
n
{\displaystyle b_{1},\ldots ,b_{n}}
is said to majorize the sequence
a
1
,
…
,
a
n
{\displaystyle a_{1},\ldots ,a_{n}}
.
Symmetric sum notation [ edit ]
It is convenient to use a special notation for the sums. A success in reducing an inequality in this form means that the only condition for testing it is to verify whether one exponent sequence (
α
1
,
…
,
α
n
{\displaystyle \alpha _{1},\ldots ,\alpha _{n}}
) majorizes the other one.
∑
sym
x
1
α
1
⋯
x
n
α
n
{\displaystyle \sum _{\text{sym}}x_{1}^{\alpha _{1}}\cdots x_{n}^{\alpha _{n}}}
This notation requires developing every permutation, developing an expression made of n ! monomials , for instance:
∑
sym
x
3
y
2
z
0
=
x
3
y
2
z
0
+
x
3
z
2
y
0
+
y
3
x
2
z
0
+
y
3
z
2
x
0
+
z
3
x
2
y
0
+
z
3
y
2
x
0
=
x
3
y
2
+
x
3
z
2
+
y
3
x
2
+
y
3
z
2
+
z
3
x
2
+
z
3
y
2
{\displaystyle {\begin{aligned}\sum _{\text{sym}}x^{3}y^{2}z^{0}&=x^{3}y^{2}z^{0}+x^{3}z^{2}y^{0}+y^{3}x^{2}z^{0}+y^{3}z^{2}x^{0}+z^{3}x^{2}y^{0}+z^{3}y^{2}x^{0}\\&=x^{3}y^{2}+x^{3}z^{2}+y^{3}x^{2}+y^{3}z^{2}+z^{3}x^{2}+z^{3}y^{2}\end{aligned}}}
Examples [ edit ]
Arithmetic-geometric mean inequality [ edit ]
Let
a
G
=
(
1
n
,
…
,
1
n
)
{\displaystyle a_{G}=\left({\frac {1}{n}},\ldots ,{\frac {1}{n}}\right)}
and
a
A
=
(
1
,
0
,
0
,
…
,
0
)
.
{\displaystyle a_{A}=(1,0,0,\ldots ,0).}
We have
a
A
1
=
1
>
a
G
1
=
1
n
,
a
A
1
+
a
A
2
=
1
>
a
G
1
+
a
G
2
=
2
n
,
⋮
a
A
1
+
⋯
+
a
A
n
=
a
G
1
+
⋯
+
a
G
n
=
1.
{\displaystyle {\begin{aligned}a_{A1}=1&>a_{G1}={\frac {1}{n}},\\a_{A1}+a_{A2}=1&>a_{G1}+a_{G2}={\frac {2}{n}},\\&\,\,\,\vdots \\a_{A1}+\cdots +a_{An}&=a_{G1}+\cdots +a_{Gn}=1.\end{aligned}}}
Then
[a A ] ≥ [a G ],
which is
1
n
!
(
x
1
1
⋅
x
2
0
⋯
x
n
0
+
⋯
+
x
1
0
⋯
x
n
1
)
(
n
−
1
)
!
≥
1
n
!
(
x
1
⋅
⋯
⋅
x
n
)
1
/
n
n
!
{\displaystyle {\frac {1}{n!}}(x_{1}^{1}\cdot x_{2}^{0}\cdots x_{n}^{0}+\cdots +x_{1}^{0}\cdots x_{n}^{1})(n-1)!\geq {\frac {1}{n!}}(x_{1}\cdot \cdots \cdot x_{n})^{1/n}n!}
yielding the inequality.
Other examples [ edit ]
We seek to prove that x 2 + y 2 ≥ 2xy by using bunching (Muirhead's inequality).
We transform it in the symmetric-sum notation:
∑
s
y
m
x
2
y
0
≥
∑
s
y
m
x
1
y
1
.
{\displaystyle \sum _{\mathrm {sym} }x^{2}y^{0}\geq \sum _{\mathrm {sym} }x^{1}y^{1}.}
The sequence (2, 0) majorizes the sequence (1, 1), thus the inequality holds by bunching.
Similarly, we can prove the inequality
x
3
+
y
3
+
z
3
≥
3
x
y
z
{\displaystyle x^{3}+y^{3}+z^{3}\geq 3xyz}
by writing it using the symmetric-sum notation as
∑
s
y
m
x
3
y
0
z
0
≥
∑
s
y
m
x
1
y
1
z
1
,
{\displaystyle \sum _{\mathrm {sym} }x^{3}y^{0}z^{0}\geq \sum _{\mathrm {sym} }x^{1}y^{1}z^{1},}
which is the same as
2
x
3
+
2
y
3
+
2
z
3
≥
6
x
y
z
.
{\displaystyle 2x^{3}+2y^{3}+2z^{3}\geq 6xyz.}
Since the sequence (3, 0, 0) majorizes the sequence (1, 1, 1), the inequality holds by bunching.
See also [ edit ]
^ Bullen, P. S. Handbook of means and their inequalities. Kluwer Academic Publishers Group, Dordrecht, 2003. ISBN 1-4020-1522-4
References [ edit ]
Combinatorial Theory by John N. Guidi, based on lectures given by Gian-Carlo Rota in 1998, MIT Copy Technology Center, 2002.
Kiran Kedlaya, A < B (A less than B ) , a guide to solving inequalities
Muirhead's theorem at PlanetMath .
Hardy, G.H.; Littlewood, J.E.; Pólya, G. (1952), Inequalities, Cambridge Mathematical Library (2. ed.), Cambridge: Cambridge University Press, ISBN 0-521-05206-8 , MR 0046395 , Zbl 0047.05302 , Section 2.18, Theorem 45.
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Muirhead%27s_inequality&oldid=1214542612 "
C a t e g o r i e s :
● I n e q u a l i t i e s
● M e a n s
H i d d e n c a t e g o r i e s :
● A r t i c l e s w i t h s h o r t d e s c r i p t i o n
● S h o r t d e s c r i p t i o n i s d i f f e r e n t f r o m W i k i d a t a
● T h i s p a g e w a s l a s t e d i t e d o n 1 9 M a r c h 2 0 2 4 , a t 1 6 : 0 8 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w