Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Almost-sure convergence of a random series

Definition

For real random variables (Xn)n1, the series n1Xn converges almost surely if its partial sums Sn converge to a finite real limit on an event of probability one, as in Almost-sure convergence of real random variables. With S0=0 from Partial sums, row sums and sample means, its convergence event is C=r1N1jiN{SjSi<1/r}. This is exactly the real Cauchy condition, with the indexing of A series converges iff for every ε>0 there is N with am+1++an<ε for all n>mN shifted by one. Measurable arithmetic makes every event in this countable expression measurable. For any fixed m, the union over N may be restricted to Nm; then each difference uses only Xm+1,Xm+2,. Thus C is in the tail sigma-algebra, without assuming independence. Under independence, Almost-sure convergence of an independent series is a zero-one event gives P(C){0,1}.

Set S=limnSn on C and S=0 off C. The functions 1CSn converge everywhere to S, so Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable and Arithmetic and lattice operations preserve measurability whenever they are defined make S measurable.

For Borel sets Bn, the event {XnBn infinitely often}=mnm{XnBn} is likewise tail measurable. Changing finitely many summands adds an eventually constant finite difference to Sn; divided by deterministic cn>0 tending to infinity that difference tends to zero, so the normalized limsup is unchanged. The sign of the unnormalized limsup need not be unchanged: the all-zero sequence has limsup zero, while changing its first term to 1 makes the limsup of partial sums equal to 1.

Depends on

Used by

Dependency tree · two levels

22 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