Kolmogorov's inequality
Kolmogorov's inequality is a probabilistic inequality of partial sums of independent random variables.
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 2398124416
- Described as
- probabilistic inequality of partial sums of independent random variables
- What it is
- inequality; theorem
- Named after
- Andrey Kolmogorov
- Wikipedias with a page
- 10
Wikidata item Q1747439 (wikidata.org/wiki/Q1747439), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1322816953
In probability theory, Kolmogorov's inequality is a so-called "maximal inequality" that gives a bound on the probability that the partial sums of a finite collection of independent random variables exceed some specified bound.
From the Wikipedia article “Kolmogorov's inequality” (en.wikipedia.org/wiki/Kolmogorov's_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.
