Kolmogorov's Two-Series Theorem¶
Independent finite-variance random terms have an almost-surely convergent sum when their mean series converges and their total variance is finite.
Core Idea¶
For independent real random variables \(X_n\) with finite means \(\mu_n\) and variances \(\sigma_n^2\), if \(\sum_n\mu_n\) converges and \(\sum_n\sigma_n^2<\infty\), then \(\sum_nX_n\) converges almost surely. The mean series controls drift; the variance series controls independent fluctuation. This is a sufficient test, not an iff classification.[^ref-cad47174de45]
Scope of Application¶
The result applies to independent finite-variance summands, not necessarily identically distributed. Independent fair signs \(\varepsilon_n\) yield \(\sum_n\varepsilon_n/n\to\) a finite random limit almost surely because the means vanish and \(\sum 1/n^2<\infty\). It can be one step in a strong-law proof when centered observations are divided by \(n\).[^ref-cad47174de45]
For an author-derived non-necessity check, let independent \(B_n\) have \(\Pr(B_n=1)=1/n^2\) for \(n\ge2\) and set \(X_n=nB_n\). Summably rare jumps mean only finitely many nonzero terms almost surely, so the random sum converges; yet \(\sum\mathbb E X_n=\sum1/n\) and \(\sum\operatorname{Var}(X_n)=\sum(1-1/n^2)\) diverge. The two-series test therefore cannot be reversed.[^ref-cad47174de45]
Clarity¶
“Two series” means two numerical series—one of means and one of variances—derived from the random terms. The mean series may converge conditionally; the variance terms are nonnegative. A failed test does not establish divergence. The related three-series theorem adds large-jump probabilities and truncated moments to obtain an equivalence. Its extra bookkeeping buys completeness; the simpler two-series condition can certify convergence quickly but cannot classify every failure.[^ref-cad47174de45]
Manages Complexity¶
Centering separates deterministic accumulation from stochastic fluctuation. Independence lets the variances add, so a tail maximal bound turns a finite variance sum into pathwise convergence without computing every partial-sum distribution.
Abstract Reasoning¶
Verify independence and finite moments; sum the means and variances; only if both tests pass infer almost-sure convergence. If they do not, seek another argument rather than reversing a sufficient implication. A later claim about normalized averages needs an additional step such as Kronecker's lemma.
Knowledge Transfer¶
The same drift/fluctuation test applies to other independent weighted series when all theorem assumptions remain literal. It is not a general principle that every series with visibly small random terms converges. The live Formal Theorem is the strict genus for this placement; Statistical Independence is a necessary hypothesis, but no separate prerequisite edge is approved. The Three-Series Theorem is a neighboring iff test, not a superclass.
[^ref-cad47174de45]: John Pike, Cornell Probability Theory 1 Lecture Notes, Theorems 10.3–10.4, PDF pp. 55–57; instructor-authored theorem presentation.
Relationships to Other Abstractions¶
Current abstraction Kolmogorov's Two-Series Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Kolmogorov's Two-Series Theorem is a kind of Formal theorem Domain-specific
The named two-series result is a proved mathematical statement specializing Formal Theorem.
Hierarchy paths (2) — routes to 2 parentless roots
- Kolmogorov's Two-Series Theorem → Formal theorem → Formal System → Formalization → Representation → Abstraction
- Kolmogorov's Two-Series Theorem → Formal theorem → Formal System → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Kolmogorov's Two-Series Theorem sits in a sparse region of the domain-specific corpus (90th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2551 abstractions)
Nearest neighbors
- Kolmogorov's Three-Series Theorem — 0.85
- Bernstein inequalities (probability theory) — 0.82
- Ratio Test — 0.80
- Matrix Chernoff Bound — 0.80
- Linnik distribution — 0.79
Computed from structural-signature embeddings · 2026-10-08