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)n1 with C=supnVar(Xn)< satisfy (SnESn)/n0 almost surely.

Facts & Assumptions

[F1]

Strong law under summable normalized variances: Let (Xn)n1 be independent square-integrable real random variables. Let 0<bn be deterministic and nondecreasing with bn. If n1Var(Xn)bn2<, then 1bnk=1n(XkEXk)0almost surely. In particular, for IID centered square-integrable variables and any ε>0, Sn/[n(logn)1/2+ε]0 almost surely (the displayed normalization is used for n2).

Proof

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

1.1

For n2, n2(n1)1n1. Therefore n=1NVar(Xn)/n2C(21/N)2C; these nonnegative partial sums have a finite supremum, so the variance series converges.

givenalgebra
2.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.

F1step 1.1

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