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.

Integrability is necessary for an iid finite mean strong law

Statement

If IID real (Xn) have Sn/n converging almost surely to a finite, possibly random, limit L, then EX1< and L=EX1 almost surely.

Facts & Assumptions

[F1]

Second Borel-Cantelli lemma under pairwise independence: Let (An)nN be pairwise independent events with n=0P(An)=+. Then P(An i.o.)=1.

[F2]

Tail sum integrability equivalence: For a measurable X:Ω[0,] on a probability space, n1P(X>n)EX1+n1P(X>n). Thus EX< if and only if the tail series is finite.

[F3]

Kolmogorov iid l1 strong law: For IID real (Xn)n1 with EX1<, Sn/nμ=EX1 almost surely.

Proof

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

1.1

On the given conull convergence event, for n2 one has Xn/n=Sn/n((n1)/n)(Sn1/(n1))LL=0. Therefore the events An={Xn>n} occur only finitely often almost surely.

givenalgebra
2.1

The events An are independent because each belongs to the σ-algebra of its own coordinate. If nP(An) were infinite, F1 would make their limsup conull, contradicting step 1.1. The series is therefore finite, and identical laws turn it into nP(X1>n).

F1step 1.1
3.1

F2 applied to step 2.1 gives EX1<. Now F3 gives Sn/nEX1 almost surely. Uniqueness of a finite real limit on the intersection of the two conull events identifies L as claimed.

F2F3step 2.1

Depends on

Used by

Dependency tree · two levels

16 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