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

Convergence in probability and almost surely agree for independent series

Statement

For partial sums Sn=k=1nXk of independent real random variables (Xn)n1 on one probability space, the following are equivalent: (Sn) is Cauchy in probability; (Sn) converges in probability to a finite real random variable; (Sn) converges almost surely to a finite real random variable. The probability and almost-sure limits agree almost surely.

Facts & Assumptions

[F1]

Levy maximal bound from uniform tail bounds: Let X1,,Xn be independent real random variables, n1, with Sk=j=1kXj. Let l>0 and 0δ<1. If P(j=inXjl/2)δ(1in), then P(maxknSkl)δ1δ. No centering or moment assumption is required.

[F2]

Almost-sure convergence of a random series: 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 def-almost-sure-convergence-of-random-variables. With S0=0 from def-partial-sums-and-sample-means, its convergence event is C=r1N1jiN{SjSi<1/r}. This is exactly the real Cauchy condition, with the indexing of thm-series-cauchy-criterion 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, cor-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 thm-sequential-suprema-infima-limsup-liminf-and-pointwise-limits-are-measurable and thm-arithmetic-and-lattice-operations-preserve-measurability 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.

[F3]

Convergence in probability: For real random variables (Xn) and X on one probability space, write XnX in probability when, for every ε>0, P(XnX>ε)0. This is precisely def-convergence-in-measure for the probability measure.

[F4]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then μ(nNEn)=supnNμ(En). No finiteness hypothesis is required.

[F5]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then μ(nNEn)=infnNμ(En).

[F6]

A series converges iff for every ε>0 there is N with am+1++an<ε for all n>mN: Let (ak) be a sequence of reals, with partial sums sn=k<nak (def-series). Then ak converges if and only if for every real ε>0 there is NN such that k=m+1nak<ε for all n>mN. The block k=m+1nak is the finite sum am+1++an of def-finite-sum, and it equals sn+1sm+1. This is the Cauchy criterion transported from sequences to series. Its value is that it decides convergence without producing, or even naming, the sum.

[F7]

Almost-sure convergence implies convergence in probability: If XnX almost surely, then XnX in probability.

[F8]

Limits in probability are unique almost surely: If XnX and XnY in probability, then X=Y almost surely.

[F9]

Cauchy sequences in probability have a measurable limit: Let (Yn)n1 be real random variables on one probability space. Suppose that for every ε,η>0 there is N such that P(YnYm>ε)<η(n,mN). Then there is a finite measurable real random variable Y such that YnY in probability.

Proof

Given: The objects and hypotheses of the statement.

1.1

Convergence in probability implies the Cauchy condition: for ε>0, the event SnSm>ε is contained in {SnS>ε/2}{SmS>ε/2}, whose probabilities are uniformly small for sufficiently large n,m. Conversely the Cauchy-in-probability completeness lemma gives a measurable finite probability limit.

F3F9givenalgebra
2.1

Assume the Cauchy condition. Fix t>0 and 0<δ<1. For all sufficiently large m and all N>m, every tail of the finite block Xm+1,,XN is an increment SNSi1 with both indices sufficiently large. Its probability of magnitude at least t/2 is at most δ: use the Cauchy condition at the strictly smaller tolerance t/4. The tail maximal lemma gives P(maxm<jNSjSmt)δ/(1δ).

F1step 1.1given
3.1

Pass to the infinite strict supremum by continuity from below. Let wm=supi,jmSiSj. Since wm2supjmSjSm, the previous estimate bounds P(wm>2t) by δ/(1δ) for sufficiently large m. These events decrease with m. Continuity from above and arbitrariness of δ show P(m{wm>2t})=0. Take t=1/r for all positive integers r. Outside a single null set the partial sums are real Cauchy, hence converge finitely; their limit extended by zero is measurable as in the series definition.

F4F5F6F2step 2.1
4.1

Almost-sure convergence implies convergence in probability. Its probability limit and any probability limit from the first step coincide almost surely by uniqueness. Thus all three conditions are equivalent. No moment hypothesis was introduced, and zero or deterministic increments cause no exception.

F7F8step 1.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

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