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.

Moving and tapered block bootstrap for dependent data

1 · Prerequisites

2 · Summary

Summary

This page defines overlapping moving blocks and tapered blocks for Hilbert-valued time series, proves their finite-sample conditional covariance identities, and verifies the taper normalization. It also proves that position-centered block resampling gives every bootstrap series the same pooled conditional mean, and gives a conditional K-sample limit theorem for continuous statistics and Hadamard-differentiable maps. The MBB and TBB sample-mean CLTs are proved with conditional weak convergence and trace-norm covariance limits under the stated block regime and AC assumption inherited from the sampling CLT. The source paper assumes mδm→0; under the stated independent-tail replacement convention, Independent-tail replacement errors are decreasing and summability implies the rate condition derives this rate from summability, so no extra process restriction is imposed. Two shared weighted-block lemmas establish empirical covariance consistency in trace norm, conditional Lindeberg, Hilbert-space tightness and negligibility of the final partial block for arbitrary sample sizes. The covariance conclusions therefore hold in Hilbert-Schmidt norm as well. This page makes no path-process FCLT claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Conditional weak convergence in probability

Definition

Let E be a separable complete metric space, let Dn be the sigma-algebra generated by the observed data at sample size n, and let Zn∗ be a bootstrap random element whose remaining randomness is the resampling randomization. Write L∗(Zn∗) for its conditional Borel probability law given Dn. Supply as part of the data a metric dw on Borel probability measures on E such that dw(μn,μ)→0 exactly when μn⇒μ in the sense of Weak convergence of borel probability measures. Assume the displayed metric distance is a measurable real random variable. For a fixed Borel probability measure μ on E, we say that Zn∗ converges conditionally weakly in probability to μ when

dw ⁣(L∗(Zn∗),μ)⟶0in probability.

The metric is supplied as a hypothesis; this definition makes no metric-existence assertion. It applies to separable complete metric spaces, including separable Banach spaces, their closed linear subspaces and finite products.

Remarks

The conditioning fixes the observations and averages only over bootstrap randomization. A conditional limit in probability is not an assertion of almost-sure conditional convergence.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Hadamard differentiability tangentially to a subspace

Definition

Let E,F be normed spaces, let D⊆E, let θ∈D, and let E0⊆E be a linear subspace. A map Ψ:D→F is Hadamard differentiable at θ, tangentially to E0 if there is a continuous linear map Ψθ′:E0→F such that, for every sequence tm>0 with tm→0, and every sequence hm→h∈E0 for which θ+tmhm∈D,

Ψ(θ+tmhm)−Ψ(θ)tm⟶Ψθ′(h)in F.

The subspace is part of the hypothesis: directions outside E0 are not covered by this definition.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Overlapping block-index resampling

Definition

Input: a finite sequence x1,…,xn in a measurable space, with n≥1, and an integer block length b satisfying 1≤b≤n. Set N=n−b+1 and k=⌈n/b⌉.

Randomization: draw J1,…,Jk independently and uniformly from {1,…,N}.

Output: in order s=1,…,k, append the block xJs,xJs+1,…,xJs+b−1, then retain the first n entries of the concatenation. Thus the final selected block is truncated to its first r=n−b⌊n/b⌋ entries when r>0. Conditional expectation given the input sequence means expectation over the indices Js alone.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Moving block bootstrap

Definition

Input: observations x1,…,xn in a real Hilbert space H, and an integer block length b with 1≤b≤n.

Output: a pseudo-series X1∗,…,Xn∗, generated by Overlapping block-index resampling: within each selected block retain the original order and concatenate blocks in their draw order, truncating only the last block when b∤n. The conditional bootstrap sample mean is Xˉn∗=n−1∑t=1nXt∗. Its conditional center is E∗Xˉn∗, where E∗ averages over the independent uniform block starts while the observations remain fixed.

This algorithm specifies the resampling law only. It does not assert that the conditional law approximates the sampling law for any data-generating process or block-length regime.

Under Sampling units and the resampling-unit contract, take each observation xt to be a complete time-indexed unit record. Each draw selects an ordered group of b consecutive records; the output retains every record of each complete block and only the initial r=n−b⌊n/b⌋ records of the final block when r>0. Thus selected length-b groups are not declared indivisible sampling units. Unit compatibility for a stated target requires that block boundaries and final truncation do not split any bundle declared indivisible by that target's sampling or assignment design. This is the sampling-unit interface, not a bootstrap-validity result.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Tapered block bootstrap

Definition

Input: observations Y1,…,Yn in a real Hilbert space H, an integer 1≤b≤n, and a window w:R→[0,1] that vanishes off [0,1], is positive on a neighbourhood of 1/2, satisfies w(1−u)=w(u), and is nondecreasing on [0,1/2]. Put wb(r)=w((r−12)/b) for 1≤r≤b, Wb=(∑r=1bwb(r)2)1/2, and ab=b/Wb. The procedure is admissible only when Wb>0.

Center and taper: set Yˉn=n−1∑t=1nYt and Rt=Yt−Yˉn. For each start j∈{1,…,n−b+1}, form the block

(abwb(1)Rj,…,abwb(b)Rj+b−1).

Resample: use the independent uniform block starts from Overlapping block-index resampling, multiply each selected centered observation by its within-block taper and the factor ab, concatenate in draw order, and retain the first n entries. The conditional bootstrap mean is centered by its own conditional expectation when used to approximate the sampling law of n Yˉn.

The factor ab compensates for the window's squared-weight sum in the block-sum variance calculation; this definition alone gives no bootstrap validity result.

For a dependent time series, the selected length-b consecutive run is the resampling unit under Sampling units and the resampling-unit contract. The taper changes each unit record's within-block weight but the whole block is selected and resampled together; validity remains a separate theorem.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Exact conditional covariance of a moving block bootstrap mean

Statement

Fix a positive integer n, observations x1,…,xn∈H, and an integer block length b with 1≤b≤n. Put N=n−b+1, k=⌊n/b⌋, and r=n−kb. For q∈{b}, and also q=r when r>0, define

Sj(q)=∑ℓ=1qxj+ℓ−1,Sˉq=N−1∑j=1NSj(q),Cq=N−1∑j=1N(Sj(q)−Sˉq)⊗(Sj(q)−Sˉq).

Set C0=0. If Xˉn∗ is the mean produced by Moving block bootstrap, then its conditional covariance operator is

n Cov⁡∗(Xˉn∗)=kCb+Crn,

where the Cr term is zero when r=0. Here Cov⁡∗(Z)=E∗[(Z−E∗Z)⊗(Z−E∗Z)].

Facts & Assumptions

Given: Fixed H-valued observations, block size b, and the independent uniform block-start randomization.

[F1]

Moving block bootstrap: It draws independent uniform block starts, concatenates the corresponding consecutive blocks, and truncates only the last block to produce exactly n observations.

Proof

Given: The observations and the bootstrap law in the Statement.

1.1F1givenalgebra

Write n=kb+r, 0≤r<b. The sum of the first n bootstrap observations is the sum of k complete selected block sums and, if r>0, the first r entries of one additional selected block. Conditional on the data, these k+1{r>0} contributions are independent, and the centered covariance of each complete contribution is Cb, while that of the partial contribution is Cr by uniformity of its start.

2.1step 1.1algebra∎

The covariance of a sum of independent centered Hilbert-valued random elements is the sum of their covariance operators: expanding the tensor product leaves only diagonal terms, since each off-diagonal expected tensor is the tensor of a zero mean with a zero mean. Dividing the sum by n to obtain Xˉn∗, and multiplying its covariance by n, gives (kCb+Cr)/n.

Remarks

When r=0, this reduces to nCov⁡∗(Xˉn∗)=Cb/b. The identity is finite-sample and makes no stationarity or moment assumption on an underlying process.

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

Exact conditional covariance of a tapered block bootstrap mean

Statement

Fix a positive integer n, observations Y1,…,Yn∈H, an integer block length b with 1≤b≤n and Wb>0, and the taper and scale wb,ab from Tapered block bootstrap. Set Rt=Yt−Yˉn, N=n−b+1, k=⌊n/b⌋, and r=n−kb. For q=b, and also q=r when r>0, define the tapered partial block sum

Tj(q)=ab∑ℓ=1qwb(ℓ)Rj+ℓ−1,Tˉq=N−1∑j=1NTj(q),Vq=N−1∑j=1N(Tj(q)−Tˉq)⊗(Tj(q)−Tˉq).

Set V0=0. If Xˉn∗ is the tapered bootstrap mean, then

n Cov⁡∗(Xˉn∗)=kVb+Vrn,

with the Vr term zero when r=0.

Facts & Assumptions

Given: Fixed observations, a positive taper norm Wb, and the conditional block-index law in the Definition.

[F1]

Tapered block bootstrap: Each resampled block consists of the centered observations multiplied positionwise by abwb(ℓ); the starts are independent uniform indices, and the final block is truncated if necessary.

Proof

Given: The data and bootstrap randomization in the Statement.

1.1F1givenalgebra

Write n=kb+r, 0≤r<b. The sum of the first n tapered bootstrap observations is the sum of k complete tapered block sums and, if r>0, the first r tapered entries of one additional block. Conditional on the data these contributions are independent; their centered covariance operators are Vb and, when present, Vr, because every block start is uniform on the same N choices.

2.1step 1.1algebra∎

Divide the block-sum total by n. Independence and centering eliminate all off-diagonal tensor terms, so Cov⁡∗(Xˉn∗)=n−2(kVb+Vr). Multiplication by n proves the identity.

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

Asymptotic squared-norm normalization of a tapered window

Statement

Let w satisfy the taper conditions in Tapered block bootstrap. As the positive integer b→∞, w2 is Riemann integrable on [0,1], and

1b∑j=1bw ⁣(j−12b)2⟶Iw:=∫01w(u)2 du>0.

Consequently, Wb>0 for all sufficiently large b and ab=b/Wb→Iw−1/2.

Facts & Assumptions

Given: The bounded, symmetric window w, nondecreasing on [0,1/2], and its midpoint weights from Tapered block bootstrap.

[F1]

Tapered block bootstrap: w takes values in [0,1], is symmetric around 1/2, is nondecreasing on [0,1/2], and is positive on a neighbourhood of 1/2; Wb2=∑j=1bw((j−12)/b)2.

[F2]

A monotone function on [a,b] is Riemann integrable: for the uniform partition into N parts the upper minus lower sum telescopes to ∣f(b)−f(a)∣ (b−a)/ι(N): A bounded monotone function on a compact interval is Riemann integrable. On the uniform partition into N parts, its upper-minus-lower Darboux sum is the endpoint variation times the interval length divided by N.

[F3]

For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε: For every ε>0 there is an integer N≥1 with 1/N<ε; since 1/N decreases with N, this implies 1/N→0.

[F4]

Riemann's criterion: a bounded f on [a,b] is Darboux integrable if and only if for every real ε>0 there is a partition P with U(f,P)−L(f,P)<ε: A bounded function on a compact interval is Riemann integrable if every ε>0 admits a partition whose upper-minus-lower sum is less than ε.

[F7]

Continuity and derivatives of positive-base real powers: The positive-base real power x↦x−1/2 is continuous on (0,∞).

Proof

Given: The window and weights in the Statement.

1.1F1F2F3F4givenchoosealgebra

Put g=w2. On [0,1/2], g is bounded and nondecreasing; symmetry makes it bounded and nonincreasing on [1/2,1]. For each N≥1, combine the uniform N-part partitions of these two half-intervals. By [F2], the Darboux gap on each half is at most 1/(2N), since 0≤g≤1; the gap on the combined partition is their sum and is at most 1/N. By [F3], choose N with 1/N<ε for each ε>0; [F4] therefore gives Riemann integrability of g on [0,1].

1.2F1F6givenchoosealgebra

Choose 0<δ<1/2 so that [1/2−δ,1/2+δ] lies inside the neighbourhood where w is positive, and put c=w(1/2−δ)>0. Monotonicity on the left half and symmetry imply g(u)≥c2 throughout this central interval, while g≥0 on [0,1]. The partition with endpoints 0,1/2−δ,1/2+δ,1 therefore has lower sum at least 2δc2. By [F6], Iw≥2δc2>0.

2.1F3F5givenstep 1.1algebra

Let Iw=∫01g(u) du. The uniform partition into b parts with midpoint tags has mesh 1/b→0, and its Riemann sum is exactly Wb2/b. By [F3], [F5] and step 1.1, Wb2/b→Iw.

3.1F7step 2.1step 1.2algebra∎

Since Wb2/b→Iw>0, it is positive and bounded away from zero for all sufficiently large b. For those b, ab=(Wb2/b)−1/2, so [F7] gives ab→Iw−1/2.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Null-constrained block bootstrap for independent series

Definition

Input: a fixed integer K≥2 of observed series Yi,1,…,Yi,ni in a real Hilbert space H, positive integer sample sizes ni, total size M=∑i=1Kni, integer block lengths 1≤bi≤ni, and a mode, moving or tapered. For tapered mode also supply an admissible window with positive block norm at each bi. Put

Yˉi=1ni∑t=1niYi,t,YˉP=1M∑i=1KniYˉi,Ri,t=Yi,t−Yˉi.

For each series i=1,…,K, let Ni=ni−bi+1 and ki=⌈ni/bi⌉. For every candidate start j=1,…,Ni and position r=1,…,bi, define the following arrays. In moving mode set Ai,j,r=Ri,j+r−1. In tapered mode set Ai,j,r=abiwbi(r)Ri,j+r−1, with abi and wbi as in Tapered block bootstrap. For each i=1,…,K and s=1,…,ki, draw independent uniform starts Ji,s∈{1,…,Ni}, using the index law of Overlapping block-index resampling. For each within-block position define

ci,r=1Ni∑j=1NiAi,j,r.

Output: for each i, a pseudo-series Yi,1∗,…,Yi,ni∗. In the order s=1,…,ki, retain the positions r=1,…,qi,s, where qi,s=min⁡{bi,ni−(s−1)bi}, and set

Yi,(s−1)bi+r∗=YˉP+Ai,Ji,s,r−ci,r.

Thus a divisible sample uses ki complete blocks; otherwise only the first ni−bi⌊ni/bi⌋ positions of the final block are retained. This centers each resampled residual position by its own conditional average, then gives every pseudo-series the same pooled location YˉP. All block starts are conditionally independent across blocks and across series.

Remarks

The algorithm is a finite-sample null imposition. Its validity for a statistic requires additional process and block-length hypotheses.

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

Exact null centering of the K-sample block bootstrap

Statement

For fixed data and either mode of Null-constrained block bootstrap for independent series, every pseudo-observation in every series has conditional expectation YˉP. Consequently, for each i,

E∗Yˉi∗=YˉP,

so the conditional mean functions of the K pseudo-series are equal.

Facts & Assumptions

Given: The fixed observed series, the block lengths and the independent uniform block-index randomization in the Statement.

[F1]

Null-constrained block bootstrap for independent series: At each series i and within-block position r, the algorithm subtracts ci,r=Ni−1∑j=1NiAi,j,r from a uniformly selected Ai,Ji,s,r, then adds the same pooled mean YˉP.

Proof

Given: The data and pseudo-series construction in the Statement.

1.1F1givenalgebra

Fix i,s,r. Uniformity of Ji,s gives E∗Ai,Ji,s,r−ci,r=1Ni∑j=1NiAi,j,r−ci,r=0. Therefore E∗Yi,(s−1)bi+r∗=YˉP, including positions in a truncated final block.

2.1step 1.1algebra∎

The bootstrap mean Yˉi∗ is the average of exactly ni such pseudo-observations. Linearity of the finite conditional expectation gives E∗Yˉi∗=YˉP for every i. The common conditional mean proves the stated null imposition.

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

Conditional bootstrap delta method for Hadamard differentiable maps

Statement

Let E,F be separable Banach spaces, E0⊆E a closed linear subspace, θ∈E, and D⊆E a neighbourhood of θ. Let tn>0 decrease to zero, let Zn∈E0 be data-measurable and tight, and let Zn∗∈E0 be bootstrap random elements such that θ+tnZn and θ+tn(Zn+Zn∗) lie in D with probability tending to one. Supply weak-convergence metrics on probability laws on E0 and F as in Conditional weak convergence in probability, with measurable distances for the conditional laws below. Assume:

  1. L∗(Zn∗) converges conditionally weakly in probability to the fixed law of G∈E0, as in Conditional weak convergence in probability;
  2. Zn∗ is conditionally tight in probability: for each ϵ,η>0, there is a deterministic compact K⊂E0 such that lim sup⁡nPr⁡{Pr⁡∗(Zn∗∉K)>ϵ}<η;
  3. D is Borel and Ψ:D→F is Borel measurable and Hadamard differentiable at θ, tangentially to E0, with continuous linear derivative Ψθ′ as in Hadamard differentiability tangentially to a subspace.

Then

L∗ ⁣(tn−1{Ψ(θ+tn(Zn+Zn∗))−Ψ(θ+tnZn)})

converges conditionally weakly in probability to the law of Ψθ′(G). Define the displayed bootstrap difference to be 0∈F whenever either argument lies outside D; the assumed vanishing probability of this event makes this convention asymptotically immaterial.

Facts & Assumptions

Given: The spaces, sequences, conditional convergence, conditional tightness, domain and differentiability assumptions in the Statement.

[F1]

Hadamard differentiability tangentially to a subspace: Along every tm→0 and hm→h∈E0, the difference quotient {Ψ(θ+tmhm)−Ψ(θ)}/tm converges to Ψθ′(h), where Ψθ′ is continuous and linear.

[F2]

Conditional weak convergence in probability: Conditional weak convergence means that a metric generating weak convergence between the conditional bootstrap law and the fixed limiting law tends to zero in probability.

[F3]

Portmanteau theorem: Weak convergence of Borel probabilities is equivalent to the closed-set upper bound lim sup⁡nμn(C)≤μ(C) for every closed set C.

[F4]

Continuous mapping theorem: If μn⇒μ and a measurable map g is continuous μ-almost everywhere, then the image laws satisfy g∗μn⇒g∗μ.

[F5]

Subsequence characterization of convergence in probability: A scalar sequence tends to zero in probability exactly when every subsequence has a further subsequence tending to zero almost surely.

Proof

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

1.1F1givenchoose

For every compact K⊂E0, sup⁡h∈K∥tn−1{Ψ(θ+tnh)−Ψ(θ)}−Ψθ′(h)∥F⟶0. If this failed, some subsequence would have hn∈K with the displayed norm bounded below by a positive constant. Compactness gives a further subsequence hn→h∈K; [F1] applied to that subsequence makes the norm tend to zero, a contradiction.

2.1F1givenstep 1.1algebra

Write Tn∗ for the bootstrap difference with the stated convention, and Rn∗=Tn∗−Ψθ′(Zn∗). Fix δ,ρ,η>0. Tightness gives a compact K0 with lim sup⁡nPr⁡(Zn∉K0)<η; conditional tightness gives compact K1 with lim sup⁡nPr⁡{Pr⁡∗(Zn∗∉K1)>ρ/2}<η. Because D is a neighbourhood of θ, the arguments associated to the bounded compact sets K0 and K0+K1 lie in D for all sufficiently large n. Step 1.1 on these two compact sets and linearity show uniformly there that ∥Rn∗∥<δ. Since Zn is fixed under conditioning, Pr⁡∗(∥Rn∗∥>δ)≤1{Zn∉K0}+Pr⁡∗(Zn∗∉K1) eventually. Thus the limit superior of Pr⁡{Pr⁡∗(∥Rn∗∥>δ)>ρ} is at most 2η. Letting η↓0 proves Pr⁡∗(∥Rn∗∥>δ)→0 in probability for every δ>0.

3.1F2F3F4F5step 2.1∎

Start with any subsequence. The nonnegative scalar min⁡(1,dw(L∗(Zn∗),L(G)))+∑j≥12−jPr⁡∗(∥Rn∗∥>1/j) tends to zero in probability: truncate the sum, use step 2.1 for its finitely many terms, and bound the tail by its geometric sum. By [F5], extract a further subsequence along which this scalar tends to zero almost surely, so the input metric distance and every remainder probability do also. Fix an outcome in their common probability-one event. The continuous mapping theorem [F4] gives weak convergence of the conditional laws of Ψθ′(Zn∗). For every closed C⊂F and δ>0, Pr⁡∗(Tn∗∈C)≤Pr⁡∗(∥Rn∗∥>δ)+Pr⁡∗(Ψθ′(Zn∗)∈Cδ), where Cδ={y:d(y,C)≤δ} is closed. Apply [F3] and let δ↓0; continuity from above of the fixed limiting probability gives the closed-set bound for Tn∗. Thus [F3] gives weak convergence on this outcome, hence convergence to zero of the supplied output weak-metric distance. A final application of [F5] proves convergence of that distance in probability along the full sequence.

Remarks

This theorem is conditional on the bootstrap limit and tightness hypotheses. It does not prove those hypotheses for a particular resampling algorithm.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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.

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

Conditional CLT for independent resampled weighted blocks

Statement

Assume AC and all the process and weight hypotheses of Weighted overlapping-block moment and covariance limits, including squared normalization and convergence of each fixed-lag weight autocorrelation to one. Let b=bn→∞ with b/n→0, N=n−b+1, k=⌊n/b⌋, r=n−kb, and

Bj,q=∑ℓ=1qcb,ℓXj+ℓ−1,Bˉq=N−1∑j=1NBj,q,Cq=N−1∑j=1N(Bj,q−Bˉq)⊗(Bj,q−Bˉq),

with Bj,0=Bˉ0=C0=0. Conditional on the observations choose independent uniform starts J1,…,Jk+1 in {1,…,N} and set

Zn∗=n−1/2{∑s=1k(BJs,b−Bˉb)+(BJk+1,r−Bˉr)}.

Then, for the centered Hilbert Gaussian G of covariance Γ,

L∗(Zn∗)⇒L(G)in probability,∥Cov⁡∗(Zn∗)−Γ∥1⟶0in probability.

Trace-norm convergence implies convergence in Hilbert-Schmidt norm as well. The conditional laws are tight in probability: for every ε,η>0 there is a deterministic compact K⊂H such that lim sup⁡nP{P∗(Zn∗∉K)>ε}<η. The complete blocks satisfy conditional Lindeberg, and the final partial block has EE∗∥n−1/2(BJk+1,r−Bˉr)∥2=O(b/n). Replacing every Xt by Xt−Mn for any common data-dependent Mn∈H leaves Zn∗ and all its conditional covariances unchanged.

Facts & Assumptions

Given: The assumptions and the conditional uniform-start randomization of the Statement. Write ∥⋅∥1 for trace norm.

[F1]

Weighted overlapping-block moment and covariance limits supplies uniform integrability of ∥b−1/2B1,b∥2, Cb/b→Γ in trace norm in probability, E∥Bˉb/b∥2=O(b/N), and E∥B1,q∥2≤Dq uniformly for q≤b. For any complete orthonormal basis and its projections Pd, putting Rd=I−Pd, it also supplies E∥RdB1,q∥2≤qDd with Dd→0.

[F2]

Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies G with positive trace-class covariance Γ. Under AC choose a complete eigenbasis for Γ by Orthonormal eigenbasis for a compact self adjoint operator. Thus E∥RdG∥2=tr⁡(RdΓRd)→0. AC is used for these inherited Hilbert-space constructions, not for an additional uncountable randomization.

[F3]

Second-order characteristic-function expansion gives ∣eiu−1−iu+u2/2∣≤min⁡(∣u∣3/3,4u2). A centered normal of variance v≥0 has characteristic function e−t2v/2 by Characteristic function of a normal law, and the characteristic function of a finite independent sum is the product of the individual characteristic functions (Characteristic functions under affine maps and independent sums). The characteristic-function criterion and Cramer--Wold apply also to degenerate limits (Characteristic function criterion for weak convergence, Cramer wold device).

[F4]

A scalar sequence converges in probability exactly when every subsequence has an almost-surely convergent further subsequence (Subsequence characterization of convergence in probability, An almost-surely convergent subsequence from convergence in probability). Weak convergence on a metric space is equivalent to convergence against all bounded uniformly continuous tests by Portmanteau theorem. Under the assumed AC, Levy prokhorov metric metrizes weak convergence supplies the Levy-Prokhorov metric generating weak convergence on the separable Hilbert space H. Use this metric in Conditional weak convergence in probability. For each n the conditional law is a finite mixture with deterministic probabilities and Borel data-dependent atoms: finite independent starts have only finitely many configurations. The map from its atom tuple to this law is continuous for weak convergence (test each bounded continuous function), hence its metric distance to the fixed law is a Borel data function.

[F5]

Markov's inequality is Markov's inequality for random variables. The trace-class ideal estimate is Trace class is a two sided Banach operator ideal, and Nuclear series characterizes trace norm identifies the trace norm with the infimum of nuclear sums. The Hilbert-Schmidt norm is the basis square-sum in Hilbert–Schmidt operator and Hilbert–Schmidt norm; The finite Bessel inequality and best approximation by a finite orthonormal family bounds finite sums of squared coordinates. These give the operator bounds proved in step 1.1.

[F6]

Hilbert-space Cauchy–Schwarz gives ∣⟨a,x⟩H∣≤∥a∥H∥x∥H (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A1]

The Axiom of Choice is assumed as in [F2].

Proof

Given: The stated process, weights, data and independent conditional block starts.

1.1givenF1F5algebra

First, for a nuclear representation T=∑j⟨⋅,uj⟩vj and an orthogonal projection R, its absolutely convergent trace has ∣tr⁡(RTR)∣≤∑j∥uj∥∥vj∥. For every finite orthonormal set E, Minkowski and Bessel give (∑e∈E∥Te∥2)1/2≤∑j∥vj∥(∑e∈E∣⟨e,uj⟩∣2)1/2≤∑j∥uj∥∥vj∥. Infinite nuclear sums follow from their summable tails. Taking the nuclear infimum proves ∣tr⁡(RTR)∣≤∥T∥1 and ∥T∥HS≤∥T∥1 by [F5]. Subtraction of Mn replaces Bj,q by Bj,q−sqMn, where sq=∑ℓ=1qcb,ℓ does not depend on j. It changes Bˉq by exactly the same amount. Thus every centered block is unchanged. Independence of the starts gives Cov⁡∗(Zn∗)=(kCb+Cr)/n. Positivity and the rank-one trace formula give Etr⁡Cr≤E∥B1,r∥2≤Dr, so E∥Cr/n∥1≤Db/n→0. Since kb/n→1, [F1] now gives the asserted trace-norm covariance limit. The conditional squared norm of the centered remainder has expectation tr⁡(Cr/n) and therefore its unconditional expectation tends to zero at rate O(b/n).

2.1F1F5step 1.1algebra

Set Uj=Bj,b/b, Uˉ=Bˉb/b, and Vj=Uj−Uˉ. For any vectors x,y and a>0, splitting according as the larger summand exceeds a/2 gives ∥x+y∥21{∥x+y∥>a}≤4∥x∥21{∥x∥>a/2}+4∥y∥21{∥y∥>a/2}. Consequently, for each ε>0, the conditional Lindeberg sum of the k complete blocks is at most Ln(ε)=kbnN∑j=1N∥Vj∥21{∥Vj∥>εn/b},ELn(ε)≤4E ⁣[∥U1∥21{∥U1∥>(ε/2)n/b}]+4E∥Uˉ∥2⟶0. Here n/b→∞, stationarity makes the expected empirical uncentered tail equal to that of U1, and [F1] supplies uniform integrability and E∥Uˉ∥2→0. Hence Ln(ε)→0 in probability by [F5].

3.1F2F3F4F6step 1.1step 2.1choosealgebra

Take any subsequence. Apply [F4] diagonally to the scalar trace-norm covariance error, tr⁡(Cr/n), and Ln(1/j) for positive integers j. There is a further subsequence on which all tend to zero almost surely. Fix a data outcome in this probability-one event. For any a∈H, let ξn=⟨a,BJ1,b−Bˉb⟩/n and vn=kE∗ξn2. Step 1.1 and remainder negligibility give vn→⟨Γa,a⟩, and the norm Lindeberg bounds imply kE∗[ξn21{∣ξn∣>ρ}]→0 for every ρ>0. The Taylor bound in [F3], split at ρ, gives k∣E∗eiξn−1+12E∗ξn2∣≤(ρ/3)vn+4kE∗[ξn21{∣ξn∣>ρ}]. Let n→∞ and then ρ↓0. Thus k(E∗eiξn−1)→−⟨Γa,a⟩/2 and k∣E∗eiξn−1∣2→0, since k→∞. The convergent power-series expansion log⁡(1+z)=z+O(∣z∣2) near zero proves (E∗eiξn)k→exp⁡(−⟨Γa,a⟩/2). The remainder's characteristic function tends to one because its conditional mean is zero and [F3], [F6] give ∣E∗ei⟨a,Rn⟩−1∣≤E∗⟨a,Rn⟩2≤∥a∥H2tr⁡(Cr/n)→0, where Rn=n−1/2(BJk+1,r−Bˉr). Replacing a by ta covers every real frequency. Therefore [F3] gives weak convergence of every finite-dimensional projection of the conditional law to that of G, on this fixed outcome; no positive lower bound on any variance was used.

4.1F2F4F5step 1.1step 3.1algebra

On the same outcome let Tn=Cov⁡∗(Zn∗). For every fixed d, conditional centering and [F5] give E∗∥RdZn∗∥2=tr⁡(RdTnRd)→tr⁡(RdΓRd). If ϕ is bounded uniformly continuous, put M=sup⁡∣ϕ∣ and ωϕ(h)=sup⁡∥x−y∥≤h∣ϕ(x)−ϕ(y)∣. Markov gives ∣E∗ϕ(Zn∗)−E∗ϕ(PdZn∗)∣≤ωϕ(h)+2Mh−2tr⁡(RdTnRd). The analogous bound for G uses tr⁡(RdΓRd). Step 3.1 gives convergence of the projected expectations. Take the limit superior in n, then d→∞, and finally h↓0. All such test expectations converge, so [F4] gives weak convergence of the full conditional laws on this outcome. Thus their distance to the law of G in the metric of [F4] tends to zero almost surely on the extracted subsequence. The subsequence characterization proves convergence in probability along the original sequence.

5.1A1F1F5step 1.1step 4.1choosealgebra∎

To verify tightness explicitly, empirical centering decreases each projected second moment. By [F1] and independence, EE∗∥RdZn∗∥2≤kb+rnDd=Dd. The same bound without projection is D. Enlarge constants to cover any finitely many initial admissible block lengths. Given ε,η>0, choose R and increasing integers dj so that D/R2<εη/4 and j2Ddj<εη 2−j−2. The closed set K={x∈H:∥x∥≤R, ∥Rdjx∥≤1/j for every j≥1} is compact: for any radius choose j with 1/j smaller than half the radius, and a finite net for the bounded ball in PdjH; this gives a finite net for K, and closedness in complete H gives compactness. Markov and the union bound yield EP∗(Zn∗∉K)<εη/2, and then P{P∗(Zn∗∉K)>ε}<η/2. This proves the stated conditional tightness, and steps 1.1-4.1 establish all the other assertions.

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

Conditional K-sample block-bootstrap validity under a joint CLT

Statement

Let H be a real separable Hilbert space. Fix an integer K≥2. Let Yi,1,…,Yi,ni∈H, 1≤i≤K, be independent functional time-series samples, M=∑ini→∞, and suppose ni/M→θi∈(0,1). Under the null hypothesis μ1=⋯=μK=μ, let Yˉi be the sample means and let YˉP=M−1∑iniYˉi. Apply Null-constrained block bootstrap for independent series to these observations with integer block lengths 1≤bi≤ni for every sample size used and a specified moving or tapered mode. In tapered mode supply the admissible windows and strictly positive block norms required by Tapered block bootstrap at each bi. Draw the starts conditionally independently across series and blocks, and write Yˉi∗ for the resulting pseudo-series means.

Assume the original centered mean vector

UM=(ni(Yˉi−μ))i=1K

converges weakly to a joint law L(G1,…,GK), and assume the conditional law of

UM∗=(ni(Yˉi∗−YˉP))i=1K

converges conditionally weakly in probability to that same joint law and is conditionally tight in probability: for every ϵ,η>0 there is a deterministic compact C⊂HK such that lim sup⁡MPr⁡{Pr⁡∗(UM∗∉C)>ϵ}<η. These are explicit joint-limit hypotheses; this theorem does not derive them from the MBB or TBB conditions.

Define the contrast maps

LM(z1,…,zK)=(M/ni zi−M/nK zK)i=1K−1,Lθ(z)=(zi/θi−zK/θK)i=1K−1.

For every continuous Ψ:HK−1→S into a metric space S, the conditional law of Ψ(LMUM∗) converges testwise in probability to the law of Ψ(Lθ(G1,…,GK)): for every bounded continuous f:S→R, the corresponding conditional expectation tends in probability to Ef(Ψ(Lθ(G1,…,GK))). If S is separable and complete and a weak-convergence metric with measurable conditional distances is supplied, the conclusion is also conditional weak convergence in probability in the sense of Conditional weak convergence in probability. Under the null, the sampling law of Ψ(LMUM) has the same limit. The maps may be squared norms, integrated linear contrasts, or any other continuous statistic of this scaled contrast.

Facts & Assumptions

Given: The samples, null, sample-size proportions, joint sampling limit and joint conditional bootstrap limit in the Statement.

[F1]

Null-constrained block bootstrap for independent series: Every pseudo-series has conditional mean equal to the pooled sample mean YˉP.

[F2]

Exact null centering of the K-sample block bootstrap: For each i, E∗Yˉi∗=YˉP.

[F3]

Conditional weak convergence in probability: The conditional law converges in probability in a metric that generates weak convergence.

[F4]

Continuous mapping theorem: Weak convergence is preserved by a measurable map whose discontinuity set has limiting probability zero; in particular this applies to continuous maps.

[F5]

Weak convergence of borel probability measures gives convergence of bounded continuous test integrals. Continuity from above when one set has finite measure gives vanishing tails of the finite random norm ∥G∥; the radial-cutoff argument in step 2.1 uses no compact-tightness theorem or additional choice axiom.

[F6]

Subsequence characterization of convergence in probability gives the almost-sure further-subsequence criterion for scalar convergence in probability. Portmanteau theorem gives the closed-set criterion for weak convergence.

Proof

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

1.1F1F2givenalgebra

Since every pseudo-series has conditional mean YˉP by [F1]-[F2], that common location cancels in every contrast. Direct substitution gives LMUM∗=(M(Yˉi∗−YˉK∗))i=1K−1 and LMUM=(M(Yˉi−YˉK))i=1K−1. Thus the two statistics use the same contrast map; under the null the common population mean also cancels from LMUM.

2.1F3F5givenstep 1.1algebra

Endow the finite products with their Hilbert product norms. The coefficients in LM converge to those of Lθ, hence aM=∥LM−Lθ∥op→0. For R>0, the function χR(z)=min⁡{1,max⁡{0,∥z∥−R}} is bounded and continuous, vanishes when ∥z∥≤R, and equals one when ∥z∥≥R+1. Thus [F5] and the given weak convergence imply lim sup⁡MPr⁡(∥UM∥≥R+1)≤EχR(G)≤Pr⁡(∥G∥>R)⟶0(R→∞). The last limit follows from continuity from above since G has finite norm. Given δ>0, eventually aM(R+1)≤δ, so Pr⁡(∥(LM−Lθ)UM∥>δ)≤Pr⁡(∥UM∥>R+1). First take the limit superior in M and then let R→∞. Hence (LM−Lθ)UM→0 in probability, without a compact-tightness or AC premise. For the conditional discrepancy, every supplied compact C⊂HK is norm bounded, say by RC. For arbitrary ϵ,η>0, conditional tightness supplies such a C with lim sup⁡MPr⁡{Pr⁡∗(UM∗∉C)>ϵ}<η. Eventually aMRC≤δ, so Pr⁡∗(∥(LM−Lθ)UM∗∥>δ)≤Pr⁡∗(UM∗∉C). Since η is arbitrary, each conditional discrepancy probability tends to zero in probability.

3.1F3F4F6step 2.1

By [F4], LθUM⇒LθG. For a closed B⊂HK−1, the sampling probability of LMUM∈B is at most the discrepancy probability from step 2.1 plus Pr⁡(LθUM∈Bδ), where Bδ is the closed δ-neighbourhood. Apply [F6] and let δ↓0 to obtain LMUM⇒LθG. For the conditional version, combine the input weak-metric distance, truncated at one, with the weighted sum ∑j≥12−jPr⁡∗(∥(LM−Lθ)UM∗∥>1/j). This scalar tends to zero in probability by truncation of the geometric tail and step 2.1. Every subsequence therefore has a further subsequence on which it tends to zero almost surely by [F6]. On each such outcome, [F4] gives weak convergence of the fixed-map conditional laws, and the same closed-neighbourhood inequality proves weak convergence of the varying-map conditional laws to L(LθG).

4.1F3F4F6step 3.1∎

Apply [F4] to Ψ for the sampling convergence and, on every almost-sure subsequence outcome of step 3.1, for conditional convergence. Every bounded continuous f:S→R then has convergent conditional expectations on those outcomes; [F6] gives their convergence in probability along the whole sequence. This proves the stated testwise conclusion for arbitrary metric S. When the supplied output weak-convergence metric is available on separable complete S, the same outcome-wise weak convergence says its distance to the fixed limiting law tends to zero. Applying [F6] to that measurable scalar distance proves the metric conditional conclusion as well.

Remarks

For a statistic expressed as a differentiable functional of the unscaled mean vector, the conditional delta theorem Conditional bootstrap delta method for Hadamard differentiable maps supplies the required Hadamard-differentiability route. The single-series conditional CLTs and tightness bounds are supplied by Moving block bootstrap CLT for dependent Hilbert-valued data and Tapered block bootstrap CLT for dependent Hilbert-valued data under their respective hypotheses. This theorem retains its explicit joint-limit hypotheses; those hypotheses must be checked for the chosen independent-series and resampling construction.

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

Independent-tail replacement errors are decreasing and summability implies the rate condition

Statement

Use the actual independent-tail replacement construction of L2-m-approximable causal Bernoulli shifts, and put X=X0, Fm=σ(δ0,…,δ−m+1) and δm=(E∥X−X0,m∥H2)1/2. There is an Fm-measurable square-integrable conditional mean gm such that δm2=2E∥X−gm∥H2. The conditional mean minimizes E∥X−Y∥H2 over all square-integrable Fm-measurable H-valued Y. Consequently δm+1≤δm for every m≥1, and ∑m≥1δm<∞⟹mδm⟶0. In particular no process under this replacement definition has summable replacement errors while failing the displayed rate condition.

Facts & Assumptions

Given: The separable real Hilbert space, supplied mutually independent original and replacement innovations, measurable filter, and finite second moment in the Statement.

[F1]

L2-m-approximable causal Bernoulli shifts supplies the measurable filter, separable complete Hilbert target, independent tail arrays and their matching product laws.

[F2]

Independent random elements have product joint law and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product identify the joint law of independent prefix and tail variables with its product and permit nonnegative section integrals.

[F3]

Dominated convergence, Fatou's lemma and Cauchy-Schwarz for random variables give the scalar dominated limits, lower integral bound and square-integrable product estimates below.

[F4]

Finite and countable subadditivity of measures gives the null-union rule. The finite Pythagorean identity follows from the inner-product axioms in [F1], and Hilbert-space Cauchy–Schwarz is Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs.

Proof

1.1F1F2F3F4givenconstruct

Fix m. Write the innovation input as (A,B), with A its first m coordinates and B its remaining tail. Its law is a product by [F2]. The replacement uses (A,B′), where B,B′ have the same tail law and are independent of one another and of A. To construct the conditional mean without assuming a vector conditional-expectation theorem, take finite-valued measurable approximants fj(A,B) to the filter f(A,B) with ∥fj−f∥L2(H)≤2−2j. They exist explicitly: include zero in a fixed dense sequence in H, use the first nearest point among its first N points, and let N increase. The error is at most ∥f∥ and tends pointwise to zero, so [F3] gives L2 convergence; choose the first N achieving the indicated bound. For each finite-valued fj, its tail average gj(A)=∫fj(A,b) νtail(db) is a finite linear combination of measurable section probabilities, hence is measurable by [F2]. Convexity of the squared Hilbert norm for finite averages, extended by simple scalar integration, gives E∥gj−gk∥2≤E∥fj−fk∥2.

2.1F1F2F3F4step 1.1constructalgebra

The last inequality implies ∑jE∥gj+1−gj∥<∞, by [F3] and the chosen error bounds. Tonelli [F2] makes the sum of these norms finite almost surely. Completeness of H gives a measurable pointwise limit gm, set to zero on the null complement. Fatou [F3], applied to ∥gj−gk∥2 as k→∞, gives gj→gm in L2(H). In particular gm is square integrable. For finite-valued Fm-measurable Y, finite sums and the section-integral identity give E⟨fj(A,B),Y⟩=E⟨gj(A),Y⟩. Pass to the limit by Cauchy–Schwarz. Approximate any square-integrable Fm-measurable Y by its finite nearest-point approximants as in step 1.1, and pass to the limit again. Thus E⟨X−gm,Y⟩=0 for every such Y, which is the conditional-mean identity and implies E∥X−Y∥2=E∥X−gm∥2+E∥gm−Y∥2. This proves the stated minimization, without a regular conditional law on the innovation space.

3.1F1F2F3F4step 1.1step 2.1algebra

Conditional product integration for the two copies of the finite-valued fj gives E⟨fj(A,B),fj(A,B′)⟩=E∥gj(A)∥2. Passing to the L2 limits by [F3] and Hilbert-space Cauchy–Schwarz [F4] gives E⟨X,X0,m⟩=E∥gm∥2. The two copies have the same second moment by [F1]. Expanding their squared difference therefore yields δm2=2(E∥X∥2−E∥gm∥2)=2E∥X−gm∥2, the final equality also following from step 2.1 with Y=gm. The sigma-fields increase with m, so every Fm-measurable competitor is an Fm+1-measurable competitor. The minimum residual squared norm cannot increase; hence δm+1≤δm.

4.1step 3.1givenalgebra∎

For m≥2, monotonicity gives ⌊m/2⌋δm≤∑j=⌈m/2⌉mδj. If the full nonnegative series is summable, its right-hand tail tends to zero. Since m/⌊m/2⌋≤3, this implies mδm→0. Thus the rate-separation example requested in the former design cannot exist under the actual independent-tail replacement convention. This is a proved implication, not an absence of a known counterexample.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Moving block bootstrap CLT for dependent Hilbert-valued data

Statement

Assume the Axiom of Choice. Let H=L2([0,1]), and let (Xt)t∈Z be a centered causal Bernoulli shift that is L2-m-approximable under L2-m-approximable causal Bernoulli shifts. Write

δm=(E∥X0−X0,m∥H2)1/2.

By Independent-tail replacement errors are decreasing and summability implies the rate condition, the summability in the stated process definition implies mδm→0. For each n, let bn be an integer with bn→∞ and bn/n→0. For all sufficiently large n, these conditions give 1≤bn≤n; apply Moving block bootstrap to X1,…,Xn on this admissible tail. All limits below concern that tail. Let Γ be the long-run covariance operator from Hilbert-valued CLT for L2-m-approximable Bernoulli shifts, and let Xˉn∗=n−1∑t=1nXt∗. Then

L∗ ⁣(n(Xˉn∗−E∗Xˉn∗))⇒L(G)in probability,

and

∥n Cov⁡∗(Xˉn∗)−Γ∥HS⟶0in probability,

where G is the centered H-valued Gaussian with covariance Γ.

Facts & Assumptions

Given: AC, the centered causal shift with summable replacement errors, and b=bn→∞, b/n→0.

[F1]

L2-m-approximable causal Bernoulli shifts supplies the centered measurable causal representation, second moment, replacement extension and summable errors.

[F2]

Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies the sampling-law limit n−1/2∑t=1nXt⇒G and its long-run covariance Γ. This is a sample-sum CLT, not a time-indexed FCLT.

[F3]

Moving block bootstrap concatenates independent uniformly chosen overlapping blocks and retains exactly n observations. Exact conditional covariance of a moving block bootstrap mean gives its exact full-plus-partial-block covariance formula.

[F4]

Weighted overlapping-block moment and covariance limits proves uniform integrability and empirical block covariance consistency for bounded normalized deterministic weights with fixed-lag autocorrelations tending to one. Conditional CLT for independent resampled weighted blocks proves the conditional CLT, tightness and trace-norm covariance limit for exactly this resampling, including the last partial block.

[F5]

Under the independent-tail construction in [F1], summability of the replacement errors implies mδm→0 (Independent-tail replacement errors are decreasing and summability implies the rate condition).

[A1]

The Axiom of Choice is assumed. Its uses are those of the Hilbert sampling and conditional-block suppliers, including the complete orthonormal basis in the latter; no further choice principle is added here.

Proof

Given: The assumptions and suppliers above.

1.1givenF1F4F5A1algebra

Take cb,ℓ=1 for 1≤ℓ≤b. These weights are bounded by one, have b−1∑ℓcb,ℓ2=1, and for each fixed h≥0 have b−1∑ℓ=1b−hcb,ℓcb,ℓ+h=(1−h/b)+→1. By [F5], the process satisfies the rate needed in [F4], and the given block regime supplies its remaining asymptotic condition.

2.1F3F4step 1.1algebra

Write n=kb+r, 0≤r<b. Subtracting the conditional mean from the sum of the k complete sampled blocks and the sampled length-r prefix gives exactly the variable Zn∗ in the conditional-block supplier. The candidate starts for both block sizes are the same N=n−b+1 starts, as required by [F3]. Hence [F4] gives the asserted conditional law and trace-norm covariance convergence. The Hilbert-Schmidt conclusion follows from ∥T∥HS≤∥T∥1; the covariance in question is exactly nCov⁡∗(Xˉn∗) by [F3]. The remainder has expected conditional squared norm O(b/n), so no divisibility condition is used.

3.1F2F4step 2.1∎

Fix the sampling-law Gaussian G supplied by [F2]. The conditional-block result [F4] applies with this same centered Gaussian, whose covariance is Γ. This proves both stated limits.

The paper's Assumption 1 states mδm→0; the local independent-tail replacement lemma derives this rate from summability under the stated replacement convention, so the local block argument adds no process restriction.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Tapered block bootstrap CLT for dependent Hilbert-valued data

Statement

Assume the Axiom of Choice. Let H=L2([0,1]), and let (Yt)t∈Z be a centered causal Bernoulli shift that is L2-m-approximable under L2-m-approximable causal Bernoulli shifts. Write

δm=(E∥Y0−Y0,m∥H2)1/2.

By Independent-tail replacement errors are decreasing and summability implies the rate condition, the summability in the stated process definition implies mδm→0. Let the integers bn→∞ with bn/n→0. Let the taper satisfy the support, positivity-near-1/2, symmetry and monotonicity conditions in Tapered block bootstrap. For all sufficiently large n, 1≤bn≤n and Wbn>0, the latter by Asymptotic squared-norm normalization of a tapered window. Apply that algorithm to Y1,…,Yn only on this admissible tail; all limits below concern that tail. Write Yˉn∗=n−1∑t=1nYt∗ for the resulting bootstrap mean. Let Γ be the long-run covariance operator from Hilbert-valued CLT for L2-m-approximable Bernoulli shifts. Then

L∗ ⁣(n(Yˉn∗−E∗Yˉn∗))⇒L(G)in probability,

and

∥n Cov⁡∗(Yˉn∗)−Γ∥HS⟶0in probability,

where G is centered Gaussian with covariance Γ.

Facts & Assumptions

Given: AC; the centered causal shift with summable replacement errors; the stated block regime; and the admissible taper.

[F1]

L2-m-approximable causal Bernoulli shifts supplies the measurable causal representation, second moment and summable replacement errors.

[F2]

Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies the sampling-law limit and centered Gaussian G of covariance Γ; it makes no time-indexed FCLT assertion.

[F3]

Tapered block bootstrap uses midpoint weights cb,ℓ=abw((ℓ−1/2)/b) on sample-centered observations, independent uniform starts and truncation to exactly n observations. Exact conditional covariance of a tapered block bootstrap mean gives the exact conditional full-plus-partial covariance.

[F4]

Asymptotic squared-norm normalization of a tapered window gives Wb2/b→Iw>0, so ab=b/Wb is defined and bounded for all sufficiently large b.

[F5]

Weighted overlapping-block moment and covariance limits proves uniform integrability and empirical trace-norm covariance consistency for bounded normalized weights with fixed-lag autocorrelations tending to one. Conditional CLT for independent resampled weighted blocks proves the corresponding conditional law, tightness, trace-norm covariance limit and partial-block bound; subtracting any common sample center leaves its centered blocks unchanged.

[F6]

Under the independent-tail construction in [F1], summability of the replacement errors implies mδm→0 (Independent-tail replacement errors are decreasing and summability implies the rate condition).

[A1]

The Axiom of Choice is assumed. Its uses are inherited from the sampling and conditional-block suppliers, including the latter's complete orthonormal basis; no further choice principle is added.

Proof

Given: The assumptions and suppliers above.

1.1givenF1F3F4F5F6A1algebra

Set cb,ℓ=abw((ℓ−1/2)/b) and extend this finite sequence by zero on all other integer indices. The exact normalization gives b−1∑ℓcb,ℓ2=1, and [F4] bounds its maximum by a constant A for sufficiently large b. Symmetry and monotonicity of w make the sequence nonnegative and unimodal, including the possible equal central pair; hence its discrete total variation, including both exterior zero tails, is at most 2A. For every fixed integer h≥1, telescoping h successive shifts gives ∑ℓ∈Z∣cb,ℓ+h−cb,ℓ∣≤2Ah. Therefore ∣b−1∑ℓ=1b−hcb,ℓcb,ℓ+h−1∣≤Ab∑ℓ∈Z∣cb,ℓ+h−cb,ℓ∣≤2A2hb⟶0. This verifies every weight hypothesis of [F5], even for discontinuous monotone tapers. By [F6], the process satisfies the replacement-error rate needed by [F5].

2.1F3F5step 1.1algebra

For each full or partial weighted block, replacing Yt by Yt−Yˉn subtracts (∑ℓ=1qcb,ℓ)Yˉn from every candidate block with q entries. Its empirical conditional center over the N=n−b+1 starts subtracts the same vector, so all conditionally centered block sums agree exactly with those formed from Yt. Thus n(Yˉn∗−E∗Yˉn∗) is precisely Zn∗ in [F5], with the full-taper prefix weights on its last r=n−b⌊n/b⌋ entries.

3.1F2F3F5step 1.1step 2.1∎

Apply [F5] with the sampling-law Gaussian G supplied by [F2]. It gives conditional weak convergence to that same G, conditional tightness, and convergence of the exact covariance nCov⁡∗(Yˉn∗) in trace norm, which implies its stated Hilbert-Schmidt convergence. The final prefix has expected conditional squared norm O(b/n) and is negligible without requiring b∣n. Its limiting covariance Γ is the sampling target in [F2], completing both claims.

The paper's Assumption 1 states mδm→0; the local independent-tail replacement lemma derives this rate from summability under the stated replacement convention, so the local block argument adds no process restriction.

5 · Examples, counterexamples and false statements

None yet.

Sources