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 three-series theorem

Statement

Let (Xn)n1 be independent real random variables and fix A>0. Put Yn=Xn1{XnA}. Then nXn converges almost surely if and only if all three conditions hold: nP(Xn>A)<,nEYn converges in R,nVar(Yn)<. The conditions hold for some A>0 if and only if they hold for every A>0. No moment assumption is imposed on the untruncated variables.

Facts & Assumptions

[F1]

Zero truncation at a positive level: For a real random variable X and a deterministic level A>0, its zero truncation is X(A)=X1{XA}. The threshold event is measurable because X is measurable and [A,A] is Borel; its indicator and the product are measurable by thm-arithmetic-and-lattice-operations-preserve-measurability. Thus X(A) is a real random variable as in def-random-element-and-real-random-variable. It equals X at both cutoff endpoints and is zero outside the interval. Since X(A)A, for every 0<p< its absolute pth moment is at most ApP(Ω)=Ap. This is not clipping to the endpoints.

[F2]

Necessity of the truncated mean and variance conditions: Let independent real random variables (Xn)n1 have nXn convergent almost surely. For every fixed A>0, set Yn=Xn(A)=Xn1{XnA}. Then nP(Xn>A)<,nVar(Yn)<, and the real numerical series nEYn converges.

[F3]

Kolmogorov two-series sufficiency: Let (Xn)n1 be independent square-integrable real random variables. If n1EXn converges in R and n1Var(Xn)<, then n1Xn converges almost surely and in L2.

[F4]

First Borel-Cantelli lemma for events: Let (An)nN be events in a probability space. If n=0P(An)<+, then P(An i.o.)=0. No independence hypothesis is needed.

[F5]

Measurable coordinatewise functions preserve independence: Let (Xi)iI be an independent family of random elements Xi:(Ω,F,P)(Si,Σi). For each i, let gi:(Si,Σi)(Ti,Ti) be measurable. Then the family (giXi)iI is independent.

[F6]

A series converges iff each of its tail series converges, and the sum splits as sN plus the N-th tail: Let (ak) be a sequence of reals with partial sums sn=k<nak, let NN, and let tj:=i<jaN+i be the partial sums of the N-th tail series kNak (def-series). Then: 1. tj=sj+NsN for every jN; 2. ak converges if and only if its N-th tail series converges, and in that case k=0ak  =  sN  +  k=Nak; 3. hence the following are equivalent: ak converges; every tail series of ak converges; some tail series of ak 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.

1.1

If the original series converges almost surely, the necessity lemma gives all three numerical conditions for this arbitrary fixed A>0. In particular all truncated means and variances used here are finite.

F2F1given
1.2

Conversely suppose the three conditions hold. The bounded truncations are independent square-integrable variables. Two-series sufficiency makes nYn converge almost surely. The first Borel–Cantelli lemma makes Xn=Yn eventually almost surely; finite-change invariance then gives convergence of nXn. This also covers zero truncations and finite exceptional sets.

F1F5F3F4F6given
2.1

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, A=1. This is an equivalence between deterministic numerical conditions, and needs no intersection over uncountably many cutoff-dependent events.

step 1.1step 1.2algebra

Depends on

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