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

Weighted overlapping-block moment and covariance limits

Statement

Assume the Axiom of Choice. Let (Xt)t∈Z be a centered L2-m-approximable causal Bernoulli shift in H=L2([0,1];R) under L2-m-approximable causal Bernoulli shifts, and suppose additionally that mδm→0. Put σ=∥X0∥L2(H), let Γ be its long-run covariance operator, and put

K=σ2+2σ∑h≥1δh.

For every integer b≥1, let cb,1,…,cb,b be deterministic real weights, uniformly bounded in absolute value by A<∞. Define

Zj,b=b−1/2∑ℓ=1bcb,ℓXj+ℓ−1.

Then {∥Zj,b∥H2:j∈Z,b≥1} is uniformly integrable, and for 0≤q≤b,

E∥∑ℓ=1qcb,ℓXj+ℓ−1∥H2≤A2Kq.

If P is any finite-rank orthogonal projection, R=I−P and αP=∥RX0∥L2(H), then also

E∥∑ℓ=1qcb,ℓRXj+ℓ−1∥H2≤A2q(αP2+2αP∑h≥1δh).

For n≥b, set N=n−b+1 and Zˉn,b=N−1∑j=1NZj,b. Then

E∥Zˉn,b∥H2≤A2Kb/N.

Suppose further that b=bn→∞, bn/n→0, and the weights satisfy

b−1∑ℓ=1bcb,ℓ2=1,qb(h):=b−1∑ℓ=1b−hcb,ℓcb,ℓ+h⟶1for every fixed h≥0.

The centered overlapping-block covariance then satisfies the stronger L1 trace-norm limit

E∥N−1∑j=1N(Zj,b−Zˉn,b)⊗(Zj,b−Zˉn,b)−Γ∥1⟶0.

In particular it converges in probability in trace norm. Both the MBB weights cb,ℓ=1 and the actual TBB weights cb,ℓ=abw((ℓ−12)/b) satisfy these weight hypotheses for all sufficiently large b. For any complete finite or countable orthonormal basis and its initial-coordinate projections Pd, the projection-tail coefficient αPd2+2αPd∑h≥1δh tends to zero as d→∞.

Facts & Assumptions

Given: AC, the centered shift, the replacement errors and their additional rate, and deterministic uniformly bounded weights as in the Statement.

[F1]

L2-m-approximable causal Bernoulli shifts supplies stationary joint replacement processes, their independent replacement arrays, finite second moments, and centered m-dependent processes Xt,m. The long-run covariance is the absolutely trace-norm convergent lag series from Long-run covariance of an L2-m-approximable shift is trace class.

[F2]

L2-m-approximable causal Bernoulli shifts gives centered jointly stationary differences Dt,m=Xt−Xt,m, with ∥Dt,m∥L2(H)=δm; replacement arrays at distinct time indices are independent of one another and of every original innovation. Disjoint coordinate groups generate independent sigma-algebras, and measurable filter maps preserve independence (Disjoint groups of an independent sigma-algebra family remain independent, Measurable coordinatewise functions preserve independence). The individual difference lag bounds are proved locally in step 1.2.

[F3]

The rank-one tensor satisfies ∥x⊗y∥1=∥x∥∥y∥ by Nuclear series characterizes trace norm. Trace class is a Banach operator ideal by Trace class is a two sided Banach operator ideal. For a positive trace-class operator its trace is the sum of its nonnegative diagonal entries, by Trace of a positive operator is the sum of its eigenvalues. Expectations obey the Bochner norm inequality from Bochner integral norm inequality.

[F4]

Cauchy–Schwarz holds in H and for square-integrable real random variables (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Cauchy-Schwarz for random variables); Markov's inequality is Markov's inequality for random variables. Dominated convergence is Dominated convergence, and complete orthonormal basis projections converge in norm by Complete orthonormal bases give norm-convergent projections and Parseval. Under AC a complete basis exists by applying Orthonormal eigenbasis for a compact self adjoint operator to the compact self-adjoint covariance Γ.

[F5]

The weights used by Moving block bootstrap are all one. The weights used by Tapered block bootstrap have the midpoint convention in the Statement, are symmetric and unimodal, and have squared sum b. By Asymptotic squared-norm normalization of a tapered window, ab is defined and bounded for all sufficiently large b.

[F6]

The joint law of finitely many independent random elements is the product of their marginal laws, and Fubini permits integrating an integrable function one coordinate at a time (Independent random elements have product joint law, Fubini's theorem for L^1 functions on a sigma-finite product). Bounded linear functionals commute with Bochner integration, and integrable products of measurable functions of independent random elements factor (Bounded linear maps commute with Bochner integration, Expectations factor over finite products of independent random variables). By [F1], the Hilbert-valued random elements below are strongly measurable; by [F3]–[F4], their rank-one tensors are Bochner integrable. Thus for the independent centered Hilbert-valued pairs below, pairing EB[U⊗V] against arbitrary vectors gives zero and the operator expectation itself is zero. The same product-law/Fubini facts justify integrating out a centered independent vector in the bounded fourth-moment expansion and the finite-dependence covariance expansions.

[A1]

The Axiom of Choice supplies the choice assumptions inherited through [F1]–[F3] and permits choosing a complete countable orthonormal basis of the separable Hilbert space H. No uncountable family of new random elements is selected.

Proof

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

1.1F1F2F3F4F6A1givenalgebra

For h≥1, Xh,h is independent of X0: its retained original innovation indices are 1,…,h, and its replacement array is independent of all inputs to X0. Its mean is zero. The tensor X0⊗Xh,h is Bochner integrable by [F1], [F3]–[F4], and the rank-one norm identity. For arbitrary f,g∈H, [F6] gives ⟨EB[X0⊗Xh,h]f,g⟩=E[⟨f,Xh,h⟩⟨X0,g⟩]=0, hence EB[X0⊗Xh,h]=0. Thus ∥E[X0⊗Xh]∥1≤σδh by [F3]–[F4]. For every finite real coefficient sequence (ut), expansion and 2∣utut+h∣≤ut2+ut+h2 therefore give E∥∑tutXt∥2≤K∑tut2. This proves the prefix bound. The same argument after applying R=I−P gives ∣E⟨RX0,RXh⟩∣≤αPδh, since ∥R∥≤1 and projection preserves independence and centering. It proves the asserted projected prefix bound. Along complete basis projections, αPd→0 by norm convergence and dominated convergence, with dominating squared norm ∥X0∥2.

1.2F1F2F4F6givenalgebra

Put Dt,m=Xt−Xt,m. For h≥1, Xh,h is independent of D0,m, so [F6] and Cauchy–Schwarz bound ∣E⟨D0,m,Xh⟩∣≤δmδh. If h≥m, Xh,m is independent of D0,m, while for 1≤h<m, Cauchy–Schwarz bounds ∣E⟨D0,m,Xh,m⟩∣ by δmσ. Consequently the individual lag bounds are ∣E⟨D0,m,Dh,m⟩∣≤δm(δh+σ) for h<m and ≤δmδh for h≥m. Negative-lag scalar covariances equal their positive counterparts by stationarity. Expanding any bounded-weight block and bounding each ∣cb,ℓcb,ℓ+h∣ by A2 gives sup⁡j,bE∥b−1/2∑ℓ=1bcb,ℓDj+ℓ−1,m∥2≤A2εm2, where εm2=δm2+2δm∑h≥1δh+2σ(m−1)δm→0. The convergence uses precisely the assumed mδm→0 and summability.

2.1F4step 1.1algebra

Minkowski's inequality in L2(H) and the finite-coefficient bound in step 1.1 give ∥N−1∑j=1NXj+ℓ−1∥L2(H)≤K/N for each ℓ. Hence ∥Zˉn,b∥L2(H)≤b−1/2∑ℓ=1b∣cb,ℓ∣K/N≤AKb/N, as claimed. Minkowski here follows by expanding a finite squared norm and applying Cauchy–Schwarz to each cross term.

2.2F1F4F6step 1.2constructalgebra

Fix m. Write Yt=Xt,m and define Vt=Yt1{∥Yt∥≤M}−E[Y01{∥Y0∥≤M}]. This is centered, stationary and m-dependent, with ∥Vt∥≤2M. Put ηm,M=∥Y0−V0∥L2(H). Since EY0=0, ηm,M≤2∥Y01{∥Y0∥>M}∥L2(H)→0 by dominated convergence. The centered residual Y−V is m-dependent, so its covariances vanish at distances greater than m by [F6], and all remaining scalar covariances have absolute value at most ηm,M2. Hence its normalized weighted block has second moment at most A2(2m+1)ηm,M2. With Zj,bV=b−1/2∑ℓ=1bcb,ℓVj+ℓ−1, step 1.2 and Minkowski give sup⁡j,b∥Zj,b−Zj,bV∥L2(H)≤dm,M:=Aεm+A2m+1ηm,M. Choose first m and then M to make this arbitrarily small.

3.1F1F2F4F6step 2.2algebra

For independent centered Hilbert elements U1,…,Uq bounded by L, write ∥∑iUi∥2=∑i∥Ui∥2+2∑i<j⟨Ui,Uj⟩. On squaring, every term containing an index exactly once has expectation zero, by integrating that independent centered element first using [F6]. In particular all mixed terms between the two sums vanish; among products of two inner products only identical pairs survive. Cauchy–Schwarz then gives E∥∑iUi∥4≤∑iE∥Ui∥4+6∑i<jE∥Ui∥2E∥Uj∥2≤3q2L4; the empty sum is zero. Partition the b summands defining bZj,bV into p=m+1 residue classes. Inside each class their input innovation sets are disjoint, hence they are jointly independent by [F2]. Applying the proved bound to the class sizes qs and using ∥∑s=1pus∥4≤p3∑s∥us∥4 and ∑sqs2≤b2 gives sup⁡j,bE∥Zj,bV∥4≤3p3A4(2M)4=:Cm,M. Thus fourth moments are used only for bounded truncations.

4.1F3F4step 1.1step 2.2step 3.1algebra

The rank-one identity and Cauchy–Schwarz imply both sup⁡j,bE∣∥Zj,b∥2−∥Zj,bV∥2∣≤dm,M(2AK+dm,M) and sup⁡j,bE∥Zj,b⊗Zj,b−Zj,bV⊗Zj,bV∥1≤dm,M(2AK+dm,M). Here use ∥Zj,b∥L2≤AK and ∥u⊗u−v⊗v∥1≤∥u−v∥(∥u∥+∥v∥). The squared truncated blocks are uniformly integrable by step 3.1 and Markov's inequality. For nonnegative F,G, splitting at G>L/2 proves E[F1{F>L}]≤2E∣F−G∣+E[G1{G>L/2}]. Apply this with the two squared block norms, then let L→∞ and dm,M→0. This proves the asserted uniform integrability for Z.

4.2F1F2F3F4F6step 3.1givenalgebra

Fix m,M and set QnV=N−1∑j=1NZj,bV⊗Zj,bV and Bn=EQnV. For fixed unit vectors e,f, the real variables ⟨Zj,bV,e⟩⟨Zj,bV,f⟩ have second moments at most Cm,M. When two starts differ by more than b+m, the blocks use disjoint original innovations and disjoint replacement arrays, so these variables are independent by [F2]. Expanding the variance of their empirical mean and factoring the independent cross terms by [F6] therefore gives E∣⟨(QnV−Bn)f,e⟩∣2≤Cm,M(2(b+m)+1)/N→0, since b/n→0. For any fixed finite-rank orthogonal projection P of rank d, expansion in an orthonormal basis of its range and the rank-one norm bound show ∥P(QnV−Bn)P∥1≤∑u,v≤d∣⟨(QnV−Bn)ev,eu⟩∣. Thus its expectation tends to zero.

5.1F3F4F6A1step 2.2step 4.2choosealgebra

Choose complete basis projections Pd and put Rd=I−Pd. For any square-integrable H-valued U, the operator T=E[U⊗U] satisfies ∥T−PTP∥1≤E∥RU∥2+2E∥PU∥2E∥RU∥2: expand its four P,R corners, use the rank-one norm inequality on each off-diagonal corner, and use positivity for the R corner. The same inequality holds for an empirical average, using its finite empirical expectation. For the V blocks, finite dependence and covariance expansion give E∥RdZj,bV∥2≤A2(2m+1)E∥RdV0∥2=:td→0 by dominated convergence. Also sup⁡j,bE∥Zj,bV∥2≤(AK+dm,M)2=:C. Applying the corner inequality to QnV and Bn, and then Cauchy–Schwarz to expectations, yields E∥QnV−Bn∥1≤E∥Pd(QnV−Bn)Pd∥1+2td+4Ctd. Send n→∞ by step 4.2, then d→∞. This proves trace-norm concentration locally, without inferring trace-norm convergence from coordinate convergence alone.

6.1F3step 2.2step 4.1step 5.1algebra

Define Qn=N−1∑j=1NZj,b⊗Zj,b. By step 4.1, E∥Qn−QnV∥1 and ∥EQn−Bn∥1 are each at most dm,M(2AK+dm,M). The triangle inequality and step 5.1 therefore give lim sup⁡nE∥Qn−EQn∥1≤2dm,M(2AK+dm,M). First send M→∞ for each fixed m, then send m→∞. It follows that E∥Qn−EQn∥1→0. This concentration conclusion required only the uniform bound on weights.

7.1F1F3F4step 1.1step 2.1step 6.1givenalgebra

Now impose the squared normalization and fixed-lag autocorrelation hypotheses. Extend each weight vector by zero. Cauchy–Schwarz gives ∣qb(h)∣≤1. With Ch=E[X0⊗Xh], stationarity gives EQn=C0+∑h=1b−1qb(h)(Ch+Ch∗). The series is absolutely convergent in trace norm by step 1.1. On each finite set of lags qb(h)→1, and the remaining trace-norm tail is uniformly bounded by its summable covariance tail. Thus EQn→Γ in trace norm. Step 6.1 gives E∥Qn−Γ∥1→0. The empirically centered covariance equals Qn−Zˉn,b⊗Zˉn,b, whose difference from Qn has expected trace norm E∥Zˉn,b∥2≤A2Kb/N→0 by step 2.1. This proves the asserted L1 limit and its probability consequence by Markov's inequality.

8.1F5step 1.1step 4.1step 7.1algebra∎

MBB has qb(h)=(1−h/b)+ and squared normalization exactly. For TBB the squared normalization is also exact and the coefficients are bounded eventually by [F5]. Extend its nonnegative unimodal coefficients by zero to all integers; the total variation is at most 2A. Telescoping gives ∑ℓ∈Z∣cb,ℓ+h−cb,ℓ∣≤2Ah, so ∣qb(h)−qb(0)∣≤2A2h/b→0. This uses exactly the midpoint coefficients of the algorithm and requires no continuity of the taper. All proved limits and uniform-integrability conclusions apply after any finite initial set of block sizes is discarded. The moment and projection conclusions, covariance limit, and claimed specializations are now established.

Depends on

Used by

Dependency tree · two levels

122 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