Alphabeta Math
Pipeline-generated
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

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Borel laws on a separable Hilbert space are determined by basis coordinates

Statement

Assume the Axiom of Countable Choice. Let H be a real Hilbert space with a finite or countable complete orthonormal basis (ej)j∈J. For each finite F⊆J, define the coordinate map πF:H→RF by πF(x)=(⟨x,ej⟩)j∈F. If ν and ν′ are Borel probability measures on H and ν(πF−1(B))=ν′(πF−1(B)) for every finite F⊆J and every Borel B⊆RF, then ν=ν′.

Facts & Assumptions

Given: Countable Choice, a real Hilbert space H, a finite or countable complete orthonormal basis (ej)j∈J, and two Borel probability measures ν,ν′ whose finite-coordinate pushforwards under the maps πF agree.

[A1]

Countable Choice is assumed, as required by the Parseval supplier. The Axiom of Countable Choice (ACω)

[F1]

Each coordinate map x↦⟨x,ej⟩ 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: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, 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

[F2]

For a complete orthonormal family in a Hilbert space, Countable Choice implies Parseval's identity ∥x∥2=∑j∣⟨x,ej⟩∣2 for every x∈H. Parseval equivalences for an orthonormal family

[F3]

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. Q is countably infinite Both Q and R∖Q are dense in R, and every nonempty open subset of R 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 ACω

[F4]

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

[F6]

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.

1.1F1givenconstruct

If H={0}, then it has only one Borel probability measure and the conclusion holds. Otherwise, let C be the family of all finite coordinate cylinder sets πF−1(B), where F⊆J is finite and B⊆RF is Borel. Each cylinder is Borel by continuity in [F1]. The family contains H, and the intersection of two cylinders is the finite-coordinate cylinder obtained on the union of their index sets. Hence C is a pi-system.

2.1A1F1F2F3F6step 1.1chooseconstruct

Enumerate the basis if it is infinite, and in the finite case repeat the last partial sum after all basis vectors have appeared. For x0∈H and r>0, put SN(x)=∑j≤N∣⟨x−x0,ej⟩∣2. By [F2], ∥x−x0∥2=sup⁡NSN(x), so B(x0,r)=⋃q∈Q0≤q<r2 ⋂N≥1{x:SN(x)≤q}. Indeed, if ∥x−x0∥2<r2, choose a rational strictly between these two numbers; conversely, membership in one intersection gives ∥x−x0∥2≤q<r2. By [F1] and [F6], each SN is Borel, and {SN≤q} is a cylinder over a Borel subset of RF. Thus every open ball belongs to σ(C).

3.1F3F5step 2.1chooseconstruct

Let D be the set of all finite rational linear combinations of basis vectors. If the basis is finite, D is at most countable by [F3]. If it is countably infinite, enumerate it and write D as the union over N of the sets of rational linear combinations of the first N 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 ∥ej∥=1. Thus D is dense in H. By definition, this makes H separable. Separability: the existence of an at most countable dense subset The balls B(d,s) with d∈D and positive rational s form an at most countable family by [F3], and they are open by [F5]. They are a base: given x∈U with U open, choose r>0 with B(x,r)⊆U, then d∈D with ∥d−x∥<r/3, and a rational s with ∥d−x∥<s<r−∥d−x∥. The triangle inequality gives x∈B(d,s)⊆B(x,r)⊆U. By step 2.1 every such ball lies in σ(C), so every open set, as a union of a subfamily of this countable base, lies in σ(C).

4.1F1F3step 3.1

Every coordinate map is continuous by [F1], so σ(C)⊆B(H). Step 3.1 and the definition of the Borel sigma-algebra give the reverse inclusion. Thus σ(C)=B(H).

5.1F4step 1.1step 4.1given∎

The assumed equality of finite-coordinate measures makes ν and ν′ agree on every cylinder in C. They are probability measures, so they agree on H as well. The pi-system C generates B(H) by step 4.1; [F4] therefore gives ν=ν′.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Prior-preserving Crank–Nicolson sampler

Definition

Assume the Axiom of Choice. Let H be a separable real Hilbert space, let μ0 be a centered Borel Gaussian probability measure on H, let D⊆H be Borel with μ0(D)=1, and let ΦD:D→(−∞,+∞] be Borel. Assume the evidence

Z:=∫De−ΦD(u) μ0(du)

satisfies 0<Z<∞. Extend the potential to all of H by setting Φˉ(u)=ΦD(u) for u∈D and Φˉ(u)=+∞ for u∉D, and define the target probability μ(du)=Z−1e−Φˉ(u)μ0(du). For a scale β∈[0,1], write ρ=1−β2. At state u∈H, draw ξ∼μ0 independently and propose v=ρu+βξ. Set the acceptance probability to 0 if either Φˉ(u) or Φˉ(v) is +∞, and otherwise set

α(u,v)=min⁡{1,exp⁡(Φˉ(u)−Φˉ(v))}.

Draw an independent uniform random variable on [0,1] and move to v if it is at most α(u,v); otherwise remain at u. The resulting one-step transition rule is the prior-preserving Crank–Nicolson, or pCN, rule Pβ. States with infinite potential are absorbing under this total definition; they have μ-measure zero.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The pCN accept-reject procedure defines a probability kernel

Statement

Under the inputs and instructions of the prior-preserving Crank–Nicolson algorithm, for every β∈[0,1] its proposal rule is a Borel probability kernel and its accept-reject transition Pβ is a Borel probability kernel on H.

Facts & Assumptions

Given: The inputs of Prior-preserving Crank–Nicolson sampler, a scale β∈[0,1], the proposal v=1−β2u+βξ, and the acceptance function specified there.

[F1]

The algorithm supplies Borel D and ΦD, extends ΦD by +∞ off D, proposes ρu+βξ with independent ξ∼μ0, and sets acceptance to zero when either potential value is infinite. Prior-preserving Crank–Nicolson sampler

[F2]

A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel

[F3]

Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the source point. Measurability of integration against a kernel

[F4]

For a measure λ and nonnegative measurable function f, the set function A↦∫Af dλ is a measure. The indefinite integral of a nonnegative measurable function is a measure

[F5]

The preimage of a Borel set under a continuous map is Borel. A continuous map has Borel preimages of Borel sets

[F6]

Since H is separable by the algorithm, let D 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 D and positive rational radii are countable and form a base: if x∈U with U open, choose r>0 with B(x,r)⊆U, then choose d∈D with ∥d−x∥<r/3 and a rational s with ∥d−x∥<s<r−∥d−x∥; the triangle inequality gives x∈B(d,s)⊆U. Thus H is second-countable. The Borel sigma- algebra on H×H therefore equals B(H)⊗B(H). 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 Q 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

[F7]

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.

1.1F1givenalgebra

For each Borel set B in the extended potential range, the preimage Φˉ−1(B) is the union of D∩ΦD−1(B) and H∖D when +∞∈B, and is just D∩ΦD−1(B) otherwise. Since D is Borel and ΦD is Borel on the trace Borel structure of D, every such preimage is Borel in H. Thus the extended potential used by the algorithm is Borel.

1.2F1F2F3F5F6givenconstruct

Write ρ=1−β2 and define Qβ(u,B)=∫H1B(ρu+βz) μ0(dz) for Borel B⊆H. For fixed u, this is the pushforward of the probability μ0 under the continuous map z↦ρu+βz, so it is a probability measure in B. The joint map (u,z)↦ρu+βz is continuous; by [F6], its Borel preimages are product-measurable for B(H)⊗B(H). Hence (u,z)↦1B(ρu+βz) is product-measurable. The constant kernel u↦μ0 is a probability kernel, so [F3] makes u↦Qβ(u,B) measurable. Therefore Qβ is a probability kernel by [F2].

2.1F1F2F3F5F6F7step 1.1step 1.2given

The finite-potential set E={u:Φˉ(u)<+∞} is Borel by step 1.1. The coordinate projections on H×H 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 (u,v)↦Φˉ(u) and (u,v)↦Φˉ(v) Borel. On E×E their difference is real- valued and Borel, and [F7] makes its exponential Borel. Extending min⁡{1,exp⁡(Φˉ(u)−Φˉ(v))} by 0 off E×E therefore makes the algorithm's α a Borel function with values in [0,1]. Put a(u)=∫Hα(u,v)Qβ(u,dv). By [F3], a is measurable; the probability rows of Qβ give 0≤a(u)≤1.

3.1F2F3F4step 2.1constructalgebra

For each u and Borel A⊆H, define Pβ(u,A)=∫Aα(u,v)Qβ(u,dv)+1A(u)(1−a(u)). The first term is a measure in A by [F4] and step 2.1. The second term is also a measure: among any pairwise-disjoint sequence of sets, at most one contains u, so the indicator of their union is the sum of their indicators at u. Their sum has total mass a(u)+1−a(u)=1. For fixed A, the first term is measurable in u by [F3], and the second is measurable because both 1A(u) and a(u) are measurable. Thus Pβ is a probability kernel by [F2].

4.1step 1.1step 1.2step 2.1step 3.1∎

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The pCN Gaussian reference pair law is symmetric

Statement

Assume the Axiom of Choice. Let H be a separable real Hilbert space and let μ0 be a centered Borel Gaussian probability measure on H. Let U and ξ be independent random elements with law μ0. For β∈[0,1], set ρ=1−β2 and V=ρU+βξ. The joint Borel law of (U,V) on H×H is unchanged by the coordinate swap (u,v)↦(v,u).

Facts & Assumptions

Given: AC, a separable real Hilbert space H, a centered Borel Gaussian probability μ0 on H, independent U,ξ∼μ0, and ρ2+β2=1 with 0≤β≤1.

[A1]

AC is assumed. The Axiom of Choice

[F1]

The algorithm's proposal is V=ρU+βξ with an independent ξ∼μ0. Prior-preserving Crank–Nicolson sampler

[F3]

H∗ 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

[F4]

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

[F5]

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

[F6]

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

[F7]

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

[F8]

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

[F9]

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 L1(μ)

[F10]

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.

1.1F2F10givenconstruct

By [F2], take a finite or countable complete orthonormal basis (ej) of H. Give H×H the inner product ⟨(u,v),(x,y)⟩×=⟨u,x⟩+⟨v,y⟩. Its induced norm is ∥u∥2+∥v∥2. It is complete because a Cauchy sequence has Cauchy coordinate sequences in H, whose limits in H give its product limit. Thus this is a Hilbert space. The family (ej,0),(0,ej) is orthonormal, and any vector orthogonal to every listed vector has both components orthogonal to every ej, hence both components are zero by completeness; it is a complete orthonormal basis. Let D⊆H be countable and dense. The balls B(d,s) with d∈D and positive rational s form a countable base for H: for x∈U open, choose r>0 with B(x,r)⊆U, then d∈D with ∥d−x∥<r/3 and rational s with ∥d−x∥<s<r−∥d−x∥. Thus H is second-countable. Then D×D is countable by [F2] and dense, since each coordinate of a pair can be approximated within ε/2 to make the product norm error less than ε. Balls with centers in D×D and positive rational radii form a countable base: for z in an open set choose r>0 with B(z,r) contained there, then a center d with ∥d−z∥<r/3 and rational s with ∥d−z∥<s<r−∥d−z∥ give z∈B(d,s)⊆B(z,r). Thus H×H is second-countable, and [F10] identifies its Borel sigma-algebra with the product Borel sigma-algebra. Since U and ξ are Borel random elements, the pair (U,ξ) 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 (U,V) and (V,U) Borel random elements of H×H. Their Borel laws are therefore defined.

2.1A1F1F3F5F6F7step 1.1given

Fix a finite list of continuous linear functionals on H×H. Each has the form (u,v)↦ℓ(u)+m(v), 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 (U,V) that combination is (ℓ+ρm)(U)+βm(ξ); under (V,U) it is (ρℓ+m)(U)+βℓ(ξ). 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.

3.1F3F4F5F9step 2.1givenalgebra

Define the symmetric covariance form Γ(ℓ,m)=E[ℓ(U)m(U)]. These products are integrable: [F4] gives finite second moments of ∥U∥, boundedness of ℓ,m gives finite second moments of their evaluations, and ∣ab∣≤(a2+b2)/2. The same argument applies to evaluations of ξ. For functionals (ℓ,m) and (ℓ′,m′), the projection under (U,V) is (ℓ+ρm)(U)+βm(ξ). Independence and centering make its mixed covariance terms zero by [F9], so its covariance with the corresponding projection for (ℓ′,m′) is Γ(ℓ,ℓ′)+ρΓ(ℓ,m′)+ρΓ(m,ℓ′)+Γ(m,m′), using ρ2+β2=1. Under (V,U) the projections are (ρℓ+m)(U)+βℓ(ξ) and (ρℓ′+m′)(U)+βℓ′(ξ); expansion gives the same expression because Γ is symmetric. Therefore the finite projection vectors from step 2.1 have equal covariance matrices and zero means.

4.1A1F7F8step 1.1step 3.1

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 H×H 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 Law⁡(U,V)=Law⁡(V,U).

5.1step 4.1given∎

Step 4.1 is the claimed invariance of the joint law under coordinate swap, for every β∈[0,1], including the identity proposal at β=0 and the independent-reference proposal at β=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

pCN stationary mean acceptance tends to one at small scale

Statement

Assume the Axiom of Choice. Let H be a separable real Hilbert space and let μ0 be a centered Borel Gaussian probability measure on H. Let Φ:H→[0,∞) be finite-valued and Borel measurable. Suppose that there are constants p,K>0 such that 0≤Φ(u)≤K(1+∥u∥p)(u∈H), and for every R>0 there is a finite LR such that ∣Φ(u)−Φ(v)∣≤LR∥u−v∥whenever max⁡{∥u∥,∥v∥}<R. Set Z=∫He−Φ(u) μ0(du) and μ(du)=Z−1e−Φ(u)μ0(du). For β∈[0,1], let U∼μ and ξ∼μ0 be independent, put Vβ=1−β2U+βξ, and define αβ=min⁡{1,exp⁡(Φ(U)−Φ(Vβ))}. Then 0<Z<∞, μ is a probability measure, and the stationary mean acceptance satisfies lim⁡β↓0E[αβ]=1.

Facts & Assumptions

Given: The hypotheses in the Statement.

[A1]

AC is assumed, as required by the centered Borel Gaussian interface and the pCN algorithm. The Axiom of Choice Prior-preserving Crank–Nicolson sampler

[F1]

The pCN proposal is Vβ=1−β2U+βξ, and its acceptance for finite potential values is min⁡{1,exp⁡(Φ(U)−Φ(Vβ))}. Prior-preserving Crank–Nicolson sampler

[F2]

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

[F3]

A centered Borel Gaussian random element in a separable Banach space has Eea∥X∥2<∞ for some a>0; a centered Borel Gaussian probability on H is realized by the identity random element on (H,B(H),μ0). Centered Borel Gaussian random element on a separable Banach space Fernique integrability for a separable Banach Gaussian law

[F4]

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 0 exactly when it vanishes almost everywhere Integral over a measurable subset

[F5]

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

[F6]

Since H is separable, countable dense D⊆H and positive rational radii give a countable base of open norm balls in its induced metric topology: for x∈U with U open, choose r>0 with B(x,r)⊆U, then d∈D with ∥d−x∥<r/3 and a rational s with ∥d−x∥<s<r−∥d−x∥; then x∈B(d,s)⊆B(x,r). Thus H is second-countable and B(H×H)=B(H)⊗B(H). The law notation in the Statement makes U and ξ Borel random elements; the pair (U,ξ) is measurable into the product sigma-algebra because inverse images of measurable rectangles are intersections of measurable coordinate events. For each β, (u,z)↦1−β2u+βz is continuous, so Vβ is Borel; composing with the Borel Φ and the continuous scalar operations shows Δβ=Φ(Vβ)−Φ(U) and αβ=min⁡{1,e−Δβ} 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 Q 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.

1.1F2F4givenconstruct

Apply [F2] with parameter space H, domain D=H, one-point data space {∗}, potential Φ~(u,∗)=Φ(u), and envelope M1=0. The domain has full μ0-mass. For any u∈H, choose R>∥u∥; all sufficiently close v satisfy max⁡{∥u∥,∥v∥}<R, so the stated Lipschitz bound proves continuity at u. Also ∫HeM1(∥u∥) μ0(du)=1. Hence 0<Z<∞ and μ is a probability. The density e−Φ is strictly positive everywhere. If μ(A)=0, then ∫He−Φ1A dμ0=0, so [F4] gives e−Φ1A=0 μ0-almost everywhere; strict positivity yields μ0(A)=0. Conversely, μ0(A)=0 implies μ(A)=0 directly from the integral formula. Thus μ and μ0 are equivalent.

1.2F1F6givenchoosealgebra

Fix any sequence βn∈[0,1] with βn→0. For every realization with U,ξ∈H, ρn:=1−βn2→1 and ∥Vβn−U∥≤∣1−ρn∣∥U∥+βn∥ξ∥⟶0. Choose R>∥U∥+1 for that realization. Eventually max⁡{∥U∥,∥Vβn∥}<R, and the assumed ball-wise Lipschitz bound gives ∣Φ(Vβn)−Φ(U)∣≤LR∥Vβn−U∥⟶0. Therefore Δn:=Φ(Vβn)−Φ(U)→0 almost surely. Its measurability, and that of αβn, was established in [F6].

2.1A1F3step 1.1givenalgebra

View the identity map x↦x on (H,B(H),μ0) as a centered Borel Gaussian random element. By [F3], there is a>0 such that ∫Hea∥x∥2 μ0(dx)<∞. For every q>0, the function r↦rqe−ar2 is bounded on [0,∞), so ∫H∥x∥q μ0(dx)<∞. Since e−Φ≤1 and Z>0, E∥U∥q=Z−1∫H∥x∥qe−Φ(x) μ0(dx)≤Z−1∫H∥x∥q μ0(dx)<∞. The same Gaussian moment bound gives E∥ξ∥q<∞ for every q>0.

3.1F5F6step 2.1step 1.2givenalgebra

The growth bound and ∥Vβn∥≤∥U∥+∥ξ∥ imply ∣Δn∣≤2K+K∥U∥p+K(∥U∥+∥ξ∥)p≤Cp,K(1+∥U∥p+∥ξ∥p), where the last inequality follows from (a+b)p≤2p(ap+bp) for a,b≥0 (use a+b≤2max⁡(a,b) and max⁡(a,b)p≤ap+bp), with Cp,K:=max⁡{2K,K(1+2p),K2p}. By step 2.1 the right side is integrable and does not depend on n. Applying [F5] to the measurable sequence ∣Δn∣ from [F6] and step 1.2 gives E∣Δn∣→0.

4.1F5F6step 1.2givenalgebra∎

The scalar function g(t)=min⁡{1,e−t} is continuous and g(0)=1. Step 1.2 therefore implies αβn=g(Δn)→1 almost surely. Since 0≤αβn≤1, [F5] with the integrable dominating constant 1 yields Eαβn→1. The sequence βn→0 was arbitrary, so the sequential criterion for real limits proves lim⁡β↓0E[αβ]=1. This is the stationary mean acceptance limit; it asserts no convergence or mixing rate for the resulting chain.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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 H, centered Borel Gaussian reference probability μ0, full-mass Borel domain D, Borel potential ΦD:D→(−∞,+∞], positive finite evidence Z, and scale β∈[0,1]. Let μ be the normalized target on H obtained by extending ΦD by +∞ off D, and let Pβ be the algorithm's accept-reject transition. Then Pβ is reversible with respect to μ: its joint flow Λβ(C):=∫HPβ(u,Cu) μ(du),Cu:={v∈H:(u,v)∈C}, is unchanged by (u,v)↦(v,u) for every Borel C⊆H×H. Consequently, μ is invariant: ∫HPβ(u,A) μ(du)=μ(A)(A∈B(H)). 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.

Facts & Assumptions

Given: The algorithm inputs in the Statement.

[A1]

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

[F1]

The proposal rule Qβ and accept-reject rule Pβ are Borel probability kernels; for each u, Qβ(u,B)=∫H1B(ρu+βz) μ0(dz),Pβ(u,A)=∫Aα(u,v)Qβ(u,dv)+1A(u)(1−a(u)), where a(u)=∫Hα(u,v)Qβ(u,dv). The pCN accept-reject procedure defines a probability kernel

[F2]

If w(u)=e−Φˉ(u), then μ(du)=Z−1w(u)μ0(du), w(u)=0 when Φˉ(u)=+∞, and α(u,v)=0 if either potential is infinite. Prior-preserving Crank–Nicolson sampler Misfit evidence and the potential posterior law

[F3]

For U0,ξ independent with law μ0 and V0=ρU0+βξ, the joint Borel law of (U0,V0) 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

[F4]

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

[F5]

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

[F7]

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

[F8]

Reversibility with respect to a probability measure implies its invariance. General-state reversibility implies invariance

[F9]

Since H is separable, norm balls centered at a countable dense subset with positive rational radii form a countable base of its induced metric topology: given x∈U with U open, choose r>0 with B(x,r)⊆U, then a dense point d with ∥d−x∥<r/3 and a positive rational s with ∥d−x∥<s<r−∥d−x∥; the triangle inequality gives x∈B(d,s)⊆U. Hence H is second-countable, and the Borel sigma-algebra of H×H equals B(H)⊗B(H). 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 Q 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

[F10]

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.

1.1A1F1F3F4F5F6givenconstruct

AC is assumed as recorded in [A1]. By [F9], H is second-countable and the Borel sigma-algebra of H×H is the product sigma-algebra. Put ρ=1−β2 and let Λ0(du,dv)=μ0(du)Qβ(u,dv) be the joint flow of the reference probability and proposal kernel. It exists by [F4]. Take the product probability space (H×H,μ0⊗μ0) and its coordinate random elements U0,ξ; [F6] gives their independence and common law μ0. For every nonnegative product-Borel h, the iterated-integral identity in [F4] and [F1] give ∫h dΛ0=∫H∫Hh(u,ρu+βz) μ0(dz) μ0(du)=E[h(U0,ρU0+βξ)], where the proposal-row pushforward and the change-of-variables identity [F5] identify the flow integral with expectation under U0∼μ0, and the product joint law [F6] together with the measurable proposal map identifies that expectation with the displayed one. Thus Λ0 is the law in [F3], so Λ0 is symmetric.

1.2A1F2givenalgebra

Define w(u)=e−Φˉ(u) and m(u,v)=min⁡{w(u),w(v)}. For every (u,v), if both potential values are finite, then w(u)α(u,v)=e−Φˉ(u)min⁡{1,eΦˉ(u)−Φˉ(v)}=min⁡{e−Φˉ(u),e−Φˉ(v)}=m(u,v). If either value is +∞, the algorithm sets α(u,v)=0 and m(u,v)=0, so the identity still holds. In particular, m is a symmetric nonnegative Borel function.

1.3F1F4F10givenalgebra

Set r(u)=1−a(u)∈[0,1]. The diagonal map d(u)=(u,u) is continuous from H into the product topology on H×H, so by [F10] it is Borel. Thus u↦1C(u,u)=1C(d(u)) is measurable for every Borel C⊆H×H. By the diagonal term in [F1] and the joint-flow formula [F4], the rejection part of the target joint flow has mass on C Λrej(C)=∫H1C(u,u)r(u) μ(du). It is symmetric because τ(d(u))=d(u) for every u: for every Borel C, 1τ−1C(u,u)=1C(u,u).

2.1F2F4F5step 1.1step 1.2algebra

For Borel C⊆H×H, the accepted part of the target joint flow is Λacc(C):=∫H∫H1C(u,v)α(u,v)Qβ(u,dv) μ(du)=Z−1∫H×H1C(u,v)m(u,v) Λ0(du,dv). The equality follows from the target density in [F2], identity 1.2, and the iterated-integral formula [F4]. Since Λ0 is symmetric by step 1.1 and m(u,v)=m(v,u), this accepted measure is symmetric. Indeed, for τ(u,v)=(v,u), the change-of-variables identity [F5] gives ∫1C(u,v)m(u,v) dΛ0=∫1C(v,u)m(v,u) dΛ0=∫1τ−1C(u,v)m(u,v) dΛ0. Equality for every Borel C is symmetry under τ.

3.1F1F4F7step 2.1step 1.3given

By the decomposition of Pβ in [F1] and the joint-flow identity [F4], Λβ=Λacc+Λrej. The accepted and rejection pieces are symmetric by steps 2.1 and 1.3, hence Λβ is symmetric. By [F7], Pβ is reversible with respect to μ.

4.1F1F8step 3.1given∎

The hypotheses of [F8] hold: [F1] gives a probability kernel and the algorithm gives the probability measure μ. Therefore [F8] yields ∫HPβ(u,A) μ(du)=μ(A) for every Borel A. The proof uses only the symmetric-flow identity; it establishes no uniqueness or convergence claim.

4 · Examples, counterexamples and false statements

None yet.

Sources