|
The Rearrangement InequalityLet (x) = x1,x2,...,xn and (y) = y1,y2,...,yn be two sequences of positive real numbers. Then the sum
is maximized when (x) and (y) are ordered the same way (e.g. both in ascending order or both in descending order), and the sum is minimized when (x) and (y) are ordered oppositely, with equality iff (x) is constant or (y) is constant. Definitions Two sequences, (x) and (y), are defined as ordered the same way if for
any i,j, xi > xj ==> yi ≥ yj
and yi > yj ==> xi ≥ xj, Two sequences, (x) and (y), are defined as ordered oppositely if for
any i,j, xi > xj ==> yi ≤ yj
and yi > yj ==> xi ≤ xj, Proof When n=2, (x2-x1)(y2-y1) ≥
0 is equivalent to x1y1+x2y2 ≥
x1y2+x2y1, and (x2-x1)(y2-y1)
≤ 0 is equivalent to x1y1+x2y2
≤ x1y2+x2y1. When n>2, suppose (x) and (y) are ordered the same way, but the sum,
is not maximized. Then a permutation, (z), of (y) exists such that the sum,
is maximal, with T larger than S. If (x) and (z) were not ordered the same way, then an i,j would exist such that xi > xj and zi < zj. In this case, xizi+xjzj < xizj+xjzi (the n=2 case with strict inequality), so interchanging zi and zj would result in a larger sum, contradicting maximality, so (x) and (z) are ordered the same way. Now we have (x) and (y) ordered the same way, giving a sum of S, and (x) and (z) ordered the same way, giving a larger sum of T>S. But since (y) is a permutation of (z) and (y) and (z) are ordered the same way, so for all i, yi=zi, and thus T=S. Internet References
Related pages in this website
|
|
The webmaster and author of the Math
Help site is Graeme McRae. |