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.
L2-m-approximable causal Bernoulli shifts
Definition
Let be the Borel sigma-algebra of , generated by intervals with rational endpoints; let be Lebesgue measure restricted to , and set , with inner product . We use the quotient-by-null-functions convention for (The space as the quotient by null functions). The measure space is finite and countably generated, so under Countable Choice is separable (If is sigma-finite and is countably generated, then is separable for , The Axiom of Countable Choice (), Separability: the existence of an at most countable dense subset); with the integral pairing is a Hilbert space verifies that this real pairing makes the quotient a Hilbert space.
Let be a probability space and an independent identically distributed family of -valued random elements with law (Random elements and real random variables, Law or distribution of a random element, Independent random elements). A causal Bernoulli shift with innovation law is a process where is measurable from the product sigma-algebra to the Borel sigma-algebra of . This product-measurability formulation is meaningful for a merely measurable innovation space .
On an independent product extension, take replacement innovations , indexed by , , and integers , all with law , mutually independent, and independent of the original innovations. Such a countable family and its product with the original probability space exist under Countable Choice and Dependent Choice (The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, Countably many independent copies of a prescribed law exist, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique). For define and define the full replacement . Each has the same marginal law as ; for fixed the sequence is strictly stationary and -dependent because its original-innovation windows have length and its replacement arrays are independent across .
For every fixed , the joint process is strictly stationary: shifting all indices relabels a family of mutually independent innovations with the same law and commutes with the defining measurable maps. Consequently is stationary and for every .
Write and The process is --approximable when The same marginal law gives . For a Bochner-integrable -valued random element , write ; the moment condition makes and every Bochner integrable (Bochner-integrable function, Bochner integrability criterion).
Here strict stationarity means invariance of every finite-dimensional law under integer shifts. A process is -dependent if, for every , the sigma-algebras generated by and are independent (Independent sigma-algebras and independent events). The stated input windows for are disjoint across these two index ranges, so they satisfy this definition.
Remarks
Every Borel -valued random element here is strongly measurable. Indeed, fix a dense sequence in the separable space . For each , send to the first point among minimizing . Its finitely many tie-broken cells are Borel because the distance functions are continuous, so this is a finite-valued measurable map; its distance from tends to zero since the sequence is dense. Composition with any Borel -valued random element gives the simple approximants in Strongly measurable Banach-valued function. The phrase “Borel measurable” in the design is thus applied to the target ; the innovation domain uses its stated product sigma-algebra.
Depends on
- Countably many independent copies of a prescribed law exist
- Bochner-integrable function
- Coordinate maps, finite-coordinate cylinders, and the cylinder $\sigma$-algebra
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Expectation of a nonnegative or integrable random variable
- Hilbert space
- Independent random elements
- Independent sigma-algebras and independent events
- The space $L^p(\mu)$ as the quotient by null functions
- Law or distribution of a random element
- Random elements and real random variables
- Real and complex inner-product spaces and their induced length
- Separability: the existence of an at most countable dense subset
- Strongly measurable Banach-valued function
- $L^2$ with the integral pairing is a Hilbert space
- Bochner integrability criterion
- If $\mu$ is sigma-finite and $\mathcal{A}$ is countably generated, then $L^p(\mu)$ is separable for $1 \le p < \infty$
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Used by
- A geometrically summable Bernoulli shift Example
- A square-integrable linear shift with nonsummable physical dependence Example
- Finite-dependent functional moving average Example
- IID functional data in the block bootstrap regime Example
- Independent-tail replacement errors are decreasing and summability implies the rate condition Lemma
- Long-run covariance of an L2-m-approximable shift is trace class Lemma
- Weighted overlapping-block moment and covariance limits Lemma
- Hilbert-valued CLT for L2-m-approximable Bernoulli shifts Theorem
- Moving block bootstrap CLT for dependent Hilbert-valued data Theorem
- Tapered block bootstrap CLT for dependent Hilbert-valued data Theorem
Dependency tree · two levels
83 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
- L. Horváth, P. Kokoszka, and R. Reeder, Estimation of the Mean of Functional Time Series and a Two-Sample Problem, JRSS B 75 (2013), §1.1 and equations (1.1)–(1.3), printed pp.104–105 (standard reference, not scraped)
- S. Hörmann and P. Kokoszka, Functional Time Series, in Time Series Analysis: Methods and Applications, Handbook of Statistics 30 (2012), pp.157–186; bibliographic context, DOI 10.1016/B978-0-444-53858-1.00007-7 (standard reference, not scraped)