Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-14
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.

Martingale central limit theorem

Statement

Assume AC. Let (Zn,k,Fn,k) be a square-integrable martingale-difference array such that, for every n, Mn,m and Γn,m converge almost surely as m to finite limits Mn, and Γn,. If Γn,1in probability and, for every ε>0, Ln(ε):=k1E[Zn,k21{Zn,k>ε}]0, then Mn,N(0,1).

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

Square-integrable martingale-difference array and variance clock supplies Mn,m, vn,k, and Γn,m with the required measurability.

[F2]

Second-order characteristic-function expansion gives the scalar remainder bounds eiu1iu+u2/2min(u3/3,4u2).

[F3]

Tower property of conditional expectation and Basic algebra and order properties of conditional expectation permit conditional centering and iteration. The defining event-integral identity is in Conditional expectation as an ae class.

[F4]

Characteristic function of a normal law identifies et2/2, and Characteristic function criterion for weak convergence converts convergence of characteristic functions to weak convergence.

[F5]

Converging together lemma removes variance-clock localization.

[F6]

The Axiom of Choice states AC, assumed here because F1 and F3 use conditional moments and chosen countable families of representatives.

[F7]

Dominated convergence passes bounded simple-function approximations through integrable products.

Proof

1.1

Write vn,k=E[Zn,k2Fn,k1]. For every ε>0, vn,kε2+E[Zn,k21{Zn,k>ε}Fn,k1]. Taking the supremum in k, bounding it by the sum of the nonnegative tail terms, and taking expectations gives Esupkvn,kε2+Ln(ε). Consequently Esupkvn,k0 after first taking n and then ε0.

F1F3
1.2

First suppose Γn,c almost surely for one deterministic c. Fix tR and put Qn,m=exp(itMn,m)exp(t2Γn,m/2). The exact telescoping identity is Qn,mQn,m1=eitMn,m1et2Γn,m/2(eitZn,met2vn,m/2). Here the prefactor before the parentheses is Fn,m1-measurable and has modulus at most et2c/2.

F1
2.1

For any bounded Fn,m1-measurable complex H and integrable complex Y, the defining conditional-expectation event integrals in F3 give E[HY]=E[HE[YFn,m1]]: prove it first for simple real H, approximate bounded real and imaginary parts by bounded simple functions, and apply F7 to each integrable product. The prefactor in step 1.2 is such an H, so this pull-out identity licenses conditioning the telescoping increment. Conditional centering, F2, and a split at Zn,m=ε give E[eitZn,mFn,m1](1t2vn,m/2)Ctεvn,m+t2E[Zn,m21{Zn,m>ε}Fn,m1], where Ct is deterministic. The elementary exponential remainder also gives et2vn,m/2(1t2vn,m/2)Ct,cvn,msupjvn,j. Sum the expected telescoping errors from step 1.2. Since mvn,m=Γn,c, step 1.1 and the Lindeberg hypothesis yield EQn,1Ct,c(ε+Ln(ε)+Esupjvn,j)0 after n and then ε0. The infinite telescoping limit is legitimate because Mn,m,Γn,m converge almost surely and Qn,met2c/2; the displayed summable error bound controls passage of expectation through the partial telescopes.

F2F3F7step 1.1step 1.2
3.1

Still under the bounded clock assumption, EeitMn,et2/2E1et2(Γn,1)/2+et2/2EQn,1. The first term tends to zero by bounded convergence from Γn,1 in probability (every subsequence has an almost-surely convergent subsubsequence), and the second tends to zero by step 2.1. Thus the characteristic functions converge to et2/2. F4 proves Mn,N(0,1) in the bounded-clock case.

F4step 2.1
4.1

For the general case fix c>1 and define predictable truncated differences Z~n,k=Zn,k1{Γn,kc}. The event is Fn,k1-measurable because Γn,k=Γn,k1+vn,k. Their variance clock is bounded by c, their Lindeberg sums do not increase, and on {Γn,c} their terminal sum equals Mn,. Moreover their clock equals Γn, on that event, so it still converges in probability to 1. step 3.1 gives M~n,N(0,1), while P(M~n,Mn,)P(Γn,>c)0. F5 transfers the weak limit to Mn,. No independence was used: the clock hypothesis and the unconditional Lindeberg hypothesis entered separately. AC has precisely the role in F6.

F5F6step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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