Khintchine inequality
Khintchine inequality is an inequality in probability theory.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 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 18, 2026 · revision 2552165998
- Described as
- inequality in probability theory
- What it is
- theorem; inequality
- Wikipedias with a page
- 4
Wikidata item Q6401711 (wikidata.org/wiki/Q6401711), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1286472536
The Khintchine inequality, is a result in probability also frequently used in analysis bounding the expectation a weighted sum of Rademacher random variables with square-summable weights. It is named after Aleksandr Khinchin and spelled in multiple ways in the Latin alphabet.
It states that for each p∈(0,∞) there exist constants Ap,Bp>0 depending only on p such that for every sequence x=(x1,x2,…)∈ℓ2, and i.i.d. Rademacher random variables ϵ1,ϵ2,…,
Ap≤𝔼[|∑n=1∞ϵnxn|p]1/p‖x‖2≤Bp.
As a particular case, consider N complex numbers x1,…,xN∈ℂ, which can be pictured as vectors in a plane. Now sample N random signs ϵ1,…,ϵN∈{−1,+1}, with equal independent probability. The inequality states that |∑iϵixi|≈|x1|2+⋯+|xN|2
with a bounded error.
From the Wikipedia article “Khintchine inequality” (en.wikipedia.org/wiki/Khintchine_inequality), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; 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.