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.
MCMC central limit theorems, MCSE, and long-run variance — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- 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
- General-state MCMC ergodicity and mixing
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- 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
- Markov Kernels and Markov Chains
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- MCMC central limit theorems, MCSE, and long-run variance
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- 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
- Recurrence Transience and Hitting Times for Markov Chains
- 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
- Stationary Markov Chains and Ergodic Limits
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Ergodic Theorems of von Neumann and Birkhoff
- The Exponential Function
- 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 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
Summary
These examples isolate what the CLT and MCSE hypotheses do. An identity-kernel chain has finite variance but no root- normal limit without ergodicity; a stationary Gaussian AR(1) chain has an explicit Poisson solution whose martingale and covariance long-run variances agree; and a square-root batch sequence fails a specific Flegal–Jones sufficient-condition limit. The batch-size example establishes only inapplicability of that sufficient route, not inconsistency of the estimator.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A stationary sticky chain with finite variance and no root-n CLT
Statement refuted
Finite variance of a centered observable alone guarantees a root- central limit theorem for every stationary Markov chain.
Facts & Assumptions
Given: A two-state measurable space, a transition kernel, an initial law, and a real observable.
AC is used by the library's Markov-chain law/stationarity convention. (The Axiom of Choice)
A stationary distribution is an invariant probability for the transition kernel. (Invariant and stationary distribution for a Markov kernel)
An invariant initial law makes the Markov chain strictly stationary. (Invariant initial law makes a Markov chain stationary)
Variance is the centered second moment. (Moments, variance, and covariance on a probability space)
Convergence in distribution requires convergence of distribution functions at every continuity point of the limiting law. (Convergence in distribution for real random variables)
-irreducibility requires every -positive set to be reachable from every state; Harris recurrence strengthens this to almost-sure hitting from every state. (Phi-irreducibility for a general-state Markov kernel, Harris recurrence relative to an irreducibility measure)
Counterexample
Let , , and let . The identity kernel leaves invariant, so the chain initialized with is stationary by [F2]. Set and . Then and .
The transition is deterministic, hence for every and . Thus takes values with equal probabilities. For each fixed , once its distribution function at is , while any has distribution function strictly greater than at when and equal to when . Since is a continuity point of every such normal law, [F4] rules out convergence to any normal distribution.
Choose and . Then , but for every because the chain stays at . By [F5] the chain is not -irreducible and is not Harris recurrent relative to . This counterexample shows only that finite variance without an ergodicity assumption does not guarantee a root- CLT.
A batch-size sequence fails the OBM consistency conditions
Example
Set and for . This sequence fails one Flegal–Jones batch-size condition, . The example establishes inapplicability of this sufficient condition only; it does not imply that the OBM estimator is inconsistent.
Facts & Assumptions
Given: The sequence and the lower-growth batch-size premise retained in the corrected Flegal–Jones OBM contract.
The Flegal–Jones batch-size contract for exponent includes the lower-growth limit . (Flegal–Jones overlapping-batch size conditions)
The OBM estimator uses overlapping batch means of integer length . (Overlapping batch means for MCMC standard errors)
Verification
For , , so . Thus , which violates the required limit in [F1] at .
Since for , the finite OBM procedure in [F2] is defined. Step 1.1 establishes failure of one source sufficient condition only, not inconsistency of the estimator.
Poisson equation and long-run variance for a stationary AR(1) chain
Example
Take and innovation variance . Let , where the innovations are independent variables and is independent of them. For , the Poisson solution is and the long-run variance is .
Facts & Assumptions
Given: The Gaussian AR(1) chain and observable in the Example.
AC supplies the Markov-chain and conditional-expectation conventions used by the stationary-chain theorem. (The Axiom of Choice)
An invariant initial law makes all finite-dimensional laws stationary. (Invariant initial law makes a Markov chain stationary)
Dominated convergence passes a pointwise-convergent sequence of densities through the Lebesgue integral under one integrable majorant. (Dominated convergence)
For a stationary chain on a countably generated state space, pointwise total-variation convergence for -almost every start implies strong mixing. (Stationary Markov-chain total-variation convergence implies strong mixing)
Strong mixing means , and its coefficient bounds event dependence between separated past and future sigma-algebras. (Strong, uniform, and maximal-correlation mixing coefficients)
The local Poisson theorem proves the martingale decomposition and identifies its variance with the covariance long-run variance under absolute covariance summability. (Poisson-equation martingale decomposition and MCMC CLT)
The covariance long-run variance is when the covariance series is absolutely convergent and the CLT holds. (Long-run variance for a stationary Markov chain)
A stationary real process has a measure-preserving canonical left shift, and ergodicity means every shift-invariant event has probability zero or one. (Stationary process and canonical path shift)
Verification
Put . If independently of , then is normal with mean zero and variance . Thus is invariant, and initializing with gives a stationary chain by [F1].
Iterating the recursion gives when , so with . For each fixed , and , so the Gaussian densities converge pointwise to the density of . For sufficiently large , and . On , ; on , , hence . This gives one integrable majorant for ; with added it also dominates . By [F2], . Therefore for every .
The Borel sigma-algebra of has the countable generating algebra of finite unions of rational half-open intervals and rational rays. Applying [F3] to step 1.2 gives .
Let be an event invariant under every power of the canonical left shift and put . Finite-coordinate cylinders form a generating pi-system. The events approximable in probability by such cylinders form a sigma-algebra: complements preserve symmetric-difference probability, and for a countable union one first truncates by continuity from below and then approximates the finitely many sets. Hence for every there are and with . For , is measurable with respect to , stationarity gives , and shift invariance gives . Thus . Let using step 2.1 and then ; we obtain . By [F7], every invariant event having probability zero or one is precisely ergodicity of the canonical shift.
Set and . Both are in and . The kernel action is , so . Also , whence . Steps 1.1 and 3.1 verify the stationary and ergodic hypotheses of [F5], so this is the Poisson CLT variance.
Iterating the recursion gives . Independence implies . Since , the covariance series is absolutely summable, and [F6] gives . This agrees with step 4.1, including and negative .