Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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