Alphabeta Math
Pipeline-generated
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.

Hilbert-Valued CLT for Functional Time Series — Examples

1 · Prerequisites

2 · Summary

The examples compute the physical-dependence errors and long-run covariance for a finite moving average and a geometrically weighted Rademacher shift. A square-integrable linear filter shows that the theorem's summability condition is substantive, while a deterministic path sequence separates convergence of terminal values from weak convergence of path laws.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A square-integrable linear shift with nonsummable physical dependence

Statement

Assume Countable Choice and Dependent Choice, and let (ϵt)t∈Z be iid Rademacher variables (P(ϵt=1)=P(ϵt=−1)=1/2), and let e(u)=1 in H=L2([0,1],dt;R), so ∥e∥H=1. Let N0 be the least N∈N such that ∑k>N(k+1)−2<1. For r≥1, recursively choose Nr as the least integer greater than Nr−1 such that ∑k>Nr(k+1)−2<2−4r. Define a causal Borel filter by f(x0,x1,…)=elim⁡r→∞∑k=0Nrxkk+1 when this subsequence converges, and define f=0 otherwise. Then Xt=f(ϵt,ϵt−1,…) is centered and has finite second moment, but its physical-dependence coefficients satisfy δm2=2∑k=m∞1(k+1)2,δm≥2m+1(m≥1). Consequently ∑m≥1δm=∞: the sufficient summability hypothesis in L2-m-approximable causal Bernoulli shifts does not apply to this shift. The example makes no claim that nonsummability alone precludes every possible central limit theorem.

Facts & Assumptions

Given: Countably many iid Rademacher innovations, the real Hilbert space H=L2([0,1],dt;R), and the replacement convention in L2-m-approximable causal Bernoulli shifts.

[F2]

The scalar L2 quotient is complete and its norm is induced by the integral inner product (The space Lp(μ) as the quotient by null functions, L2 with the integral pairing is a Hilbert space).

[F3]

Chebyshev's inequality bounds the probability of a deviation by its variance divided by the squared threshold, and the first Borel--Cantelli lemma makes events with summable probabilities occur only finitely often (Chebyshev's inequality for random variables, First Borel-Cantelli lemma for events).

[F4]

The stated two-point Rademacher law gives Eϵt=0 and Eϵt2=1 by the expectation definition. Independence is the independence of the generated sigma-algebras (Independent random elements); expectations of products of integrable functions of distinct independent coordinates factor (Expectation of a nonnegative or integrable random variable, Expectations factor over finite products of independent random variables).

[F5]

Cauchy--Schwarz on a probability space gives E∣Y∣≤∥Y∥2; thus L2 convergence implies convergence of means and of L2 norms (Cauchy-Schwarz for random variables).

[F6]

Since x−2 is decreasing, ∑j=2Nj−2≤∫1Nx−2 dx≤1, so ∑j≥1j−2<∞. Since x−1/2 is decreasing, ∑j=2Nj−1/2≥∫2N+1x−1/2 dx→∞, so ∑j≥2j−1/2=∞.

Proof

Given: The probability space and iid Rademacher innovations in the Statement, together with the independent replacement extension from L2-m-approximable causal Bernoulli shifts.

1.1givenF1F6constructalgebra

By [F6], the coefficient series ∑k≥0(k+1)−2 converges and its tails tend to zero. Hence the set defining N0 is nonempty, so its least element exists. For r≥1, once Nr−1 is chosen, the tail tends to zero, so some integer N>Nr−1 satisfies the required bound ∑k>N(k+1)−2<2−4r; thus the least such Nr exists. For a deterministic sign sequence x=(xk)k≥0, put sN(x)=∑k=0Nxk/(k+1). Each sN is product-measurable. The set on which (sNr)r≥0 is Cauchy is Borel, because the Cauchy condition is a countable combination of inequalities between these measurable real functions. On that set their limit is measurable, and extending it by zero on the complement is product-measurable. Thus f is a total Borel map into the one-dimensional subspace Re⊂H.

2.1F2F3F4F5F6step 1.1choosealgebra

On the given probability space carrying the iid innovations, the partial sums SN=∑k=0Nϵ−k/(k+1) are Cauchy in L2, since for M>N independence, centering and [F4] give E∣SM−SN∣2=∑k=N+1M(k+1)−2⟶0. By [F2] they converge in L2 to a random variable S. Each SN has mean zero and squared norm ∥SN∥22=∑k=0N(k+1)−2; [F5] therefore gives ES=0 and ES2=∥S∥22=∑k=0∞(k+1)−2<∞ by [F6]. Choose increasing Nr with ∑k>Nr(k+1)−2<2−4r. Taking M→∞ in the finite tail-variance identity gives E∣SNr−S∣2=∑k>Nr(k+1)−2. Thus [F3] gives P(∣SNr−S∣>2−r)≤22rE∣SNr−S∣2<2−2r. These probabilities are summable, so [F3] implies SNr→S almost surely. Hence the defining subsequence filter equals Se almost surely. In particular X0 is centered and E∥X0∥H2=ES2=∑k=0∞(k+1)−2<∞. The same argument applies to every shifted iid input sequence.

3.1F1F2F4step 2.1algebra

For fixed m≥1, the mixed sequence used by X0,m is itself iid Rademacher, so its filter is the corresponding L2 limit. Subtracting its partial sums from those for X0 cancels the terms k<m and leaves X0−X0,m=e∑k=m∞ϵ−k−ϵ0,m,−k′k+1in L2. The summands are independent, centered, and have variance 2/(k+1)2 by [F4]; finite-tail variance computation followed by L2 convergence therefore gives δm2=2∑k=m∞(k+1)−2.

4.1F6step 2.1step 3.1algebra∎

Since x↦x−2 is decreasing on (0,∞), ∑k=m∞(k+1)−2≥∫m+1∞x−2 dx=1m+1. Thus δm≥2/(m+1), and the decreasing-function integral comparison gives ∑m≥1δm≥2∑j≥2j−1/2≥2∫2∞x−1/2 dx=+∞ by [F6]. The moment condition holds by step 2.1, but the required dependence-coefficient summability fails.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite-dependent functional moving average

Statement

Let (ϵt)t∈Z be iid Rademacher variables and let e(u)=1 in H=L2([0,1],dt;R). The centered process Xt=(ϵt+2ϵt−1)e is a finite-dependent causal shift. Its physical-dependence coefficients satisfy δ1=22 and δm=0 for m≥2, while its long-run covariance is Γ=9(e⊗e). Under AC, the theorem Hilbert-valued CLT for L2-m-approximable Bernoulli shifts gives n−1/2∑t=1nXt⇒G, where G is centered Gaussian in H with covariance 9(e⊗e).

Facts & Assumptions

Given: AC and countably many iid Rademacher innovations.

[A1]

AC supplies Countable Choice and the countable independent family used here (The Axiom of Choice, Countably many independent copies of a prescribed law exist).

[F1]

The causal-shift definition specifies Xt,m by retaining the last m original innovations and independently replacing the earlier tail; the physical-dependence coefficient is the L2(H) norm of the difference (L2-m-approximable causal Bernoulli shifts).

[F2]

The stated two-point Rademacher law gives mean zero and variance one; independence of random elements means independence of their generated sigma-algebras, and expectations of independent integrable real products factor (Expectation of a nonnegative or integrable random variable, Independent random elements, Expectations factor over finite products of independent random variables).

[F3]

Under AC, a centered L2-approximable causal shift has the Hilbert valued CLT with its long-run covariance operator (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).

[F4]

Independence of random elements is independence of their generated sigma-algebras, and disjoint groups of an independent sigma-algebra family generate independent sigma-algebras (Independent random elements, Independent sigma-algebras and independent events, Disjoint groups of an independent sigma-algebra family remain independent).

Proof

Given: The innovations and the process in the Statement.

1.1A1F1F2algebra

The vector e has norm one, so Xt has mean zero and E∥Xt∥H2=E(ϵt+2ϵt−1)2=5 by [F2]. For m=1, the replacement changes only ϵ−1 in X0, so X0−X0,1=2(ϵ−1−ϵ0,1,−1′)e and [F2] gives δ12=4(1+1)=8. For m≥2, both innovations on which X0 depends are retained, so X0,m=X0 and δm=0. Hence ∑m≥1δm=22<∞.

1.2F2algebra

The lag-zero covariance is 5(e⊗e). At lag one, the only nonzero product in (ϵ0+2ϵ−1)(ϵ1+2ϵ0) is 2ϵ02, so EB[X0⊗X1]=2(e⊗e). Reversing the factors gives the same operator. At every lag ∣j∣≥2 the innovation sets are disjoint, so independence and centering make the covariance zero. Therefore the long-run covariance sum is (5+2+2)(e⊗e)=9(e⊗e).

1.3F1F4givenalgebra

Fix a cut a∈Z. The variables (ϵj)j∈Z are independent by the iid assumption, so their generated sigma-algebras form an independent family by Independent random elements and Independent sigma-algebras and independent events. Each Xs is measurable with respect to σ(ϵs,ϵs−1). Thus σ(Xs:s≤a)⊆σ(ϵj:j≤a), while σ(Xs:s≥a+2)⊆σ(ϵj:j≥a+1). By [F4] the two source sigma-algebras are independent; their sub-sigma-algebras generated by the process groups inherit independence. The process is therefore 1-dependent under the definition in L2-m-approximable causal Bernoulli shifts.

2.1F3step 1.1step 1.2∎

The moment, centering and summability conditions were verified in step 1.1, and step 1.2 gives the covariance required by [F3]. Applying [F3] proves the asserted sample-sum convergence; the Gaussian limit is allowed to have finite rank, as it does here. This conclusion concerns the H-valued sample sums.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A geometrically summable Bernoulli shift

Statement

Let (ϵt)t∈Z be iid Rademacher variables, put e(u)=1 in H=L2([0,1],dt;R), and define Xt=(∑k=0∞2−kϵt−k)e. The series converges absolutely for every sign sequence. Its physical dependence coefficients are δm2=83 4−m, so they are summable. Its long-run covariance is 4(e⊗e), and under AC the Hilbert-valued CLT gives a centered Gaussian limit with that covariance.

Facts & Assumptions

Given: AC and countably many iid Rademacher innovations.

[A1]

AC supplies Countable Choice and the countable independent family used here (The Axiom of Choice, Countably many independent copies of a prescribed law exist).

[F1]

For fixed m, the replacement keeps coefficients k<m and uses independent copies for all k≥m; δm is the resulting L2(H) error (L2-m-approximable causal Bernoulli shifts).

[F2]

The stated two-point Rademacher law gives mean zero and variance one; independence means independence of the generated sigma-algebras, and expectations of independent integrable products factor (Expectation of a nonnegative or integrable random variable, Independent random elements, Expectations factor over finite products of independent random variables). Dominated convergence passes expectations through uniformly bounded partial sums (Dominated convergence).

[F3]

Under AC, a centered L2-approximable causal shift has the Hilbert valued CLT with its long-run covariance operator (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).

Proof

Given: The innovations and process in the Statement.

1.1A1F1F2constructalgebra

For every input sequence with ∣ϵt∣=1, ∑k≥0∣2−kϵt−k∣≤2, so the series converges absolutely and uniformly over the product space. Its partial sums are product-measurable and bounded by 2, so their pointwise limit is a Borel causal map. Finite partial-sum variances are ∑k≤N4−k by [F2]; the uniform bound and dominated convergence give centering and E∥X0∥H2=∑k≥04−k=4/3<∞. For the replacement, the first m terms cancel; finite tails are independent centered differences with variance 2∑k=mN4−k and are bounded in absolute value by 2∑k=m∞2−k. Dominated convergence [F2] passes these variances to the infinite tail, giving δm2=2∑k=m∞4−k=83 4−m. Thus ∑m≥1δm=8/3∑m≥12−m<∞.

2.1F2step 1.1algebra

For j≥0, truncate both linear sums at index N. Their product is bounded by 4 and converges pointwise to X0Xj, so dominated convergence [F2] passes expectations to the limit. The finite sums share exactly innovations with indices −k=j−(k+j); their coefficient products are 2−k2−(k+j), while all other products have zero expectation by [F2]. The finite shared-coefficient sums tend to ∑k≥02−k2−(k+j), giving γj=E⟨X0,Xj⟩H=43 2−j. Symmetry gives γ−j=γj. Therefore the scalar long-run variance is γ0+2∑j≥1γj=43+83∑j≥12−j=4, and the operator is 4(e⊗e).

3.1F3step 1.1step 2.1∎

Step 1.1 gives centering, a finite second moment and summable physical-dependence errors; step 2.1 gives the long-run covariance. Applying [F3] yields convergence of the normalized H-valued sums to a centered Gaussian with covariance 4(e⊗e).

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A terminal weak limit does not imply a path-space weak limit

Statement

Let C=C([0,1];H) with the supremum norm, choose a unit vector e∈H, and define deterministic paths w2r(t)=0,w2r+1(t)=sin⁡(πt)e(0≤t≤1). Every terminal value is zero, so the laws of wn(1) converge to the point mass at 0 in H. The laws of the paths do not converge weakly on C. This illustrates why the sample-sum CLT in Hilbert-valued CLT for L2-m-approximable Bernoulli shifts is not a time-indexed process CLT.

Facts & Assumptions

Given: The metric space C with d(w,v)=sup⁡t∈[0,1]∥w(t)−v(t)∥H and the deterministic paths in the Statement.

[F1]

Weak convergence of Borel probability laws entails convergence of integrals of bounded continuous real functions (Convergence in distribution of random elements).

[F2]

The preceding Hilbert-valued theorem concerns normalized sample sums as single H-valued random elements, not paths indexed by t∈[0,1] (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).

Proof

Given: The paths wn and their point-mass laws.

1.1givenF1algebra

Since sin⁡(0)=sin⁡(π)=0, both even and odd paths satisfy wn(1)=0. Thus their terminal laws are all the point mass δ0 and in particular converge weakly to δ0 in H.

1.2F1algebra

Define Φ:C→R by Φ(w)=min⁡{1,sup⁡0≤t≤1∥w(t)∥H}. The supremum norm inequality gives ∣sup⁡t∥w(t)∥H−sup⁡t∥v(t)∥H∣≤sup⁡t∥w(t)−v(t)∥H=d(w,v), and truncation by x↦min⁡(1,x) is 1-Lipschitz on [0,∞). Hence Φ is bounded and continuous. It equals 0 on every even path and 1 on every odd path, so its expectations under the path laws alternate between 0 and 1 and do not converge. By [F1], those path laws cannot converge weakly.

2.1F2step 1.1step 1.2∎

The example has convergence only after applying the terminal evaluation map; the bounded continuous path functional in step 1.2 detects the missing path-space convergence. Therefore endpoint convergence alone supplies no functional CLT conclusion, consistently with the scope in [F2].