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.

Independent-copy symmetrization of random series

Statement

Given an independent sequence (Xn)n1 on (Ω,F,P), form the product probability space (Ω2,FF,PP). Write Un(ω,ω)=Xn(ω), Vn(ω,ω)=Xn(ω), and Zn=UnVn. Then (Un) and (Vn) are independent copies of the whole sequence, and the Zn are independent symmetric real random variables. Almost-sure convergence of nXn implies almost-sure convergence of nZn. If XnA almost surely for every n, with 0A<, then Zn2A almost surely, EZn=0, and Var(Zn)=2Var(Xn).

Facts & Assumptions

[F1]

Independent random elements: Let Xi:(Ω,F,P)(Si,Σi) be random elements on a common probability space. For each i, write σ(Xi):={Xi1(B):BΣi}F. The family (Xi)iI is independent when the sigma-algebras (σ(Xi))iI are independent in the sense of def-independent-sigma-algebras-and-events. When Σi is a Borel sigma-algebra, this agrees with the notation σ(Xi) from def-sigma-algebra-generated-by-a-function.

[F2]

Symmetric real random variables: A real random variable X is symmetric if its law as defined in def-law-or-distribution-of-a-random-element equals the law of X. Equivalently, P(XB)=P(XB) for every Borel BR, where B={b:bB}. No existence of an expectation is assumed in this definition. In particular atoms, including an atom at zero, are allowed.

[F3]

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.

[F4]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: Let (X,A,μ) and (Y,B,ν) be sigma-finite measure spaces. Then: 1. the set function E(μ×ν)(E) of def-product-measure-on-sigma-finite-spaces is a measure on AB; 2. for measurable rectangles, (μ×ν)(A×B)=μ(A)ν(B); 3. the measure μ×ν is sigma-finite; and 4. it is the unique measure on AB with the rectangle formula.

[F5]

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.

[F6]

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.

[F7]

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.

[F8]

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.

Proof

Given: The objects and hypotheses of the statement.

1.1

Probability measures are finite and hence sigma-finite, so the two-factor product theorem applies. Its rectangle formula gives independent coordinate sigma-algebras with the original marginals. For any finite list of restrictions on the Ui and Vi, the rectangle formula followed by independence of the original Xi factors its probability into all the individual probabilities. Thus the combined family is independent.

F4F1given
2.1

Group each pair (Ui,Vi): distinct pair sigma-algebras are independent, so their measurable differences are independent. The pair law is the product of two equal marginal laws, invariant under exchanging coordinates (first on rectangles, then by product-measure uniqueness). Its difference therefore has the same law as its negative.

F5F6F4F2step 1.1
2.2

If C is the original probability-one convergence event, then C×C has probability one. On it the partial sums of Zn are differences of two convergent real sequences, hence converge finitely. This is almost-sure series convergence.

F3F4step 1.1algebra
3.1

Under the boundedness hypothesis, Zn2A and EUn=EVn, so EZn=0. Factorization gives E(UnVn)=(EXn)2. Expanding the square gives EZn2=2EXn22(EXn)2=2Var(Xn). This includes A=0 and deterministic laws.

F7F8step 1.1algebra

Depends on

Used by

Dependency tree · two levels

37 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