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 — Examples
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
- Brownian Motion Construction and Continuity
- 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
- Moving and tapered block bootstrap for dependent data
- 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
- Stationary means and sample autocovariance
- 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
- Weak Laws and Series of Independent Random Variables
2 · Summary
Summary
The examples calculate a conditional moving-block mean for a four-observation sample, work out a triangular taper and its scale, check a standard block-length sequence, include an IID functional-data instance and an exact two-series pooled-null centering calculation, and show that pointwise resampling estimates the marginal AR(1) variance instead of its long-run variance. The AR(1) calculation is a variance counterexample only; it does not claim that variance inconsistency alone settles every possible bootstrap distribution metric.
Under the independent-tail replacement convention, summability of the replacement errors implies , as proved in Independent-tail replacement errors are decreasing and summability implies the rate condition. The formerly requested example separating these two conditions cannot exist; the proved implication replaces that impossible example.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A finite moving-block bootstrap calculation
Example
Apply Moving block bootstrap to the scalar data with block length . There are three overlapping blocks, , and two independent uniform block starts are drawn and concatenated.
Verification
Given: The four data values and block length in the Example.
[F1] Moving block bootstrap: A length-two moving block starts at one of the three positions uniformly; two such starts are sampled independently and the concatenation has length four.
At the first position of a selected block, the conditional average over starts is . At the second position it is .
The output mean is the average of two first-position values and two second-position values, so its conditional expectation is , which equals the observed sample mean. The resampled blocks preserve each adjacent pair inside its chosen block; only the join between blocks can alter adjacency.
Triangular taper weights for a block of length three
Example
Take the triangular window and a block length . The midpoint weights are .
Verification
Given: The window and block length in the Example.
[F1] Tapered block bootstrap: The sampled window weights are , with scale .
[F2] Asymptotic squared-norm normalization of a tapered window: For an admissible window, ; the exact finite- scale is still computed from .
Substitution of gives , so and .
The scaled within-block weights are therefore . Their squared sum is , equal to , as required by the normalization .
A block-length sequence in the bootstrap CLT regime
Example
For , the two block-length conditions in the moving and tapered block bootstrap theorems are satisfied.
Verification
Given: and the theorem regime , .
[F1] Overlapping block-index resampling: A block length is an integer between and .
Since , , and is a positive integer. For every integer , ; since itself is an integer, taking the least integer above gives . Thus the block length is admissible at every positive sample size.
Dividing the same bounds by gives . Thus .
Pointwise resampling misses the long-run variance of an AR(1) mean
Statement refuted
The claim refuted is: for every strictly stationary real time series, if its long-run variance exists and is finite, then the pointwise bootstrap is variance-consistent, meaning in probability. Here ; under the pointwise bootstrap, conditional on the observations, each independently selects a uniform index from and takes the corresponding observed value, and ; is conditional variance given the observations.
Facts & Assumptions
Given: Assume AC. Let be a two-sided iid sequence with law , . For each , define as the sum when the series converges absolutely, and set otherwise.
AC is assumed by the repository's normal-law and characteristic-function uniqueness suppliers (The Axiom of Choice).
Identical distribution and IID families: The innovations have a common law and are mutually independent; shifting a finite index set preserves its joint product law.
Standard normal and normal laws and Characteristic function of a normal law: is a centered symmetric normal law with characteristic function and variance .
Characteristic functions under affine maps and independent sums: The characteristic function of a finite sum of independent real random variables is the product of their characteristic functions.
Uniqueness of a law from its characteristic function: Under AC, two Borel probability laws on with equal characteristic functions are equal.
Gaussian even moments for Brownian increments: If , its even moments are ; in particular its fourth moment is and its sixth moment is finite.
Cauchy-Schwarz for random variables: An tail has norm at most its norm.
Moments, variance, and covariance on a probability space: Variance and covariance are centered second moments, so finite-sum expansions count pairs at each lag.
Moving block bootstrap and Overlapping block-index resampling: When , each selected block contains one observation; its start is independently uniform on , so the replicate consists of conditionally iid empirical draws.
Monotone convergence for the integral: Expectations of increasing nonnegative partial sums converge to the expectation of their pointwise sum.
Dominated convergence: Almost-sure convergence of bounded complex random variables passes to their expectations.
Disjoint groups of an independent sigma-algebra family remain independent: Disjoint groups of an independent family generate independent sigma-algebras.
Expectations factor over finite products of independent random variables: Expectations of integrable products of functions of independent random variables factor.
Riesz-Fischer completeness of for : The space is complete, so an -Cauchy sequence has an limit.
Markov's inequality for random variables: For a nonnegative random variable and , ; applying it to squared errors turns convergence into convergence in probability.
Portmanteau theorem: Borel probability laws on a metric space are determined by their integrals against all bounded uniformly continuous real functions.
Strict and weak stationarity for integer-indexed time series: A real process indexed by is strictly stationary when every finite-dimensional law is unchanged by every common integer shift.
Counterexample
We verify strict stationarity and calculate for this series. Compare its true sample-mean variance with the conditional variance of the pointwise bootstrap, which is the case of Moving block bootstrap.
Given: AC, the iid normal innovations, stationary linear filter, and pointwise resampling rule in the Statement and Facts & Assumptions.
For let . For , independence, centering and [F12] give , so the partial sums are -Cauchy and have a limit by [F13]. Also [F9] and [F2], [F6] give , so the series converges absolutely almost surely. The limit and the almost-sure series are both probability limits of these partial sums: [F14] applied to squared errors proves the first assertion, and [F10] applied to indicators of tail events proves the second. For each , the triangle inequality bounds the probability that the two limits differ by more than by the sum of the two partial-sum error probabilities at threshold ; letting gives zero, so the limits agree almost surely. By [F6], the expectations of the partial sums converge to , and continuity of the norm gives . For any finite set of times, the finite truncation vector has the same law after a common time shift by [F1]; its coordinates converge almost surely to the series vector, so bounded uniformly continuous test expectations pass to the limit by [F10]. [F15] gives equality of the limiting vector laws, proving strict stationarity in the sense of [F16].
The characteristic function of is by [F3] and [F2]. By the a.s. convergence in step 1.1 and [F10], these characteristic functions converge to ; [F4] identifies . Thus [F5] gives .
For , the recursion gives , where . The variable is measurable with respect to the past innovation sigma-algebra and with respect to the disjoint sigma-algebra generated by , so [F11] makes them independent. [F12] gives , , and . Thus . Expanding the product of squares, the cross term vanishes because and independence, and by step 2.1; by the covariance definition [F7], .
By [F8], conditional on the observations each of the draws is uniform on the observed values, so its mean is and its variance is . [F12] factors the cross terms in the variance of their mean, giving . Stationarity and step 3.1 give : the lag-zero covariance is , and the positive-lag covariances are . Also because . Markov [F14] applied to squared deviations gives in probability and in probability. Therefore in probability.
Counting pairs at each lag gives . Absolute summability of gives the limit , whereas the conditional bootstrap variance tends to by step 4.1. The finite, unequal limits refute the universal variance-consistency claim. This calculation makes no broader assertion about every possible distributional metric.
Two-series null centering with a final block prefix
Example
Apply moving-mode Null-constrained block bootstrap for independent series in to the series and , with . Their observed means are and , but both bootstrap series have conditional mean .
Verification
Given: The two fixed series and block lengths in the Example.
[F1] Null-constrained block bootstrap for independent series subtracts the within-series mean, then the candidate average at each within-block position, and adds the pooled mean; it retains exactly observations.
[F2] Exact null centering of the K-sample block bootstrap gives the common conditional mean for every retained observation and hence every series mean.
Here , , , , and . The first residual series is ; its candidate blocks are and , with position averages . After subtracting those averages the two candidates are and . The second residual series is ; its candidates are , also with position averages , and become .
Let be independent uniforms on and independent uniforms on , all four independent. The outputs are and . The first output retains only the first entry of its final block. Since all four offsets have mean zero, , explicitly realizing [F2] despite the unequal observed means and unequal sample sizes.
IID functional data in the block bootstrap regime
Example
Assume the Axiom of Choice. In , let be the constant function and let , where the innovations are independent with . This IID functional series satisfies the moving and tapered block bootstrap theorems with and, in tapered mode, the window .
Verification
Given: AC and the IID signs, constant function, block lengths and window in the Example.
[F1] L2-m-approximable causal Bernoulli shifts retains the most recent innovations when forming .
[F2] Moving block bootstrap CLT for dependent Hilbert-valued data and Tapered block bootstrap CLT for dependent Hilbert-valued data give conditional Gaussian mean limits and Hilbert–Schmidt covariance consistency under their stated process, block and taper conditions, assuming The Axiom of Choice.
The filter is measurable: it is the coordinate projection followed by a map from the finite innovation space to . We have and . For every , the retained current innovation gives exactly, so . Thus both and hold. Independence and identical laws follow directly because each depends only on its own IID innovation.
The integer lengths satisfy , and . The window vanishes off , takes values in , is positive near , symmetric, and nondecreasing on . Every midpoint weight equals one, so and . All assumptions of both theorems are therefore met, giving their stated conditional law and covariance limits for this IID example.
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
- 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), Theorems 2.1 and 2.2