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.
General-state MCMC ergodicity and mixing
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Darboux, L'Hôpital, and Taylor's Theorem
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Markov Kernels and Markov Chains
- Martingale Inequalities and Convergence
- Measurable Functions and Simple Approximation
- Measure-Preserving Systems and Mixing Criteria
- Measures and Their Basic Properties
- Metric Spaces
- 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
- 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
- Recurrence Transience and Hitting Times for Markov Chains
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- SCM, DAGs, adjustment
- 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
- Stationary Markov Chains and Ergodic Limits
- Stopping Times and Optional Stopping
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Summary
This page separates invariance from convergence for a general-state Markov kernel. It defines irreducibility, aperiodicity, small and petite sets, drift, and Harris recurrence; proves the measurable-density and small-set results needed on countably generated spaces; and establishes stationary almost-everywhere convergence, the Harris all-start upgrade, uniform ergodicity from whole-space minorization, and a V(x)-weighted geometric rate.
Without Harris recurrence the convergence conclusion is only for pi-almost every start. The drift theorem gives a common geometric rate weighted by V(x): globally finite drift functions yield the bound from every state, while extended drift certificates finite pi-almost everywhere yield it on the full-measure absorbing set {V<infinity}. The bounded-set reduction explicitly supplies the improved drift needed to integrate V under the invariant law. Invariance alone gives neither irreducibility nor convergence. The companion page records periodicity, null-set starts, reducible Gibbs dynamics, sticky chains, and mixing-rate limitations.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Total variation duality, kernel contraction, and coupling bound
Statement
Let be probability measures on and let be a probability kernel on that space. Then If is a coupling of and on a probability space and is a measurable event on which , then
Facts & Assumptions
Given: Two probability measures on the same measurable space, a probability kernel , and, for the coupling conclusion, random elements with laws and a measurable event such that on .
Total variation distance for probability laws: total variation is .
Measure kernel and probability kernel: is a probability measure and is measurable for each .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions may be integrated in either order.
Proof
Given: [F1]–[F3] and the hypotheses in the Statement.
For measurable , put for . The identity and [F3] give . Its absolute value is at most by [F1]. Conversely, each indicator is an admissible and attains the setwise difference for its set . Taking suprema proves the dual formula.
For each , the function is measurable and takes values in by [F2]. Apply step 1.1 to that function to obtain . Taking the supremum over proves kernel contraction.
For any , , because the two indicators agree on . Taking the supremum over proves the stated bound.
Petite sets for a Markov kernel
Definition
For a probability kernel from to itself (Measure kernel and probability kernel), a set is petite if there are a probability measure on (Probability measures and probability spaces), nonnegative weights with , and a constant such that This is a randomized-time minorization. A small set requires one fixed time; a petite set permits a common distribution over positive integer times.
Phi-irreducibility for a general-state Markov kernel
Definition
Let be a countably generated measurable space (Measurable spaces and measurable sets), a probability kernel (Measure kernel and probability kernel), and a nonzero -finite measure (Finite, sigma-finite, and semifinite measures) on . Write for the -fold kernel iterate. The kernel is -irreducible if, for every with and every , there is an integer such that . Equivalently, the sum of these nonnegative probabilities over is positive. No recurrence or invariant law is part of this definition.
Small-set minorization and geometric drift
Definition
For a probability kernel on (Measure kernel and probability kernel), a measurable set is -small if is an integer, , is a probability measure (Probability measures and probability spaces), and The inequality is pointwise in and holds for every measurable .
A geometric drift inequality outside consists of a finite-valued measurable , constants and , and The terms small set and drift are separate hypotheses; neither definition asserts the existence of the other.
When an invariant probability is specified (Invariant and stationary distribution for a Markov kernel), an extended geometric drift certificate finite -almost everywhere allows measurable with and the same pointwise inequality, interpreted in the nonnegative extended reals. This is a separate convention from the finite-valued drift function above. The geometric theorem treats this certificate on ; the original finite-valued convention gives the corresponding bound on the whole state space.
Measurable Lebesgue decomposition of a kernel on a countably generated space
Statement
Let be countably generated, let be a nonzero -finite measure, and let be a probability kernel. There are a jointly measurable and a subprobability kernel such that where and are mutually singular for each .
Facts & Assumptions
Given: The countably generated space, -finite reference measure, and probability kernel in the Statement.
Measurable spaces and measurable sets: a countable generating family yields an increasing sequence of finite partitions generating .
Measure kernel and probability kernel: is measurable and is a probability measure.
Every sigma-finite signed measure admits a Lebesgue decomposition relative to a sigma-finite positive measure and A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: each fixed kernel section has a scalar Lebesgue decomposition and an absolutely continuous density.
Doob submartingale convergence theorem gives almost-sure convergence for a submartingale whose positive parts have uniformly bounded expectations. Levy upward convergence of conditional expectations identifies the almost-sure limit of conditional expectations along an increasing generating sequence with the conditional expectation on the generated sigma-algebra.
Measurability of integration against a kernel: integrating a nonnegative jointly measurable function against a kernel preserves measurability.
Approximation in symmetric difference by a generating algebra: under a finite measure, every measurable set is approximable in symmetric difference by members of a generating algebra.
Finite, sigma-finite, and semifinite measures: a sigma-finite measure admits a countable partition into finite-measure pieces.
The measure with density relative to : integrating a nonnegative measurable density against the reference measure defines a measure.
The Axiom of Choice: select sectionwise RN decompositions and singular support sets, and supply the AC hypotheses of the Doob and Levy convergence theorems in [F4].
Proof
Given: The hypotheses and facts [F1]–[F7], with [A1].
Choose a disjoint measurable partition with and positive total measure. Set and . Then , and is an equivalent probability measure. Its density on is positive. For each fixed , choose from [F3]. Let be increasing finite partitions generating , and set with value zero on zero-measure cells. For a positive-measure cell , its average at level integrates over to the sum of over the positive-measure children , which is at most ; zero-measure parents and all their children have value zero. Thus is a nonnegative -supermartingale. Also , so has uniformly bounded positive-part expectations and [F4] gives a finite almost-sure limit for .
Define , a jointly measurable extended nonnegative function; for each fixed it agrees almost everywhere with the finite limit from step 1.1. The conditional-expectation averages of the integrable density over are defined by on positive-measure cells , and by zero on zero-measure cells. Since , [F4] and the AC hypothesis [A1] give almost everywhere: generates . Cellwise because , with both averages zero on null cells. Taking limits proves almost everywhere.
For a cell at partition level , every has , since the positive-measure level- cells inside contribute only a sub-sum of the kernel masses of a partition of . Fatou therefore gives . By [F8], the left side defines a measure; Fatou at the whole space gives its total mass at most one, so both sides are finite measures. Their sum is a finite measure, and [F6] approximates any measurable set in symmetric difference under that sum; the inequality extends from the generating partition algebra to every measurable set. Choose a singular support with and . Since the left measure has density with respect to , it assigns zero mass to . Applying the inequality to therefore gives . Together with step 2.1, this proves almost everywhere.
Since , set and . Step 3.1 shows sectionwise that , a nonnegative subprobability measure singular to . The integral is measurable in by [F5]; hence is measurable for every , and its sections are countably additive. Thus is a subprobability kernel and the decomposition holds.
A positive triple set has uniformly overlapping sections
Statement
Let be a finite nonzero measure on a countably generated measurable space. For measurable , define . If , then there are measurable with and such that where and .
Facts & Assumptions
Given: The finite measure, countably generated sigma-algebra, and product-measurable sets in the Statement.
Measurable spaces and measurable sets: a measurable space consists of a set and a sigma-algebra. Countable generation is an explicit hypothesis here.
Approximation in symmetric difference by a generating algebra: under a finite measure every measurable set has arbitrarily close symmetric-difference approximants in a generating algebra.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: product integrals equal iterated section integrals.
Proof
Given: The hypotheses and facts [F1]–[F3].
Put . The product measure is finite because is finite. Fix a generating sequence for . Let consist of the nonempty sets , where each is or . These are finite partitions and refines . Their finite-union algebras increase and contain every . The union of the corresponding tensor-cell algebras on is therefore an algebra generating : it contains every coordinate lift of a , which generate the product sigma-algebra, and all its cells are product-measurable. Apply [F2] to obtain a member of that algebra with . Then and , so occupies more than three quarters of . The set is a finite union of tensor cells at a common partition level. If every positive-measure cell had occupancy at most three quarters, finite additivity would give the same upper bound on , a contradiction. Thus some cell has positive product measure and . Only one finite-algebra approximant and one cell of its finite partition are selected; no conditional-expectation representative or choice axiom is used.
Since , Tonelli gives and likewise . Consequently the sets and have positive measure; otherwise the corresponding integral could not exceed three quarters of the rectangle measure.
For and , both sections occupy more than three quarters of . The complement of their intersection in is the union of two sets, each of measure less than . Thus . Set .
Aperiodicity for a general-state Markov kernel
Definition
Let be a -irreducible probability kernel (Phi-irreducibility for a general-state Markov kernel) with invariant probability (Invariant and stationary distribution for a Markov kernel). The chain is aperiodic if there do not exist an integer and pairwise disjoint measurable sets such that and Invariance then gives for every . The sets need not cover the full state space; the definition rules out any positive-mass cyclic part. Aperiodicity does not itself assert convergence.
Harris recurrence relative to an irreducibility measure
Definition
Let be -irreducible with nonzero -finite irreducibility measure . It is Harris recurrent relative to if for every with and every starting state , the first hitting time satisfies . This is an all-start almost-sure hitting property; it is stronger than -irreducibility, which requires only positive probability at some finite time.
A bivariate drift and minorization bound geometric coupling error
Statement
Let be a probability kernel, be -small for , and let . If , define residual probabilities on and assume If , set and impose no residual condition. Suppose is finite-valued and measurable and off . Then there are and such that a coupling of two -chains has a measurable split-success time , with on , and satisfies Consequently . For , the transition following the first visit to couples the chains.
Facts & Assumptions
Given: The kernel, one-step minorization, bivariate drift, finite residual bound, and in the Statement.
Measure kernel and probability kernel: the independent product and residual transition rules define probability transitions.
Total variation duality, kernel contraction, and coupling bound: for any coupling, total variation is bounded by the probability that the coupled variables differ.
Measurability of integration against a kernel: the residual expectations and stopped-chain expectations are measurable.
Finite products of probability kernels are probability kernels: independent coordinate transitions form the product probability kernel.
Canonical Markov chain on path space: the coupled kernel transitions have a canonical path realization under the stated AC convention.
Discrete strong Markov property: the attempt times obey the discrete strong Markov property.
The Axiom of Choice: the canonical path and split-transition construction uses AC as stated by [F6].
Proof
Given: The hypotheses and facts [F1]–[F7], with [A1].
Run the two coordinates independently until both lie in . At each such visit, use the minorization to toss a common Bernoulli() split: on success draw one shared state; on failure draw independently from . Let , with . Record success with a measurable binary flag and evolve synchronously thereafter, without testing equality before success. The shared transition is the pushforward of under ; this map is measurable on every measurable space. This construction has the required -marginals by [F1], [F2], and [F5].
Let count failed split transitions completed by time , with , and set . If , a visit to couples on the next transition, so the uncoupled contribution there is zero. If , off the conditional expectation of the next is at most ; on the uncoupled transition has probability and expected equal to . The definition of bounds its contribution after the extra factor by , since . Thus is a nonnegative supermartingale in both cases.
For any integer , the probability of at least failed attempts is at most . On the event with at most failures, and , so the supermartingale bound gives
Choose so and set . Both terms in step 3.1 are bounded by a constant times for some . Apply the coupling inequality [F3] to obtain the asserted geometric bound after increasing to cover the finite initial values of .
A drift sublevel enlargement of a small set is petite
Statement
Suppose is -small and with finite , . For every finite , is petite.
Facts & Assumptions
Given: The kernel, small-set minorization and drift inequality in the Statement.
Small-set minorization and geometric drift: on , and outside , .
Petite sets for a Markov kernel: petite means a fixed probability mixture of positive-time transition kernels dominates a positive multiple of a common probability.
Measure kernel and probability kernel: kernel iteration and stopping-time probabilities are measurable.
Monotone convergence for the integral: nonnegative sums may be integrated termwise.
Discrete strong Markov property: conditional on a finite first entrance time, the chain continues with kernel .
The Axiom of Choice: the canonical path and stopping-time realization use AC as specified by [F5].
Proof
Given: The hypotheses and facts [F1]–[F5], with [A1].
If , then everywhere; iterating gives for every state and , impossible for sufficiently large because . Thus the hypotheses force . Let . The killed kernel satisfies off . Since , induction gives . Hence for , ; for , .
For each , restrict paths to the disjoint event and apply [F5] followed by the small-set minorization. This gives Summing over yields uniformly on .
Choose with and assign weight to times . The resulting probability mixture dominates , so it satisfies the petite definition with positive multiplier .
An invariant law integrates a drift function bounded on its small set
Statement
Let be invariant for , and suppose with , , and . Then .
Facts & Assumptions
Given: The invariant probability and drift inequality in the Statement.
The supremum is interpreted in the extended reals, with ; the empty-set case is handled separately below.
Small-set minorization and geometric drift: is finite-valued and pointwise.
Invariant and stationary distribution for a Markov kernel: , including equality of integrals for bounded measurable functions.
Measure kernel and probability kernel: is measurable and bounded by .
Proof
Given: The hypotheses and facts [F1]–[F4].
If , then everywhere. For each integer , satisfies on and on . Invariance for the bounded function gives integral zero, so . Since is finite-valued, these sets increase to the whole space, contradicting that is a probability. Thus no invariant probability exists in the empty-set case, and the implication is vacuous. Assume below.
Set . Since and , . On , . On it is at most , and on it is at most zero.
Invariance for bounded gives . Using the three pointwise bounds from step 1.2,
The domains increase to ; monotone convergence bounds by the right side divided by . The integral over is at most . Hence .
Invariant mass and almost-sure hitting of accessible sets
Statement
Let have invariant probability . If a measurable set has positive probability of being hit from every starting state, then for -almost every . In addition, if is -irreducible and , then and the positive-hitting hypothesis holds.
Facts & Assumptions
Given: A probability kernel with invariant probability; for the first conclusion, the positive-hitting premise; for the additional conclusion, a -irreducibility measure and .
Phi-irreducibility for a general-state Markov kernel: every -positive set is reached with positive probability from every state at some finite positive time.
Canonical Markov chain on path space: under its stated AC convention, iterated kernels define the canonical path law.
Discrete strong Markov property: the canonical chain has the strong Markov property at discrete stopping times.
Monotone convergence for the integral: increasing countable sums and limits pass through integration.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative sums and kernel integrals may be interchanged.
Measurability of integration against a kernel: integrating a bounded measurable function against a probability kernel gives a measurable function of the starting state.
Assume The Axiom of Choice as required by the canonical path-law [F3] and strong Markov [F4] suppliers. The countable level-set arguments below need no measurable selection theorem.
Proof
Given: The invariant law and applicable hypotheses, with [F1]–[F7] and [A1].
For the additional conclusion, let . By [F1], everywhere. Tonelli and stationarity give . If , this integral is zero, contradicting positivity of under a probability measure. Hence ; [F1] also supplies the positive-hitting premise for the first assertion.
It remains to prove the first assertion under its positive-hitting premise. Set and recursively , where . Then ; induction and [F7] show each is measurable, and , so is measurable. If the bad set has positive mass, a countable level-set union gives some for which has positive -measure. For each , and , so some has . Countable unions over times and rational thresholds then give a common , , and with and on .
Let . At each such visit, the conditional probability of avoiding at the next -step time is at most . Induction using [F4] gives for each finite , and hence . Thus for , . To select a measurable positive-mass set with a common finite last-visit bound, for each forbid at every time and also forbid at times with . For a finite horizon , let if for some , and otherwise. Set and recursively set for . Then is the finite-horizon event probability and is measurable by [F7]. As , these events decrease to , so continuity from above makes their limit measurable. The events increase with and their union is , so a value at least on . A countable rational threshold selection therefore gives , , and with and
Put and , with if no such visit occurs. For , consider the event that , there is no later -visit at a positive multiple of , and no hit of at or after . It is a subset of . Stationarity and the Markov property at time therefore give Indeed the event in step 2.1 rules out every -visit at skeleton indices , hence every later -visit at a positive multiple of , as well as every future hit of . The events are disjoint, so stationarity yields . Taking contradicts . Therefore the bad set is -null.
Iterated kernel densities retain convolution lower bounds
Statement
Let be -irreducible on a countably generated space, with nonzero -finite irreducibility measure . For each there are a jointly measurable and a singular residual kernel such that and versions may be chosen so that for every and every , For every , for -almost every .
Facts & Assumptions
Given: The countably generated space, -irreducible kernel, and irreducibility measure in the Statement.
Phi-irreducibility for a general-state Markov kernel: every -positive set is reached from every state at some finite positive time.
Measure kernel and probability kernel: a probability kernel has measurable evaluations and probability-measure sections.
Measurable Lebesgue decomposition of a kernel on a countably generated space: each has a jointly measurable density component and singular residual kernel.
Measurability of integration against a kernel: integration of a nonnegative product-measurable function against a probability kernel is measurable.
The Axiom of Choice: retain the Choice assumption of [F3] and choose countably many sectionwise singular supports.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative sums and kernel integrals can be interchanged.
Proof
Given: The hypotheses and facts [F1]–[F5], and [A1].
Apply [F3] to each , obtaining preliminary densities and singular residuals . Inductively set and, for , For each , the lifted kernel is a probability kernel by [F2]. Apply [F4] to this kernel and the nonnegative product-measurable integrand ; finite maxima preserve measurability. Thus the right side is jointly measurable. For each fixed , composition of kernels gives . Since is singular, this domination forces each candidate density to be at most -almost everywhere. Thus -a.e. for each , so it is still the density part and has both displayed convolution lower bounds pointwise by construction.
Fix . For each , choose a -null support of and let . Then and every residual assigns zero mass to . If has , [F1] gives an with ; because the residual gives zero mass, .
Therefore every positive- subset of intersects in positive measure. Its complement in must be -null; otherwise take that complement as in step 1.2, which would make every integral zero. Hence the density sum is positive -almost everywhere.
Whole-space minorization gives uniform geometric ergodicity
Statement
Let have invariant probability . If for some , , and probability , then for every , Thus this chain is uniformly geometrically ergodic: there are common and with . No converse is asserted. When , the floor bound means for and for .
Facts & Assumptions
Given: The probability kernel, invariant probability, and whole-space minorization in the Statement.
Small-set minorization and geometric drift: the stated lower bound is a probability-kernel minorization.
Total variation distance for probability laws: total variation is the supremum over measurable events (up to the stated normalization).
Total variation duality, kernel contraction, and coupling bound: a probability kernel contracts total variation.
Proof
Given: The hypotheses and facts [F1]–[F4].
Write ; if , take any probability residual because its coefficient is zero. For probabilities , the common term cancels, so by the event-supremum definition and kernel contraction.
Iterating step 1.1 times and using invariance yields . Write with ; the remaining contracts total variation and leaves invariant, so the same bound holds at . Taking the supremum over proves the result.
Aperiodicity makes minorization times eventually consecutive
Statement
Let be -irreducible (Phi-irreducibility for a general-state Markov kernel) and aperiodic (Aperiodicity for a general-state Markov kernel) with invariant probability . Let be a probability. Suppose every state has some and with . Then there is such that for every , for some .
Facts & Assumptions
Given: Countable generation, the irreducibility and aperiodicity definitions, invariant law, , and the statewise minorization.
Aperiodicity for a general-state Markov kernel: no disjoint cyclic family of at least two positive- classes has deterministic transitions to its successors; the family need not cover the space.
Measure kernel and probability kernel: kernel iterates act on measures and preserve nonnegative measure inequalities.
Phi-irreducibility for a general-state Markov kernel: the underlying measurable space is countably generated.
Approximation in symmetric difference by a generating algebra: finite-measure sets are approximable in symmetric difference by the generating algebra.
Monotone convergence for the integral: countable nonnegative sums may be integrated termwise.
Proof
Given: The hypotheses and facts [F1]–[F6].
For , let . Fix a countable generating sequence . The union of the finite Boolean algebras generated by is a countable algebra generating . The inequality defining is equivalent to its restrictions to : if those hold, approximate any measurable under the finite measure by an algebra set; the difference of the two sides changes by at most that symmetric-difference mass, which tends to zero. Thus is measurable by [F2] and [F4]. The statewise hypothesis makes their union the whole space. Since is a probability, one such set has positive -mass. Integrating its inequality gives . Thus the set is nonempty.
If , then , so is additive. Let .
Suppose . For , define Every positive witness time has exactly one representation with and , so the statewise minorization covers the space by these sets; rational thresholds and the countable testing algebra make them measurable. Put . For every , : otherwise a countable subdivision gives a positive -mass subset of an overlap on which both phase exponents and both positive constants are fixed. Integrating the two minorization inequalities gives two times in with different residues modulo , contradicting that divides every member of .
Let and . Since for every , . The are disjoint and cover . For , : positive mass on the countable union defining would, by integration of a positive hitting probability, imply for some , contradicting . Thus . If for , countably partition by its witnessing exponent and rational minorization constant; one part has positive -mass. Integrating the common later minorization after that one-step transition puts in , contradicting disjointness of the . Thus for . Since , the disjoint classes satisfy . Absolute continuity gives , so some has positive -mass. Invariance propagates positive mass from each class to its successor, so all have positive -mass. This is a cyclic decomposition, contrary to [F1]. Hence .
Choose finitely many with gcd one. Their nonnegative combinations modulo form the subgroup generated by their residues; gcd one makes this all residues. Choose one represented for each residue . Every sufficiently large integer in residue is and belongs to by additivity. The defining positive constant for each such is .
A countably generated phi-irreducible chain has a positive-measure small set
Statement
Let be countably generated, let be a probability kernel that is -irreducible (Phi-irreducibility for a general-state Markov kernel), and let be a nonzero -finite irreducibility measure. Then there are an integer , a measurable with , a probability with , and such that for every .
Facts & Assumptions
Given: Countable generation, the probability kernel, and -irreducibility.
Phi-irreducibility for a general-state Markov kernel: every positive- set is reached with positive probability at some finite positive time from every state.
Small-set minorization and geometric drift: a small set is a common fixed-time minorization by a probability measure.
Iterated kernel densities retain convolution lower bounds: iterated kernel densities satisfy convolution lower bounds and their sum is positive -almost everywhere from every state.
A positive triple set has uniformly overlapping sections: a positive-measure set of composable density pairs has sections with a uniform positive overlap.
Measurable spaces and measurable sets: countable generation supplies finite partitions and countable testing algebras.
The Axiom of Choice: the density versions and measure representatives in [F3] are selected under AC.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product integrals and countable sums can be interchanged.
Proof
Given: The hypotheses and facts [F1]–[F5], [F7], and [A1].
Write as a countable disjoint union of measurable finite-measure sets . Set and . Since is nonzero and the cover the space, . Then is an equivalent probability measure: it has density on every , and hence exactly the same null sets and positive sets as . Replace by for the rest of the proof. By [F3], for every the sum is positive for -almost every . Tonelli and countability imply that for -almost every , this sum is positive at and the corresponding sum at is positive. Hence the product of the two sums is positive almost everywhere; its countable expansion shows that some fixed satisfy For a sufficiently small , the set where both factors exceed still has positive product measure.
Apply [F4] to and . Obtain positive- sets and such that their sections overlap by at least . The convolution bound [F3] gives for every .
Since is -positive, irreducibility gives for every . Integrating over and using Tonelli, some has . A positive-level-set subdivision yields with and such that for every .
For every and , the second convolution inequality in [F3] gives Let and choose . Integrating the density over gives for every . Since and , . Thus is the required small set.
A petite drift enlargement is small under aperiodicity
Statement
Let be countably generated, -irreducible and aperiodic with invariant probability . Suppose is petite with probability and multiplier , and is -small for this same , with and . Then is small at some common time.
Facts & Assumptions
Given: The kernel, irreducibility, aperiodicity, invariant probability, petite inequality on , and same-measure small-set minorization on .
Aperiodicity makes minorization times eventually consecutive: once every state can reach a minorization into , for every sufficiently large .
Phi-irreducibility for a general-state Markov kernel: every positive- set is accessible from every state.
Discrete strong Markov property: the chain restarts from its state at the first entrance time.
The Axiom of Choice: the canonical path/stopping-time construction uses AC as specified by [F5].
Proof
Given: The hypotheses and facts [F1]–[F5], with [A1].
The petite inequality on gives for every . Choose so . Since for , the truncated weighted sum gives uniformly on .
Since and , . To see that every state has positive probability of reaching , let . Kernel iteration makes measurable. If and , the countable union has a member of positive -mass; integrating the corresponding positive function gives , a contradiction. Thus for every . Suppose and fix . Irreducibility then forces , since no point of can reach ; hence . For every , invariance and on give . Irreducibility says every has for some , so the countable union of these -null level sets is and , contradicting . Therefore . For some positive time reaches by the definition of ; for , [F2] gives . Thus for each state there is with ; then . By [F3], for every . Choose . For every and , The minimum over these finitely many is positive.
Decompose at the first hitting time . The strong Markov property and step 2.1 give for every . This is one fixed-time minorization, so is small.
Small-set coupling yields almost-everywhere total-variation convergence
Statement
Let be countably generated, -irreducible and aperiodic with invariant probability . If is -small, , and , then for -almost every .
Facts & Assumptions
Given: The kernel, irreducibility measure, aperiodicity, invariant law and small set.
Phi-irreducibility for a general-state Markov kernel: every positive- set is accessible from every state.
Aperiodicity for a general-state Markov kernel: no cyclic decomposition exists on the stationary irreducible part.
Invariant and stationary distribution for a Markov kernel: is invariant.
Invariant mass and almost-sure hitting of accessible sets: for any stationary kernel, if every start has positive chance to hit a target, stationary almost every start hits it almost surely.
Aperiodicity makes minorization times eventually consecutive: for all sufficiently large when and each state can reach the minorization.
Finite products of probability kernels are probability kernels: independent coordinates define product probability kernels.
Total variation duality, kernel contraction, and coupling bound: a coupling bounds total variation by its disagreement probability.
Canonical Markov chain on path space: the kernel defines its canonical path law under its stated AC convention.
Discrete strong Markov property: the pair chain restarts at discrete stopping times.
Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: finite measures agreeing on measurable rectangles agree on the product sigma-algebra.
The Axiom of Choice: the path and split-kernel constructions use AC as specified by [F9].
Proof
Given: The hypotheses and facts [F1]–[F11], with [A1].
By [F5], . Integrating the small-set inequality over and using invariance gives for all , hence .
Fix . Irreducibility gives with , so . By [F6], for every sufficiently large . Thus for every sufficiently large , and in particular for every sufficiently large integer . This holds for every .
Let . For measurable rectangles , . By [F11], this proves that is invariant for . By step 2.1, every starting pair has positive probability of hitting under . Apply the stationary positive-hitting lemma [F5] to , invariant law , and target : the stationary pair hits almost surely from -almost every pair.
Start the pair with law and run independent transitions before each split attempt. By step 3.1 and [F5], the first hit of occurs almost surely. Its location law is absolutely continuous with respect to : for any -null set , the event that the first hit lies in is contained in , which has probability zero by stationarity. More generally, if the pair at the start of a waiting period has any subprobability law , then for every , because invariance gives for -almost every ; hence its next first-hit location is also absolutely continuous and the hit occurs almost surely by [F5]. At a visit with , use one common Bernoulli() coin: success draws a shared value and couples immediately, while failure draws independently from and . Each coordinate retains its marginal. For every -null , stationarity gives for -almost every , while the product expansion gives ; thus the failed endpoint law is absolutely continuous whenever the attempt-state law is. It therefore reaches almost surely again, with an absolutely continuous first-hit law. If , the first split succeeds and no failure branch occurs.
Each visit succeeds with probability , so successive failures have probability . The coupling succeeds almost surely for -almost every initial pair. Fubini gives that for -almost every , a chain from couples almost surely to an independent stationary chain. The coupling inequality gives convergence along times . For , , contraction by and invariance of gives convergence for every .
Geometric drift yields a bounded small set and bivariate drift
Statement
Let be countably generated, -irreducible and aperiodic with invariant probability . Suppose is -small with and for finite , . Then there are and a -positive small set with and pointwise. Moreover there are a bounded- small set , a time , a minorizing probability , and such that for and , If on , the residual laws have when ; for no residual branch is needed.
Facts & Assumptions
Given: The irreducibility, aperiodicity, invariant probability, small-set and drift assumptions.
Phi-irreducibility for a general-state Markov kernel: every positive- set is reachable from every state.
Small-set minorization and geometric drift: the fixed-time minorization and pointwise drift inequality hold.
Invariant mass and almost-sure hitting of accessible sets: charges each positive- set.
A drift sublevel enlargement of a small set is petite: a drift sublevel enlargement of a small set is petite.
A petite drift enlargement is small under aperiodicity: a petite set is small if it contains a small set with the same minorizer, that minorizer charges the small set, and it is absolutely continuous with respect to the invariant law.
Aperiodicity makes minorization times eventually consecutive: once and every state reaches a minorization into , for all sufficiently large .
Aperiodicity for a general-state Markov kernel: aperiodicity excludes cyclic decompositions.
Invariant and stationary distribution for a Markov kernel: is invariant.
Measure kernel and probability kernel: probability kernels have measurable evaluations and probability-measure sections.
Assume The Axiom of Choice as inherited from the path and stopping-time constructions in [F4] and [F5].
Proof
Given: The hypotheses and facts [F1]–[F9], with [A1].
Choose and then large enough that has positive -measure; such a choice exists since is finite and is positive. The set remains -small and is bounded in . For , , while outside the original drift has no term. Hence .
By [F3], . Integrating the minorization over gives . Iteration of the original drift yields ; for the right side is finite and uniformly bounded. Since , it follows that . Irreducibility and give some with . Put . For any with , invariance gives , so for -almost every ; since , this implies . Thus . Also , and is small at time with minorizer .
Choose any finite large enough that . Put , which is bounded in . By [F4], there are weights , , and a probability such that on . Put , so is -small. By [F1], every state reaches at some positive time; a countable union therefore gives with . Composition yields . Thus the shifted mixture makes petite with minorizer . Since and , [F5] gives some , , and probability with on . Again [F1] gives with . Hence, for , , where on . Each state also reaches a positive minorization into by reaching and then running steps. For every sufficiently large , [F6] gives ; hence for .
Iterating the improved drift gives with . Choose in step 3.1 large enough that also satisfies If , at least one coordinate has , so . Therefore The set is bounded in , and is uniformly bounded on by the drift bound. The minorizer has finite -moment by step 2.1, so the residual laws have uniformly finite -moment and their product expectation of is bounded.
General-state Markov-chain convergence under recurrence conditions
Statement
Let be countably generated, -irreducible (Phi-irreducibility for a general-state Markov kernel) and aperiodic (Aperiodicity for a general-state Markov kernel) with invariant probability . Then for -almost every . If is Harris recurrent relative to (Harris recurrence relative to an irreducibility measure), convergence holds for every starting state.
Facts & Assumptions
Given: The kernel, irreducibility, aperiodicity, invariant probability and, for the all-start conclusion, Harris recurrence.
Aperiodicity for a general-state Markov kernel: no positive-mass cyclic family has deterministic transitions to its successor.
Harris recurrence relative to an irreducibility measure: every positive- set is hit almost surely from every state.
Invariant and stationary distribution for a Markov kernel: is stationary.
Total variation distance for probability laws: total variation is the supremum of measurable event-probability differences.
A countably generated phi-irreducible chain has a positive-measure small set: a countably generated irreducible chain has a small set with and .
Small-set coupling yields almost-everywhere total-variation convergence: aperiodicity and such a small set imply -almost-everywhere convergence.
Approximation in symmetric difference by a generating algebra: finite-measure events are approximable by a countable generating algebra, making the total-variation supremum countable.
Discrete strong Markov property: at the finite hitting time, the future law is the kernel iterate from the hit state.
Canonical Markov chain on path space: the transition kernel has its canonical path law under the declared choice convention.
Dominated convergence: bounded pointwise-convergent functions may be integrated through limits under a finite measure.
The Axiom of Choice: the path-law construction uses AC as specified in [F9].
Proof
Given: The hypotheses and facts [F1]–[F9], with [A1].
Apply [F6] under the aperiodicity and invariance hypotheses [F1] and [F3]. This gives convergence on a set with . The set is measurable because [F7] expresses total variation as a supremum over the countable generating algebra.
Assume Harris recurrence and let be any -null measurable set. If , [F2] says every start hits almost surely. Averaging over would give stationary probability one to ever hitting , but stationarity gives for each , and a countable union gives probability zero. Therefore every -null set is -null. In particular , so .
Harris recurrence [F2] implies every start hits at a finite time almost surely. For fixed , split the time- law according to and . The first contribution is at most .
On , the strong Markov property [F8] gives conditional law , with . For each fixed , let be the finite law of on . For any measurable event , conditioning on and bounds the absolute event-probability difference from by Taking the supremum over gives the same bound for total variation. For fixed and , the terms with tend to zero by [F10]: the distance functions are measurable by [F7], converge pointwise on , and are bounded by one; the terms with are at most . Also . Letting first and then proves convergence. The path law is supplied by [F9] under [A1].
Geometric ergodicity under drift and small-set minorization
Statement
Let be countably generated, -irreducible and aperiodic with invariant probability . Suppose a -positive small set and finite-valued satisfy for . Then there are and such that This is geometric ergodicity with a -weighted bound.
Under the same kernel, -positive small-set and drift-constant hypotheses, the result also holds if is measurable and finite -almost everywhere, with the drift inequality holding pointwise in the extended sense. Then is measurable, absorbing and of full -measure, and the displayed bound holds for every . Thus extended certificates give the common geometric rate for -almost every start, while globally finite certificates give it for every start.
Facts & Assumptions
Given: The kernel, irreducibility, aperiodicity, invariant probability, small set and drift inequality in the Statement.
Phi-irreducibility for a general-state Markov kernel: positive- sets are reachable from every state.
Aperiodicity for a general-state Markov kernel: no cyclic decomposition exists.
Small-set minorization and geometric drift: the common minorization and drift inequalities hold.
Invariant and stationary distribution for a Markov kernel: is invariant.
Total variation distance for probability laws gives the event-supremum definition of total variation. Total variation duality, kernel contraction, and coupling bound bounds it by coupling disagreement and contracts it under a probability kernel.
Geometric drift yields a bounded small set and bivariate drift: there is a bounded-, -positive small subset with improved pointwise drift for some ; a skeleton and bounded small set also satisfy the bivariate drift/minorization hypotheses.
A bivariate drift and minorization bound geometric coupling error: those hypotheses yield a geometric coupling bound.
An invariant law integrates a drift function bounded on its small set: an invariant probability integrates a finite-valued drift function when its drift set is bounded in that function.
A nonnegative measurable function with finite integral is finite almost everywhere: finite nonnegative integral implies the integrand is finite almost everywhere under the integrating measure. Measure kernel and probability kernel gives pointwise probability sections and measurable evaluations for the restricted kernel construction.
Invariant mass and almost-sure hitting of accessible sets: each positive- set has positive invariant probability.
Assume The Axiom of Choice as inherited from the path and stopping-time suppliers used by [F6] and [F7].
Proof
Given: The hypotheses and facts [F1]–[F10].
First assume is finite-valued. By [F6], choose the bounded- small subset and with . Its boundedness is exactly the hypothesis needed for [F8], which now gives . Apply the remaining conclusions of [F6] to obtain a skeleton , bounded small set , function , and constants satisfying the hypotheses of [F7]. Since is bounded in , the residual split expectation is uniformly finite.
Now allow the extended certificate and put and . These sets are measurable and . If , the pointwise drift bound has finite right side, so . Apply [F9] to under the probability measure to obtain . Thus is absorbing, including for every iterate. Also : otherwise [F10] would give . Hence , in particular is nonempty, and remains a nonzero sigma-finite irreducibility measure.
For every fixed pair , [F7] gives with constants independent of the pair. For each measurable event , invariance and the pointwise event bound imply . The integrand on the left is a difference of measurable kernel evaluations; no measurable selection of pairwise couplings is needed. By step 1.1, . Taking the event supremum [F5] gives the required -weighted bound at skeleton times.
Restrict the state space to with its trace sigma-algebra and set for trace-measurable . Absorption makes this a probability kernel, with invariant probability ; a countable generator of restricts to a countable generator on . Original irreducibility supplies positive finite-time access to every positive- set from each . For the original -minorization on , choose . Since , minorization gives , so is small for with probability . Any positive- cyclic part for would consist of original measurable subsets of with the same pointwise transitions under , contradicting the actual aperiodicity definition [F2], which excludes such a part without requiring it to cover the state space. Finally is finite-valued and satisfies the original drift inequality with drift set .
Write , . The finite set of residual powers contracts total variation and the stationary law remains . Absorb the finite factor and over into a single , and put . Then the asserted bound holds for every .
Apply the finite-valued result proved in steps 1.1, 2.1, 3.1 to . It gives constants and and the weighted bound for every . Both and are supported on , so their total variation on the original space equals their total variation on the trace space: every event is replaced by its intersection with . Thus precisely the displayed original-space bound holds on , a full- absorbing set. If is globally finite, and the first branch is recovered.
5 · Examples, counterexamples and false statements
None yet.