Alphabeta Math
LemmaStatement: 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.

Bounded centered convergent series have summable variances

Statement

Let (Xn)n1 be independent centered real random variables with XnC almost surely for one finite constant C0. If nXn converges almost surely, then nVar(Xn)<. The bound is two-sided and uniform in n.

Facts & Assumptions

[F1]

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.

[F2]

Disjoint groups of an independent sigma-algebra family remain independent: Let (Fi)iI be an independent family of sigma-algebras on a probability space, and let J0,,Jm1I be pairwise disjoint index sets. For each r<m, define Gr:=σ(iJrFi). Then the sigma-algebras G0,,Gm1 are independent.

[F3]

Expectations factor over finite products of independent random variables: Let n1, let X0,,Xn1 be independent real random variables on a common probability space, and let gi:RR be Borel measurable for each i<n. 1. If every gi is nonnegative, then E[i<ngi(Xi)]=i<nE[gi(Xi)] in [0,+]. 2. If every gi(Xi) is integrable, then i<ngi(Xi) is integrable and the same factorization holds in R.

[F4]

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.

[F5]

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.

[F6]

Linearity, monotonicity, and the modulus bound for expectation: Let X,Y be integrable real or complex random variables on one probability space. 1. For scalars a,b, E[aX+bY]=aE[X]+bE[Y]. 2. If X and Y are real-valued and XY almost surely, then E[X]E[Y]. 3. E[X]E[X].

Proof

Given: The objects and hypotheses of the statement.

1.1

Put S0=0 and Sn=k=1nXk. Almost every convergent path is bounded. The measurable events {supnSnl} for positive integers l increase to a probability-one event. Continuity from below supplies one integer l with probability δ>0. Set F0=Ω and Fn={maxknSkl}; thus P(Fn)δ.

F1F5given
2.1

The past event Fn1 and Sn1 are independent of Xn by grouping. All moments below are finite by boundedness. Expanding and factoring the cross term and the square term gives E[Sn21Fn1]=E[Sn121Fn1]+Var(Xn)P(Fn1). This also holds at n=1, where the past sum is zero.

F2F3F4step 1.1
3.1

On Fn1Fn, the triangle inequality and XnC give Snl+C almost surely. Split the expectation in the previous identity over Fn and Fn1Fn. Monotonicity yields δVar(Xn)E[Sn21Fn]E[Sn121Fn1]+(l+C)2P(Fn1Fn).

F6step 2.1algebra
4.1

Sum from 1 to N. The expectation differences telescope, the exit events are disjoint, and SN2l2 on FN. Thus δn=1NVar(Xn)l2+(l+C)2 for every N. The increasing nonnegative partial sums are bounded, so their series is finite. No division by C or a variance is used, and C=0 is included.

step 1.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

34 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