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)k≥1 are IID real random variables and E∣X1∣<∞, then, with Sn=∑k=1nXk and μ=EX1, E∣Sn/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{∣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]

IID finite-variance weak law: Let (Xk)k≥1 be IID square-integrable real random variables, with μ=EX1 and σ2=Var⁡(X1). For Sn=∑k=1nXk, E∣Sn/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)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]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fn→f almost everywhere and ∣fn∣≤g almost everywhere for a single nonnegative measurable function g with ∫g dμ<+∞. Then f∈L1(μ), ∫∣fn−f∣ dμ⟶0, and hence ∫fn dμ⟶∫f dμ.

[F5]

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

[F6]

Finite-measure Lr includes into Lp for p<r: Let (X,A,μ) be a measure space with μ(X)<∞. 1. If 1≤p<r<∞ and f∈Lr(μ), then f∈Lp(μ) and ∥f∥p≤μ(X)1/p−1/r∥f∥r. 2. If 1≤p<∞ and f∈L∞(μ), then f∈Lp(μ) and ∥f∥p≤μ(X)1/p∥f∥∞.

[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]=a E[X]+b E[Y]. 2. If X and Y are real-valued and X≤Y almost surely, then E[X]≤E[Y]. 3. ∣E[X]∣≤E[∣X∣].

Proof

Given: The objects and hypotheses of the statement.

1.1F1F3F2given

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

2.1F6F7step 1.1algebra

On a probability space the L1 norm is at most the L2 norm. Finite linearity, the triangle inequality and the modulus bound give E∣n−1∑k(Rk−ERk)∣≤2E∣R1∣. Therefore E∣Sn/n−μ∣≤Var⁡(Y1)/n+2E(∣X1∣1{∣X1∣>A}).

3.1F4F5step 2.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.

Depends on

Used by

Dependency tree · two levels

35 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