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:
“To cease to admire is a proof of deterioration.”
—Charles Horton Cooley (18641929)
“War is a beastly business, it is true, but one proof we are human is our ability to learn, even from it, how better to exist.”
—M.F.K. Fisher (19081992)
“If we view our children as stupid, naughty, disturbed, or guilty of their misdeeds, they will learn to behold themselves as foolish, faulty, or shameful specimens of humanity. They will regard us as judges from whom they wish to hide, and they will interpret everything we say as further proof of their unworthiness. If we view them as innocent, or at least merely ignorant, they will gain understanding from their experiences, and they will continue to regard us as wise partners.”
—Polly Berrien Berends (20th century)

