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.

✓ 3 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Hilbert-Valued CLT for Functional Time Series

1 · Prerequisites

2 · Summary

This page defines the causal Bernoulli-shift approximation convention in H=L2([0,1]) and proves the local ingredients needed for its sample-mean central limit theorem. The finite-dependent vector CLT is proved by truncation and independent blocks. A local basis-projection lemma proves norm convergence and Parseval from basis completeness. A separate Hilbert-valued expectation lemma supplies the orthogonal-projection step. The long-run covariance is shown to be a positive trace-class operator and an L2([0,1]2) kernel equivalence class; a local kernel-operator lemma makes that identification precise. A positive trace-class covariance is realized by a Borel Hilbert-valued Gaussian. The final theorem proves weak convergence of the normalized sums in H under AC. It does not assert convergence of a partial-sum path process.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

L2-m-approximable causal Bernoulli shifts

Definition

Let B be the Borel sigma-algebra of [0,1], generated by intervals with rational endpoints; let dt be Lebesgue measure restricted to B, and set H=L2([0,1],B,dt;R), with inner product ⟨x,y⟩H=∫01x(u)y(u) du. We use the quotient-by-null-functions convention for L2 (The space Lp(μ) as the quotient by null functions). The measure space is finite and countably generated, so under Countable Choice H is separable (If μ is sigma-finite and A is countably generated, then Lp(μ) is separable for 1≤p<∞, The Axiom of Countable Choice (ACω), Separability: the existence of an at most countable dense subset); L2 with the integral pairing is a Hilbert space verifies that this real pairing makes the quotient a Hilbert space.

Let (S,S,ν) be a probability space and (δt)t∈Z an independent identically distributed family of S-valued random elements with law ν (Random elements and real random variables, Law or distribution of a random element, Independent random elements). A causal Bernoulli shift with innovation law ν is a process Xt=f(δt,δt−1,δt−2,…),t∈Z, where f:SN0→H is measurable from the product sigma-algebra S⊗N0 to the Borel sigma-algebra of H. This product-measurability formulation is meaningful for a merely measurable innovation space S.

On an independent product extension, take replacement innovations δt,m,k′, indexed by t∈Z, m∈N0, and integers k≤t−m, all with law ν, mutually independent, and independent of the original innovations. Such a countable family and its product with the original probability space exist under Countable Choice and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Countably many independent copies of a prescribed law exist, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique). For m≥1 define Xt,m=f(δt,…,δt−m+1,δt,m,t−m′,δt,m,t−m−1′,…), and define the full replacement Xt,0=f(δt,0,t′,δt,0,t−1′,…). Each Xt,m has the same marginal law as Xt; for fixed m≥1 the sequence (Xt,m)t∈Z is strictly stationary and m-dependent because its original-innovation windows have length m and its replacement arrays are independent across t.

For every fixed m≥0, the joint process (Xt,Xt,m)t∈Z is strictly stationary: shifting all indices relabels a family of mutually independent innovations with the same law and commutes with the defining measurable maps. Consequently Dt,m:=Xt−Xt,m is stationary and ∥Dt,m∥L2(H)=δm for every t.

Write ∥X∥L2(H)=(E∥X∥H2)1/2 and δm=∥X0−X0,m∥L2(H),m≥0. The process is L2-m-approximable when E∥X0∥H2<∞and∑m≥1δm<∞. The same marginal law gives δ0≤2∥X0∥L2(H)<∞. For a Bochner-integrable H-valued random element Y, write EBY=∫Y dP; the moment condition makes Xt and every Xt,m Bochner integrable (Bochner-integrable function, Bochner integrability criterion).

Here strict stationarity means invariance of every finite-dimensional law under integer shifts. A process is m-dependent if, for every a∈Z, the sigma-algebras generated by (Xs)s≤a and (Xs)s≥a+m+1 are independent (Independent sigma-algebras and independent events). The stated input windows for Xt,m are disjoint across these two index ranges, so they satisfy this definition.

Remarks

Every Borel H-valued random element here is strongly measurable. Indeed, fix a dense sequence (hj) in the separable space H. For each N, send x to the first point among h0,…,hN minimizing ∥x−hj∥H. Its finitely many tie-broken cells are Borel because the distance functions are continuous, so this is a finite-valued measurable map; its distance from x tends to zero since the sequence is dense. Composition with any Borel H-valued random element gives the simple approximants in Strongly measurable Banach-valued function. The phrase “Borel measurable” in the design is thus applied to the target H; the innovation domain uses its stated product sigma-algebra.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite-dependent vector central limit theorem

Statement

Assume the Axiom of Choice. Let d≥1 and m≥0 be finite integers, and let (Yt)t∈Z be a centered strictly stationary sequence of Rd-valued random vectors with E∥Y0∥2<∞. Strict stationarity means that every finite-dimensional law is invariant under integer shifts. Assume m-dependence: for each a∈Z, the sigma-algebras generated by (Yt)t≤a and (Yt)t≥a+m+1 are independent, in the sense of Independent sigma-algebras and independent events. Set Σm=∑∣j∣≤mCov⁡(Y0,Yj), where Cov⁡(U,V)=E[(U−EU)(V−EV)T] (Moments, variance, and covariance on a probability space). Then Σm is symmetric positive semidefinite and 1n∑t=1nYt ⇒ Nd(0,Σm). The conclusion allows singular Σm, including Σm=0.

Facts & Assumptions

Given: Assume AC. Let (Yt)t∈Z be centered, strictly stationary, m-dependent Rd-valued random vectors with finite second moment, as in the Statement.

[A1]

The Axiom of Choice is assumed (The Axiom of Choice).

[F1]

A centered row-wise independent triangular array with finite second moments and the Lindeberg condition has a standard normal normalized row-sum limit (Lindeberg-Feller central limit theorem: sufficiency); the row and Lindeberg conventions are those of Row-wise independent centered triangular array and Total row variance and the Lindeberg condition.

[F2]

Slutsky's theorem permits multiplication of a convergent real random variable by a sequence converging in probability to a constant (Slutsky's theorem for real random variables).

[F3]

If two sequences on a common metric space differ by a quantity tending to zero in probability, they have the same weak limit (Converging together lemma).

[F4]

Under AC, pointwise convergence of characteristic functions to a specified characteristic function implies weak convergence of the corresponding real laws (Characteristic function criterion for weak convergence).

[F5]

Under AC, a positive semidefinite covariance matrix, including a singular one, defines Nd(0,Σ) (Multivariate normal law, including singular covariance); convergence of all one-dimensional linear projections to the corresponding projections of a specified law implies vector weak convergence (Cramer wold device).

[F6]

A square-integrable real random variable satisfies Chebyshev's inequality, so a sequence whose second moments tend to zero converges in probability to zero (Chebyshev's inequality for random variables).

[F7]

Dominated convergence removes the tails of a square-integrable random variable when it is clipped at levels K→∞ (Dominated convergence).

[F8]

Cauchy--Schwarz for square-integrable real random variables bounds expectations of products by the product of their L2 norms (Cauchy-Schwarz for random variables).

Proof

Given: The objects and assumptions in the Statement.

1.1A1givenF5F8algebra

For h∈Z put Ch=Cov⁡(Y0,Yh). These covariance terms are finite by [F8]. Strict stationarity gives C−h=ChT, and m-dependence gives Ch=0 when ∣h∣>m. Expanding the finite variance of the sum yields 1nCov⁡ ⁣(∑t=1nYt)=∑∣h∣≤m(1−∣h∣n)+Ch⟶Σm. Thus Σm is symmetric, and for every a∈Rd, aTΣma is the limit of nonnegative variances divided by n, so it is nonnegative. Hence Nd(0,Σm) exists by [F5].

2.1givenF3F6F7F8step 1.1algebra

Fix a∈Rd and let Zt=aTYt and σ2=aTΣma. If σ2=0, step 1.1 gives E∣n−1/2∑t=1nZt∣2→0; [F6] and then [F3] give convergence in distribution to zero. Suppose σ2>0. For K≥1 define Zt(K)=max⁡(−K,min⁡(K,Zt))−E[max⁡(−K,min⁡(K,Z0))]. This is centered, stationary, m-dependent and bounded by 2K; [F7] gives ∥Z0−Z0(K)∥2→0. Write σK2=lim⁡nn−1Var⁡(∑t=1nZt(K))=∑∣h∣≤mCov⁡(Z0(K),Zh(K)). Finite summation and [F8] give σK2→σ2, so σK2>0 for all sufficiently large K.

3.1A1F1F2givenstep 2.1choosealgebra

Fix such a K, put ℓn=⌊n1/4⌋, and retain qn=⌊n/(ℓn+m)⌋ blocks of length ℓn, with m omitted indices between successive blocks. Write b for the last index in a retained block. The next block starts at b+m+1, so m-dependence makes its sigma-algebra independent of the sigma-algebra generated by all earlier blocks; induction gives row-wise independence of the block sums Bn,r. If γh(K)=Cov⁡(Z0(K),Zh(K)), stationarity gives Var⁡(Bn,r)=ℓnγ0(K)+2∑h=1m(ℓn−h)γh(K),sn2n:=qnVar⁡(Bn,1)n⟶σK2. Here qnℓn/n→1 and qn/n→0. Also ∣Bn,r∣≤2Kℓn and sn/n→σK>0. Thus qn≥1 and sn>0 for all sufficiently large n; on this tail, for each ε>0 every block is eventually bounded by εsn, so the Lindeberg sum is zero. Applying [F1] to this tail of rows, sn−1∑rBn,r⇒N(0,1), and [F2] gives n−1/2∑rBn,r⇒N(0,σK2).

4.1F3F6givenstep 3.1algebra

The omitted gaps and terminal remainder contain rn≤mqn+ℓn+m=O(n/ℓn+ℓn)=o(n) indices. For a centered m-dependent sequence bounded by 2K, at most (2m+1)rn ordered pairs of omitted terms can have nonzero covariance, each covariance having absolute value at most 4K2. Therefore the omitted sum divided by n tends to zero in L2, hence in probability by [F6]. By [F3], n−1/2∑t=1nZt(K)⇒N(0,σK2).

5.1A1F4F8step 2.1step 4.1algebra

The centered m-dependent truncation errors Wt(K)=Zt−Zt(K) satisfy E∣n−1/2∑t=1nWt(K)∣2≤(2m+1)E∣W0(K)∣2⟶0(K→∞), by expanding the variance and bounding each of its at most 2m+1 nonzero lag terms with [F8]. For fixed real u, ∣eiux−eiuy∣≤∣u∣∣x−y∣; thus the characteristic function of n−1/2∑Zt differs from that of its K-truncation by at most ∣u∣(2m+1)E∣W0(K)∣2. First taking n→∞ using step 4.1 and then K→∞ using σK2→σ2 proves convergence to e−u2σ2/2. By [F4], n−1/2∑Zt⇒N(0,σ2). This also covers every projection with positive variance; the zero-variance case was handled in step 2.1.

6.1A1F5step 1.1step 2.1step 5.1∎

Steps 2.1 and 5.1 show for every a∈Rd that aTn−1/2∑t=1nYt⇒N(0,aTΣma). These are precisely the projections of the law Nd(0,Σm) established in step 1.1, so [F5] gives the asserted vector convergence, including singular and zero covariance.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Positive trace-class covariance defines a Hilbert Gaussian

Statement

Assume AC. Let H be a separable real Hilbert space and let Γ:H→H be positive, self-adjoint and trace class. Then there is a Borel H-valued random element G such that every ⟨G,h⟩H is a centered real normal random variable and E[⟨G,h⟩H⟨G,k⟩H]=⟨Γh,k⟩H(h,k∈H). This is the centered Gaussian law with covariance operator Γ; it includes finite-rank and zero covariance.

Facts & Assumptions

Given: AC, a separable real Hilbert space H, and a positive self-adjoint trace-class operator Γ on H.

[F1]

A compact self-adjoint operator has an orthonormal eigenbasis under AC; for positive Γ its eigenvalues are nonnegative (Spectral theorem for compact self adjoint operators, Orthonormal eigenbasis for a compact self adjoint operator).

[F2]

For positive trace-class Γ, its trace is the finite sum of its nonnegative eigenvalues with multiplicity (Trace class operator, Trace of a positive operator is the sum of its eigenvalues).

[F3]

Under Countable Choice and Dependent Choice, a countable independent family with prescribed standard normal law exists; a standard normal has mean zero, variance one and characteristic function e−t2/2 (Countably many independent copies of a prescribed law exist, Standard normal and normal laws, Characteristic function of a normal law).

[F4]

Expectations of products of integrable functions of distinct independent real random variables factor, and a real law is determined by its characteristic function (Expectations factor over finite products of independent random variables, Uniqueness of a law from its characteristic function).

[F5]

Tonelli interchanges the countable sum of nonnegative squared coordinates with expectation (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F6]

A strongly measurable Banach-valued map is an almost-everywhere pointwise limit of measurable simple maps (Strongly measurable Banach-valued function); separability supplies a dense sequence in H (Separability: the existence of an at most countable dense subset).

[F7]

Cauchy--Schwarz makes products of square-integrable real random variables integrable and passes their expectations under L2 limits (Cauchy-Schwarz for random variables).

Proof

Given: The assumptions and facts in the Statement and Facts & Assumptions.

1.1A1F1F2givenchoose

By [F1], choose an orthonormal eigenbasis (ej)j∈J of Γ with eigenvalues λj≥0. This basis is finite or countable: take a dense sequence (hk) in H and assign to each unit basis vector the least index k with ∥ej−hk∥H<1/4. Distinct orthogonal unit vectors are separated by 2, so the assignment is injective. By [F2], ∑j∈Jλj=tr⁡(Γ)<∞.

1.2A1F2F3F5algebra

By [A1] and [F3], take independent standard normal variables (Zj)j∈J on a common probability space. Define T=∑j∈JλjZj2 as a nonnegative extended random variable. Tonelli [F5] gives ET=∑jλjEZj2=tr⁡(Γ)<∞, so T<∞ almost surely: if P(T=∞)>0, then ET≥MP(T=∞) for every M>0, a contradiction.

2.1F1F2F5F6givenstep 1.2construct

On {T<∞} the partial sums GN=∑j∈J, j≤NλjZjej are Cauchy in H, since orthonormality gives ∥GM−GN∥H2=∑N<j≤MλjZj2. Let G be their limit there, and set G=0 on the measurable null complement. The convergence set is measurable by the Cauchy criterion. For F=∅ the preimage is empty. For nonempty closed F⊆H, the set {G∈F} is the union of {T<∞, dist⁡(GN,F)→0} and, when 0∈F, {T=∞}; the first set is measurable because each distance map is continuous and the second is measurable. Thus G is Borel. To see strong measurability, let (hk) be a dense sequence in H and, for each N, map x to the first point among h1,…,hN minimizing distance to x. The finitely many tie-broken cells are Borel, so these are finite-valued Borel maps; their distances from x tend to zero by density. Composing them with G gives measurable simple maps converging pointwise to G, as required by [F6]. On {T<∞}, ∥G−GN∥H2=∑j>NλjZj2; [F5] gives E∥G−GN∥H2=∑j>Nλj→0 and E∥G∥H2=∑jλj=tr⁡(Γ)<∞.

3.1F1F3F4step 2.1

Fix h∈H. The finite sum ⟨GN,h⟩H is a sum of independent centered normal variables, so its characteristic function is exp⁡(−t2∑j≤Nλj⟨ej,h⟩H2/2) by [F3] and [F4]. The series of variances increases to ∑jλj⟨ej,h⟩H2=⟨Γh,h⟩H, and GN→G in L2 by step 2.1. Since ∣eitx−eity∣≤∣t∣∣x−y∣, the characteristic functions converge to exp⁡(−t2⟨Γh,h⟩H/2); [F3]–[F4] identify ⟨G,h⟩H as the centered normal with that variance, including variance zero.

4.1F1F3F4F7step 2.1∎

For h,k∈H, the finite-sum covariances are E[⟨GN,h⟩H⟨GN,k⟩H]=∑j≤Nλj⟨h,ej⟩H⟨ej,k⟩H by independence, centering and [F3]–[F4]. The L2 convergence from step 2.1 and [F7] pass the left side to the limit, while the eigen-expansion of Γ makes the right side tend to ⟨Γh,k⟩H. Hence G has the asserted covariance.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Real L2 kernels define bounded operators and represent rank-one tensors

Statement

Let I=[0,1] with its Borel sigma-algebra and Lebesgue measure dt, and let H=L2(I,dt;R) and K=L2(I2,dt×dt;R) be the quotient spaces by null functions. Assume Countable Choice, so these L2 spaces have their usual real Hilbert-space structures. For k∈K and f∈H, define, for almost every u, (Tkf)(u)=∫01k(u,v)f(v) dv. This defines a bounded linear operator Tk:H→H and ∥Tk∥≤∥k∥K. For x,y∈H, the class x⊠y represented by x(u)y(v) is well-defined in K, satisfies ∥x⊠y∥K=∥x∥H∥y∥H, and Tx⊠y=x⊗y, where (x⊗y)h=⟨h,y⟩Hx. For x,y,g,h∈H the product-kernel inner product also satisfies ⟨x⊠y,g⊠h⟩K=⟨x,g⟩H⟨y,h⟩H.

Facts & Assumptions

Given: Countable Choice; the Borel probability space (I,B,dt); the product measure dt×dt on I2; and the real L2 quotient spaces H and K.

[A1]

Countable Choice is assumed for the Hilbert-space L2 interfaces (The Axiom of Countable Choice (ACω), L2 with the integral pairing is a Hilbert space).

[F1]

The product measure is sigma-finite and satisfies (dt×dt)(A×B)=dt(A)dt(B) for Borel A,B (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Finite, sigma-finite, and semifinite measures).

[F2]

Tonelli applies to nonnegative Borel functions on I2 and makes their section integrals measurable (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F3]

If a product-measurable function is in L1(dt×dt), its sections are integrable almost everywhere, the section-integral function is measurable after zero extension on the exceptional null set, and its integral equals the product integral (Fubini's theorem for L^1 functions on a sigma-finite product).

[F4]

The real L2 quotient has inner product ⟨f,g⟩=∫fg dt and satisfies Cauchy–Schwarz (L2 with the integral pairing is a Hilbert space, The space Lp(μ) as the quotient by null functions, Real and complex inner-product spaces and their induced length).

Proof

Given: The spaces, functions, and conventions in the Statement and Facts & Assumptions.

1.1A1F1F2F4

Choose measurable representatives of x and y. By [F1]–[F2], ∫I2∣x(u)y(v)∣2 d(dt×dt)=(∫I∣x(u)∣2 du)(∫I∣y(v)∣2 dv)<∞. Changing either representative changes the product only on (N×I)∪(I×M) for null sets N,M⊂I; [F1] gives this union product measure zero. Hence x⊠y is a well-defined class in K and the displayed integral proves its norm identity.

1.2F1F2F3F4algebra

Choose Borel representatives of k and f. The function (u,v)↦k(u,v)f(v) is product-measurable and belongs to L1(dt×dt), since Cauchy–Schwarz on I2 gives ∫I2∣k(u,v)f(v)∣ du dv≤∥k∥K(∫I2∣f(v)∣2 du dv)1/2=∥k∥K∥f∥H. By [F3] its section integrals are defined almost everywhere and have a measurable representative. For almost every u, sectionwise Cauchy–Schwarz and [F2] give ∣(Tkf)(u)∣2≤∥f∥H2∫I∣k(u,v)∣2 dv,∥Tkf∥H2≤∥k∥K2∥f∥H2. If f is changed on a dt-null set, its section integral is unchanged for every u whose k(u,⋅) is square-integrable. If k is changed on a (dt×dt)-null set, the difference times f(v) is in L1 by the same Cauchy–Schwarz estimate, so [F3] makes its section integral zero for almost every u. Thus Tk is well-defined on the quotients. Linearity follows from linearity of the section integral, and the second estimate proves boundedness and ∥Tk∥≤∥k∥K.

2.1step 1.1step 1.2F4algebra

For k=x⊠y and almost every u, the section is integrable by step 1.2 and (Tx⊠yf)(u)=x(u)∫Iy(v)f(v) dv=x(u)⟨f,y⟩H=((x⊗y)f)(u). Thus Tx⊠y=x⊗y as operators on H. This includes x=0 or y=0, when both operators are zero.

3.1F1F3F4step 1.1algebra∎

For x,y,g,h∈H, [F3] applies to x(u)y(v)g(u)h(v) because Cauchy–Schwarz on I2 bounds its absolute integral by ∥x∥H∥g∥H∥y∥H∥h∥H. Fubini then factors the integral into ⟨x,g⟩H⟨y,h⟩H, proving the stated inner-product identity.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Complete orthonormal bases give norm-convergent projections and Parseval

Statement

Let H be a real Hilbert space and let (ek) be a finite or countable orthonormal family whose finite linear span is dense in H. Here orthonormal means ⟨ej,ek⟩H=1 when j=k and 0 otherwise; density means every x∈H is arbitrarily close in norm to a finite linear combination of the ek. For x∈H, define PNx=∑k≤N⟨x,ek⟩Hek, using all basis vectors once N reaches the size of a finite family. Then PNx→x in norm and ∥x∥H2=lim⁡N→∞∑k≤N∣⟨x,ek⟩H∣2.

Facts & Assumptions

Given: The real Hilbert space, orthonormal family, and density hypothesis in the Statement.

[F1]

Pythagoras holds for finite orthogonal sums: if u⊥v, then ∥u+v∥2=∥u∥2+∥v∥2 (Pythagoras and finite orthogonal sums).

Proof

Given: The objects and hypotheses in the Statement.

1.1givenF1algebra

Fix x∈H and N. Orthonormality gives ⟨x−PNx,ej⟩H=0 for each j≤N, so x−PNx is orthogonal to both PNx and every vector in the first-N span. By [F1], ∥x∥H2=∥PNx∥H2+∥x−PNx∥H2,∥PNx∥H2=∑k≤N∣⟨x,ek⟩H∣2. For any y in that span, PNx−y also lies in the span and is orthogonal to x−PNx, hence ∥x−y∥H2=∥x−PNx∥H2+∥PNx−y∥H2≥∥x−PNx∥H2. Thus PNx is a closest vector to x in the first-N span.

2.1givenstep 1.1choosealgebra∎

Let ε>0. By density choose a finite linear combination y of the ek with ∥x−y∥H<ε, and choose N at least as large as every index used in y. Then y lies in the first-N span, so step 1.1 gives ∥x−PNx∥H≤∥x−y∥H<ε. Hence PNx→x; the first identity in step 1.1 then gives the asserted Parseval limit. For a finite family, PNx=x once all its vectors are included.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Independent centered Hilbert-valued elements have zero expected inner product

Statement

Let H be a real Hilbert space with a fixed complete finite or countable orthonormal basis (ek). On a probability space let U,V be independent, strongly measurable and Bochner-integrable H-valued random elements with EBU=EBV=0 and E∥U∥H2,E∥V∥H2<∞. Then E⟨U,V⟩H=0.

Facts & Assumptions

Given: The hypotheses and fixed basis in the Statement.

[F1]

Bochner integrability makes the means in the Statement well-defined, and a bounded linear functional commutes with the Bochner integral; in particular E⟨U,ek⟩H=⟨EBU,ek⟩H=0, and similarly for V (Bochner-integrable function, Bounded linear maps commute with Bochner integration).

[F2]

Measurable scalar functions of independent random elements are independent (Independent random elements, Measurable coordinatewise functions preserve independence).

[F3]

Expectations of integrable products of independent real random variables factor (Expectations factor over finite products of independent random variables).

[F4]

For each vector, the finite orthogonal projections onto the initial basis spans converge in norm to that vector and are contractions (Complete orthonormal bases give norm-convergent projections and Parseval).

[F5]

Cauchy--Schwarz makes ∥U∥H∥V∥H integrable, and dominated convergence passes expectations through the projection limit (Cauchy-Schwarz for random variables, Dominated convergence).

Proof

Given: The independent centered random elements and basis in the Statement.

1.1F1F2F3algebra

For each k, the coordinate variables Uk=⟨U,ek⟩H and Vk=⟨V,ek⟩H are measurable, centered by [F1], and independent by [F2]. Their product is integrable by Cauchy--Schwarz, so [F3] gives E[UkVk]=E[Uk]E[Vk]=0. Every finite sum ⟨PNU,PNV⟩H=∑k≤NUkVk therefore has expectation zero.

2.1F4F5step 1.1algebra∎

By [F4], PNU→U and PNV→V almost surely (indeed for every vector in H); continuity of the inner product gives ⟨PNU,PNV⟩H→⟨U,V⟩H. Since projections are contractions, ∣⟨PNU,PNV⟩H∣≤∥U∥H∥V∥H, and this majorant is integrable by [F5]. Dominated convergence [F5] and step 1.1 now yield E⟨U,V⟩H=0.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Long-run covariance of an L2-m-approximable shift is trace class

Statement

Assume Countable Choice and Dependent Choice. Let H=L2([0,1],dt;R), let (Xt)t∈Z be a centered causal Bernoulli shift as in L2-m-approximable causal Bernoulli shifts, and suppose it is L2-m-approximable. Write σ=(E∥X0∥H2)1/2, let S1(H) be the trace-class Banach space with trace norm ∥⋅∥1 (Trace class operator, Trace class is a two sided Banach operator ideal), write EB for a Bochner integral, and define x⊗y:H→H by (x⊗y)h=⟨h,y⟩Hx. The Bochner series Γ=EB[X0⊗X0]+∑j=1∞(EB[X0⊗Xj]+EB[Xj⊗X0]) converges absolutely in trace norm to a positive self-adjoint trace-class operator. For Sn=∑t=1nXt, the Bochner covariance operators Γn=n−1EB[Sn⊗Sn] satisfy ∥Γn−Γ∥1→0. If ⊠ is the product-kernel class from Real L2 kernels define bounded operators and represent rank-one tensors, then κj=EB[X0⊠Xj],κ~j=EB[Xj⊠X0] are well-defined elements of K=L2([0,1]2,dt×dt;R), and c=κ0+∑j=1∞(κj+κ~j) converges absolutely in K and satisfies Tc=Γ. Equivalently, c is the design's long-run covariance-kernel series interpreted as an L2([0,1]2) equivalence class; no pointwise representatives are fixed.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, and a centered L2-m-approximable causal Bernoulli shift (Xt)t∈Z in H.

[A1]

Countable Choice is used for the Banach-space completeness of S1(H); Dependent Choice is among the assumptions used to construct the countable replacement extension in L2-m-approximable causal Bernoulli shifts. (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Trace class is a two sided Banach operator ideal)

[F1]

The definition supplies E∥X0∥H2<∞, δm=(E∥X0−X0,m∥H2)1/2 with ∑m≥1δm<∞, δ0≤2σ, and ∥Xj−Xj,m∥L2(H)=δm. For j≥1, the innovations used by X0 are disjoint from those used by Xj,j−1; for j=1, X1,0 is the full independent replacement. The original and replacement innovation families together are independent, so grouping their disjoint coordinate sigma-algebras and applying measurable maps makes these two random elements independent; Xj,j−1 has the same centered law as X0. (L2-m-approximable causal Bernoulli shifts, Disjoint groups of an independent sigma-algebra family remain independent, Measurable coordinatewise functions preserve independence)

[F2]

For x,y∈H, x⊗y is trace class with ∥x⊗y∥1=∥x∥H∥y∥H; S1(H) is Banach and ∥T∥≤∥T∥1 (Trace class operator, Nuclear series characterizes trace norm, Trace class is a two sided Banach operator ideal).

[F3]

A strongly measurable Banach-valued function with integrable norm has a Bochner integral, ∥∫U∥≤∫∥U∥, and bounded linear maps commute with that integral (Strongly measurable Banach-valued function, Bochner integrability criterion, Bochner integral norm inequality, Bounded linear maps commute with Bochner integration). Cauchy--Schwarz for real random variables bounds the expectations of products of the two norms (Cauchy-Schwarz for random variables).

[F4]

For independent real random variables, expectations of integrable products factor (Expectations factor over finite products of independent random variables); measurable functions of independent random elements remain independent (Measurable coordinatewise functions preserve independence).

[F5]

Under Countable Choice, K is a real Hilbert space. The product-kernel map x⊠y is continuous bilinear into K, ∥x⊠y∥K=∥x∥H∥y∥H, and its integral operator is x⊗y; moreover ⟨x⊠y,g⊠h⟩K=⟨x,g⟩H⟨y,h⟩H (Real L2 kernels define bounded operators and represent rank-one tensors). Finite complex linear combinations of rectangle kernels are dense in complex product L2; taking real parts shows that their finite real span is dense in K (Product rectangle kernels are dense in product L two).

Proof technique: direct.

Proof

Given: The assumptions in the Statement and Facts & Assumptions.

1.1F1F2F3F5algebra

Put σ=(E∥X0∥H2)1/2. For each j≥0, the map (x,y)↦x⊗y is continuous into S1(H), since [F2] and the triangle inequality give ∥x⊗y−x′⊗y′∥1≤∥x−x′∥H∥y∥H+∥x′∥H∥y−y′∥H. Likewise (x,y)↦x⊠y is continuous into K by [F5]. Strong simple approximants to X0 and Xj therefore make both tensor-valued maps strongly measurable. Their norms have expectations at most (E∥X0∥2)1/2(E∥Xj∥2)1/2=σ2 by Cauchy–Schwarz and stationarity.

1.2F1F2F3F4F5

Fix j≥1 and put Zj=Xj,j−1. For any h,g∈H, the scalar maps x↦⟨x,g⟩H and y↦⟨h,y⟩H are continuous. By [F1] and [F4] their values at X0 and Zj are independent, and the first has mean zero. The bounded linear functional Lh,g(T)=⟨Th,g⟩H on S1(H) commutes with Bochner integration by [F2]–[F3], so Lh,g(EB[X0⊗Zj])=E[⟨h,Zj⟩H⟨X0,g⟩H]=0. For each h, taking g=EB[X0⊗Zj]h shows that this vector has zero squared norm, so EB[X0⊗Zj]=0; reversing the tensor factors gives EB[Zj⊗X0]=0 as well. For the kernel expectation, pair EB[X0⊠Zj] with any product kernel g⊠h. By [F3] and [F5], the scalar pairing is E[⟨X0,g⟩H⟨Zj,h⟩H], which is zero by independence and centering. Such product kernels span a dense subspace of K by [F5], so EB[X0⊠Zj]=0; similarly EB[Zj⊠X0]=0.

2.1A1F1F2F3F5step 1.2

By step 1.2, stationarity, and [F1], for every j≥1, ∥EB[X0⊗Xj]∥1=∥EB[X0⊗(Xj−Zj)]∥1≤E[∥X0∥H∥Xj−Zj∥H]≤σδj−1. The same bound holds for EB[Xj⊗X0]. It also holds for ∥κj∥K and ∥κ~j∥K by [F3] and [F5]. Since δ0≤2σ and ∑m≥1δm<∞, both series of trace-class terms and product-kernel terms are absolutely summable. The Banach property of S1(H) in [F2] and the Hilbert completeness of K in [A1], [F5] give their norm limits.

3.1F1F2step 1.1step 2.1algebra

For n≥1, set Sn=∑t=1nXt and Γn=n−1EB[Sn⊗Sn]. Step 1.1 makes this Bochner expectation well-defined. It is positive and self-adjoint because for every h∈H, ⟨Γnh,h⟩H=n−1E⟨Sn,h⟩H2≥0. Expanding the finite sum and using stationarity gives Γn=EB[X0⊗X0]+∑j=1n−1(1−jn)(EB[X0⊗Xj]+EB[Xj⊗X0]). Absolute summability from step 2.1 implies Γn→Γ in trace norm: for any fixed finite lag cutoff the coefficients tend to 1, and the remaining trace-norm tail is uniformly bounded by the tail of the absolutely convergent series. Since ∥T∥≤∥T∥1, positivity and self-adjointness pass to the limit. Thus Γ is positive self-adjoint and trace class.

4.1F2F3F5step 2.1∎

For f,g∈H, define the bounded linear functional Λf,g(k)=⟨Tkf,g⟩H on K; [F5] gives ∣Λf,g(k)∣≤∥k∥K∥f∥H∥g∥H. For each j≥0, [F5] and [F3] therefore give Λf,g(κj)=E⟨(X0⊗Xj)f,g⟩H=⟨(EB[X0⊗Xj])f,g⟩H, and the same identity holds for the reversed terms. Passing to the absolutely convergent kernel and trace-norm series in step 2.1 yields ⟨Tcf,g⟩H=⟨Γf,g⟩H for every f,g. Hence Tc=Γ, and c is exactly the design's L2 covariance-kernel equivalence class.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Hilbert-valued CLT for L2-m-approximable Bernoulli shifts

Statement

Assume the Axiom of Choice. Let H=L2([0,1],dt;R) and let (Xt)t∈Z be a centered, L2-m-approximable causal Bernoulli shift as defined in L2-m-approximable causal Bernoulli shifts, with Bochner mean EBX0=0. Let Γ be its long-run covariance operator from Long-run covariance of an L2-m-approximable shift is trace class, and let G be a centered H-valued Gaussian random element with covariance Γ, whose existence is given by Positive trace-class covariance defines a Hilbert Gaussian. Then, for Sn=∑t=1nXt, n−1/2Sn ⇒ G in the weak topology of Borel probability measures on H. The covariance kernel is the L2([0,1]2) equivalence class c in the long-run covariance lemma, and its integral operator is Tc=Γ. This is a CLT for the H-valued sample sums; it is not a functional CLT for the time-indexed partial-sum process.

Facts & Assumptions

Given: Assume AC and take the centered shift and notation in the Statement.

[F1]

The definition gives strict stationarity of Xt and, for each fixed m≥1, of Xt,m. The joint process (Xt,Xt,m) is stationary because the original iid coordinates and the mutually independent, independently indexed replacement arrays are invariant in law under a common time shift. It also gives centered replacement differences, δm=∥X0−X0,m∥L2(H), and ∥Xt−Xt,m∥L2(H)=δm (L2-m-approximable causal Bernoulli shifts). For h≥1, X0 is independent of Xh,h−1 because their original innovation indices are disjoint and all replacement arrays are independent of the original family; the measurable maps defining the random elements preserve this independence (Measurable coordinatewise functions preserve independence).

[F2]

The long-run covariance lemma gives Γn=n−1EB[Sn⊗Sn]→Γ in trace norm, where Γ is positive, self-adjoint and trace class (Long-run covariance of an L2-m-approximable shift is trace class). For trace-class operators ∥T∥op≤∥T∥1 (Trace class is a two sided Banach operator ideal).

[F3]

AC supplies a complete finite or countable orthonormal eigenbasis (ek) for the positive compact self-adjoint operator Γ; its eigenvalues λk≥0 sum to tr⁡Γ<∞ (Trace class operator, Spectral theorem for compact self adjoint operators, Orthonormal eigenbasis for a compact self adjoint operator, Trace of a positive operator is the sum of its eigenvalues). The local basis-projection lemma gives norm convergence of PKx to x and Parseval's identity for this basis (Complete orthonormal bases give norm-convergent projections and Parseval).

[F3a] Tonelli permits summing the nonnegative squared Gaussian coordinates before taking expectation (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F9]
[F10]

Independent centered square-integrable random elements in H have zero expected inner product; the local proof uses the complete countable orthonormal basis in [F3] (Independent centered Hilbert-valued elements have zero expected inner product).

[F4]

A centered stationary finite m-dependent sequence of square-integrable vectors in Rd has the CLT with covariance equal to the finite sum of its lag covariances, including singular covariance (Finite-dependent vector central limit theorem).

[F5]

Pointwise characteristic-function convergence to a specified real law implies weak convergence, and convergence of every real linear projection implies vector weak convergence (Characteristic function criterion for weak convergence, Cramer wold device).

[F11]

A centered real normal with variance v≥0 has characteristic function t↦e−t2v/2, including v=0 (Multivariate normal law, including singular covariance, Characteristic function of a normal law).

[F6]

Dominated convergence applies to the squared projection tails when they are bounded by ∥X0∥H2 (Dominated convergence).

[F7]

Markov's inequality bounds the probability that a nonnegative random variable exceeds a positive threshold by its expectation divided by that threshold (Markov's inequality for random variables).

[F8]

For Borel probability laws on a metric space, weak convergence is defined as convergence against bounded continuous tests and is equivalent to convergence of expectations against every bounded uniformly continuous real function (Convergence in distribution of random elements, Portmanteau theorem).

Proof

Given: The assumptions and supplier facts in the Statement and Facts & Assumptions.

1.1F1F9F10givenalgebra

Put σ=∥X0∥L2(H) and Dt,m=Xt−Xt,m for m≥1. Both terms have the same centered law, so Dt,m is centered. For h≥1, Xh,h is independent of D0,m: its original inputs have indices 1,…,h, while D0,m uses original indices at most 0 and its own replacement array; Xh,h uses a distinct independent replacement array. It has the centered law of X0, so [F10] gives E⟨D0,m,Xh,h⟩H=0. Also ∥Xh−Xh,h∥L2(H)=δh. Hence Cauchy--Schwarz gives ∣E⟨D0,m,Xh⟩H∣=∣E⟨D0,m,Xh−Xh,h⟩H∣≤δmδh. If h≥m, the original inputs of Xh,m have indices h−m+1,…,h, all positive, and its replacement array is independent of the coordinates in D0,m; hence it is independent of D0,m and centered. [F10] gives E⟨D0,m,Xh,m⟩H=0. If 1≤h<m, its marginal second moment is σ2, giving ∣E⟨D0,m,Xh,m⟩H∣≤δmσ. Therefore ∣E⟨D0,m,Dh,m⟩H∣≤{δm(δh+σ),1≤h<m,δmδh,h≥m. Stationarity makes the negative-lag inner products equal to the corresponding positive-lag ones. Expanding the squared norm of the normalized sum and bounding each finite-lag weight by one yields, for Un=n−1/2Sn and Un(m)=n−1/2∑t=1nXt,m, sup⁡nE∥Un−Un(m)∥H2≤δm2+2δm∑h≥1δh+2σ(m−1)δm. The m=1 empty middle-lag sum is zero.

2.1A1F2F9step 1.1choosealgebra

Since ∑m≥1δm<∞, lim inf⁡m→∞mδm=0: otherwise δm≥c/m eventually for some c>0, contradicting summability. Recursively choose strictly increasing integers mr with mrδmr<1/r; the least eligible integer at each stage exists by the liminf statement. Thus the right side of step 1.1 tends to zero along m=mr. Write εm for its square root. For each fixed K, the covariance matrices of PKUn are bounded because Cov⁡(Un)=Γn and [F2] bounds tr⁡(PKΓnPK). For any v∈PKH, the scalar variance difference satisfies ∣E⟨Un(m)−EUn(m),v⟩H2−E⟨Un,v⟩H2∣≤∥v∥H2εm(2MK+εm), where MK=sup⁡n(E∥PKUn∥H2)1/2<∞; this follows from ∣a2−b2∣≤∣a−b∣(∣a∣+∣b∣) and [F9].

3.1F2F3F4F5F11step 2.1algebra

For fixed m and K, the coordinate vectors (⟨Xt,m,e1⟩H,…,⟨Xt,m,eK⟩H)t are centered, stationary, m-dependent and square-integrable in RK; they identify PKXt,m isometrically with PKH. By [F4], their normalized sums converge to a centered Gaussian with covariance matrix Σm,K=∑∣j∣≤mCov⁡(PKX0,m,PKXj,m). The finite covariance expansion shows Cov⁡(PKUn(m))=∑∣j∣≤m(1−∣j∣/n)+ Cov⁡(PKX0,m,PKXj,m)→Σm,K; terms with ∣j∣>m vanish by m-dependence, and each of the finitely many coefficients tends to one. Letting n→∞ in step 2.1 and using [F2] gives ∥Σm,K−PKΓPK∥op≤εm(2MK+εm). In particular Σmr,K→PKΓPK. Because these operators are symmetric and finite-dimensional, their operator norm is the supremum of the absolute quadratic form over unit vectors. For each real v∈PKH, [F11] therefore gives convergence of the characteristic functions of the scalar projections of N(0,Σmr,K) to that of N(0,PKΓPK); [F5] and Cramér--Wold give convergence of these finite-dimensional Gaussian laws.

4.1F4F5F11step 1.1step 3.1algebra

For a∈PKH, compare the characteristic functions of ⟨Un,a⟩H and ⟨Un(m),a⟩H. The inequality ∣eix−eiy∣≤∣x−y∣ and step 1.1 bound their difference by ∥a∥Hεm. For each fixed m, [F4] gives the limit law of the second projection; along m=mr, step 3.1 and [F11] make those Gaussian limit laws converge to N(0,⟨Γa,a⟩H). Taking first n→∞ and then r→∞ proves convergence of the characteristic functions of ⟨Un,a⟩H to that normal law. Explicitly, their limsup difference from the target characteristic function is at most ∥a∥Hεm+∣e−⟨Σm,Ka,a⟩H/2−e−⟨Γa,a⟩H/2∣, which tends to zero along m=mr by steps 1.1 and 3.1. Since a ranges over all vectors, for any fixed projection direction b this also gives its characteristic-function convergence at every frequency t by taking a=tb. Thus [F5] and Cramér--Wold give PKUn⇒PKG for every fixed K, since G has covariance Γ.

5.1F1F3F6F9F10step 4.1algebra

Let RK=I−PK and αK=(E∥RKX0∥H2)1/2. Completeness of the eigenbasis and Parseval give RKX0→0 almost surely in H; the bound ∥RKX0∥H2≤∥X0∥H2 and [F6] imply αK→0. For h≥1, X0 is independent of Xh,h−1 by [F1]; bounded linear projection preserves independence and centering, so [F10] gives E⟨RKX0,RKXh,h−1⟩H=0. Hence ∣E⟨RKX0,RKXh⟩H∣=∣E⟨RKX0,RK(Xh−Xh,h−1)⟩H∣≤αKδh−1. Expanding the variance of RKUn and using [F9] now gives sup⁡nE∥RKUn∥H2≤αK2+2αK(δ0+∑m≥1δm)⟶0. Also [F3], [F3a] and the covariance of G give E∥RKG∥H2=∑k>Kλk→0; if the basis is finite, take PK=I once all basis vectors are included.

6.1F7F8step 4.1step 5.1∎

Let ϕ:H→R be bounded and uniformly continuous, with M=sup⁡x∣ϕ(x)∣. For η>0 put ωϕ(η)=sup⁡∥x−y∥≤η∣ϕ(x)−ϕ(y)∣, which tends to zero as η↓0. Markov's inequality [F7] and step 5.1 imply ∣Eϕ(Un)−Eϕ(PKUn)∣≤ωϕ(η)+2Mη−2sup⁡nE∥RKUn∥H2, and the same bound for G and PKG with E∥RKG∥H2. For fixed K, step 4.1 gives Eϕ(PKUn)→Eϕ(PKG). First let K→∞ in these inequalities and then let η↓0. It follows that Eϕ(Un)→Eϕ(G) for every bounded uniformly continuous ϕ. By [F8], Un⇒G in the Borel weak topology of H. The kernel assertion is the conclusion of the long-run covariance lemma; the theorem asserts no time-indexed process convergence.

5 · Examples, counterexamples and false statements

None yet.

Sources