Chebyshev's sum inequality
{{For|the similarly named inequality in probability theory|Chebyshev's inequality}}
In mathematics, Chebyshev's sum inequality, named after Pafnuty Chebyshev, states that if
: and
then
:
Similarly, if
: and
then
Proof
Consider the sum
:
The two sequences are non-increasing, therefore {{math|aj − ak}} and {{math|bj − bk}} have the same sign for any {{math|j, k}}. Hence {{math|S ≥ 0}}.
Opening the brackets, we deduce:
:
hence
:
An alternative proof is simply obtained with the rearrangement inequality, writing that
:
\leq \sum_{k=0}^{n-1} \sum_{i=0}^{n-1} a_ib_i = n \sum_i a_ib_i.
Continuous version
There is also a continuous version of Chebyshev's sum inequality:
If f and g are real-valued, integrable functions over [a, b], both non-increasing or both non-decreasing, then
:
with the inequality reversed if one is non-increasing and the other is non-decreasing.