Alphabeta Math
CorollaryStatement: 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.

Strong law for independent nonidentical variables

Statement

For independent square-integrable real random variables (Xn)n1, the condition n1Var(Xn)/n2< implies SnESnn0almost surely,Sn=k=1nXk. The variables need not have a common law or a common mean.

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 and hypotheses of the statement.

1.1

Take bn=n for n1. This sequence is positive, increasing, and tends to infinity, and the required normalized variance series is exactly the one in the hypothesis.

givenalgebra
2.1

The normalized-variance strong law gives n1k=1n(XkEXk)0 almost surely. Finite linearity identifies the numerator with SnESn. This includes zero variance and deterministic variables and requires no relation between different means.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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