Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-09-23 (gpt-6-sol)
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.

Truncation weak law for independent arrays

Statement

For each n≥1 let Xn,1,…,Xn,rn be independent real random variables on one probability space, with finite rn≥0. Let deterministic bn>0 tend to infinity and set Yn,k=Xn,k1{∣Xn,k∣≤bn}. If ∑k=1rnP(∣Xn,k∣>bn)→0,bn−2∑k=1rnVar⁡(Yn,k)→0, then ∑k=1rnXn,k−∑k=1rnEYn,kbn⟶0in probability. No independence between rows is required.

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{∣X∣≤A}. 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]

Chebyshev weak law for uncorrelated arrays: For each n≥1, let Xn,1,…,Xn,rn be square-integrable real random variables on one probability space, pairwise uncorrelated within the row, where rn≥0 is finite. Set Sn=∑k=1rnXn,k and let bn>0 be deterministic. If vn:=bn−2∑k=1rnVar⁡(Xn,k)⟶0, then (Sn−ESn)/bn→0 in L2 and in probability. More precisely, its second moment is vn, and its probability of absolute value at least ε>0 is at most vn/ε2. No independence between rows is required.

[F3]

Measurable coordinatewise functions preserve independence: Let (Xi)i∈I 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 (gi∘Xi)i∈I is independent.

[F4]

Convergence in probability: For real random variables (Xn) and X on one probability space, write Xn→X in probability when, for every ε>0, P(∣Xn−X∣>ε)⟶0. This is precisely def-convergence-in-measure for the probability measure.

[F5]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)k∈N be measurable. Then μ(⋃k∈NEk)≤∑k=0∞μ(Ek). For every m∈N one also has μ(⋃k<mEk)≤∑k<mμ(Ek), including m=0, where both sides are 0.

[F6]

For n≥1, if X0,…,Xn−1 are independent real random variables and gi:R→R are Borel measurable with each gi(Xi) integrable, then ∏i<ngi(Xi) is integrable and E[∏i<ngi(Xi)]=∏i<nE[gi(Xi)] in R (Expectations factor over finite products of independent random variables).

Proof

Given: The objects and hypotheses of the statement.

1.1F1F3F2givenF6

Each truncated row is independent by measurable transformations and bounded by bn. Its distinct centered mixed moments vanish: independence factors expectations of bounded products, so the row is uncorrelated. The row weak law therefore makes bn−1∑k(Yn,k−EYn,k) tend to zero in probability.

2.1F5F4step 1.1givenalgebra∎

Let En=⋃k=1rn{∣Xn,k∣>bn}. Outside En the original and truncated sums agree. Hence for ε>0 the probability of the claimed error exceeding ε is bounded by ∑kP(∣Xn,k∣>bn) plus the corresponding centered truncated probability. Both tend to zero. For empty rows all sums and the union are zero or empty, so the argument includes them; equality at the cutoff is retained.

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