proof of rearrangement inequality
We first prove the rearrangement inequality for the case . Let be real numbers such that and . Then
and therefore
Equality holds iff or .
For the general case, let and
be real numbers such that . Suppose that is a permutation
(rearrangement) of such that the sum
is maximized. If there exists a pair with , then (the case); equality holds iff . Therefore, is not maximal unless or for all pairs such that . In the latter case, we can consecutively interchange these pairs until (this is possible because the number of pairs with decreases with each step). So is maximized if
To show that is minimal for a permutation of if , observe that is maximized if . This implies that is minimized if
Title | proof of rearrangement inequality |
---|---|
Canonical name | ProofOfRearrangementInequality |
Date of creation | 2013-03-22 13:08:41 |
Last modified on | 2013-03-22 13:08:41 |
Owner | pbruin (1001) |
Last modified by | pbruin (1001) |
Numerical id | 4 |
Author | pbruin (1001) |
Entry type | Proof |
Classification | msc 26D15 |
Related topic | ChebyshevsInequality |