Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Moving and tapered block bootstrap for dependent data — Examples

1 · Prerequisites

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 n1/3 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 mδm→0, 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

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A finite moving-block bootstrap calculation

Example

Apply Moving block bootstrap to the scalar data 0,1,2,3 with block length b=2. There are three overlapping blocks, (0,1),(1,2),(2,3), 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.

1.1F1givenalgebra

At the first position of a selected block, the conditional average over starts is (0+1+2)/3=1. At the second position it is (1+2+3)/3=2.

2.1step 1.1givenalgebra∎

The output mean is the average of two first-position values and two second-position values, so its conditional expectation is (1+2)/2=3/2, 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.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Triangular taper weights for a block of length three

Example

Take the triangular window w(u)=max⁡(1−2∣u−12∣,0) and a block length b=3. The midpoint weights are w3=(1/3,1,1/3).

Verification

Given: The window and block length in the Example.

[F1] Tapered block bootstrap: The sampled window weights are wb(r)=w((r−12)/b), with scale ab=b/(∑rwb(r)2)1/2.

[F2] Asymptotic squared-norm normalization of a tapered window: For an admissible window, Wb2/b→∫01w(u)2du>0; the exact finite-b scale is still computed from Wb.

1.1F1givenalgebra

Substitution of r=1,2,3 gives w3=(1/3,1,1/3), so W32=1/9+1+1/9=11/9 and a3=33/11.

2.1F1F2step 1.1algebra∎

The scaled within-block weights are therefore (3/11,33/11,3/11). Their squared sum is 3+27+311=3, equal to b, as required by the normalization ab2Wb2=b.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A block-length sequence in the bootstrap CLT regime

Example

For bn=⌈n1/3⌉, the two block-length conditions in the moving and tapered block bootstrap theorems are satisfied.

Verification

Given: bn=⌈n1/3⌉ and the theorem regime bn→∞, bn/n→0.

[F1] Overlapping block-index resampling: A block length is an integer bn between 1 and n.

1.1F1givenalgebra

Since n1/3≤bn<n1/3+1, bn→∞, and bn is a positive integer. For every integer n≥1, n1/3≤n; since n itself is an integer, taking the least integer above n1/3 gives bn≤n. Thus the block length is admissible at every positive sample size.

2.1givenstep 1.1algebra∎

Dividing the same bounds by n gives 0≤bn/n<n−1/6+n−1/2→0. Thus bn−1+bnn−1/2→0.

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

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 V∞:=lim⁡n→∞Var⁡(n Xˉn) exists and is finite, then the pointwise bootstrap is variance-consistent, meaning Var⁡∗ ⁣(n(Xˉn∗−Xˉn))⟶V∞ in probability. Here Xˉn=n−1∑t=1nXt; under the pointwise bootstrap, conditional on the observations, each Xt∗ independently selects a uniform index from {1,…,n} and takes the corresponding observed value, and Xˉn∗=n−1∑t=1nXt∗; Var⁡∗ is conditional variance given the observations.

Facts & Assumptions

Given: Assume AC. Let (εt)t∈Z be a two-sided iid sequence with law N(0,σ2), σ2>0. For each t, define Xt as the sum ∑j=0∞2−jεt−j when the series converges absolutely, and set Xt=0 otherwise.

[A1]

AC is assumed by the repository's normal-law and characteristic-function uniqueness suppliers (The Axiom of Choice).

[F1]

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.

[F2]

Standard normal and normal laws and Characteristic function of a normal law: N(0,s2) is a centered symmetric normal law with characteristic function t↦e−s2t2/2 and variance s2.

[F3]

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.

[F4]

Uniqueness of a law from its characteristic function: Under AC, two Borel probability laws on R with equal characteristic functions are equal.

[F5]

Gaussian even moments for Brownian increments: If Z∼N(0,v), its even moments are E∣Z∣2m=(2m−1)!!vm; in particular its fourth moment is 3v2 and its sixth moment is finite.

[F6]

Cauchy-Schwarz for random variables: An L2 tail has L1 norm at most its L2 norm.

[F7]

Moments, variance, and covariance on a probability space: Variance and covariance are centered second moments, so finite-sum expansions count pairs at each lag.

[F8]

Moving block bootstrap and Overlapping block-index resampling: When b=1, each selected block contains one observation; its start is independently uniform on {1,…,n}, so the replicate consists of conditionally iid empirical draws.

[F9]

Monotone convergence for the integral: Expectations of increasing nonnegative partial sums converge to the expectation of their pointwise sum.

[F10]

Dominated convergence: Almost-sure convergence of bounded complex random variables passes to their expectations.

[F11]

Disjoint groups of an independent sigma-algebra family remain independent: Disjoint groups of an independent family generate independent sigma-algebras.

[F12]

Expectations factor over finite products of independent random variables: Expectations of integrable products of functions of independent random variables factor.

[F13]

Riesz-Fischer completeness of Lp for 1≤p≤∞: The space L2 is complete, so an L2-Cauchy sequence has an L2 limit.

[F14]

Markov's inequality for random variables: For a nonnegative random variable U and a>0, P(U>a)≤EU/a; applying it to squared errors turns L2 convergence into convergence in probability.

[F15]

Portmanteau theorem: Borel probability laws on a metric space are determined by their integrals against all bounded uniformly continuous real functions.

[F16]

Strict and weak stationarity for integer-indexed time series: A real process indexed by Z is strictly stationary when every finite-dimensional law is unchanged by every common integer shift.

Counterexample

We verify strict stationarity and calculate V∞ for this series. Compare its true sample-mean variance with the conditional variance of the pointwise bootstrap, which is the b=1 case of Moving block bootstrap.

Given: AC, the iid normal innovations, stationary linear filter, and pointwise resampling rule in the Statement and Facts & Assumptions.

1.1F1F2F6F9F10F12F13F14F15F16givenalgebraconstruct

For J≥1 let Xt,J=∑j=0J−12−jεt−j. For K>J, independence, centering and [F12] give E∣Xt,K−Xt,J∣2=σ2∑j=JK−14−j, so the partial sums are L2-Cauchy and have a limit by [F13]. Also [F9] and [F2], [F6] give E∑j≥02−j∣εt−j∣=2E∣ε0∣<∞, so the series converges absolutely almost surely. The L2 limit and the almost-sure series are both probability limits of these partial sums: [F14] applied to squared L2 errors proves the first assertion, and [F10] applied to indicators of tail events proves the second. For each ϵ>0, 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 ϵ/2; letting J→∞ gives zero, so the limits agree almost surely. By [F6], the expectations of the partial sums converge to EX0=0, and continuity of the L2 norm gives v:=EX02=lim⁡JEX0,J2=σ2∑j≥04−j=4σ2/3. 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].

2.1A1F2F3F4F5F10step 1.1algebra

The characteristic function of X0,J is exp⁡{−t2σ2∑j=0J−14−j/2} by [F3] and [F2]. By the a.s. convergence in step 1.1 and [F10], these characteristic functions converge to exp⁡(−t2v/2); [F4] identifies X0∼N(0,v). Thus [F5] gives EX04=3v2.

3.1F1F2F5F7F11F12givenstep 1.1step 2.1algebra

For h≥1, the recursion gives Xh=2−hX0+ηh, where ηh=∑j=0h−12−jεh−j. The variable X0 is measurable with respect to the past innovation sigma-algebra and ηh with respect to the disjoint sigma-algebra generated by ε1,…,εh, so [F11] makes them independent. [F12] gives Eηh=0, Eηh2=v(1−4−h), and E[X02ηh2]=EX02Eηh2. Thus γ(h):=E(X0Xh)=2−hv. Expanding the product of squares, the cross term vanishes because Eηh=0 and independence, and EX04=3v2 by step 2.1; by the covariance definition [F7], Cov⁡(X02,Xh2)=2v24−h=2γ(h)2.

4.1F7F8F12F14step 1.1step 3.1algebra

By [F8], conditional on the observations each of the n draws is uniform on the observed values, so its mean is Xˉn and its variance is n−1∑t=1n(Xt−Xˉn)2. [F12] factors the cross terms in the variance of their mean, giving Var⁡∗ ⁣(n(Xˉn∗−Xˉn))=n−1∑t=1n(Xt−Xˉn)2. Stationarity and step 3.1 give Var⁡(n−1∑tXt2)≤2n(v2+2∑h≥1γ(h)2)→0: the lag-zero covariance is EX04−v2=2v2, and the positive-lag covariances are 2γ(h)2. Also EXˉn2=1n∑∣h∣<n(1−∣h∣/n)γ(∣h∣)→0 because ∑h∈Z∣γ(h)∣<∞. Markov [F14] applied to squared deviations gives n−1∑tXt2→v in probability and Xˉn2→0 in probability. Therefore n−1∑t(Xt−Xˉn)2=n−1∑tXt2−Xˉn2→v in probability.

5.1F7step 1.1step 3.1step 4.1algebra∎

Counting pairs at each lag gives Var⁡(n Xˉn)=∑∣h∣<n(1−∣h∣/n)γ(∣h∣). Absolute summability of γ gives the limit γ(0)+2∑h≥1γ(h)=v(1+2∑h≥12−h)=3v=4σ2, whereas the conditional bootstrap variance tends to v=4σ2/3 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.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Two-series null centering with a final block prefix

Example

Apply moving-mode Null-constrained block bootstrap for independent series in H=R to the series (0,2,4) and (10,12,14,16), with b1=b2=2. Their observed means are 2 and 13, but both bootstrap series have conditional mean YˉP=58/7.

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 ni 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.

1.1F1givenalgebra

Here M=7, YˉP=(6+52)/7=58/7, N1=2, N2=3, and k1=k2=2. The first residual series is (−2,0,2); its candidate blocks are (−2,0) and (0,2), with position averages (−1,1). After subtracting those averages the two candidates are (−1,−1) and (1,1). The second residual series is (−3,−1,1,3); its candidates are (−3,−1),(−1,1),(1,3), also with position averages (−1,1), and become (−2,−2),(0,0),(2,2).

2.1F1F2step 1.1algebra∎

Let V1,V2 be independent uniforms on {−1,1} and W1,W2 independent uniforms on {−2,0,2}, all four independent. The outputs are (58/7+V1,58/7+V1,58/7+V2) and (58/7+W1,58/7+W1,58/7+W2,58/7+W2). The first output retains only the first entry of its final block. Since all four offsets have mean zero, E∗Yˉ1∗=E∗Yˉ2∗=58/7, explicitly realizing [F2] despite the unequal observed means and unequal sample sizes.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

IID functional data in the block bootstrap regime

Example

Assume the Axiom of Choice. In H=L2([0,1]), let e be the constant function 1 and let Xt=εte, where the innovations εt are independent with P(εt=1)=P(εt=−1)=1/2. This IID functional series satisfies the moving and tapered block bootstrap theorems with bn=⌈n1/3⌉ and, in tapered mode, the window w(u)=1[0,1](u).

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 m innovations when forming Xt,m.

[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.

1.1F1givenalgebra

The filter f(s0,s1,…)=s0e is measurable: it is the coordinate projection followed by a map from the finite innovation space to H. We have EXt=0 and E∥Xt∥H2=1. For every m≥1, the retained current innovation gives Xt,m=Xt exactly, so δm=0. Thus both ∑m≥1δm<∞ and mδm→0 hold. Independence and identical laws follow directly because each Xt depends only on its own IID innovation.

2.1F2givenstep 1.1algebra∎

The integer lengths satisfy 1≤⌈n1/3⌉≤n, bn→∞ and bn/n≤n−1/6+n−1/2→0. The window vanishes off [0,1], takes values in [0,1], is positive near 1/2, symmetric, and nondecreasing on [0,1/2]. Every midpoint weight equals one, so Wbn=bn>0 and abn=1. All assumptions of both theorems are therefore met, giving their stated conditional law and covariance limits for this IID example.

Sources