Alphabeta Math
TheoremStatement: 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 iid l1 strong law

Statement

For IID real (Xn)n1 with EX1<, Sn/nμ=EX1 almost surely.

Facts & Assumptions

[F1]

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.

[F2]

Summability of truncated normalized variances: For identically distributed integrable real (Xn) and Yn=Xn1{Xnn}, n1Var(Yn)/n22EX1<. No independence is required.

[F3]

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).

[F4]

Cesaro limit of truncated means: For identically distributed integrable real (Xn), with Yk=Xk1{Xkk}, one has n1k=1nEYkEX1.

[F5]

Iid linear truncation occurs only finitely often: For identically distributed integrable real (Xn), put Yn=Xn1{Xnn}. Almost surely Yn=Xn for all sufficiently large n. Consequently n1k=1n(XkYk)0. Independence is unnecessary.

Proof

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

1.1

Set Yn=Xn1{Xnn}. The truncation maps are Borel, so F1 makes (Yn) mutually independent. They are bounded by n and hence square-integrable.

F1
2.1

F2 gives nVar(Yn)/n2<. With bn=n, F3 applies to step 1.1 and yields n1kn(YkEYk)0 almost surely.

F2F3step 1.1
3.1

By F4, n1knEYkμ. By F5, n1kn(XkYk)0 almost surely. Intersecting the two conull events with step 2.1 and adding these three terms gives Sn/nμ.

F4F5step 2.1

Depends on

Used by

Dependency tree · two levels

29 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