Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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)n1, if n1Var(Xn)<, then n1Xn 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, n1, and Sk=j=1kXj. For every λ>0, P(max1knSkλ)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)n1, the series n1Xn 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=r1N1jiN{SjSi<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 Nm; 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=limnSn 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 {XnBn infinitely often}=mnm{XnBn} 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>mN: 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 NN such that k=m+1nak<ε for all n>mN. The block k=m+1nak is the finite sum am+1++an of def-finite-sum, and it equals sn+1sm+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)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then μ(nNEn)=supnNμ(En). No finiteness hypothesis is required.

[F5]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then μ(nNEn)=infnNμ(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]

Riesz-Fischer completeness of Lp for 1p: Let (X,A,μ) be a measure space and let 1p. Then Lp(μ), 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 Lp(μ) converges in norm, then some subsequence admits measurable representatives converging almost everywhere in the sense of def-convergence-almost-everywhere-relative-to-a-measure.

[F8]

Lp convergence implies convergence in probability: Let 1p<. If XnX in Lp, then XnX in probability.

[F9]

Almost-sure convergence implies convergence in probability: If XnX almost surely, then XnX in probability.

[F10]

Limits in probability are unique almost surely: If XnX and XnY in probability, then X=Y almost surely.

Proof

Given: The objects and hypotheses of the statement.

1.1

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(supjmSjSm>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.

F1F4given
1.2

For n>m, the same variance expansion used in the maximal inequality gives ESnSm2=k=m+1nVar(Xk)vm0. Hence the classes of Sn are Cauchy in L2; completeness gives an L2 limit class with a finite measurable representative T0. Set T=ReT0. This is a finite measurable real variable, and SnTSnT0 pointwise, so SnT in L2 even if completeness was formulated over complex scalars.

F1F6F7given
2.1

Let wm=supi,jmSiSj. Its strict level events are countable unions of measurable events and decrease with m. Since wm2supjmSjSm, continuity from above gives P(m{wm>2/r})=0 for every integer r1. Outside the union of these null events, for each r some m has wm2/r; this is the real Cauchy condition. Completeness supplies a finite limit, extended measurably by zero as in the series definition.

F5F3F2step 1.1
3.1

The L2 convergence gives convergence in probability to T, and the almost-sure convergence gives convergence in probability to the limit S from the Cauchy event. Uniqueness gives S=T almost surely. These arguments allow all variances to vanish and finite tails to be identically zero.

F8F9F10step 2.1step 1.2

Depends on

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