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.

Strong law under summable normalized variances

Statement

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

Facts & Assumptions

[F1]

Kolmogorov convergence criterion: For independent centered square-integrable real random variables (Xn)n1, if n1Var(Xn)<, then n1Xn converges almost surely and in L2 to the same finite real random variable.

[F2]

Kronecker summation lemma: Let (xn)n1 be real and let 0<bn be deterministic, nondecreasing, and tend to infinity. If n1xn/bn converges in R, then 1bnk=1nxk0. Repeated values of bn are allowed.

[F3]

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.

[F4]

Variance and covariance identities for random variables: Let X,Y be square-integrable real random variables on one probability space. Then Var(X)=E[X2]E[X]2, Cov(X,Y)=E[XY]E[X]E[Y]. Moreover, covariance is symmetric and bilinear on finite linear combinations. On finite full-power-set probability spaces these formulas reduce to the published finite identities.

[F5]

The integral test: for f0 nonincreasing on [0,), kf(k) converges if and only if the sequence (0Nf)N is bounded, with 0Nfk<Nf(k)f(0)+0Nf: For nonnegative nonincreasing f on [0,), the series k0f(k) converges if and only if the proper integrals 0Nf are bounded above as integers N vary.

Proof

Given: The objects and hypotheses of the statement.

1.1

The variables Yn=(XnEXn)/bn are independent, centered, and square-integrable, with variances Var(Xn)/bn2. Measurable transformations give independence, and covariance bilinearity gives the variance identity. The convergence criterion makes nYn converge on one probability-one event.

F3F4F1given
2.1

On each path in that event apply Kronecker to xn=XnEXn and the given bn. The deterministic conclusion is precisely the asserted normalized convergence. Zero variances and repeated positive normalizers present no exception.

F2step 1.1
3.1

For the rate assertion, set bn=n(logn)1/2+ε for n2 and choose b1=b2. These are positive and nondecreasing. The variance sum from n=2 is σ2n2[n(logn)1+2ε]1. Apply the zero-based integral test to f(t)=[(t+2)(log(t+2))1+2ε]1 on [0,): it is nonnegative and decreasing, and substitution u=log(t+2) bounds its integrals by log2u12εdu=(log2)2ε/(2ε). The first variance term is finite. The result already proved therefore gives the rate, also when σ2=0.

F5step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

43 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