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.
Function-space pCN and invariant posterior kernels
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 Gaussian priors, RKHS support, and concentration
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- 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
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- 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
- Domination and Likelihood Ratios
- 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 Probability and the Probabilistic Method
- Finite-window spatial likelihood
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function-space priors and sample regularity
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- General-state Markov kernels, invariance, and reversibility
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- 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
- Inverse maps, identifiability, and stability
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- 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
- Posterior propriety and dominated Bayes formula
- 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
- 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
- Splitting Fields
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- 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 · Logical flowchart
3 · Definitions, theorems and proofs
Borel laws on a separable Hilbert space are determined by basis coordinates
Statement
Assume the Axiom of Countable Choice. Let be a real Hilbert space with a finite or countable complete orthonormal basis . For each finite , define the coordinate map by . If and are Borel probability measures on and for every finite and every Borel , then .
Statement references
A real Hilbert space is a complete real inner-product space.
A complete orthonormal basis is an orthonormal family with dense linear span.
The Borel sigma-algebra is generated by the open sets.
A Borel probability law is a probability measure on the Borel sigma-algebra.
Facts & Assumptions
Given: Countable Choice, a real Hilbert space , a finite or countable complete orthonormal basis , and two Borel probability measures whose finite-coordinate pushforwards under the maps agree.
Countable Choice is assumed, as required by the Parseval supplier. The Axiom of Countable Choice ()
Each coordinate map is a continuous linear functional by Cauchy–Schwarz; continuous maps have Borel preimages of Borel sets; the inner-product norm satisfies the triangle inequality; a Borel probability law is a probability measure on the Borel sigma-algebra. Hilbert space Cauchy–Schwarz: , with equality exactly for dependent pairs A continuous map has Borel preimages of Borel sets The induced length is a norm A norm on a real vector space, the induced metric, and the dictionary with the metric axioms The Borel sigma-algebra of a topological space Borel probability law on a polish space Probability measures and probability spaces
For a complete orthonormal family in a Hilbert space, Countable Choice implies Parseval's identity for every . Parseval equivalences for an orthonormal family
The rationals are countable and dense in the reals, finite products of at most countable sets are at most countable, and under Countable Choice a countable union of at most countable sets is at most countable. is countably infinite Both and are dense in , and every nonempty open subset of is uncountable A product of two at most countable sets is at most countable Every subset of an at most countable set is at most countable Countable unions of at most countable sets, assuming
Finite measures agreeing on a generating pi-system and on the whole space agree on the generated sigma-algebra. Finite measures agreeing on a generating pi-system and on the whole space are equal
The norm topology is the induced metric topology: every open set contains a metric ball about each of its points, and positive-radius metric balls are open. Open ball, closed ball and sphere in a metric space The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
Finite sums, products, and lattice operations of Borel real functions are Borel measurable. Arithmetic and lattice operations preserve measurability whenever they are defined
Proof
Given: The hypotheses in the Statement.
If , then it has only one Borel probability measure and the conclusion holds. Otherwise, let be the family of all finite coordinate cylinder sets , where is finite and is Borel. Each cylinder is Borel by continuity in [F1]. The family contains , and the intersection of two cylinders is the finite-coordinate cylinder obtained on the union of their index sets. Hence is a pi-system.
Enumerate the basis if it is infinite, and in the finite case repeat the last partial sum after all basis vectors have appeared. For and , put . By [F2], , so Indeed, if , choose a rational strictly between these two numbers; conversely, membership in one intersection gives . By [F1] and [F6], each is Borel, and is a cylinder over a Borel subset of . Thus every open ball belongs to .
Let be the set of all finite rational linear combinations of basis vectors. If the basis is finite, is at most countable by [F3]. If it is countably infinite, enumerate it and write as the union over of the sets of rational linear combinations of the first vectors. Each of those sets is at most countable by [F3], so their union is at most countable by the Countable Choice clause of [F3]. The real span of the basis is dense by completeness. Each finite real linear combination is approximated by a rational one: approximate each of its finitely many coefficients by a rational and use the triangle inequality and . Thus is dense in . By definition, this makes separable. Separability: the existence of an at most countable dense subset The balls with and positive rational form an at most countable family by [F3], and they are open by [F5]. They are a base: given with open, choose with , then with , and a rational with . The triangle inequality gives . By step 2.1 every such ball lies in , so every open set, as a union of a subfamily of this countable base, lies in .
Every coordinate map is continuous by [F1], so . Step 3.1 and the definition of the Borel sigma-algebra give the reverse inclusion. Thus .
The assumed equality of finite-coordinate measures makes and agree on every cylinder in . They are probability measures, so they agree on as well. The pi-system generates by step 4.1; [F4] therefore gives .
Prior-preserving Crank–Nicolson sampler
Definition
Assume the Axiom of Choice. Let be a separable real Hilbert space, let be a centered Borel Gaussian probability measure on , let be Borel with , and let be Borel. Assume the evidence
satisfies . Extend the potential to all of by setting for and for , and define the target probability . For a scale , write . At state , draw independently and propose . Set the acceptance probability to if either or is , and otherwise set
Draw an independent uniform random variable on and move to if it is at most ; otherwise remain at . The resulting one-step transition rule is the prior-preserving Crank–Nicolson, or pCN, rule . States with infinite potential are absorbing under this total definition; they have -measure zero.
Definition references
The pCN accept-reject procedure defines a probability kernel
Statement
Under the inputs and instructions of the prior-preserving Crank–Nicolson algorithm, for every its proposal rule is a Borel probability kernel and its accept-reject transition is a Borel probability kernel on .
Statement references
Facts & Assumptions
Given: The inputs of Prior-preserving Crank–Nicolson sampler, a scale , the proposal , and the acceptance function specified there.
The algorithm supplies Borel and , extends by off , proposes with independent , and sets acceptance to zero when either potential value is infinite. Prior-preserving Crank–Nicolson sampler
A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel
Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the source point. Measurability of integration against a kernel
For a measure and nonnegative measurable function , the set function is a measure. The indefinite integral of a nonnegative measurable function is a measure
The preimage of a Borel set under a continuous map is Borel. A continuous map has Borel preimages of Borel sets
Since is separable by the algorithm, let be a countable dense subset. The norm topology is the induced metric topology, whose positive-radius balls are open; the norm balls with centers in and positive rational radii are countable and form a base: if with open, choose with , then choose with and a rational with ; the triangle inequality gives . Thus is second-countable. The Borel sigma- algebra on therefore equals . Prior-preserving Crank–Nicolson sampler Separability: the existence of an at most countable dense subset Second countability: an at most countable basis for the topology A product of two at most countable sets is at most countable is countably infinite The rationals embed densely in the reals A norm on a real vector space, the induced metric, and the dictionary with the metric axioms Open ball, closed ball and sphere in a metric space The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed Every subset of an at most countable set is at most countable Borel sigma-algebra of a product of second-countable spaces
Composing a measurable function with a Borel scalar function preserves measurability; the real exponential is continuous by the supplied smoothness result, and finite arithmetic and lattice operations preserve measurability. Composition with a Borel measurable outer map preserves measurability The exponential function is strictly increasing Arithmetic and lattice operations preserve measurability whenever they are defined
Proof
Given: The hypotheses and algorithm inputs in the Statement.
For each Borel set in the extended potential range, the preimage is the union of and when , and is just otherwise. Since is Borel and is Borel on the trace Borel structure of , every such preimage is Borel in . Thus the extended potential used by the algorithm is Borel.
Write and define for Borel . For fixed , this is the pushforward of the probability under the continuous map , so it is a probability measure in . The joint map is continuous; by [F6], its Borel preimages are product-measurable for . Hence is product-measurable. The constant kernel is a probability kernel, so [F3] makes measurable. Therefore is a probability kernel by [F2].
The finite-potential set is Borel by step 1.1. The coordinate projections on are continuous and hence Borel by [F5]; [F6] identifies their source Borel sigma-algebra with the product sigma-algebra. Composing them with the Borel makes and Borel. On their difference is real- valued and Borel, and [F7] makes its exponential Borel. Extending by off therefore makes the algorithm's a Borel function with values in . Put . By [F3], is measurable; the probability rows of give .
For each and Borel , define The first term is a measure in by [F4] and step 2.1. The second term is also a measure: among any pairwise-disjoint sequence of sets, at most one contains , so the indicator of their union is the sum of their indicators at . Their sum has total mass . For fixed , the first term is measurable in by [F3], and the second is measurable because both and are measurable. Thus is a probability kernel by [F2].
Steps 1.1, 1.2, 2.1, and 3.1 establish that the potential extension, the proposal, the acceptance function, and the accept-reject transition have the claimed Borel and probability properties.
The pCN Gaussian reference pair law is symmetric
Statement
Assume the Axiom of Choice. Let be a separable real Hilbert space and let be a centered Borel Gaussian probability measure on . Let and be independent random elements with law . For , set and . The joint Borel law of on is unchanged by the coordinate swap .
Statement references
The pCN proposal combines the current state with an independent Gaussian reference draw.
A real Hilbert space is complete for the norm induced by its inner product.
A separable space has an at most countable dense subset.
The continuous dual consists of bounded linear functionals.
Independent random elements generate independent sigma-algebras.
The law of a random element is the pushforward probability on its measurable target.
Facts & Assumptions
Given: AC, a separable real Hilbert space , a centered Borel Gaussian probability on , independent , and with .
AC is assumed. The Axiom of Choice
The algorithm's proposal is with an independent . Prior-preserving Crank–Nicolson sampler
A separable Hilbert space has a finite or countable complete orthonormal basis. A countable dense subset, its product with itself, and the product with the positive rationals are at most countable; the positive rationals are dense in the reals. Separability: the existence of an at most countable dense subset A nonempty set is at most countable iff it is a surjective image of A Hilbert space with a dense sequence has a finite or countable orthonormal basis A product of two at most countable sets is at most countable is countably infinite The rationals embed densely in the reals Every subset of an at most countable set is at most countable A norm on a real vector space, the induced metric, and the dictionary with the metric axioms Open ball, closed ball and sphere in a metric space The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
denotes the continuous dual, and every continuous linear functional of a centered Borel Gaussian random element has a centered real normal law. The dual space X^* of a normed space and its dual norm Centered Borel Gaussian random element on a separable Banach space
A centered Borel Gaussian random element in a separable Banach space has finite moments of every polynomial order by Fernique exponential-square integrability. Fernique integrability for a separable Banach Gaussian law
Independent random elements have the product of their marginal laws as their joint law. Each continuous linear functional is Borel measurable, so applying such functionals separately to independent random elements preserves independence. Independence is independence of the sigma-algebras generated by the random elements. Independent random elements Independent random elements have product joint law A continuous map has Borel preimages of Borel sets Measurable coordinatewise functions preserve independence
For independent scalar normal variables, the characteristic function of a finite linear combination is the product of the scalar normal characteristic functions; uniqueness of characteristic functions then makes the combination normal, including when its variance is zero. Characteristic functions under affine maps and independent sums Characteristic function of a normal law Uniqueness of a law from its characteristic function
A finite-dimensional normal law is determined by its mean and covariance, including in the singular case. Multivariate normal law, including singular covariance Characteristic function of a multivariate normal law
Under AC's consequence Countable Choice, two Borel probabilities on a separable Hilbert space with the same finite coordinate laws in a complete orthonormal basis are equal. AC implies DC implies countable choice Borel laws on a separable Hilbert space are determined by basis coordinates
For independent integrable real random variables, expectations of their products factor; covariance is the expectation of the product of centered variables, and expectation is linear on integrable functions. Expectations factor over finite products of independent random variables Moments, variance, and covariance on a probability space The Lebesgue integral is linear on
For second-countable spaces, the Borel sigma-algebra on the product equals the product sigma-algebra, which is generated by measurable rectangles. Second countability: an at most countable basis for the topology The product sigma-algebra and its finite iterates Borel sigma-algebra of a product of second-countable spaces Law or distribution of a random element
Proof
Given: The hypotheses in the Statement.
By [F2], take a finite or countable complete orthonormal basis of . Give the inner product . Its induced norm is . It is complete because a Cauchy sequence has Cauchy coordinate sequences in , whose limits in give its product limit. Thus this is a Hilbert space. The family is orthonormal, and any vector orthogonal to every listed vector has both components orthogonal to every , hence both components are zero by completeness; it is a complete orthonormal basis. Let be countable and dense. The balls with and positive rational form a countable base for : for open, choose with , then with and rational with . Thus is second-countable. Then is countable by [F2] and dense, since each coordinate of a pair can be approximated within to make the product norm error less than . Balls with centers in and positive rational radii form a countable base: for in an open set choose with contained there, then a center with and rational with give . Thus is second-countable, and [F10] identifies its Borel sigma-algebra with the product Borel sigma-algebra. Since and are Borel random elements, the pair is measurable into the product sigma-algebra: the preimage of each measurable rectangle is the intersection of the two coordinate preimages, and rectangles generate the product sigma-algebra. Continuous addition and scalar multiplication then make and Borel random elements of . Their Borel laws are therefore defined.
Fix a finite list of continuous linear functionals on . Each has the form , because its restrictions to the two coordinate subspaces sum to the functional. Any real linear combination of the listed projections is another such functional. Under that combination is ; under it is . By [F3], the two summands in each display are centered normal, and [F5] makes them independent; [F6] makes their sum normal, including a zero coefficient. Hence every finite projection vector under either pair is multivariate normal by the projection definition in [F7], with zero mean.
Define the symmetric covariance form . These products are integrable: [F4] gives finite second moments of , boundedness of gives finite second moments of their evaluations, and . The same argument applies to evaluations of . For functionals and , the projection under is . Independence and centering make its mixed covariance terms zero by [F9], so its covariance with the corresponding projection for is using . Under the projections are and ; expansion gives the same expression because is symmetric. Therefore the finite projection vectors from step 2.1 have equal covariance matrices and zero means.
By [F7], the finite projection laws in step 3.1 are equal, in particular the finite coordinate laws for the product basis from step 1.1. That step also shows that is a separable Hilbert space. By [A1], Countable Choice follows from AC; the coordinate-law result [F8] therefore identifies the two Borel probability laws. Hence .
Step 4.1 is the claimed invariance of the joint law under coordinate swap, for every , including the identity proposal at and the independent-reference proposal at .
pCN stationary mean acceptance tends to one at small scale
Statement
Assume the Axiom of Choice. Let be a separable real Hilbert space and let be a centered Borel Gaussian probability measure on . Let be finite-valued and Borel measurable. Suppose that there are constants such that and for every there is a finite such that Set and . For , let and be independent, put , and define Then , is a probability measure, and the stationary mean acceptance satisfies
Statement references
Facts & Assumptions
Given: The hypotheses in the Statement.
AC is assumed, as required by the centered Borel Gaussian interface and the pCN algorithm. The Axiom of Choice Prior-preserving Crank–Nicolson sampler
The pCN proposal is , and its acceptance for finite potential values is . Prior-preserving Crank–Nicolson sampler
A prior on a full-mass Borel forward domain and a finite continuous potential with a common integrable lower envelope have positive finite evidence and a normalized posterior. A Borel prior concentrated on a forward-map domain Misfit evidence and the potential posterior law Function-space posterior propriety from a common lower envelope
A centered Borel Gaussian random element in a separable Banach space has for some ; a centered Borel Gaussian probability on is realized by the identity random element on . Centered Borel Gaussian random element on a separable Banach space Fernique integrability for a separable Banach Gaussian law
If a nonnegative measurable function has integral zero, it vanishes almost everywhere; integrating on a measurable set is integrating its indicator times the function. A nonnegative measurable function has integral exactly when it vanishes almost everywhere Integral over a measurable subset
If measurable functions converge pointwise and are dominated in absolute value by one integrable function, their integrals converge to the integral of the pointwise limit. Dominated convergence
Since is separable, countable dense and positive rational radii give a countable base of open norm balls in its induced metric topology: for with open, choose with , then with and a rational with ; then . Thus is second-countable and . The law notation in the Statement makes and Borel random elements; the pair is measurable into the product sigma-algebra because inverse images of measurable rectangles are intersections of measurable coordinate events. For each , is continuous, so is Borel; composing with the Borel and the continuous scalar operations shows and are measurable. Separability: the existence of an at most countable dense subset Second countability: an at most countable basis for the topology The product sigma-algebra and its finite iterates Law or distribution of a random element Independent random elements A product of two at most countable sets is at most countable is countably infinite The rationals embed densely in the reals A norm on a real vector space, the induced metric, and the dictionary with the metric axioms Open ball, closed ball and sphere in a metric space The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed Every subset of an at most countable set is at most countable Borel sigma-algebra of a product of second-countable spaces A continuous map has Borel preimages of Borel sets Composition with a Borel measurable outer map preserves measurability Arithmetic and lattice operations preserve measurability whenever they are defined The exponential function is strictly increasing
Proof
Given: The hypotheses and definitions in the Statement.
Apply [F2] with parameter space , domain , one-point data space , potential , and envelope . The domain has full -mass. For any , choose ; all sufficiently close satisfy , so the stated Lipschitz bound proves continuity at . Also . Hence and is a probability. The density is strictly positive everywhere. If , then , so [F4] gives -almost everywhere; strict positivity yields . Conversely, implies directly from the integral formula. Thus and are equivalent.
Fix any sequence with . For every realization with , and Choose for that realization. Eventually , and the assumed ball-wise Lipschitz bound gives Therefore almost surely. Its measurability, and that of , was established in [F6].
View the identity map on as a centered Borel Gaussian random element. By [F3], there is such that . For every , the function is bounded on , so . Since and , The same Gaussian moment bound gives for every .
The growth bound and imply where the last inequality follows from for (use and ), with . By step 2.1 the right side is integrable and does not depend on . Applying [F5] to the measurable sequence from [F6] and step 1.2 gives .
The scalar function is continuous and . Step 1.2 therefore implies almost surely. Since , [F5] with the integrable dominating constant yields . The sequence was arbitrary, so the sequential criterion for real limits proves . This is the stationary mean acceptance limit; it asserts no convergence or mixing rate for the resulting chain.
The pCN accept-reject kernel preserves the posterior
Statement
Assume the Axiom of Choice and the inputs of the prior-preserving Crank–Nicolson algorithm: a separable real Hilbert space , centered Borel Gaussian reference probability , full-mass Borel domain , Borel potential , positive finite evidence , and scale . Let be the normalized target on obtained by extending by off , and let be the algorithm's accept-reject transition. Then is reversible with respect to : its joint flow is unchanged by for every Borel . Consequently, is invariant: This conclusion gives invariance only; it does not assert uniqueness, convergence, mixing, an effective-sample-size bound, mesh-independent cost, or correctness of an approximate forward solver.
Statement references
The pCN target, total potential extension, proposal, and accept-reject transition.
Reversibility means symmetry of the joint flow measure under coordinate swap.
A symmetric joint flow implies invariance of its probability target.
The Gaussian pCN proposal pair law under the reference probability is symmetric.
Facts & Assumptions
Given: The algorithm inputs in the Statement.
The Axiom of Choice and the algorithm's full-mass domain, potential extension, evidence, target density, proposal, and acceptance convention. The Axiom of Choice Prior-preserving Crank–Nicolson sampler
The proposal rule and accept-reject rule are Borel probability kernels; for each , where . The pCN accept-reject procedure defines a probability kernel
If , then , when , and if either potential is infinite. Prior-preserving Crank–Nicolson sampler Misfit evidence and the potential posterior law
For independent with law and , the joint Borel law of is symmetric under coordinate swap; on the separable Hilbert product, the Borel sigma-algebra equals the product sigma-algebra. The pCN Gaussian reference pair law is symmetric Borel sigma-algebra of a product of second-countable spaces
A prior and probability kernel define a joint flow probability measure with the rectangle formula and nonnegative iterated-integral identity. A prior and model kernel define a joint law Measure kernel and probability kernel Probability measures and probability spaces
Equality of probability laws is preserved under measurable changes of variables, and integration against a law equals expectation of the corresponding random-element function. Law or distribution of a random element Change of variables for expectation
The product of two probability measures exists and has the rectangle formula; the rectangle criterion then makes its coordinate projections independent random elements. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique Independent random elements are characterized by finite rectangle probabilities Independent random elements The product sigma-algebra and its finite iterates
A probability kernel is reversible with respect to a probability measure when its joint flow equals its coordinate transpose; this definition requires no density. General-state reversibility by symmetric flow measure
Reversibility with respect to a probability measure implies its invariance. General-state reversibility implies invariance
Since is separable, norm balls centered at a countable dense subset with positive rational radii form a countable base of its induced metric topology: given with open, choose with , then a dense point with and a positive rational with ; the triangle inequality gives . Hence is second-countable, and the Borel sigma-algebra of equals . Separability: the existence of an at most countable dense subset Second countability: an at most countable basis for the topology A product of two at most countable sets is at most countable is countably infinite The rationals embed densely in the reals Every subset of an at most countable set is at most countable Hilbert space A norm on a real vector space, the induced metric, and the dictionary with the metric axioms Open ball, closed ball and sphere in a metric space The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed Borel sigma-algebra of a product of second-countable spaces
Continuous maps have Borel preimages of Borel sets. A continuous map has Borel preimages of Borel sets
Proof
Given: The hypotheses and notation in the Statement.
AC is assumed as recorded in [A1]. By [F9], is second-countable and the Borel sigma-algebra of is the product sigma-algebra. Put and let be the joint flow of the reference probability and proposal kernel. It exists by [F4]. Take the product probability space and its coordinate random elements ; [F6] gives their independence and common law . For every nonnegative product-Borel , the iterated-integral identity in [F4] and [F1] give where the proposal-row pushforward and the change-of-variables identity [F5] identify the flow integral with expectation under , and the product joint law [F6] together with the measurable proposal map identifies that expectation with the displayed one. Thus is the law in [F3], so is symmetric.
Define and . For every , if both potential values are finite, then If either value is , the algorithm sets and , so the identity still holds. In particular, is a symmetric nonnegative Borel function.
Set . The diagonal map is continuous from into the product topology on , so by [F10] it is Borel. Thus is measurable for every Borel . By the diagonal term in [F1] and the joint-flow formula [F4], the rejection part of the target joint flow has mass on It is symmetric because for every : for every Borel , .
For Borel , the accepted part of the target joint flow is The equality follows from the target density in [F2], identity 1.2, and the iterated-integral formula [F4]. Since is symmetric by step 1.1 and , this accepted measure is symmetric. Indeed, for , the change-of-variables identity [F5] gives Equality for every Borel is symmetry under .
By the decomposition of in [F1] and the joint-flow identity [F4], . The accepted and rejection pieces are symmetric by steps 2.1 and 1.3, hence is symmetric. By [F7], is reversible with respect to .
The hypotheses of [F8] hold: [F1] gives a probability kernel and the algorithm gives the probability measure . Therefore [F8] yields for every Borel . The proof uses only the symmetric-flow identity; it establishes no uniqueness or convergence claim.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Gerald Teschl, Topics in Real and Functional Analysis, §2.1, Theorems 2.3–2.4
- S. L. Cotter, G. O. Roberts, A. M. Stuart, and D. White, MCMC Methods for Functions: Modifying Old Algorithms to Make Them Faster, Statistical Science 28(3) (2013)
- Yury Korolev and Jonas Latz, Inverse Problems: Lecture Notes, Michaelmas Term 2020 (University of Cambridge, 18 May 2021)
- M. Hairer, A. M. Stuart, and S. J. Vollmer, Spectral gaps for a Metropolis–Hastings algorithm in infinite dimensions, Annals of Applied Probability 24(6) (2014)
- G. O. Roberts and J. S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, Probability Surveys 1 (2004)