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 be a centered --approximable causal Bernoulli shift in under L2-m-approximable causal Bernoulli shifts, and suppose additionally that . Put , let be its long-run covariance operator, and put
For every integer , let be deterministic real weights, uniformly bounded in absolute value by . Define
Then is uniformly integrable, and for ,
If is any finite-rank orthogonal projection, and , then also
For , set and . Then
Suppose further that , , and the weights satisfy
The centered overlapping-block covariance then satisfies the stronger trace-norm limit
In particular it converges in probability in trace norm. Both the MBB weights and the actual TBB weights satisfy these weight hypotheses for all sufficiently large . For any complete finite or countable orthonormal basis and its initial-coordinate projections , the projection-tail coefficient tends to zero as .
Facts & Assumptions
Given: AC, the centered shift, the replacement errors and their additional rate, and deterministic uniformly bounded weights as in the Statement.
L2-m-approximable causal Bernoulli shifts supplies stationary joint replacement processes, their independent replacement arrays, finite second moments, and centered -dependent processes . 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.
L2-m-approximable causal Bernoulli shifts gives centered jointly stationary differences , with ; 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.
The rank-one tensor satisfies 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.
Cauchy–Schwarz holds in and for square-integrable real random variables (Cauchy–Schwarz: , 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 .
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 . By Asymptotic squared-norm normalization of a tapered window, is defined and bounded for all sufficiently large .
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 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.
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 . No uncountable family of new random elements is selected.
Proof
Given: The assumptions and notation in the Statement and Facts & Assumptions.
For , is independent of : its retained original innovation indices are , and its replacement array is independent of all inputs to . Its mean is zero. The tensor is Bochner integrable by [F1], [F3]–[F4], and the rank-one norm identity. For arbitrary , [F6] gives , hence . Thus by [F3]–[F4]. For every finite real coefficient sequence , expansion and therefore give . This proves the prefix bound. The same argument after applying gives , since and projection preserves independence and centering. It proves the asserted projected prefix bound. Along complete basis projections, by norm convergence and dominated convergence, with dominating squared norm .
Put . For , is independent of , so [F6] and Cauchy–Schwarz bound . If , is independent of , while for , Cauchy–Schwarz bounds by . Consequently the individual lag bounds are for and for . Negative-lag scalar covariances equal their positive counterparts by stationarity. Expanding any bounded-weight block and bounding each by gives , where . The convergence uses precisely the assumed and summability.
Minkowski's inequality in and the finite-coefficient bound in step 1.1 give for each . Hence , as claimed. Minkowski here follows by expanding a finite squared norm and applying Cauchy–Schwarz to each cross term.
Fix . Write and define . This is centered, stationary and -dependent, with . Put . Since , by dominated convergence. The centered residual is -dependent, so its covariances vanish at distances greater than by [F6], and all remaining scalar covariances have absolute value at most . Hence its normalized weighted block has second moment at most . With , step 1.2 and Minkowski give . Choose first and then to make this arbitrarily small.
For independent centered Hilbert elements bounded by , write . 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 ; the empty sum is zero. Partition the summands defining into 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 and using and gives . Thus fourth moments are used only for bounded truncations.
The rank-one identity and Cauchy–Schwarz imply both and . Here use and . The squared truncated blocks are uniformly integrable by step 3.1 and Markov's inequality. For nonnegative , splitting at proves . Apply this with the two squared block norms, then let and . This proves the asserted uniform integrability for .
Fix and set and . For fixed unit vectors , the real variables have second moments at most . When two starts differ by more than , 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 , since . For any fixed finite-rank orthogonal projection of rank , expansion in an orthonormal basis of its range and the rank-one norm bound show . Thus its expectation tends to zero.
Choose complete basis projections and put . For any square-integrable -valued , the operator satisfies : expand its four corners, use the rank-one norm inequality on each off-diagonal corner, and use positivity for the corner. The same inequality holds for an empirical average, using its finite empirical expectation. For the blocks, finite dependence and covariance expansion give by dominated convergence. Also . Applying the corner inequality to and , and then Cauchy–Schwarz to expectations, yields . Send by step 4.2, then . This proves trace-norm concentration locally, without inferring trace-norm convergence from coordinate convergence alone.
Define . By step 4.1, and are each at most . The triangle inequality and step 5.1 therefore give . First send for each fixed , then send . It follows that . This concentration conclusion required only the uniform bound on weights.
Now impose the squared normalization and fixed-lag autocorrelation hypotheses. Extend each weight vector by zero. Cauchy–Schwarz gives . With , stationarity gives . The series is absolutely convergent in trace norm by step 1.1. On each finite set of lags , and the remaining trace-norm tail is uniformly bounded by its summable covariance tail. Thus in trace norm. Step 6.1 gives . The empirically centered covariance equals , whose difference from has expected trace norm by step 2.1. This proves the asserted limit and its probability consequence by Markov's inequality.
MBB has 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 . Telescoping gives , so . 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
- Orthonormal eigenbasis for a compact self adjoint operator
- Moving block bootstrap
- Tapered block bootstrap
- Cauchy-Schwarz for random variables
- Markov's inequality for random variables
- The Axiom of Choice
- L2-m-approximable causal Bernoulli shifts
- Bochner integral norm inequality
- Complete orthonormal bases give norm-convergent projections and Parseval
- Long-run covariance of an L2-m-approximable shift is trace class
- Measurable coordinatewise functions preserve independence
- Nuclear series characterizes trace norm
- Asymptotic squared-norm normalization of a tapered window
- Bounded linear maps commute with Bochner integration
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Dominated convergence
- Expectations factor over finite products of independent random variables
- Fubini's theorem for L^1 functions on a sigma-finite product
- Disjoint groups of an independent sigma-algebra family remain independent
- Independent random elements have product joint law
- Trace class is a two sided Banach operator ideal
- Trace of a positive operator is the sum of its eigenvalues
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.