Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Kolmogorov strong law for independent uniformly bounded variances

Statement

Independent square-integrable real (Xn)n≥1 with C=sup⁡nVar⁡(Xn)<∞ satisfy (Sn−ESn)/n→0 almost surely.

Facts & Assumptions

[F1]

Strong law under summable normalized variances: Let (Xn)n≥1 be independent square-integrable real random variables. Let 0<bn be deterministic and nondecreasing with bn→∞. If ∑n≥1Var⁡(Xn)bn2<∞, then 1bn∑k=1n(Xk−EXk)⟶0almost surely. In particular, for IID centered square-integrable variables and any ε>0, Sn/[n(log⁡n)1/2+ε]→0 almost surely (the displayed normalization is used for n≥2).

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1givenalgebra

For n≥2, n−2≤(n−1)−1−n−1. Therefore ∑n=1NVar⁡(Xn)/n2≤C(2−1/N)≤2C; these nonnegative partial sums have a finite supremum, so the variance series converges.

2.1F1step 1.1∎

The normalizers bn=n are positive, nondecreasing and tend to infinity. The independence and square-integrability are given, and step 1.1 verifies the summability hypothesis of F1. Its almost-sure conclusion is exactly the stated centered law.

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