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.
Hilbert-Valued CLT for Functional Time Series — 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
- 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
- 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
- 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
- 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
2 · Summary
The examples compute the physical-dependence errors and long-run covariance for a finite moving average and a geometrically weighted Rademacher shift. A square-integrable linear filter shows that the theorem's summability condition is substantive, while a deterministic path sequence separates convergence of terminal values from weak convergence of path laws.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A square-integrable linear shift with nonsummable physical dependence
Statement
Assume Countable Choice and Dependent Choice, and let be iid Rademacher variables (), and let in , so . Let be the least such that For , recursively choose as the least integer greater than such that Define a causal Borel filter by when this subsequence converges, and define otherwise. Then is centered and has finite second moment, but its physical-dependence coefficients satisfy Consequently : the sufficient summability hypothesis in L2-m-approximable causal Bernoulli shifts does not apply to this shift. The example makes no claim that nonsummability alone precludes every possible central limit theorem.
Facts & Assumptions
Given: Countably many iid Rademacher innovations, the real Hilbert space , and the replacement convention in L2-m-approximable causal Bernoulli shifts.
The countable product carrying iid Rademacher variables exists under Countable Choice and Dependent Choice (Countably many independent copies of a prescribed law exist, The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
The scalar quotient is complete and its norm is induced by the integral inner product (The space as the quotient by null functions, with the integral pairing is a Hilbert space).
Chebyshev's inequality bounds the probability of a deviation by its variance divided by the squared threshold, and the first Borel--Cantelli lemma makes events with summable probabilities occur only finitely often (Chebyshev's inequality for random variables, First Borel-Cantelli lemma for events).
The stated two-point Rademacher law gives and by the expectation definition. Independence is the independence of the generated sigma-algebras (Independent random elements); expectations of products of integrable functions of distinct independent coordinates factor (Expectation of a nonnegative or integrable random variable, Expectations factor over finite products of independent random variables).
Cauchy--Schwarz on a probability space gives ; thus convergence implies convergence of means and of norms (Cauchy-Schwarz for random variables).
Since is decreasing, , so . Since is decreasing, , so .
Proof
Given: The probability space and iid Rademacher innovations in the Statement, together with the independent replacement extension from L2-m-approximable causal Bernoulli shifts.
By [F6], the coefficient series converges and its tails tend to zero. Hence the set defining is nonempty, so its least element exists. For , once is chosen, the tail tends to zero, so some integer satisfies the required bound ; thus the least such exists. For a deterministic sign sequence , put . Each is product-measurable. The set on which is Cauchy is Borel, because the Cauchy condition is a countable combination of inequalities between these measurable real functions. On that set their limit is measurable, and extending it by zero on the complement is product-measurable. Thus is a total Borel map into the one-dimensional subspace .
On the given probability space carrying the iid innovations, the partial sums are Cauchy in , since for independence, centering and [F4] give By [F2] they converge in to a random variable . Each has mean zero and squared norm ; [F5] therefore gives and by [F6]. Choose increasing with . Taking in the finite tail-variance identity gives . Thus [F3] gives These probabilities are summable, so [F3] implies almost surely. Hence the defining subsequence filter equals almost surely. In particular is centered and The same argument applies to every shifted iid input sequence.
For fixed , the mixed sequence used by is itself iid Rademacher, so its filter is the corresponding limit. Subtracting its partial sums from those for cancels the terms and leaves The summands are independent, centered, and have variance by [F4]; finite-tail variance computation followed by convergence therefore gives .
Since is decreasing on , Thus , and the decreasing-function integral comparison gives by [F6]. The moment condition holds by step 2.1, but the required dependence-coefficient summability fails.
Finite-dependent functional moving average
Statement
Let be iid Rademacher variables and let in . The centered process is a finite-dependent causal shift. Its physical-dependence coefficients satisfy and for , while its long-run covariance is . Under AC, the theorem Hilbert-valued CLT for L2-m-approximable Bernoulli shifts gives where is centered Gaussian in with covariance .
Facts & Assumptions
Given: AC and countably many iid Rademacher innovations.
AC supplies Countable Choice and the countable independent family used here (The Axiom of Choice, Countably many independent copies of a prescribed law exist).
The causal-shift definition specifies by retaining the last original innovations and independently replacing the earlier tail; the physical-dependence coefficient is the norm of the difference (L2-m-approximable causal Bernoulli shifts).
The stated two-point Rademacher law gives mean zero and variance one; independence of random elements means independence of their generated sigma-algebras, and expectations of independent integrable real products factor (Expectation of a nonnegative or integrable random variable, Independent random elements, Expectations factor over finite products of independent random variables).
Under AC, a centered -approximable causal shift has the Hilbert valued CLT with its long-run covariance operator (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).
Independence of random elements is independence of their generated sigma-algebras, and disjoint groups of an independent sigma-algebra family generate independent sigma-algebras (Independent random elements, Independent sigma-algebras and independent events, Disjoint groups of an independent sigma-algebra family remain independent).
Proof
Given: The innovations and the process in the Statement.
The vector has norm one, so has mean zero and by [F2]. For , the replacement changes only in , so and [F2] gives . For , both innovations on which depends are retained, so and . Hence .
The lag-zero covariance is . At lag one, the only nonzero product in is , so . Reversing the factors gives the same operator. At every lag the innovation sets are disjoint, so independence and centering make the covariance zero. Therefore the long-run covariance sum is .
Fix a cut . The variables are independent by the iid assumption, so their generated sigma-algebras form an independent family by Independent random elements and Independent sigma-algebras and independent events. Each is measurable with respect to . Thus , while . By [F4] the two source sigma-algebras are independent; their sub-sigma-algebras generated by the process groups inherit independence. The process is therefore -dependent under the definition in L2-m-approximable causal Bernoulli shifts.
The moment, centering and summability conditions were verified in step 1.1, and step 1.2 gives the covariance required by [F3]. Applying [F3] proves the asserted sample-sum convergence; the Gaussian limit is allowed to have finite rank, as it does here. This conclusion concerns the -valued sample sums.
A geometrically summable Bernoulli shift
Statement
Let be iid Rademacher variables, put in , and define The series converges absolutely for every sign sequence. Its physical dependence coefficients are so they are summable. Its long-run covariance is , and under AC the Hilbert-valued CLT gives a centered Gaussian limit with that covariance.
Facts & Assumptions
Given: AC and countably many iid Rademacher innovations.
AC supplies Countable Choice and the countable independent family used here (The Axiom of Choice, Countably many independent copies of a prescribed law exist).
For fixed , the replacement keeps coefficients and uses independent copies for all ; is the resulting error (L2-m-approximable causal Bernoulli shifts).
The stated two-point Rademacher law gives mean zero and variance one; independence means independence of the generated sigma-algebras, and expectations of independent integrable products factor (Expectation of a nonnegative or integrable random variable, Independent random elements, Expectations factor over finite products of independent random variables). Dominated convergence passes expectations through uniformly bounded partial sums (Dominated convergence).
Under AC, a centered -approximable causal shift has the Hilbert valued CLT with its long-run covariance operator (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).
Proof
Given: The innovations and process in the Statement.
For every input sequence with , , so the series converges absolutely and uniformly over the product space. Its partial sums are product-measurable and bounded by , so their pointwise limit is a Borel causal map. Finite partial-sum variances are by [F2]; the uniform bound and dominated convergence give centering and . For the replacement, the first terms cancel; finite tails are independent centered differences with variance and are bounded in absolute value by . Dominated convergence [F2] passes these variances to the infinite tail, giving Thus .
For , truncate both linear sums at index . Their product is bounded by and converges pointwise to , so dominated convergence [F2] passes expectations to the limit. The finite sums share exactly innovations with indices ; their coefficient products are , while all other products have zero expectation by [F2]. The finite shared-coefficient sums tend to , giving Symmetry gives . Therefore the scalar long-run variance is and the operator is .
Step 1.1 gives centering, a finite second moment and summable physical-dependence errors; step 2.1 gives the long-run covariance. Applying [F3] yields convergence of the normalized -valued sums to a centered Gaussian with covariance .
A terminal weak limit does not imply a path-space weak limit
Statement
Let with the supremum norm, choose a unit vector , and define deterministic paths Every terminal value is zero, so the laws of converge to the point mass at in . The laws of the paths do not converge weakly on . This illustrates why the sample-sum CLT in Hilbert-valued CLT for L2-m-approximable Bernoulli shifts is not a time-indexed process CLT.
Facts & Assumptions
Given: The metric space with and the deterministic paths in the Statement.
Weak convergence of Borel probability laws entails convergence of integrals of bounded continuous real functions (Convergence in distribution of random elements).
The preceding Hilbert-valued theorem concerns normalized sample sums as single -valued random elements, not paths indexed by (Hilbert-valued CLT for L2-m-approximable Bernoulli shifts).
Proof
Given: The paths and their point-mass laws.
Since , both even and odd paths satisfy . Thus their terminal laws are all the point mass and in particular converge weakly to in .
Define by . The supremum norm inequality gives and truncation by is 1-Lipschitz on . Hence is bounded and continuous. It equals on every even path and on every odd path, so its expectations under the path laws alternate between and and do not converge. By [F1], those path laws cannot converge weakly.
The example has convergence only after applying the terminal evaluation map; the bounded continuous path functional in step 1.2 detects the missing path-space convergence. Therefore endpoint convergence alone supplies no functional CLT conclusion, consistently with the scope in [F2].