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 three-series theorem
Statement
Let be independent real random variables and fix . Put . Then converges almost surely if and only if all three conditions hold: The conditions hold for some if and only if they hold for every . No moment assumption is imposed on the untruncated variables.
Facts & Assumptions
Zero truncation at a positive level: For a real random variable and a deterministic level , its zero truncation is The threshold event is measurable because is measurable and is Borel; its indicator and the product are measurable by thm-arithmetic-and-lattice-operations-preserve-measurability. Thus is a real random variable as in def-random-element-and-real-random-variable. It equals at both cutoff endpoints and is zero outside the interval. Since , for every its absolute th moment is at most . This is not clipping to the endpoints.
Necessity of the truncated mean and variance conditions: Let independent real random variables have convergent almost surely. For every fixed , set . Then and the real numerical series converges.
Kolmogorov two-series sufficiency: Let be independent square-integrable real random variables. If converges in and , then converges almost surely and in .
First Borel-Cantelli lemma for events: Let be events in a probability space. If then No independence hypothesis is needed.
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
A series converges iff each of its tail series converges, and the sum splits as plus the -th tail: Let be a sequence of reals with partial sums , let , and let be the partial sums of the -th tail series (def-series). Then: 1. for every ; 2. converges if and only if its -th tail series converges, and in that case 3. hence the following are equivalent: converges; every tail series of converges; some tail series of converges. In words: convergence of a series is a property of its terms from any index on, and changing finitely many terms changes the sum but not the fact of convergence.
Proof
Given: The objects and hypotheses of the statement.
If the original series converges almost surely, the necessity lemma gives all three numerical conditions for this arbitrary fixed . In particular all truncated means and variances used here are finite.
Conversely suppose the three conditions hold. The bounded truncations are independent square-integrable variables. Two-series sufficiency makes converge almost surely. The first Borel–Cantelli lemma makes eventually almost surely; finite-change invariance then gives convergence of . This also covers zero truncations and finite exceptional sets.
Conditions at one positive cutoff give convergence by the preceding direction; convergence gives the conditions at every positive cutoff by the first direction. Conditions at every positive cutoff give them at, for example, . This is an equivalence between deterministic numerical conditions, and needs no intersection over uncountably many cutoff-dependent events.
Depends on
- Almost-sure convergence of a random series
- Zero truncation at a positive level
- Necessity of the truncated mean and variance conditions
- Kolmogorov two-series sufficiency
- First Borel-Cantelli lemma for events
- Measurable coordinatewise functions preserve independence
- A series converges iff each of its tail series converges, and the sum splits as $s_N$ plus the $N$-th tail
Used by
Dependency tree · two levels
31 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.8, p. 85 (standard reference, not scraped)
- Theorem 3.12, pp. 66–68 (standard reference, not scraped)