How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Kolmogorov convergence criterion
Statement
For independent centered square-integrable real random variables , if , then converges almost surely and in to the same finite real random variable.
Facts & Assumptions
Kolmogorov maximal inequality: Let be independent centered square-integrable real random variables, , and . For every , Thus controlling the whole finite maximum costs no larger bound than controlling the final sum by Chebyshev.
Almost-sure convergence of a random series: For real random variables , the series converges almost surely if its partial sums converge to a finite real limit on an event of probability one, as in def-almost-sure-convergence-of-random-variables. With from def-partial-sums-and-sample-means, its convergence event is This is exactly the real Cauchy condition, with the indexing of thm-series-cauchy-criterion shifted by one. Measurable arithmetic makes every event in this countable expression measurable. For any fixed , the union over may be restricted to ; then each difference uses only . Thus is in the tail sigma-algebra, without assuming independence. Under independence, cor-almost-sure-convergence-of-an-independent-series-is-a-zero-one-event gives . Set on and off . The functions converge everywhere to , so thm-sequential-suprema-infima-limsup-liminf-and-pointwise-limits-are-measurable and thm-arithmetic-and-lattice-operations-preserve-measurability make measurable. For Borel sets , the event is likewise tail measurable. Changing finitely many summands adds an eventually constant finite difference to ; divided by deterministic tending to infinity that difference tends to zero, so the normalized limsup is unchanged. The sign of the unnormalized limsup need not be unchanged: the all-zero sequence has limsup zero, while changing its first term to makes the limsup of partial sums equal to .
A series converges iff for every there is with for all : Let be a sequence of reals, with partial sums (def-series). Then converges if and only if The block is the finite sum of def-finite-sum, and it equals . This is the Cauchy criterion transported from sequences to series. Its value is that it decides convergence without producing, or even naming, the sum.
Continuity from below for measures: Let be an increasing sequence of measurable sets for a measure , so . Then No finiteness hypothesis is required.
Continuity from above when one set has finite measure: Let be a decreasing sequence of measurable sets for a measure . If for some , then
Variance and covariance identities for random variables: Let be square-integrable real random variables on one probability space. Then Moreover, covariance is symmetric and bilinear on finite linear combinations. On finite full-power-set probability spaces these formulas reduce to the published finite identities.
Riesz-Fischer completeness of for : Let be a measure space and let . Then , with the norm of thm-the-l-p-norm-descends-to-the-quotient-and-makes-l-p-a-normed-space, is complete. Equivalently, the metric induced by that norm is a complete metric in the sense of def-complete-metric-space. Moreover, if a sequence in converges in norm, then some subsequence admits measurable representatives converging almost everywhere in the sense of def-convergence-almost-everywhere-relative-to-a-measure.
convergence implies convergence in probability: Let . If in , then in probability.
Almost-sure convergence implies convergence in probability: If almost surely, then in probability.
Limits in probability are unique almost surely: If and in probability, then almost surely.
Proof
Given: The objects and hypotheses of the statement.
Write , , and . Applying the maximal inequality to each block and then continuity from below gives for . The strict supremum event is the increasing union of finite strict maximum events, each bounded by the corresponding non-strict estimate.
For , the same variance expansion used in the maximal inequality gives . Hence the classes of are Cauchy in ; completeness gives an limit class with a finite measurable representative . Set . This is a finite measurable real variable, and pointwise, so in even if completeness was formulated over complex scalars.
Let . Its strict level events are countable unions of measurable events and decrease with . Since , continuity from above gives for every integer . Outside the union of these null events, for each some has ; this is the real Cauchy condition. Completeness supplies a finite limit, extended measurably by zero as in the series definition.
The convergence gives convergence in probability to , and the almost-sure convergence gives convergence in probability to the limit from the Cauchy event. Uniqueness gives almost surely. These arguments allow all variances to vanish and finite tails to be identically zero.
Depends on
- Kolmogorov maximal inequality
- Almost-sure convergence of a random series
- A series converges iff for every $\varepsilon > 0$ there is $N$ with $|a_{m+1} + \dots + a_n| < \varepsilon$ for all $n > m \ge N$
- Continuity from below for measures
- Continuity from above when one set has finite measure
- Variance and covariance identities for random variables
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- $L^p$ convergence implies convergence in probability
- Almost-sure convergence implies convergence in probability
- Limits in probability are unique almost surely
Used by
Dependency tree · two levels
46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Theorem 2.5.6, pp. 84–85 (standard reference, not scraped)
- Theorem 3.10, pp. 65–66; L2 strengthening uses published completeness (standard reference, not scraped)