Proof
The lower bound follows by applying the upper bound to
Therefore, it suffices to prove the upper bound. Since there are only finitely many permutations, there exists at least one for which
is maximal. In case there are several permutations with this property, let σ denote one with the highest number of fixed points.
We will now prove by contradiction, that σ has to be the identity (then we are done). Assume that σ is not the identity. Then there exists a j in {1, ..., n − 1} such that σ(j) ≠ j and σ(i) = i for all i in {1, ..., j − 1}. Hence σ(j) > j and there exists k in {j + 1, ..., n} with σ(k) = j. Now
Therefore,
Expanding this product and rearranging gives
hence the permutation
which arises from σ by exchanging the values σ(j) and σ(k), has at least one additional fixed point compared to σ, namely at j, and also attains the maximum. This contradicts the choice of σ.
If
then we have strict inequalities at (1), (2), and (3), hence the maximum can only be attained by the identity, any other permutation σ cannot be optimal.
Read more about this topic: Rearrangement Inequality
Famous quotes containing the word proof:
“When children feel good about themselves, its like a snowball rolling downhill. They are continually able to recognize and integrate new proof of their value as they grow and mature.”
—Stephanie Martson (20th century)
“The thing with Catholicism, the same as all religions, is that it teaches what should be, which seems rather incorrect. This is what should be. Now, if youre taught to live up to a what should be that never existedonly an occult superstition, no proof of this should beMthen you can sit on a jury and indict easily, you can cast the first stone, you can burn Adolf Eichmann, like that!”
—Lenny Bruce (19251966)
“O, popular applause! what heart of man
Is proof against thy sweet, seducing charms?”
—William Cowper (17311800)

