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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Hilbert-Valued CLT for Functional Time Series
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measure-Preserving Systems and Mixing Criteria
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Resampling schemes and the sampling-unit contract
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Square-Integrable Kernels and Hilbert–Schmidt Compactness
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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 ; 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
Conditional weak convergence in probability
Definition
Let be a separable complete metric space, let be the sigma-algebra generated by the observed data at sample size , and let be a bootstrap random element whose remaining randomness is the resampling randomization. Write for its conditional Borel probability law given . Supply as part of the data a metric on Borel probability measures on such that exactly when 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 , we say that converges conditionally weakly in probability to when
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.
Hadamard differentiability tangentially to a subspace
Definition
Let be normed spaces, let , let , and let be a linear subspace. A map is Hadamard differentiable at , tangentially to if there is a continuous linear map such that, for every sequence with , and every sequence for which ,
The subspace is part of the hypothesis: directions outside are not covered by this definition.
Overlapping block-index resampling
Definition
Input: a finite sequence in a measurable space, with , and an integer block length satisfying . Set and .
Randomization: draw independently and uniformly from .
Output: in order , append the block , then retain the first entries of the concatenation. Thus the final selected block is truncated to its first entries when . Conditional expectation given the input sequence means expectation over the indices alone.
Moving block bootstrap
Definition
Input: observations in a real Hilbert space , and an integer block length with .
Output: a pseudo-series , 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 . The conditional bootstrap sample mean is . Its conditional center is , where 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 to be a complete time-indexed unit record. Each draw selects an ordered group of consecutive records; the output retains every record of each complete block and only the initial records of the final block when . Thus selected length- 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.
Tapered block bootstrap
Definition
Input: observations in a real Hilbert space , an integer , and a window that vanishes off , is positive on a neighbourhood of , satisfies , and is nondecreasing on . Put for , , and . The procedure is admissible only when .
Center and taper: set and . For each start , form the block
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 , concatenate in draw order, and retain the first entries. The conditional bootstrap mean is centered by its own conditional expectation when used to approximate the sampling law of .
The factor 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- 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.
Exact conditional covariance of a moving block bootstrap mean
Statement
Fix a positive integer , observations , and an integer block length with . Put , , and . For , and also when , define
Set . If is the mean produced by Moving block bootstrap, then its conditional covariance operator is
where the term is zero when . Here .
Facts & Assumptions
Given: Fixed -valued observations, block size , and the independent uniform block-start randomization.
Moving block bootstrap: It draws independent uniform block starts, concatenates the corresponding consecutive blocks, and truncates only the last block to produce exactly observations.
Proof
Given: The observations and the bootstrap law in the Statement.
Write , . The sum of the first bootstrap observations is the sum of complete selected block sums and, if , the first entries of one additional selected block. Conditional on the data, these contributions are independent, and the centered covariance of each complete contribution is , while that of the partial contribution is by uniformity of its start.
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 to obtain , and multiplying its covariance by , gives .
Remarks
When , this reduces to . The identity is finite-sample and makes no stationarity or moment assumption on an underlying process.
Exact conditional covariance of a tapered block bootstrap mean
Statement
Fix a positive integer , observations , an integer block length with and , and the taper and scale from Tapered block bootstrap. Set , , , and . For , and also when , define the tapered partial block sum
Set . If is the tapered bootstrap mean, then
with the term zero when .
Facts & Assumptions
Given: Fixed observations, a positive taper norm , and the conditional block-index law in the Definition.
Tapered block bootstrap: Each resampled block consists of the centered observations multiplied positionwise by ; the starts are independent uniform indices, and the final block is truncated if necessary.
Proof
Given: The data and bootstrap randomization in the Statement.
Write , . The sum of the first tapered bootstrap observations is the sum of complete tapered block sums and, if , the first tapered entries of one additional block. Conditional on the data these contributions are independent; their centered covariance operators are and, when present, , because every block start is uniform on the same choices.
Divide the block-sum total by . Independence and centering eliminate all off-diagonal tensor terms, so . Multiplication by proves the identity.
Asymptotic squared-norm normalization of a tapered window
Statement
Let satisfy the taper conditions in Tapered block bootstrap. As the positive integer , is Riemann integrable on , and
Consequently, for all sufficiently large and .
Facts & Assumptions
Given: The bounded, symmetric window , nondecreasing on , and its midpoint weights from Tapered block bootstrap.
Tapered block bootstrap: takes values in , is symmetric around , is nondecreasing on , and is positive on a neighbourhood of ; .
A monotone function on is Riemann integrable: for the uniform partition into parts the upper minus lower sum telescopes to : A bounded monotone function on a compact interval is Riemann integrable. On the uniform partition into parts, its upper-minus-lower Darboux sum is the endpoint variation times the interval length divided by .
For every in a complete ordered field there is a natural with : For every there is an integer with ; since decreases with , this implies .
Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with : A bounded function on a compact interval is Riemann integrable if every admits a partition whose upper-minus-lower sum is less than .
The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below : If a bounded function is Riemann integrable, then for every all tagged Riemann sums on sufficiently fine partitions differ from its integral by less than .
The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation and For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and : The Darboux integral of an integrable function is the supremum of its lower sums and the infimum of its upper sums; in particular each lower sum is at most the integral.
Continuity and derivatives of positive-base real powers: The positive-base real power is continuous on .
Proof
Given: The window and weights in the Statement.
Put . On , is bounded and nondecreasing; symmetry makes it bounded and nonincreasing on . For each , combine the uniform -part partitions of these two half-intervals. By [F2], the Darboux gap on each half is at most , since ; the gap on the combined partition is their sum and is at most . By [F3], choose with for each ; [F4] therefore gives Riemann integrability of on .
Choose so that lies inside the neighbourhood where is positive, and put . Monotonicity on the left half and symmetry imply throughout this central interval, while on . The partition with endpoints therefore has lower sum at least . By [F6], .
Let . The uniform partition into parts with midpoint tags has mesh , and its Riemann sum is exactly . By [F3], [F5] and step 1.1, .
Since , it is positive and bounded away from zero for all sufficiently large . For those , , so [F7] gives .
Null-constrained block bootstrap for independent series
Definition
Input: a fixed integer of observed series in a real Hilbert space , positive integer sample sizes , total size , integer block lengths , and a mode, moving or tapered. For tapered mode also supply an admissible window with positive block norm at each . Put
For each series , let and . For every candidate start and position , define the following arrays. In moving mode set . In tapered mode set , with and as in Tapered block bootstrap. For each and , draw independent uniform starts , using the index law of Overlapping block-index resampling. For each within-block position define
Output: for each , a pseudo-series . In the order , retain the positions , where , and set
Thus a divisible sample uses complete blocks; otherwise only the first 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 . 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.
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 . Consequently, for each ,
so the conditional mean functions of the pseudo-series are equal.
Facts & Assumptions
Given: The fixed observed series, the block lengths and the independent uniform block-index randomization in the Statement.
Null-constrained block bootstrap for independent series: At each series and within-block position , the algorithm subtracts from a uniformly selected , then adds the same pooled mean .
Proof
Given: The data and pseudo-series construction in the Statement.
Fix . Uniformity of gives . Therefore , including positions in a truncated final block.
The bootstrap mean is the average of exactly such pseudo-observations. Linearity of the finite conditional expectation gives for every . The common conditional mean proves the stated null imposition.
Conditional bootstrap delta method for Hadamard differentiable maps
Statement
Let be separable Banach spaces, a closed linear subspace, , and a neighbourhood of . Let decrease to zero, let be data-measurable and tight, and let be bootstrap random elements such that and lie in with probability tending to one. Supply weak-convergence metrics on probability laws on and as in Conditional weak convergence in probability, with measurable distances for the conditional laws below. Assume:
- converges conditionally weakly in probability to the fixed law of , as in Conditional weak convergence in probability;
- is conditionally tight in probability: for each , there is a deterministic compact such that ;
- is Borel and is Borel measurable and Hadamard differentiable at , tangentially to , with continuous linear derivative as in Hadamard differentiability tangentially to a subspace.
Then
converges conditionally weakly in probability to the law of . Define the displayed bootstrap difference to be whenever either argument lies outside ; 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.
Hadamard differentiability tangentially to a subspace: Along every and , the difference quotient converges to , where is continuous and linear.
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.
Portmanteau theorem: Weak convergence of Borel probabilities is equivalent to the closed-set upper bound for every closed set .
Continuous mapping theorem: If and a measurable map is continuous -almost everywhere, then the image laws satisfy .
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.
For every compact , . If this failed, some subsequence would have with the displayed norm bounded below by a positive constant. Compactness gives a further subsequence ; [F1] applied to that subsequence makes the norm tend to zero, a contradiction.
Write for the bootstrap difference with the stated convention, and . Fix . Tightness gives a compact with ; conditional tightness gives compact with . Because is a neighbourhood of , the arguments associated to the bounded compact sets and lie in for all sufficiently large . Step 1.1 on these two compact sets and linearity show uniformly there that . Since is fixed under conditioning, eventually. Thus the limit superior of is at most . Letting proves in probability for every .
Start with any subsequence. The nonnegative scalar 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 . For every closed and , , where is closed. Apply [F3] and let ; continuity from above of the fixed limiting probability gives the closed-set bound for . 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.
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.
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 with , , , , and
with . Conditional on the observations choose independent uniform starts in and set
Then, for the centered Hilbert Gaussian of covariance ,
Trace-norm convergence implies convergence in Hilbert-Schmidt norm as well. The conditional laws are tight in probability: for every there is a deterministic compact such that . The complete blocks satisfy conditional Lindeberg, and the final partial block has . Replacing every by for any common data-dependent leaves and all its conditional covariances unchanged.
Facts & Assumptions
Given: The assumptions and the conditional uniform-start randomization of the Statement. Write for trace norm.
Weighted overlapping-block moment and covariance limits supplies uniform integrability of , in trace norm in probability, , and uniformly for . For any complete orthonormal basis and its projections , putting , it also supplies with .
Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies with positive trace-class covariance . Under AC choose a complete eigenbasis for by Orthonormal eigenbasis for a compact self adjoint operator. Thus . AC is used for these inherited Hilbert-space constructions, not for an additional uncountable randomization.
Second-order characteristic-function expansion gives . A centered normal of variance has characteristic function 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).
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 . Use this metric in Conditional weak convergence in probability. For each 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.
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.
Hilbert-space Cauchy–Schwarz gives (Cauchy–Schwarz: , with equality exactly for dependent pairs).
The Axiom of Choice is assumed as in [F2].
Proof
Given: The stated process, weights, data and independent conditional block starts.
First, for a nuclear representation and an orthogonal projection , its absolutely convergent trace has . For every finite orthonormal set , Minkowski and Bessel give . Infinite nuclear sums follow from their summable tails. Taking the nuclear infimum proves and by [F5]. Subtraction of replaces by , where does not depend on . It changes by exactly the same amount. Thus every centered block is unchanged. Independence of the starts gives . Positivity and the rank-one trace formula give , so . Since , [F1] now gives the asserted trace-norm covariance limit. The conditional squared norm of the centered remainder has expectation and therefore its unconditional expectation tends to zero at rate .
Set , , and . For any vectors and , splitting according as the larger summand exceeds gives . Consequently, for each , the conditional Lindeberg sum of the complete blocks is at most Here , stationarity makes the expected empirical uncentered tail equal to that of , and [F1] supplies uniform integrability and . Hence in probability by [F5].
Take any subsequence. Apply [F4] diagonally to the scalar trace-norm covariance error, , and for positive integers . There is a further subsequence on which all tend to zero almost surely. Fix a data outcome in this probability-one event. For any , let and . Step 1.1 and remainder negligibility give , and the norm Lindeberg bounds imply for every . The Taylor bound in [F3], split at , gives Let and then . Thus and , since . The convergent power-series expansion near zero proves . The remainder's characteristic function tends to one because its conditional mean is zero and [F3], [F6] give , where . Replacing by covers every real frequency. Therefore [F3] gives weak convergence of every finite-dimensional projection of the conditional law to that of , on this fixed outcome; no positive lower bound on any variance was used.
On the same outcome let . For every fixed , conditional centering and [F5] give . If is bounded uniformly continuous, put and . Markov gives The analogous bound for uses . Step 3.1 gives convergence of the projected expectations. Take the limit superior in , then , and finally . 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 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.
To verify tightness explicitly, empirical centering decreases each projected second moment. By [F1] and independence, The same bound without projection is . Enlarge constants to cover any finitely many initial admissible block lengths. Given , choose and increasing integers so that and . The closed set is compact: for any radius choose with smaller than half the radius, and a finite net for the bounded ball in ; this gives a finite net for , and closedness in complete gives compactness. Markov and the union bound yield , and then . This proves the stated conditional tightness, and steps 1.1-4.1 establish all the other assertions.
Conditional K-sample block-bootstrap validity under a joint CLT
Statement
Let be a real separable Hilbert space. Fix an integer . Let , , be independent functional time-series samples, , and suppose . Under the null hypothesis , let be the sample means and let . Apply Null-constrained block bootstrap for independent series to these observations with integer block lengths 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 . Draw the starts conditionally independently across series and blocks, and write for the resulting pseudo-series means.
Assume the original centered mean vector
converges weakly to a joint law , and assume the conditional law of
converges conditionally weakly in probability to that same joint law and is conditionally tight in probability: for every there is a deterministic compact such that . These are explicit joint-limit hypotheses; this theorem does not derive them from the MBB or TBB conditions.
Define the contrast maps
For every continuous into a metric space , the conditional law of converges testwise in probability to the law of : for every bounded continuous , the corresponding conditional expectation tends in probability to . If 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 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.
Null-constrained block bootstrap for independent series: Every pseudo-series has conditional mean equal to the pooled sample mean .
Exact null centering of the K-sample block bootstrap: For each , .
Conditional weak convergence in probability: The conditional law converges in probability in a metric that generates weak convergence.
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.
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 ; the radial-cutoff argument in step 2.1 uses no compact-tightness theorem or additional choice axiom.
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.
Since every pseudo-series has conditional mean by [F1]-[F2], that common location cancels in every contrast. Direct substitution gives and . Thus the two statistics use the same contrast map; under the null the common population mean also cancels from .
Endow the finite products with their Hilbert product norms. The coefficients in converge to those of , hence . For , the function is bounded and continuous, vanishes when , and equals one when . Thus [F5] and the given weak convergence imply The last limit follows from continuity from above since has finite norm. Given , eventually , so . First take the limit superior in and then let . Hence in probability, without a compact-tightness or AC premise. For the conditional discrepancy, every supplied compact is norm bounded, say by . For arbitrary , conditional tightness supplies such a with . Eventually , so . Since is arbitrary, each conditional discrepancy probability tends to zero in probability.
By [F4], . For a closed , the sampling probability of is at most the discrepancy probability from step 2.1 plus , where is the closed -neighbourhood. Apply [F6] and let to obtain . For the conditional version, combine the input weak-metric distance, truncated at one, with the weighted sum . 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 .
Apply [F4] to for the sampling convergence and, on every almost-sure subsequence outcome of step 3.1, for conditional convergence. Every bounded continuous 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 . When the supplied output weak-convergence metric is available on separable complete , 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.
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 , and . There is an -measurable square-integrable conditional mean such that The conditional mean minimizes over all square-integrable -measurable -valued . Consequently for every , and 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.
L2-m-approximable causal Bernoulli shifts supplies the measurable filter, separable complete Hilbert target, independent tail arrays and their matching product laws.
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.
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.
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: , with equality exactly for dependent pairs.
Proof
Fix . Write the innovation input as , with its first coordinates and its remaining tail. Its law is a product by [F2]. The replacement uses , where have the same tail law and are independent of one another and of . To construct the conditional mean without assuming a vector conditional-expectation theorem, take finite-valued measurable approximants to the filter with . They exist explicitly: include zero in a fixed dense sequence in , use the first nearest point among its first points, and let increase. The error is at most and tends pointwise to zero, so [F3] gives convergence; choose the first achieving the indicated bound. For each finite-valued , its tail average 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 .
The last inequality implies , by [F3] and the chosen error bounds. Tonelli [F2] makes the sum of these norms finite almost surely. Completeness of gives a measurable pointwise limit , set to zero on the null complement. Fatou [F3], applied to as , gives in . In particular is square integrable. For finite-valued -measurable , finite sums and the section-integral identity give . Pass to the limit by Cauchy–Schwarz. Approximate any square-integrable -measurable by its finite nearest-point approximants as in step 1.1, and pass to the limit again. Thus for every such , which is the conditional-mean identity and implies This proves the stated minimization, without a regular conditional law on the innovation space.
Conditional product integration for the two copies of the finite-valued gives . Passing to the limits by [F3] and Hilbert-space Cauchy–Schwarz [F4] gives . The two copies have the same second moment by [F1]. Expanding their squared difference therefore yields , the final equality also following from step 2.1 with . The sigma-fields increase with , so every -measurable competitor is an -measurable competitor. The minimum residual squared norm cannot increase; hence .
For , monotonicity gives . If the full nonnegative series is summable, its right-hand tail tends to zero. Since , this implies . 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.
Moving block bootstrap CLT for dependent Hilbert-valued data
Statement
Assume the Axiom of Choice. Let , and let be a centered causal Bernoulli shift that is --approximable under L2-m-approximable causal Bernoulli shifts. Write
By Independent-tail replacement errors are decreasing and summability implies the rate condition, the summability in the stated process definition implies . For each , let be an integer with and . For all sufficiently large , these conditions give ; apply Moving block bootstrap to 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 . Then
and
where is the centered -valued Gaussian with covariance .
Facts & Assumptions
Given: AC, the centered causal shift with summable replacement errors, and , .
L2-m-approximable causal Bernoulli shifts supplies the centered measurable causal representation, second moment, replacement extension and summable errors.
Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies the sampling-law limit and its long-run covariance . This is a sample-sum CLT, not a time-indexed FCLT.
Moving block bootstrap concatenates independent uniformly chosen overlapping blocks and retains exactly observations. Exact conditional covariance of a moving block bootstrap mean gives its exact full-plus-partial-block covariance formula.
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.
Under the independent-tail construction in [F1], summability of the replacement errors implies (Independent-tail replacement errors are decreasing and summability implies the rate condition).
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.
Take for . These weights are bounded by one, have , and for each fixed have . By [F5], the process satisfies the rate needed in [F4], and the given block regime supplies its remaining asymptotic condition.
Write , . Subtracting the conditional mean from the sum of the complete sampled blocks and the sampled length- prefix gives exactly the variable in the conditional-block supplier. The candidate starts for both block sizes are the same starts, as required by [F3]. Hence [F4] gives the asserted conditional law and trace-norm covariance convergence. The Hilbert-Schmidt conclusion follows from ; the covariance in question is exactly by [F3]. The remainder has expected conditional squared norm , so no divisibility condition is used.
Fix the sampling-law Gaussian 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 ; 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.
Tapered block bootstrap CLT for dependent Hilbert-valued data
Statement
Assume the Axiom of Choice. Let , and let be a centered causal Bernoulli shift that is --approximable under L2-m-approximable causal Bernoulli shifts. Write
By Independent-tail replacement errors are decreasing and summability implies the rate condition, the summability in the stated process definition implies . Let the integers with . Let the taper satisfy the support, positivity-near-, symmetry and monotonicity conditions in Tapered block bootstrap. For all sufficiently large , and , the latter by Asymptotic squared-norm normalization of a tapered window. Apply that algorithm to only on this admissible tail; all limits below concern that tail. Write for the resulting bootstrap mean. Let be the long-run covariance operator from Hilbert-valued CLT for L2-m-approximable Bernoulli shifts. Then
and
where 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.
L2-m-approximable causal Bernoulli shifts supplies the measurable causal representation, second moment and summable replacement errors.
Hilbert-valued CLT for L2-m-approximable Bernoulli shifts supplies the sampling-law limit and centered Gaussian of covariance ; it makes no time-indexed FCLT assertion.
Tapered block bootstrap uses midpoint weights on sample-centered observations, independent uniform starts and truncation to exactly observations. Exact conditional covariance of a tapered block bootstrap mean gives the exact conditional full-plus-partial covariance.
Asymptotic squared-norm normalization of a tapered window gives , so is defined and bounded for all sufficiently large .
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.
Under the independent-tail construction in [F1], summability of the replacement errors implies (Independent-tail replacement errors are decreasing and summability implies the rate condition).
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.
Set and extend this finite sequence by zero on all other integer indices. The exact normalization gives , and [F4] bounds its maximum by a constant for sufficiently large . Symmetry and monotonicity of 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 . For every fixed integer , telescoping successive shifts gives . Therefore This verifies every weight hypothesis of [F5], even for discontinuous monotone tapers. By [F6], the process satisfies the replacement-error rate needed by [F5].
For each full or partial weighted block, replacing by subtracts from every candidate block with entries. Its empirical conditional center over the starts subtracts the same vector, so all conditionally centered block sums agree exactly with those formed from . Thus is precisely in [F5], with the full-taper prefix weights on its last entries.
Apply [F5] with the sampling-law Gaussian supplied by [F2]. It gives conditional weak convergence to that same , conditional tightness, and convergence of the exact covariance in trace norm, which implies its stated Hilbert-Schmidt convergence. The final prefix has expected conditional squared norm and is negligible without requiring . Its limiting covariance is the sampling target in [F2], completing both claims.
The paper's Assumption 1 states ; 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
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Section 2.2, Theorem 2.1
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Remark 2.1
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Section 2.2
- A. DasGupta, Asymptotic Theory of Statistics and Probability, Section 29.18, Block Bootstrap Methods, pp. 478-479
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Section 2.3, Assumption 2
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Section 2.3
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Section 3.2
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Theorems 2.1–2.2 and Appendix
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), proof of Theorem 2.1; weighted-block and arbitrary-length extension proved locally
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Sections 3.1-3.3, Theorem 3.1
- Horvath, Kokoszka and Reeder, Estimation of the Mean of Functional Time Series and a Two-Sample Problem, Section 1.1
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Theorem 2.1 and Appendix
- D. Pilavakis, E. Paparoditis, and T. Sapatinas, Moving block and tapered block bootstrap for functional time series with an application to the K-sample mean problem, Bernoulli 25 (2019), Theorem 2.2