Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

103 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