Chebyshev's sum inequality
Chebyshev's sum inequality is an inequality relating two increasing sequences of numbers, or one decreasing and another increasing sequence.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2458990669
- Described as
- inequality relating two increasing sequences of numbers, or one decreasing and another increasing sequence
- What it is
- inequality; theorem
- Named after
- Pafnuty Chebyshev
- Wikipedias with a page
- 17
Wikidata item Q1428736 (wikidata.org/wiki/Q1428736), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1355044557
In mathematics, Chebyshev's sum inequality, named after Pafnuty Chebyshev, states that if
a1≥a2≥⋯≥an and b1≥b2≥⋯≥bn,
then1n∑k=1nakbk≥(1n∑k=1nak)(1n∑k=1nbk).
In words, if we are given two sequences that are both non-increasing or non-decreasing, then the product of their averages is less than the average of their (termwise) product.
Similarly, ifa1≤a2≤⋯≤an and b1≥b2≥⋯≥bn,
then1n∑k=1nakbk≤(1n∑k=1nak)(1n∑k=1nbk).
From the Wikipedia article “Chebyshev's sum inequality” (en.wikipedia.org/wiki/Chebyshev's_sum_inequality), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
