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.
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.
Depends on
- Moving block bootstrap
- Overlapping block-index resampling
- Cauchy-Schwarz for random variables
- Markov's inequality for random variables
- The Axiom of Choice
- Identical distribution and IID families
- Moments, variance, and covariance on a probability space
- Standard normal and normal laws
- Strict and weak stationarity for integer-indexed time series
- Characteristic function of a normal law
- Characteristic functions under affine maps and independent sums
- Gaussian even moments for Brownian increments
- Dominated convergence
- Expectations factor over finite products of independent random variables
- Disjoint groups of an independent sigma-algebra family remain independent
- Monotone convergence for the integral
- Portmanteau theorem
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- Uniqueness of a law from its characteristic function
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
95 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- 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 (standard reference, not scraped)
- A. DasGupta, Asymptotic Theory of Statistics and Probability, Section 29.18, Block Bootstrap Methods, pp. 478-479 (standard reference, not scraped)