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.

Khinchin weak law for integrable IID variables

Statement

If (Xk)k1 are IID real random variables and EX1<, then, with Sn=k=1nXk and μ=EX1, ESn/nμ0. Consequently Sn/nμ in probability.

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]

IID finite-variance weak law: Let (Xk)k1 be IID square-integrable real random variables, with μ=EX1 and σ2=Var(X1). For Sn=k=1nXk, ESn/nμ2=σ2/n, and Sn/nμ in L2 and in probability. Also P(Sn/nμε)σ2/(nε2) for ε>0.

[F3]

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.

[F4]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fnf almost everywhere and fng almost everywhere for a single nonnegative measurable function g with gdμ<+. Then fL1(μ), fnfdμ0, and hence fndμfdμ.

[F5]

Markov's inequality for random variables: If X:Ω[0,+] is a nonnegative random variable on a probability space and a>0, then P(Xa)E[X]a.

[F6]

Finite-measure Lr includes into Lp for p<r: Let (X,A,μ) be a measure space with μ(X)<. 1. If 1p<r< and fLr(μ), then fLp(μ) and fpμ(X)1/p1/rfr. 2. If 1p< and fL(μ), then fLp(μ) and fpμ(X)1/pf.

[F7]

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

Fix A>0 and set Yk=Xk(A), Rk=XkYk. The Yk are bounded IID variables: measurable transformations preserve independence and their laws remain equal by inverse images. The finite-variance result gives n1k(YkEYk)2=Var(Y1)/n.

F1F3F2given
2.1

On a probability space the L1 norm is at most the L2 norm. Finite linearity, the triangle inequality and the modulus bound give En1k(RkERk)2ER1. Therefore ESn/nμVar(Y1)/n+2E(X11{X1>A}).

F6F7step 1.1algebra
3.1

For each fixed A let n in this bound. Then let A run through positive integers tending to infinity. The residual is dominated by the integrable X1 and tends pointwise to zero, so dominated convergence makes the remaining bound tend to zero. Finally Markov applied to Sn/nμ proves convergence in probability. No division by a moment occurs, so constant or zero variables are included.

F4F5step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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