Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Summable conditional projections give a stationary martingale CLT

Statement

Assume AC. Let T be an invertible bimeasurable probability-preserving transformation on (Ω,A,Q) such that Q(A△T−1A)=0 implies Q(A)∈{0,1}. Let X0∈L2(Q) be real and centered, put Xk=X0∘Tk for k∈Z, and put Fk=σ(Xi:i≤k). Suppose ∑j=1∞∥E[Xj∣F0]∥2<∞. Then the L2 series H0=∑j≥1E[Xj∣F0] converges. Put Hk=H0∘Tk and Dk=Xk+Hk−Hk−1. The Dk are stationary square-integrable martingale differences for Fk, and for n≥1, Sn:=∑k=1nXk=∑k=1nDk+H0−Hn,∥H0−Hn∥2≤2∥H0∥2. With τ2=E[D12], Sn/n⇒N(0,τ2), including τ2=0. If additionally ∑j≥1∣Cov⁡(X0,Xj)∣<∞, then τ2=E[X02]+2∑j=1∞Cov⁡(X0,Xj).

Facts & Assumptions

Given: AC, the invertible probability-preserving ergodic transformation T, centered real X0∈L2(Q), its stationary translates, natural past filtration, and the displayed summability assumption.

[A1]

AC supplies the inherited choices for the following conditional-expectation and limit suppliers. (The Axiom of Choice)

[F1]

Conditional expectation is linear, preserves expectation and constants, and contracts the real L2 norm. (Basic algebra and order properties of conditional expectation, Conditional lp contraction)

[F2]

Conditional expectations satisfy the tower property and allow a known measurable factor to be taken out when the input and the required products are integrable. (Tower property of conditional expectation, Taking out what is known)

[F3]

Under countable choice L2 is complete. (Riesz-Fischer completeness of Lp for 1≤p≤∞)

[F4]

Square-integrable products satisfy Cauchy–Schwarz. (Cauchy-Schwarz for random variables)

[F5]

A stationary integrable process with ergodic canonical shift has averages converging almost surely to its expectation. Ergodicity requires invariant events to have probability zero or one. (Birkhoff limit for a stationary integrable process, Ergodicity relative to an invariant measure)

[F6]

A square-integrable martingale-difference array with terminal conditional variance clock tending to 1 in probability and vanishing unconditional Lindeberg sums has terminal sum converging to N(0,1). (Martingale central limit theorem)

[F7]

Dominated convergence passes limits through integrals dominated by an integrable function. (Dominated convergence)

[F8]

L2 convergence implies convergence in probability; a perturbation tending to zero in probability preserves a weak limit; continuous scaling preserves weak convergence. (Lp convergence implies convergence in probability, Converging together lemma, Continuous mapping theorem)

[F9]

Variance and covariance are centered second and product moments. (Moments, variance, and covariance on a probability space)

Proof

1.1A1F1given

For an integrable Z and any integer k, the variable E[Z∣F0]∘Tk is Fk measurable because the pullback of F0 by Tk is Fk. Every event in Fk is the pullback of an event in F0, since T is invertible and bimeasurable. Changing variables under the probability-preserving bijection Tk proves that the integrals of this candidate and Z∘Tk agree over every Fk event. Uniqueness of conditional expectation therefore gives E[Z∘Tk∣Fk]=E[Z∣F0]∘Tk as almost-everywhere classes.

2.1A1F3step 1.1givenconstruct

By summability and [F3], the partial sums defining H0 are Cauchy in L2(F0) and have a limit there. Composition with Tk is an L2 isometry, so step 1.1 yields Hk=∑j≥1E[Xk+j∣Fk] in L2, with Hk measurable in Fk and ∥Hk∥2=∥H0∥2. Representatives may be fixed for the countably many indices; discard a countable union of null sets for their identities.

3.1F1F2F8step 1.1step 2.1algebra

By [F1], conditional expectation is continuous in L2. Apply [F2]'s tower property to the partial sums in step 2.1 and pass to the L2 limit to obtain E[Hk∣Fk−1]=∑j≥1E[Xk+j∣Fk−1]=Hk−1−E[Xk∣Fk−1]. Thus Dk=Xk+Hk−Hk−1 is square-integrable and Fk measurable, with E[Dk∣Fk−1]=0. Also Dk=D1∘Tk−1, so the differences are stationary. Summing their defining identity gives Sn=Mn+Rn, where Mn=∑k=1nDk, Rn=H0−Hn, and ∥Rn∥2≤2∥H0∥2. In particular Rn/n→0 in L2 and hence in probability by [F8].

4.1F1F5step 1.1step 3.1given

Put q0=E[D12∣F0]. It is nonnegative, integrable, and has expectation τ2=E[D12] by [F1]. Step 1.1 gives E[Dk2∣Fk−1]=q0∘Tk−1. The map ω↦(q0(Tjω))j≥0 intertwines T with the canonical one-sided shift. Hence a shift-invariant event for this process pulls back to a T-invariant event modulo null sets, whose probability is zero or one by the assumed ergodicity. The process is stationary, integrable and ergodic, so [F5] gives n−1∑k=1nE[Dk2∣Fk−1]→τ2 almost surely. The limiting variance is therefore a constant.

5.1A1F6F7F8step 3.1step 4.1construct

If τ2>0, let Zn,k=Dk/(τn) for 1≤k≤n, and let Zn,k=0 for k>n; use the filtration Fn,k=Fmin⁡(k,n) for k≥0. Step 3.1 makes each row a square-integrable martingale-difference row. The row sums and clocks are eventually constant, and step 4.1 shows their terminal clocks converge almost surely to 1. For every ε>0, stationarity gives ∑k≥1E[Zn,k21{∣Zn,k∣>ε}]=τ−2E[D121{∣D1∣>ετn}]→0 by [F7]. Thus [F6] gives Mn/(τn)⇒N(0,1). Scaling and the perturbation in step 3.1 give Sn/n⇒N(0,τ2) by [F8].

6.1F8step 3.1step 5.1given

If τ2=0, stationarity implies E[Dk2]=0 for every k, so Mn=0 almost surely. Step 3.1 gives Sn/n→0 in L2 and hence in probability. The constant sequence 0 has weak limit the point mass N(0,0); [F8] transfers that limit to Sn/n. This establishes the asserted CLT in both variance cases.

7.1F2F4F7F9step 3.1given∎

Suppose the additional covariance summability holds, and put γj=Cov⁡(X0,Xj). Stationarity and expansion of the finite square give Var⁡(Sn)/n=γ0+2∑j=1n−1(1−j/n)γj→γ0+2∑j≥1γj, by [F7] on counting measure with summable dominator ∣γj∣. For i<j, Di is Fj−1 measurable, so [F2], [F4], and step 3.1 give E[DiDj]=0. Therefore E[Mn2]=nτ2. The identity Sn=Mn+Rn and [F4] imply ∣E[Sn2]−nτ2∣/n≤∥Rn∥22/n+2∥Rn∥2τ/n→0, since ∥Rn∥2 is bounded. All Sn are centered, so [F9] identifies the two variance limits and proves the stated covariance formula, including τ2=0.

Source notes

The absolutely summable projection assumption permits an exact L2 coboundary series, so no maximal martingale approximation theorem is imported. The deterministic variance follows from the explicitly assumed ergodicity and its factor argument. The covariance identity is obtained from second moments, independently of convergence in distribution.

Depends on

Used by

Dependency tree · two levels

64 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