Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-09-09 (gpt-6-astra)
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 (Xn)n≥1, if ∑n≥1Var⁡(Xn)<∞, then ∑n≥1Xn converges almost surely and in L2 to the same finite real random variable.

Facts & Assumptions

[F1]

Kolmogorov maximal inequality: Let X1,…,Xn be independent centered square-integrable real random variables, n≥1, and Sk=∑j=1kXj. For every λ>0, P(max⁡1≤k≤n∣Sk∣≥λ)≤Var⁡(Sn)λ2=∑j=1nVar⁡(Xj)λ2. Thus controlling the whole finite maximum costs no larger bound than controlling the final sum by Chebyshev.

[F2]

Almost-sure convergence of a random series: For real random variables (Xn)n≥1, the series ∑n≥1Xn converges almost surely if its partial sums Sn converge to a finite real limit on an event of probability one, as in def-almost-sure-convergence-of-random-variables. With S0=0 from def-partial-sums-and-sample-means, its convergence event is C=⋂r≥1⋃N≥1⋂j≥i≥N{∣Sj−Si∣<1/r}. 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 m, the union over N may be restricted to N≥m; then each difference uses only Xm+1,Xm+2,…. Thus C 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 P(C)∈{0,1}. Set S=lim⁡nSn on C and S=0 off C. The functions 1CSn converge everywhere to S, so thm-sequential-suprema-infima-limsup-liminf-and-pointwise-limits-are-measurable and thm-arithmetic-and-lattice-operations-preserve-measurability make S measurable. For Borel sets Bn, the event {Xn∈Bn infinitely often}=⋂m⋃n≥m{Xn∈Bn} is likewise tail measurable. Changing finitely many summands adds an eventually constant finite difference to Sn; divided by deterministic cn>0 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 1 makes the limsup of partial sums equal to 1.

[F3]

A series converges iff for every ε>0 there is N with ∣am+1+⋯+an∣<ε for all n>m≥N: Let (ak) be a sequence of reals, with partial sums sn=∑k<nak (def-series). Then ∑ak converges if and only if for every real ε>0 there is N∈N such that ∣∑k=m+1nak∣<ε for all n>m≥N. The block ∑k=m+1nak is the finite sum am+1+⋯+an of def-finite-sum, and it equals sn+1−sm+1. This is the Cauchy criterion transported from sequences to series. Its value is that it decides convergence without producing, or even naming, the sum.

[F4]

Continuity from below for measures: Let (En)n∈N be an increasing sequence of measurable sets for a measure μ, so En⊆En+1. Then μ(⋃n∈NEn)=sup⁡n∈Nμ(En). No finiteness hypothesis is required.

[F5]

Continuity from above when one set has finite measure: Let (En)n∈N be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+∞ for some n0, then μ(⋂n∈NEn)=inf⁡n∈Nμ(En).

[F6]

Variance and covariance identities for random variables: Let X,Y be square-integrable real random variables on one probability space. Then Var⁡(X)=E[X2]−E[X]2, Cov⁡(X,Y)=E[XY]−E[X]E[Y]. 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.

[F7]

Fatou's lemma holds for supplied nonnegative measurable functions (Fatou's lemma); the nonnegative integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F8]
[F9]

A supplied countable union of measurable null sets is null (Finite and countable subadditivity of measures).

[F10]

For square-integrable real random variables, L2 convergence means E∣Sn−S∣2→0 (Lp convergence for random variables).

Proof

Given: The objects and hypotheses of the statement.

1.1F1F4given

Write S0=0, Sn=∑k=1nXk, and vm=∑k>mVar⁡(Xk). Applying the maximal inequality to each block Xm+1,…,XN and then continuity from below gives P(sup⁡j≥m∣Sj−Sm∣>t)≤vm/t2 for t>0. The strict supremum event is the increasing union of finite strict maximum events, each bounded by the corresponding non-strict estimate.

1.2F1F6given

For n>m≥0, the variance identity in the maximal inequality gives E∣Sn−Sm∣2=∑k=m+1nVar⁡(Xk)≤vm, where vm→0 and v0<∞. In particular all supplied partial sums are square-integrable.

2.1F5F3F2F9step 1.1

Let wm=sup⁡i,j≥m∣Si−Sj∣. Its strict level events are countable unions of measurable events and decrease with m. Since wm≤2sup⁡j≥m∣Sj−Sm∣, continuity from above gives P(⋂m{wm>2/r})=0 for every integer r≥1. By [F9], the complement C of the union of these null events is measurable and has probability one. On C, for each r some m has wm≤2/r; this is the real Cauchy condition. Let S be its finite pointwise limit on C and zero off C. The measurable functions Un=1CSn converge everywhere to S, which is measurable by the construction in [F2].

3.1F7F8F10step 1.2step 2.1∎

Fatou applied to ∣Un∣2 and monotonicity give E∣S∣2≤lim inf⁡nE∣Un∣2≤v0<∞, so S is square-integrable. For fixed m, the functions ∣Un−Um∣2 converge everywhere to ∣S−Um∣2, and ∣Un−Um∣2=1C∣Sn−Sm∣2. Fatou and step 1.2 therefore give E∣S−Um∣2≤vm. Since Sm,Um,S are square-integrable, both squared differences with S are integrable (use ∣a−b∣2≤2∣a∣2+2∣b∣2); they agree almost everywhere. Thus [F8] gives E∣S−Sm∣2=E∣S−Um∣2≤vm→0. By [F10] this is convergence in L2 to the very same S as the almost-sure limit. Zero variances and identically zero tails are included.

Remarks

No Choice assumption is required by this proof. The random variables and their partial sums are already supplied as measurable functions; the conull set and limit are explicitly defined. Abstract completeness for a sequence of L2 equivalence classes may require countable choice of representatives, but that theorem is not used here.

Depends on

Used by

Dependency tree · two levels

48 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