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.

Langevin algorithms: ULA bias and MALA exactness

1 · Prerequisites

2 · Summary

ULA applies a noisy gradient step without correction, while MALA uses the same Gaussian proposal with a Hastings acceptance rule and rejected self-transitions. This page proves the exact Gaussian ULA stationary variance and MALA target invariance. For a twice continuously differentiable potential with globally Lipschitz gradient and the stated superlinear radial drift, it proves existence and uniqueness of each ULA invariant law and a weighted total-variation bias bound of order square root of the step size throughout the specified step-size interval.

Local suppliers establish finite-horizon Brownian change of drift and directional relative entropy, a reversible diffusion density and compact minorization, weighted contraction and invariant existence, and the uniform exponential moments needed by the proof. Every quantitative conclusion retains its explicit hypotheses; the Gaussian example alone does not establish the general bias bound.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Weighted total variation for probability measures

Definition

Let d≥1, let W:Rd→[1,∞) be Borel measurable, and let μ,ν be Borel probability measures on Rd with ∫W dμ<∞ and ∫W dν<∞. Define their W-weighted total-variation distance by ∥μ−ν∥W:=sup⁡f Borel, ∣f∣≤W∣∫f dμ−∫f dν∣. The moment hypotheses make every integral in the supremum finite. This is the signed-measure test-function norm used in weighted-variation bounds. For W≡1 it has the usual factor of two relative to the event-supremum probability distance in Total variation distance for probability laws. Here a Borel probability measure is in the sense of Probability measures and probability spaces, on the Borel sigma-algebra of The Borel sigma-algebra of a topological space.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Radial gradient drift forces potential coercivity

Statement

Let d≥1, U∈C2(Rd), and suppose ∇U is L-Lipschitz for some L>0. Let x⋆ be a global minimizer, normalize U(x⋆)=0, and assume that for some ρ>0, α∈(1,2], and Mρ≥0, ⟨∇U(x),x−x⋆⟩≥ρ∥x−x⋆∥αwhenever ∥x−x⋆∥≥Mρ. Then every x∈Rd satisfies U(x)≥ρα+1∥x−x⋆∥α−aα,aα:=ρMραα+1+LMρ22.

Facts & Assumptions

Given: The hypotheses in the Statement; ∇U is the Euclidean coordinate gradient and ⟨⋅,⋅⟩ and ∥⋅∥ are the Euclidean inner product and norm.

[A1]

The differentiability, global-minimizer, Lipschitz-gradient, and radial-drift hypotheses are exactly those stated above. The gradient convention is The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case and the inner product is The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

[F1]

At an interior differentiable local minimum, the gradient vanishes. Fermat's theorem: an interior differentiable local extremum has zero gradient

[F2]

The derivative of a composition with a differentiable path is given by the total-derivative chain rule. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

Proof

Given: The potential and constants in the Statement.

1.1A1F1F2F3F4

Put h=x−x⋆ and r=∥h∥. By [F1], ∇U(x⋆)=0. The path g(t)=U(x⋆+th) is continuously differentiable, and [F2]–[F3] give U(x)−U(x⋆)=∫01⟨∇U(x⋆+th),h⟩ dt. For 0≤t≤1, Lipschitz continuity gives ∥∇U(x⋆+th)∥≤Ltr, hence the integrand is at least −Ltr2 by [F4].

2.1A1step 1.1algebra

If r<Mρ, integrating the bound from step 1.1 over [0,1] yields U(x)−U(x⋆)≥−Lr2/2≥−LMρ2/2. Since rα≤Mρα, this is at least ρrα/(α+1)−aα.

2.2A1step 1.1algebra

Suppose r≥Mρ and r>0. On 0≤t≤Mρ/r, the bound in step 1.1 integrates to at least −LMρ2/2. On Mρ/r≤t≤1, the radial assumption gives t⟨∇U(x⋆+th),h⟩≥ρtαrα. For t∈(0,1], division by t and tα−1≥tα show that the path derivative is at least ρtαrα.

3.1step 2.2algebra

Integrating the outer-segment bound in step 2.2 and adding the inner-segment bound gives U(x)−U(x⋆)≥−LMρ22+ρrαα+1(1−(Mρ/r)α+1). Because r≥Mρ, Mρα+1/r≤Mρα, so this is at least ρrα/(α+1)−aα.

4.1step 2.1step 3.1algebra∎

If r=0, the claimed inequality reads 0≥−aα and holds because aα≥0. Steps 2.1 and 3.1 cover all other r, proving the bound.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Exponential Lyapunov drift for the formal Langevin generator

Statement

Let d≥1, U∈C2(Rd), and suppose ∇U is L-Lipschitz with L>0. Let x⋆ be a global minimizer with U(x⋆)=0, and assume the radial condition of Radial gradient drift forces potential coercivity with parameters ρ>0, α∈(1,2], and Mρ≥0. For 0<s<1, set Ws(x)=esU(x),LUf(x):=∑i=1d∂iif(x)−⟨∇U(x),∇f(x)⟩, where LU is only the displayed formal differential operator here. Define Ks:=max⁡{Mρ,(2dL(1−s)ρ2)1/(2(α−1))},βs:=2sdLexp⁡(sLKs2/2). Then for every x∈Rd, LUWs(x)≤−sdLWs(x)+βs1{∥x−x⋆∥≤Ks}.

Facts & Assumptions

Given: U, x⋆, and the constants in the Statement.

[A1]

U∈C2, its gradient is L-Lipschitz, x⋆ is a global minimizer with U(x⋆)=0, and the stated radial drift condition holds. The Euclidean inner product and gradient are those of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, the Hessian convention is The Hessian matrix and critical points of a scalar field, and the radial condition is from Radial gradient drift forces potential coercivity.

[F1]

A differentiable function at an interior local minimum has zero gradient. Fermat's theorem: an interior differentiable local extremum has zero gradient

[F4]

Proof

Given: The hypotheses and formal operator in the Statement.

1.1A1F1algebra

By [F1], ∇U(x⋆)=0. For each coordinate vector ei, the Lipschitz bound gives ∣∂iU(x+hei)−∂iU(x)h∣≤L(h≠0). Taking h→0 yields ∣∂iiU(x)∣≤L, so ∑i∂iiU(x)≤dL.

2.1F2step 1.1algebra

Applying [F2] coordinatewise to Ws=esU gives ∇Ws=sWs∇U,∑i∂iiWs=sWs∑i∂iiU+s2Ws∥∇U∥2. Substitution in the displayed definition of LU therefore gives LUWs=sWs(∑i∂iiU−(1−s)∥∇U∥2).

3.1A1F3step 2.1algebra

If r=∥x−x⋆∥≥Mρ and r>0, radial drift and [F3] imply ∥∇U(x)∥≥ρrα−1. Thus when r>Ks, the formula in step 2.1 and r>Ks give LUWs(x)≤sWs(x)(dL−(1−s)ρ2r2(α−1))≤−sdLWs(x). The same conclusion holds for r≥Ks by the definition of Ks.

3.2A1F1F2F4step 1.1step 2.1

For h=x−x⋆ and 0≤t≤1, Lipschitz continuity and [F1] give ∥∇U(x⋆+th)∥≤Ltr. The chain rule and [F4] therefore yield U(x)−U(x⋆)≤Lr2/2. Since U(x⋆)=0, on r≤Ks we have Ws(x)≤esLKs2/2. Also ∑i∂iiU≤dL by step 1.1, so step 2.1 implies LUWs+sdLWs≤2sdLesLKs2/2=βs.

4.1step 3.1step 3.2∎

On r>Ks use step 3.1, and on r≤Ks use step 3.2. These two regions cover Rd and give the displayed drift inequality.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Unadjusted Langevin algorithm (ULA)

Definition

Assume AC (The Axiom of Choice). Let d≥1, let U:Rd→R be Borel measurable in the sense of Borel measurable and Lebesgue measurable functions on Rn and continuously differentiable with 0<ZU:=∫Rde−U(x) dx<∞, and define the target probability πU(dx):=ZU−1e−U(x) dx. This is the measure with density ZU−1e−U relative to Lebesgue measure (The measure with density f relative to μ and Lebesgue measurable sets, the family L(Rn), and the restricted set function λn); the probability-measure convention is Probability measures and probability spaces, and the normalizer makes its total mass one. Given a step size γ>0, an initial state X0∈Rd, and an IID sequence Z1,Z2,…∼Nd(0,Id), using the multivariate-normal law of Multivariate normal law, including singular covariance and standard-normal convention of Standard normal and normal laws, repeat for k≥0:

  1. Compute the Euclidean gradient ∇U(Xk) using the convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case.
  2. Take the fixed-step gradient update X~k+1=Xk−γ∇U(Xk), the fixed-step branch of Gradient descent.
  3. Set Xk+1=X~k+1+2γ Zk+1.

The one-step transition law is Qγ(x,⋅)=Nd(x−γ∇U(x),2γId). The procedure applies the proposal at every step and has no accept/reject correction. The probability-kernel and density properties of Qγ are proved in The ULA Gaussian proposal is a probability kernel with a positive density ↗.

Remarks

The definition only asserts a well-defined Gaussian update. It asserts no convergence rate, invariant-law existence, or equality of the invariant law with πU; those are separate mathematical claims.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A weighted total-variation bound from relative entropy

Statement

Assume AC. Let μ,ν be Borel probability measures on Rd, and let W:Rd→[1,∞) be Borel measurable with ∫W2 dμ+∫W2 dν<∞. Then ∥μ−ν∥W≤2(∫W2 dμ+∫W2 dν)D(μ∥ν), where μ,ν are probability measures in the sense of Probability measures and probability spaces, ∥⋅∥W is defined in Weighted total variation for probability measures and D(μ∥ν) is the directional relative entropy of Kullback–Leibler divergence. If D(μ∥ν)=+∞, the inequality is understood in the extended-real sense and is immediate.

Facts & Assumptions

Given: AC; probability measures μ,ν; a Borel weight W≥1 with finite second moments under both measures.

[A1]

AC supplies the Radon–Nikodym representative used in the definition of directional relative entropy. The Axiom of Choice The Radon-Nikodym derivative as an almost-everywhere equivalence class

[F1]

If D(μ∥ν)<∞, then μ≪ν, the density r=dμ/dν is nonnegative, and D(μ∥ν)=∫(rlog⁡r) dν with 0log⁡0=0. Kullback–Leibler divergence Integrating against a Radon-Nikodym derivative recovers integration against the measure

[F2]

The directional relative entropy has finite negative part and ∫r dν=1. Kullback–Leibler divergence Integrating against a Radon-Nikodym derivative recovers integration against the measure

[F3]

Cauchy–Schwarz gives ∫∣fg∣ dν≤(∫∣f∣2dν)1/2(∫∣g∣2dν)1/2 for square-integrable f,g. Cauchy-Schwarz inequality for L2

[F6]

Integrals of integrable real functions are linear. The Lebesgue integral is linear on L1(μ)

Proof

Given: The hypotheses in the Statement.

1.1F4F5algebra

Define ϕ(0)=1 and ϕ(t)=tlog⁡t−t+1 for t>0. For 0<t≤1, the function h(t)=t−1−log⁡t satisfies h(1)=0 and h′(t)=1−1/t≤0. The mean value theorem on [t,1] gives h(t)≥0, so log⁡t≤t−1. Now k(t)=ϕ(t)−(1−t)2/2 satisfies k(1)=0 and k′(t)=log⁡t+1−t≤0 by [F4]–[F5]; another application of the mean value theorem gives k(t)≥0. At t=0 the inequality holds because 1≥1/2.

2.1F4F5step 1.1algebra

For t≥1, put g(t)=2(1+t)ϕ(t)−(t−1)2. By [F5], g(1)=g′(1)=0 and g′′(t)=4log⁡t+2/t≥0 using [F4] and log⁡t≥0 for t≥1. The mean value theorem applied first to g′ and then to g shows g′(t)≥0 and g(t)≥0 for t≥1. Combining with step 1.1 gives ∣1−t∣2≤2(1+t)ϕ(t)(t≥0).

3.1A1F1F2F3F6step 2.1given∎

It remains to consider finite D(μ∥ν). Let r=dμ/dν as in [F1]. For every Borel f with ∣f∣≤W, the Radon–Nikodym identity gives ∣∫f dμ−∫f dν∣≤∫W∣r−1∣ dν. Applying step 2.1 pointwise and [F3] with factors W1+r and 2ϕ(r) bounds this by ∫W2(1+r) dν2∫ϕ(r) dν=(∫W2dν+∫W2dμ)2D(μ∥ν). The moment hypotheses make the first factor finite, and [F1], [F2], and [F6] identify the second integral with the directional relative entropy, using ∫r dν=∫1 dν=1. Taking the supremum over f proves the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Global drift and one-step minorization give weighted contraction and a unique invariant law

Statement

Assume AC. Let K be a Borel probability kernel on Rd, d≥1, and let V:Rd→[1,∞) be finite and Borel. Suppose KV≤aV+b,0<a<1,0≤b<∞. Suppose that for some R>max⁡{2,2b/(1−a)} the set D={V≤R} is nonempty and there are a probability ν and ϵ0>0 such that K(x,A)≥ϵ0ν(A)(x∈D, A Borel). Then K has a unique invariant probability π, uniqueness being among all Borel probabilities, and πV≤b/(1−a)<∞. There are C<∞ and 0<r<1 such that for all finite-V-moment probabilities μ,λ and n≥0, ∥μKn−λKn∥V≤Crn∥μ−λ∥V. In particular, ∥Kn(x,⋅)−π∥V≤Crn(V(x)+πV). The norm is that of Weighted total variation for probability measures. Explicitly, put ϵ=min⁡{ϵ0,1/2},β=ϵ2(b+1),a′=a+2bR,C=1+ββ, r=max⁡{2+βa′R2+βR, 1−2(ϵ−βb)2+βR}. The same contraction holds for finite signed η with η(Rd)=0 and ∫V d∣η∣<∞, with μ−λ replaced by η.

Facts & Assumptions

Given: The kernel, finite weight, global drift and one-step sublevel minorization in the Statement.

[A1]

AC, The Axiom of Choice, is assumed for the general signed-measure Jordan existence clause below.

[F2]

The indefinite integral of a nonnegative measurable function is a measure constructs measures by nonnegative measurable densities; Monotone convergence for the integral extends integration identities from simple functions.

[F3]

Finite-total-variation signed measures are complete gives completeness of finite signed measures in the norm ∣η∣(Rd).

[F6]

Invariant and stationary distribution for a Markov kernel defines μK and invariance. Dominated convergence applies to bounded measurable kernel evaluations under any probability.

[F7]

Weighted total variation for probability measures uses the supremum over all Borel ∣f∣≤V, without the event-distance factor of one half.

Proof

Given: The hypotheses and facts [A1], [F1]–[F7].

1.1A1F1F2F3F7constructalgebra

Put w=1+βV and, for finite signed η with ∫w d∣η∣<∞, define ∥η∥w=sup⁡∣f∣≤w∣ηf∣. Obtain a Hahn partition P,N by [F1]. The upper bound ∣ηf∣≤∫w d∣η∣ and the test f=w(1P−1N) give ∥η∥w=∫w d∣η∣. Multiplication Tη=wη is an isometry onto the ordinary finite-total-variation signed measures: define it by multiplying the Jordan parts, and note that the same partition is Hahn, so ∣Tη∣=w∣η∣. Conversely, for any finite signed ζ, multiplication by w−1 gives ∣w−1ζ∣=w−1∣ζ∣ and is inverse to T. The density integration identities follow first for indicators and simple functions, then by monotone convergence. Thus [F3] makes the finite-w-moment signed-measure space complete. Also βV≤w≤(1+β)V.

2.1F1F2F4F6step 1.1givenalgebra

Define ηK=η+K−η−K. Each positive part acts by integration of the kernel evaluations. Countable additivity follows by monotone convergence. The inequality ∣ηK∣≤∣η∣K follows by bounding the variation sum on every countable measurable partition by the corresponding positive measure ∣η∣K. The drift gives Kw≤1+βaV+βb≤(1+βb)w, so ηK has finite w moment whenever η does. Kernel integration is Borel and finite for ∣f∣≤cw, and (ηK)f=η(Kf), by the indicator identity and monotone convergence applied separately to positive and negative parts. Total mass is preserved.

3.1givenstep 2.1algebra

The constants satisfy 0<a′<1 and 0<βb<ϵ if b>0, while βb=0<ϵ if b=0. Both displayed component rates are in (0,1). Fix Borel ∣f∣≤w, and write S=V(x)+V(y). If S≥R, then ∣Kf(x)−Kf(y)∣≤Kw(x)+Kw(y)≤2+β(aS+2b)≤2+βa′S. Since s↦(2+βa′s)/(2+βs) is decreasing for s≥R, this gives ∣Kf(x)−Kf(y)∣≤r(2+βS).

4.1F2F4step 2.1step 3.1givenconstructalgebra

If S<R, both states are in D. The residual probabilities Hx=(K(x,⋅)−ϵν)/(1−ϵ) are well defined there. Fixing one point of the nonempty D, the minorization and finite KV give ϵνV≤KV(xD)<∞. Consequently νf is finite, and the common term ϵνf cancels from Kf(x)−Kf(y). Thus ∣Kf(x)−Kf(y)∣≤(1−ϵ)(Hxw+Hyw)≤2(1−ϵ)+β(aS+2b)≤(2+βS)−2(ϵ−βb)≤r(2+βS). The residual evaluations are Borel on D, so these are legitimate kernel integrations; no selected optimal coupling is involved.

5.1A1F1F5F7step 1.1step 2.1step 3.1step 4.1algebra

Let η have zero mass and finite w norm. If η≠0, its Jordan masses agree at some m>0; put p=η+/m and q=η−/m. They concentrate on disjoint Hahn sets. Integration of steps 3.1 and 4.1 against p⊗q gives, for every ∣f∣≤w, ∣(ηK)f∣=m∣∫(Kf(x)−Kf(y))p(dx)q(dy)∣≤mr∫(w(x)+w(y))p(dx)q(dy)=r∥η∥w. Every integral is finite by the finite moments and step 2.1. For η=0 the inequality is immediate. Taking the supremum and iterating, using preservation of mass and moments, proves ∥ηKn∥w≤rn∥η∥w. Norm comparison in step 1.1 yields ∥ηKn∥V≤Crn∥η∥V, including differences of the stated probabilities.

6.1F6step 1.1step 2.1step 5.1constructalgebra

Fix x0∈Rd and set μn=δx0Kn. The difference μ1−μ0 has finite w norm, and step 5.1 gives ∥μn+1−μn∥w≤rn∥μ1−μ0∥w. The geometric tail sum makes (μn) Cauchy, so step 1.1 gives a signed-measure limit π with finite w norm. Norm convergence implies π(A)=lim⁡nμn(A)≥0 for every Borel A and π(Rd)=1. Thus π is a probability and πV<∞. Step 5.1 gives ∥μnK−πK∥w≤r∥μn−π∥w→0; since μnK=μn+1→π, it follows that πK=π. Finally drift iteration gives μnV≤anV(x0)+b(1−an)/(1−a). Because βV≤w, norm convergence gives μnV→πV, whence πV≤b/(1−a).

7.1F4F6F7step 5.1step 6.1algebra∎

Apply step 5.1 to δx−π. Its V norm is at most V(x)+πV, giving the pointwise asserted bound. If λ is any invariant probability, without a moment assumption, then for each Borel A the pointwise convergence Kn(x,A)→π(A) and 0≤Kn(x,A)≤1 give λ(A)=∫Kn(x,A)λ(dx)→π(A) by dominated convergence. Thus λ=π. Together with steps 5.1 and 6.1 this proves all assertions.

Remarks

This is a weighted signed-measure contraction and an invariant-law construction. Minorization is needed only on one sufficiently large sublevel. For a family of kernels its constants depend on the drift and minorization constants; no uniformity over an additional discretization parameter is asserted.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The ULA Gaussian proposal is a probability kernel with a positive density

Statement

Assume AC and the hypotheses of Unadjusted Langevin algorithm (ULA). For γ>0, its proposal family Qγ is a probability kernel on Rd and has the everywhere positive finite jointly continuous Lebesgue density qγ(y∣x)=(4πγ)−d/2exp⁡ ⁣(−∥y−x+γ∇U(x)∥24γ).

Facts & Assumptions

Given: AC, a finite d≥1, U∈C1(Rd), γ>0, and the proposal in Unadjusted Langevin algorithm (ULA).

[A1]

AC holds as required by the algorithm and multivariate normal law. The Axiom of Choice Unadjusted Langevin algorithm (ULA)

[F1]

For positive-definite covariance, Nd(m,Σ) has the displayed Gaussian Lebesgue density. A positive-definite multivariate normal law has its Gaussian density

[F2]

Nd(m,Σ) is a probability law when Σ is symmetric positive semidefinite; its coordinates and projections follow the multivariate-normal convention. Multivariate normal law, including singular covariance

[F3]

The definition of a probability kernel requires each section to be a probability measure and each evaluation on a Borel set to be measurable in the starting point. Measure kernel and probability kernel

[F4]

Integration of a nonnegative product-measurable function against a uniformly sigma-finite kernel is measurable in the starting point. Measurability of integration against a kernel

[F6]

AC implies countable choice, which is the hypothesis of the continuous-map measurability result. AC supplies countable selections and prescribed serial paths The Axiom of Countable Choice (ACω)

[F8]

The Borel sigma-algebra The Borel sigma-algebra of a topological space of R2d is the product of the two Borel sigma-algebras on Rd. The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}

Proof

Given: The hypotheses and conventions above.

1.1A1F1F2given

The covariance 2γId is symmetric positive definite. By [F2], the transition law in Unadjusted Langevin algorithm (ULA) is a probability measure for each x. Applying [F1] with m=x−γ∇U(x) gives the displayed density; its normalizing factor is finite and positive because γ>0.

2.1F3F4F5F6F7F8step 1.1∎

The map (x,y)↦x−y+γ∇U(x) is continuous, so the displayed qγ(y∣x) is Borel on R2d by [F7], hence product-measurable by [F8]. For a Borel set A, the constant kernel K(x,B)=λd(B) is uniformly sigma-finite: [−n,n]d exhausts Rd and has finite Lebesgue measure by [F5]. Applying [F4] to f(x,y)=1A(y)qγ(y∣x) gives measurability of x↦∫Aqγ(y∣x) dy=Qγ(x,A). Together with step 1.1 this is exactly [F3], so Qγ is a probability kernel.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The Gaussian ULA invariant law has variance 2/(2−γ)

Statement

Assume AC, let U(x)=x2/2 on R, and let π=N(0,1). For every 0<γ<2, the one-dimensional ULA kernel of Unadjusted Langevin algorithm (ULA) has the invariant probability πγ=N ⁣(0,22−γ). Every invariant probability with finite second moment has variance 2/(2−γ). Thus its invariant variance is not the target variance 1. No uniqueness claim is made for invariant laws without a finite second moment.

Facts & Assumptions

Given: AC, the standard Gaussian target, and the ULA update with U(x)=x2/2.

[A1]

AC is assumed in the standard-normal construction and characteristic-function uniqueness. The Axiom of Choice

[F1]

For this potential, ∇U(x)=x and the ULA update is X′=(1−γ)X+2γZ, where Z∼N(0,1) is independent of the current state. Unadjusted Langevin algorithm (ULA) The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case

[F2]

The normal-law convention is Standard normal and normal laws; the characteristic function of N(m,v) is exp⁡(imt−vt2/2), and its mean and variance are m and v. Characteristic function of a normal law Moments, variance, and covariance on a probability space

[F3]

Affine transforms and finite independent sums multiply the corresponding characteristic functions. Characteristic functions under affine maps and independent sums

[F4]

Equal characteristic functions determine equal Borel probability laws. Uniqueness of a law from its characteristic function

[F5]

For independent square-integrable variables, expectations factor and finite linear combinations commute with expectation. Expectations factor over finite products of independent random variables The Lebesgue integral is linear on L1(μ)

[F6]

A square-integrable variable is integrable by Cauchy–Schwarz on a probability space. Cauchy-Schwarz for random variables

Proof

Given: AC, 0<γ<2, and the ULA transition in [F1].

1.1A1F1F2F3F4algebra

Set vγ=2/(2−γ)>0 and let X∼N(0,vγ) be independent of Z∼N(0,1). By [F2]–[F3], the updated state has characteristic function φX′(t)=exp⁡ ⁣(−(1−γ)2vγt22)exp⁡(−γt2)=exp⁡ ⁣(−((1−γ)2vγ+2γ)t22). Direct algebra gives (1−γ)2vγ+2γ=vγ, so [F2] and [F4] imply X′∼N(0,vγ). This proves that πγ is invariant.

2.1F1F2F5F6algebra∎

Let X have any invariant law with finite second moment, independently of the fresh standard normal Z. By [F6], X is integrable, and [F5] gives Var⁡(X′)=(1−γ)2Var⁡(X)+2γ, because Var⁡(Z)=1 and the cross-covariance of the independent variables is zero. Invariance gives Var⁡(X′)=Var⁡(X), so Var⁡(X)=2γ1−(1−γ)2=22−γ. Since γ>0, this exceeds 1.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

ULA's Gaussian kernel satisfies an exponential drift bound

Statement

Assume AC. Let d≥1, U∈C2(Rd), and suppose ∇U is L-Lipschitz for L>0. Let x⋆ be a global minimizer with U(x⋆)=0. Suppose that for ρ>0, α∈(1,2], and Mρ≥0, ⟨∇U(x),x−x⋆⟩≥ρ∥x−x⋆∥αif ∥x−x⋆∥≥Mρ. For 0<γ<L−1, define Kγ:=max⁡{Mρ,(2d[−log⁡(1−Lγ)]/γ+4ρ2)1/(2(α−1))},V(x):=eU(x)/2, and let Pγ be the ULA proposal kernel. Then PγV(x):=∫V(y)Pγ(x,dy)≤e−γV(x)+eLKγ2/4(1−Lγ)−d/21{∥x−x⋆∥≤Kγ}.

Facts & Assumptions

Given: AC; d,L,U,x⋆,ρ,α,Mρ,γ as in the Statement; and the ULA update.

[A1]

U is twice continuously differentiable, has L-Lipschitz gradient, has the stated global minimizer and radial drift, and is normalized by U(x⋆)=0. The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case

[F1]

At a differentiable local minimum in Euclidean space, the gradient is zero. Fermat's theorem: an interior differentiable local extremum has zero gradient

[F2]

The derivative of a composition with a differentiable path is given by the total-derivative chain rule, and a continuous derivative integrates to its endpoint difference. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a) Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative

[F6]
[F7]

Finite-dimensional Lebesgue measure is the finite product of one-dimensional Lebesgue measures on Borel sets, and Tonelli factors nonnegative product-measurable integrals. On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n} Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F8]

Under [A1], U(x)≥c∥x−x⋆∥α−aα, where c=ρ/(α+1)>0 and aα is finite. Radial gradient drift forces potential coercivity

[F9]

Under countable choice, ∫Re−∣z∣ dz<∞. The real-line exponential tail is Lebesgue integrable

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F3

By [F1], ∇U(x⋆)=0. For h=y−x, apply [F2] to t↦U(x+th) and subtract ⟨∇U(x),h⟩ from the endpoint difference. The remaining integral is ∫01⟨∇U(x+th)−∇U(x),h⟩ dt≤∫01Lt∥h∥2 dt=L2∥h∥2, by [A1] and [F3]. Thus U(y)≤U(x)+⟨∇U(x),y−x⟩+L∥y−x∥2/2 for all x,y.

1.2A1F3algebra

Put r=∥x−x⋆∥. If r≥Mρ and r>0, the radial condition and [F3] give ρrα≤⟨∇U(x),x−x⋆⟩≤∥∇U(x)∥r, so ∥∇U(x)∥≥ρrα−1.

1.3F4F6F7

For c<1/2 and β∈R, completing the square and applying [F6] gives 12π∫Re−(1/2−c)z2+βz dz=(1−2c)−1/2eβ2/(2(1−2c)). For b∈Rd, apply this with β=bi for each i<d. The product density in [F4], Lebesgue product identification, and Tonelli's theorem [F7] therefore give, for Z∼Nd(0,Id), Eec∥Z∥2+⟨b,Z⟩=(1−2c)−d/2exp⁡ ⁣(∥b∥22(1−2c)).

1.4A1F3F5F6F7F8F9step 1.1algebra

Verify the target normalizer before using the proposal-kernel conclusion of [F4]. Put r=∥x−x⋆∥, c=ρ/(α+1), and k=c/d>0. Since rα≥r−1 for r≥0 and ∑i<d∣xi−x⋆,i∣≤d r by [F3], [F8] gives e−U(x)≤eaα+ce−cr≤eaα+c∏i<de−k∣xi−x⋆,i∣. Translation and scaling [F6], followed by [F7] and [F9], show that the right-hand side has finite integral. Step 1.1 also gives U(x)≤Lr2/2, so [F6]–[F7] imply ∫Rde−U(x) dx≥∫Rde−L∥x−x⋆∥2/2 dx=(2π/L)d/2>0. Continuity supplies Borel measurability as in [F5]. Thus all target hypotheses of the ULA algorithm and its proposal-kernel lemma hold.

2.1A1F4F5step 1.1step 1.3step 1.4algebra

Write g=∇U(x) and Y=x−γg+2γZ, the ULA update. Step 1.1 and [F4] imply EV(Y)V(x)≤Eexp⁡ ⁣(12⟨g,−γg+2γZ⟩+L4∥−γg+2γZ∥2). In step 1.3 take c=Lγ/2 and b=2γ(1−Lγ)g/2. Since 1−2c=1−Lγ>0, expanding the exponent and collecting its ∥g∥2 terms gives PγV(x)≤V(x)(1−Lγ)−d/2exp⁡ ⁣(−γ∥g∥24).

3.1A1step 1.2step 2.1algebra

If r≥Kγ, then step 1.2 and the definition of Kγ give d2[−log⁡(1−Lγ)]−γ∥g∥24≤d2[−log⁡(1−Lγ)]−γρ2Kγ2(α−1)4≤−γ. Step 2.1 therefore yields PγV(x)≤e−γV(x) on this region.

4.1A1F1step 1.1step 2.1step 3.1algebra∎

If r≤Kγ, use step 1.1 with starting point x⋆ and [F1] to obtain U(x)≤Lr2/2, so V(x)≤eLKγ2/4. Bounding the exponential factor in step 2.1 by one gives PγV(x)≤eLKγ2/4(1−Lγ)−d/2. Together with step 3.1, this proves the asserted drift inequality on both regions.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Metropolis-adjusted Langevin algorithm (MALA)

Definition

Assume AC (The Axiom of Choice) and the target-potential hypotheses of Unadjusted Langevin algorithm (ULA). For a step size γ>0, use the ULA Gaussian proposal Qγ(x,dy)=qγ(y∣x) dy,qγ(y∣x)=(4πγ)−d/2exp⁡ ⁣(−∥y−x+γ∇U(x)∥24γ), whose kernel properties are in The ULA Gaussian proposal is a probability kernel with a positive density. The target density is pU(x)=ZU−1e−U(x). At state x, propose y from Qγ(x,⋅), set αγ(x,y):=min⁡{1,pU(y)qγ(x∣y)pU(x)qγ(y∣x)}, and use the Metropolis–Hastings transition kernel Pγ(x,A)=∫Aαγ(x,y)Qγ(x,dy)+(1−∫αγ(x,z)Qγ(x,dz))1A(x). Thus every rejected proposal remains at the current state. The target and proposal densities are strictly positive, so the displayed ratio has no zero-denominator case. The ratio is the common-density accepted-flow version from The common-density Metropolis–Hastings ratio; this procedure is the general Metropolis–Hastings algorithm Metropolis–Hastings kernel specialized to the ULA proposal. The Euclidean Borel space is standard Borel in the sense of Standard Borel spaces, by Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel, as required by that general Metropolis–Hastings procedure.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite-horizon Brownian change of drift and relative entropy

Statement

Assume AC. Let T>0, let W be a standard d-dimensional Brownian motion on a complete usual filtered probability space, with increments after s independent of Fs, and let θ be predictable with AT:=∫0T∣θs∣2ds<∞ almost surely. Set Mt=∫0tθs⋅dWs,At=∫0t∣θs∣2ds,Zt=exp⁡(Mt−At/2). If Z is a true martingale on [0,T], then Q=ZTP is equivalent to P, its restriction to F0 equals that of P, and Bt=Wt−∫0tθsds is standard Brownian motion under Q relative to the same filtration. If AT is bounded by a deterministic constant, Z is a true martingale. If additionally EPAT<∞, then D(P∥Q)=12EPAT.

Here is a sufficient condition that permits unbounded AT. Fix a globally Lipschitz vector field b:Rd→Rd, a finite deterministic grid 0=t0<⋯<tN=T, and η(t)=tk for tk≤t<tk+1. Let each of the two path drifts a,c be one of 0, b(Xt), or b(Xη(t)). Suppose Xt=X0+∫0tas(X)ds+2Wt,E∣X0∣2<∞, where X is adapted with continuous paths and the equation holds on one probability-one event for all t∈[0,T], while X0 is F0-measurable. For θt=(ct(X)−at(X))/2, the exponential Z above is a true martingale, and under Q the process X has the unique path law with initial law LP(X0) and drift c and dispersion 2Id. Moreover EPAT<∞, so the entropy identity applies. Values of the piecewise coefficients at grid points do not affect any integral.

Finally, for any probability measures R≪S and measurable statistic F, relative entropy decreases under pushforward: D(F#R∥F#S)≤D(R∥S). All equivalence and entropy assertions concern this finite horizon.

Facts & Assumptions

Given: AC and the filtered Brownian data, integrand, horizon and, for the sufficient condition, the vector field, grid, initial value and solution specified in the Statement.

[F1]

Localized predictable Brownian integrals exist; stopping commutes with integration; finite-energy integrals are continuous square-integrable mean-zero martingales and obey their isometry. The multidimensional Itô formula applies to Brownian Itô processes with locally integrable drift and locally square-integrable diffusion. In particular it applies to exponentials of (M,A) and products of two such processes. Localized Ito integral Stopping an Ito integral The Ito integral process has a continuous martingale version Ito isometry and linearity in predictable L2 Multidimensional Ito formula for Brownian-driven processes

[F2]

A continuous vector local martingale starting at zero with covariation matrix tId is Brownian relative to its filtration; its increments are independent of the earlier sigma-algebra. Vector Levy characterization

[F3]

Conditional expectations are characterized by event integrals and preserve order; the tower property holds. Conditional expectations of a fixed integrable terminal variable are UI; UI and convergence in probability imply L1 convergence. Bounded optional sampling applies to the finite discrete-time martingale obtained by sampling a continuous martingale on a deterministic grid; the continuous-time extension is proved in step 1.2 below. Conditional expectation as an ae class Basic algebra and order properties of conditional expectation Tower property of conditional expectation Uniform integrability of conditional expectations of one variable Uniform integrability plus convergence in probability implies L1 convergence Optional sampling for bounded stopping times

[F4]

Each Brownian coordinate satisfies Esup⁡t≤T∣Wti∣2≤4T. The globally Lipschitz diffusion has a unique strong solution with finite second path moment, constructed by Picard iteration. Doob maximal bound for the Ito integral Global strong well-posedness for Lipschitz Itô SDEs

[F5]

Continuous adapted processes are predictable; interval step processes with coefficients measurable at the left endpoint have predictable versions. Adapted continuous processes are progressively measurable Progressively measurable and predictable processes

[F6]

Fatou, dominated convergence, monotone convergence, Tonelli and Cauchy–Schwarz apply to the displayed integrable or nonnegative quantities. Radon–Nikodym densities are determined by their event integrals and change measure in integrals. Relative entropy is directional, and xlog⁡x≥−1/e for x≥0, with 0log⁡0=0. Fatou's lemma Dominated convergence Monotone convergence for the integral Tonelli's theorem for nonnegative measurable functions on a sigma-finite product Cauchy-Schwarz for random variables A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density Likelihood-ratio change of measure Kullback–Leibler divergence

[F7]

The Borel sigma-algebra of continuous path space is generated by coordinate evaluations. The finite-horizon version follows by restriction and constant extension, and the vector version by finite products of scalar path spaces. Thus independence on finite coordinate cylinders extends to independence on the full Borel path space. Borel sigma-algebra of continuous path space is generated by coordinates

[A1]

AC is inherited from the Brownian Itô, conditional-expectation, Levy, and SDE suppliers; the integer localizers and deterministic meshes below require no additional choice principle. The Axiom of Choice

Proof

1.1F1F3F5F6given

By [F1], applied to f(m,a)=em−a/2, dZt=Ztθt⋅dWt. Stopping at integer levels of A, ∣M∣ and Z makes the integral finite-energy, so Z is a positive continuous local martingale. All these stops tend beyond every time strictly less than T, and stabilize at T, because the paths and energy are bounded on [0,T]. A nonnegative local martingale N is a supermartingale: Fatou first gives integrability, and conditional Fatou gives E[Nt∣Fs]≤lim inf⁡jE[Nt∧ρj∣Fs]=lim inf⁡jNs∧ρj=Ns for a localizing sequence. The conditional Fatou assertion follows by taking the increasing infima of the tails, using conditional order and monotone convergence; conditional monotone convergence follows by ordinary monotone convergence in the defining event integrals. Thus EZt≤1, and the same assertion applies to the stopped exponential for every scalar multiple of θ.

1.2F3F6

We record the continuous stopping consequence needed below. Let V be a continuous true martingale on [0,T]. For ρ≤T, round ρ upward to stopping times ρj on finite grids whose meshes tend to zero. Discrete bounded optional sampling in [F3] gives Vρj=E[VT∣Fρj]. This family is UI and converges almost surely to Vρ, hence in L1. If A∈Fρ, then A∈Fρj, as is checked by the defining stopped-event tests, so passage in those tests gives Vρ=E[VT∣Fρ]. In particular the family of all Vρ, ρ≤T, is UI. Stopping preserves true martingality: for fixed s<t, choose the grids on [0,t] to contain s; the finite-grid identity E[1AVt∧ρj]=E[1AVs∧ρj] for A∈Fs follows by telescoping grid increments with the left-endpoint measurable stopping indicators. Continuity and the preceding UI argument pass it to Vρ. Thus both continuous stopping facts used below have been derived from the discrete supplier.

1.3F3F6algebra

To prove data processing, write r=dR/dS, and let u be the density of F#R relative to F#S; absolute continuity follows immediately by taking inverse images of null sets. Testing events in σ(F) gives u∘F=ES[r∣σ(F)]. If D(R∥S)=∞ the desired inequality is immediate. Otherwise ϕ(r) is integrable, where ϕ(x)=xlog⁡x on x>0 and ϕ(0)=0, since its negative part is bounded by 1/e. For positive rational a, the tangent line ℓa(x)=(1+log⁡a)x−a lies below ϕ(x) on x≥0, by differentiating their difference, and ϕ(x)=sup⁡a∈Q, a>0ℓa(x), including x=0 by a↓0. Conditional order gives ℓa(ES[r∣σ(F)])≤ES[ϕ(r)∣σ(F)]. Intersect these countably many full events, take the supremum and then expectations. This yields D(F#R∥F#S)≤D(R∥S), with left integrability following from the lower bound −1/e and the displayed conditional upper bound.

2.1F1F3step 1.1algebra

If AT≤n, then at every stopping time ρ≤T, Zρ2=exp⁡(2Mρ−2Aρ)exp⁡(Aρ), whence EZρ2≤en by step 1.1 applied to the stopped integrand 2θ1[0,ρ]. Apply this bound to localizing stops for Z. Their terminal values are UI, since their tail integrals are at most en/R above level R. They converge almost surely, and hence in L1, to ZT. The same holds at every earlier time, so passage in martingale event tests proves true martingality. In particular Zt=E[ZT∣Ft].

2.2F1F3F5F6step 1.1

Suppose Z is true and put Q=ZTP. Since 0<ZT<∞ almost surely, these probabilities are equivalent. For A∈Ft, Q(A)=EP[ZT1A]=EP[Zt1A] by [F3], so Q∣Ft=ZtP∣Ft; at t=0 this is Q∣F0=P∣F0. The measures have identical null sets, so completeness and the usual filtration conditions persist. Let B=W−∫θds, whose drift has finite total variation by pathwise Cauchy–Schwarz. For a coordinate i, let σr be the first time ∣Bi∣ reaches r, capped at T. These are stopping times because continuous adapted path suprema are measurable by their rational-time suprema. Product Itô gives d(ZtBt∧σri)=Zt1[0,σr](t)dWti+Bt∧σriZtθt⋅dWt. The finite-variation terms cancel against d[Z,Wi]t=Ztθtidt. The right side is locally square integrable, so the product is a P-local martingale.

3.1F3F6step 1.2step 2.2

For every ρ≤T, ∣ZρBρ∧σri∣≤rZρ. By step 1.2, Zρ=E[ZT∣Fρ], and these random variables form a UI family. Hence the localizing stopped products in step 2.2 are UI. Passing their event tests in L1 makes ZBi,σr a true P-martingale. For A∈Fs, change of measure at times s,t now gives EQ[1ABt∧σri]=EP[1AZtBt∧σri]=EP[1AZsBs∧σri]=EQ[1ABs∧σri]. Thus Bi is a Q-local martingale. Its localizers increase to the horizon because continuous paths are bounded on each compact interval.

3.2F1F6step 2.2

If EPAT<∞, [F1] gives EPMT=0 and EPMT2=EPAT. Since dQ/dP=ZT>0, dP/dQ=1/ZT and −log⁡ZT=−MT+AT/2 is P-integrable. The definition of relative entropy therefore gives D(P∥Q)=EP[−log⁡ZT]=EPAT/2. This establishes the asserted identity whenever Z is true; it does not yet presume true martingality in the unbounded-energy sufficient condition.

4.1F1F2F6step 3.1

Subtracting a continuous finite-variation path preserves quadratic covariations: its squared-increment sum is at most its largest increment times its total variation, and its mixed-increment sum with Wi is at most the largest Brownian increment times that variation. Both errors tend to zero pathwise along every vanishing-mesh partition. The Brownian covariation limits also hold in Q-probability: P(En)→0 implies Q(En)=EP[ZT1En]→0 by integrability of ZT. Consequently [Bi,Bj]t=δijt under Q, and [F2] proves that B is Q-Brownian. The cited proof applies on [0,T] because it uses only finite pairs of times. Equivalently, if the Brownian space is defined for all times, set θ=0 after T and keep Z constant; the argument applies on every horizon and uses [F2] literally. A space defined only up to T can first be extended by an independent Brownian continuation.

5.1F4F5step 2.1step 4.1given

Consider that sufficient condition. The three candidate drifts are predictable by [F5] and obey ∣vt(X)∣≤K(1+sup⁡u≤t∣Xu∣) for some common K. The base Brownian and Euler equations are explicit, and the diffusion equation is covered by [F4]. Their solutions have finite second path moment: for Euler this follows immediately from its finite recursion and the Brownian maximal bound. Pathwise boundedness gives AT<∞. Set τn=inf⁡{t:At≥n}∧T and Ztn=exp⁡(Mt∧τn−At∧τn/2). By step 2.1 it is a true martingale. Under Qn=ZTnP, step 4.1 gives Brownian motion Bn=W−∫0⋅∧τnθsds, and substitution in the additive equation gives dXt=(1[0,τn](t)ct(X)+1(τn,T](t)at(X))dt+2dBtn. The initial law is unchanged and the switched drift obeys the same K bound.

6.1F4F6step 5.1algebra

Uniformly in n, EQnsup⁡t≤T∣Xt∣2≤CT:=(1+3E∣X0∣2+24dT)e6K2T2−1. To establish finiteness without assuming it, first stop X at its first exit from a ball of radius R. If ∣X0∣≥R the stop is zero and the stopped path is X0, which retains its integrable second moment. Before stopping, the drift bound uses the corresponding stopped path supremum. Cauchy–Schwarz, ∣x+y+z∣2≤3(∣x∣2+∣y∣2+∣z∣2), and [F4] therefore bound its expected squared supremum qn,R(t) by 3E∣X0∣2+24dT+6K2T∫0t(1+qn,R(s))ds. These quantities are finite for fixed R. Put H(t)=1+3E∣X0∣2+24dT+6K2T∫0t(1+qn,R(s))ds; then 1+qn,R≤H and H′≤6K2TH almost everywhere, so the integrating factor gives qn,R(T)≤CT. The ball stops tend to T on every bounded continuous path; Fatou proves the displayed bound.

7.1F1F5F6step 4.1step 5.1step 6.1

For the integrands used here, elementary left-endpoint sums on deterministic partitions refining the Euler grid give the identity MT∧τn=∫0T1[0,τn](s)θs⋅dBsn+AT∧τn. Here is a direct justification across the measure change. All path coefficients are continuous on each of finitely many open mesh intervals; multiplying by the stopping indicator adds at most one discontinuity. Stop further on bounded path and coefficient levels. Their left-endpoint staircases converge for almost every time on each path, are bounded, and hence converge in predictable L2 under both equivalent measures by dominated convergence. Both Brownian integrals converge by their respective isometries, while the drift integral converges by Cauchy–Schwarz. For each elementary sum the identity follows by substituting dW=dBn+1[0,τn]θds. Equivalence identifies the probability limits; removing the extra increasing stops proves the displayed identity. The Qn-Brownian integral has mean zero since its energy is at most n. As ∣θt∣2≤4K2(1+sup⁡u≤t∣Xu∣2), step 6.1 yields EP[ZTnlog⁡ZTn]=12EQnAT∧τn≤2K2T(1+CT).

8.1F3F6step 1.1step 3.2step 5.1step 7.1

Since zlog⁡z≥−1/e, step 7.1 gives, for R>1, EP[ZTn1{ZTn>R}]≤(2K2T(1+CT)+1/e)/log⁡R. Thus (ZTn) is UI. On every path with AT<∞, τn=T for all sufficiently large n, so ZTn→ZT almost surely and in L1. In particular EZT=1. Step 1.1 gives a supermartingale with initial mean one and terminal mean one, so every intermediate mean equals one; the nonnegative conditional supermartingale deficit has mean zero, proving true martingality of Z. Apply step 4.1 without stops to get the target equation. The base finite second path moment in step 5.1 and the coefficient bound imply EPAT<∞, so step 3.2 applies.

9.1F2F4F6F7step 4.1step 8.1

The target path law is uniquely determined, as follows. For target zero it is X0+2B; for Euler target it is the finite mesh recursion, a Borel function of (X0,B). For target b(Xt), use the Picard recursion Xm+1=X0+∫0⋅b(Xsm)ds+2B starting with Xt0=X0. Its iterates are Borel functions on Rd×C([0,T],Rd): integration of a continuous path is a uniform limit of its deterministic Riemann sums. For every fixed input (x,w), put C=T∣b(x)∣+2sup⁡∣w∣. The first iterate difference has supremum at most C, and induction in the Lipschitz integral inequality bounds the mth difference up to time t by CLm−1tm−1/(m−1)!. Their uniformly summable majorant proves uniform convergence for every continuous input. The limit is consequently a Borel function of that input. The deterministic Lipschitz integral inequality makes any solution with the same input agree with this limit: if h(t) is the path supremum of their difference, h(t)≤L∫0th(s)ds, and the integrating factor forces h=0. Under the changed measure, B has Wiener law and is independent of X0, because its future increments are independent of F0; independence of the entire path follows first on finite-time cylinder events and then on their generated Borel sigma-algebra by [F7]. Thus (X0,B) has the same product law on every such space, and its Borel solution map proves the asserted uniqueness in law.

10.1A1step 2.1step 4.1step 3.2step 8.1step 9.1step 1.3∎

If θ=0, then Z=1, Q=P and the entropy is zero. A zero mesh interval is omitted; the stated grid has strictly positive lengths, and no lower bound on those lengths is needed. At time zero all integrals vanish and the initial law is preserved. The excluded horizon T=0 has the same trivial conclusions. AC has exactly the inherited uses in [A1].

Source notes

Van der Vaart, Theorem 6.9 and Theorem 6.14 with their proofs, supply the exponential/product route and its source provenance. The bounded-energy argument above replaces the source's general Novikov/time-change argument. The entropy localization is supplied explicitly for the required linear-growth path drifts. No general Girsanov, Novikov, semimartingale measure-invariance, or weak-uniqueness theorem is taken as an unproved premise.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

MALA preserves its target probability exactly

Statement

Assume AC and the hypotheses of Metropolis-adjusted Langevin algorithm (MALA), with d≥1, U∈C1(Rd), 0<ZU=∫e−U(x)dx<∞, and γ>0. The MALA transition kernel Pγ is reversible with respect to πU(dx)=ZU−1e−U(x)dx, and therefore πU is invariant. This conclusion asserts neither irreducibility nor uniqueness, convergence, a rate, nor a central limit theorem.

Facts & Assumptions

Given: AC; the target and proposal specified by Metropolis-adjusted Langevin algorithm (MALA).

[A1]

AC supplies the accepted-flow Radon–Nikodym version in the general Metropolis–Hastings construction. The Axiom of Choice Metropolis–Hastings kernel

[F1]

MALA uses the ULA Gaussian proposal and explicit common-density acceptance ratio, with rejection mass placed at x. Metropolis-adjusted Langevin algorithm (MALA)

[F2]

The proposal Qγ is a probability kernel with finite, positive, jointly measurable density qγ(y∣x). The ULA Gaussian proposal is a probability kernel with a positive density

[F3]

The target density pU(x)=ZU−1e−U(x) is finite, positive, Borel measurable, and integrates to one, hence defines a probability measure in the sense of Probability measures and probability spaces. Unadjusted Langevin algorithm (ULA) Probability measures and probability spaces

[F4]

For a target density p and jointly measurable proposal density q against a common sigma-finite measure, the pointwise minimum ratio is a version of the accepted-flow Radon–Nikodym derivative. The common-density Metropolis–Hastings ratio

[F5]

A Metropolis–Hastings kernel built from a target probability and proposal probability kernel is reversible and leaves the target invariant. Metropolis–Hastings flow is reversible and invariant

[F7]

The Euclidean Borel space, with Borel sigma-algebra The Borel sigma-algebra of a topological space, is standard Borel in the sense of Standard Borel spaces, as required by the general Metropolis–Hastings suppliers. Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel Standard Borel spaces The Borel sigma-algebra of a topological space

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F3F4F6F7

By [F3], πU is a probability with positive finite density pU. By [F2], Qγ is a probability kernel with jointly measurable finite density qγ relative to the sigma-finite Lebesgue measure [F6]. The state-space hypothesis [F7] is also met. Thus the common-density ratio result [F4] applies at every pair (x,y) with pU(x)qγ(y∣x)>0, which holds because both factors are strictly positive. It identifies the MALA acceptance function in [F1] with a version of the accepted-flow derivative; the chosen pointwise version is measurable and belongs to [0,1].

2.1F1F5step 1.1∎

Step 1.1 and [F1] show that Pγ is precisely the Metropolis–Hastings transition built from target πU, proposal Qγ, and an accepted-flow derivative version, including its rejected self-transition. Applying [F5] gives reversibility and invariance of πU. No ergodicity or convergence premise is among the hypotheses, so no such conclusion follows here.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Pathwise relative-entropy error of the Langevin Euler interpolation

Statement

Assume AC. Let d≥1, let U∈C1(Rd) have globally L-Lipschitz gradient g=∇U, and let 0=t0<⋯<tN=T, γk+1=tk+1−tk, η(t)=tk on [tk,tk+1). On a complete usual filtered Brownian space, start with an F0-measurable X0 satisfying E∣X0∣2<∞ and interpolate the Euler recursion by Xt=Xtk−(t−tk)g(Xtk)+2(Wt−Wtk),tk≤t≤tk+1. Let E be its law on C([0,T],Rd) and let D be the path law of dYt=−g(Yt)dt+2dBt with the same initial law. Then E and D are equivalent and D(E∥D)=14E∫0T∣g(Xt)−g(Xη(t))∣2dt≤L24∑k=0N−1{γk+133E∣g(Xtk)∣2+dγk+12}. In particular the same upper bound holds for D(L(XT)∥L(YT)). The expectations in the bound are under the Euler law; its gradient moments are finite under the stated hypotheses. No convexity or stationarity is required, and the direction of the relative entropy is Euler relative to diffusion.

Facts & Assumptions

Given: AC, the potential, Lipschitz constant, finite mesh, square-integrable initial value, Brownian filtration, interpolation and path laws above.

[F1]

The finite-horizon change-of-drift lemma applies to drift choices b(Xt) and b(Xη(t)) for globally Lipschitz b, with the same square-integrable initial law. Its exponential is a true density, identifies the target path law, and satisfies the base-measure entropy identity and measurable-statistic data processing. Finite-horizon Brownian change of drift and relative entropy

[F2]

The Langevin diffusion is strongly well-posed and has finite second path moment. Each Brownian coordinate has squared maximal expectation at most 4T; finite-energy vector Brownian integrals obey their isometry. Global strong well-posedness for Lipschitz Itô SDEs Doob maximal bound for the Ito integral Ito isometry and linearity in predictable L2

[F3]

Brownian increments after tk are independent of Ftk, centered and have covariance (t−tk)Id. d-dimensional Brownian motion

[F4]

Relative entropy is directional and uses the Radon–Nikodym density; change of measure follows by integrating that density. Dominated convergence, Tonelli and Cauchy–Schwarz justify the integrable operations below. Kullback–Leibler divergence Likelihood-ratio change of measure Dominated convergence Tonelli's theorem for nonnegative measurable functions on a sigma-finite product Cauchy-Schwarz for random variables

[A1]

AC is inherited from the Brownian, Itô, SDE, change-of-measure and relative-entropy suppliers. The Axiom of Choice

Proof

1.1F1F2F3given

The finite Euler recursion and ∣g(x)∣≤∣g(0)∣+L∣x∣ give E∣Xtk∣2<∞ by induction, using the finite Brownian second moments. Its interpolation has Esup⁡t≤T∣Xt∣2<∞: on each of the finitely many intervals its supremum is bounded by ∣Xtk∣+γk+1∣g(Xtk)∣+2sup⁡tk≤t≤tk+1∣Wt−Wtk∣, whose square is integrable by [F2]. Thus every stated Euler gradient moment is finite. The diffusion law exists by [F2]. Apply [F1] on the Euler probability space with b=−g, at=−g(Xη(t)), ct=−g(Xt) and θt=g(Xη(t))−g(Xt)2,ZT=exp⁡(∫0Tθt⋅dWt−12∫0T∣θt∣2dt). It is a true positive density, and under Q=ZTP, X has diffusion path law D.

2.1F1F3F4step 1.1algebra

For h=t−tk, the increment representation and [F3] imply E∣Xt−Xtk∣2=h2E∣g(Xtk)∣2+2dh. The mixed term vanishes because g(Xtk) is Ftk-measurable and square integrable, while Wt−Wtk is centered and independent of that sigma-algebra. Lipschitz continuity and Tonelli now give E∫0T∣θt∣2dt≤L22∑k=0N−1{γk+133E∣g(Xtk)∣2+dγk+12}<∞. Indeed integrate h2 and 2dh on [0,γk+1]. The entropy identity of [F1] yields D(P∥Q)=12E∫∣θt∣2dt.

3.1F2F4step 1.1step 2.1construct

The exact path-law identity, rather than just its upper bound, follows because ZT is a measurable function of the Euler path. In fact Wt=Xt−X0+∫0tg(Xη(s))ds2 is a Borel functional of that continuous path. On deterministic refining partitions containing all mesh points, the left-endpoint step approximations to θ converge at almost every time on every continuous path: on an open Euler interval θ is continuous and at its left endpoint it equals zero. Their squared errors are bounded by a fixed constant times 1+sup⁡t≤T∣Xt∣2, integrable by step 1.1. Dominated convergence and the Itô isometry therefore make the corresponding stochastic sums converge to ∫θdW in L2(P). Each sum is a Borel path functional, since both θ and the recovered Brownian increments are such functionals. Choose a subsequence whose squared L2 errors are at most 2−3j; Markov's inequality bounds the probability of error exceeding 2−j by 2−j, so the union bound on the tails shows almost sure convergence. Define its Borel limit arbitrarily on the Borel nonconvergence set. Also ∫∣θ∣2dt is a Borel path functional, by ordinary interval Riemann approximation. Hence ZT=z(X) almost surely for some positive Borel function z (reset its value to one where the constructed exponential is not finite and positive).

4.1F2F4step 2.1step 3.1algebra

For every Borel path set C, D(C)=Q(X∈C)=EP[ZT1{X∈C}]=∫Cz dE. Since z>0 almost everywhere, the two path laws are equivalent and dD/dE=z. The logarithm is integrable under E because its pullback equals ∫θdW−12∫∣θ∣2dt, with the first term square integrable and the second integrable by step 2.1. Thus D(E∥D)=EP[−log⁡ZT]=12E∫0T∣θt∣2dt=14E∫0T∣g(Xt)−g(Xη(t))∣2dt. Combining with step 2.1 proves the asserted upper bound.

5.1A1F1step 4.1∎

Terminal evaluation is a measurable statistic on continuous path space. Data processing in [F1] therefore gives D(L(XT)∥L(YT))≤D(E∥D). If L=0, g is constant, Euler interpolation already solves the diffusion and both entropies and the displayed bound are zero. At t=0 the path laws have the same initial law; the trivial zero-horizon case likewise has entropy zero. All positive step lengths, including a single interval, were covered without a minimum-step restriction. AC has exactly the inherited uses stated in [A1].

Source notes

Durmus–Moulines v3, equations (12)–(15), motivates the interpolation bound. Its Euler expectations give the directional entropy D(E∥D) used here. The Brownian exponential in step 1.1 fixes the density sign without relying on a path-coordinate sign convention in a source formula. The change-of-measure and entropy arguments are supplied by the proved local supplier, rather than by an external Girsanov citation.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Langevin diffusion has a reversible density and compact minorization

Statement

Assume AC. Let d≥1, U∈C2(Rd), ∇U be L-Lipschitz, and let x⋆ be a global minimizer with U(x⋆)=0. The solutions of dXt=−∇U(Xt) dt+2 dBt,X0=x, define a Borel Markov semigroup Pt. For every t>0 it has a positive jointly Borel density pt(x,y) relative to Lebesgue measure, and e−U(x)pt(x,y)=e−U(y)pt(y,x). If Z=∫e−U dx∈(0,∞), then Z−1e−U(x)dx is invariant. For every R>0 and t>0, there are ϵ>0 and a probability ν such that Pt(x,A)≥ϵν(A) for every Borel A and ∥x−x⋆∥≤R.

Facts & Assumptions

Given: AC and the potential, minimizer, and Brownian equation in the Statement.

[A1]

AC is inherited through Brownian, Gaussian, Ito and change-of-measure constructions. The Axiom of Choice

[F1]

Globally Lipschitz coefficients with linear growth have a unique strong solution from each square-integrable initial state on every finite horizon. Global strong well-posedness for Lipschitz Itô SDEs

[F2]

A true stochastic exponential changes a Brownian drift by its integrand. Finite-horizon Brownian change of drift and relative entropy

[F3]

Multidimensional Ito's formula applies to U(x+2Bt) and to its exponential compositions. Multidimensional Ito formula for Brownian-driven processes

[F4]

Brownian finite-dimensional laws are Gaussian with covariance min⁡(s,u)Id, independent future increments, and continuous paths; uncorrelated jointly Gaussian finite blocks are independent. d-dimensional Brownian motion Uncorrelated jointly Gaussian blocks are independent

[F5]

Continuous-path Borel sets are generated by rational evaluations; equality on a generating pi-system extends by the pi-lambda theorem. The same assertion on a finite interval and in finitely many coordinates follows by restriction, constant extension, and finite products. Borel sigma-algebra of continuous path space is generated by coordinates Dynkin's pi-lambda theorem

[F6]

The Gaussian increment 2Bt has density ht(z)=(4πt)−d/2e−∥z∥2/(4t). Each coordinate Brownian path obeys Esup⁡s≤t∣Bsi∣2≤4t. A positive-definite multivariate normal law has its Gaussian density Doob maximal bound for the Ito integral

[F7]

Tonelli interchanges nonnegative integrals, and dominated convergence applies under a fixed integrable majorant. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product Dominated convergence

[F8]

A differentiable global minimizer has zero gradient. Fermat's theorem: an interior differentiable local extremum has zero gradient

Proof

Given: The hypotheses in the Statement.

1.1A1F1F4F8construct

Put g=∇U. By [F8], g(x⋆)=0, so ∥g(x)∥≤L∥x−x⋆∥; the equation meets [F1]. Its additive-noise integral equation is Xs=x−∫0sg(Xu)du+2Bs. For each continuous input path the deterministic Picard iteration converges uniformly on finite intervals: successive differences are bounded by a fixed finite constant times Lnsn/n!, by repeated integration. The limit is the unique solution; subtraction and the same iterative integral bound give sup⁡s≤t∥Xsx,w−Xsz,v∥≤eLt(∥x−z∥+2sup⁡s≤t∥ws−vs∥). Thus the solution is a continuous function of its initial point and driving path. Its flow composition identity follows from uniqueness of the integral equation. Independent Brownian future increments [F4] now give the Markov and semigroup identities; integration of its Borel solution map against the Brownian law gives a Borel transition kernel. Solutions on integer horizons agree by uniqueness and hence define all t≥0.

1.2F4F5F6construct

Define βs=2(Bs−sBt/t) for 0≤s≤t. For any finite list of times its coordinates together with Bt are jointly Gaussian and Cov⁡(Bs−sBt/t,Bt)=0. By [F4] that finite bridge block is independent of Bt. Apply [F5] to rational-time cylinders to obtain independence of the entire bridge path and Bt. Thus Brownian paths disintegrate explicitly as Ys=x+(s/t)(y−x)+βs when their endpoint has value y, with endpoint density ht(y−x) and bridge law independent of y. This identity holds first for cylinder functions by independence and the Gaussian endpoint density, then for all bounded Borel path functions by [F5], and for nonnegative ones by monotone approximation. The bridge has covariance 2(min⁡(s,u)−su/t)Id, which is unchanged when (s,u) is replaced by (t−s,t−u); its mean is zero. Gaussian finite-dimensional laws and [F5] therefore also give equality in law of βs and βt−s.

2.1F2F3F7step 1.1algebra

Under Brownian law put Ys=x+2Bs. The stochastic exponential with integrand −g(Ys)/2 is, by [F3], Zs=exp⁡ ⁣(U(x)−U(Ys)2+∫0s{ΔU(Yu)2−∥g(Yu)∥24}du). Lipschitz continuity gives ∣∂iiU∣≤L by taking coordinate difference quotients. Since U≥0, for s≤t this positive local martingale is bounded above by eU(x)/2+tdL/2. Stop at increasing energy/local-martingale levels. Dominated convergence [F7] in the stopped martingale identities makes Z a true martingale of mean one. By [F2], under Zt times Brownian law the process Bs+∫0sg(Yu)/2 du is Brownian, so Y solves the Langevin equation. The explicit unique solution map of step 1.1 identifies its law with Pt(x,⋅).

3.1F5F7step 2.1step 1.2algebra

Put H(z)=ΔU(z)/2−∥g(z)∥2/4 and bsx,y=x+(s/t)(y−x)+βs. Combining steps 2.1 and 1.2 gives the density pt(x,y)=ht(y−x)e(U(x)−U(y))/2 Eexp⁡ ⁣(∫0tH(bsx,y)ds). The integral is a continuous function of (x,y,β) in the uniform path topology, since H is continuous and uniformly continuous on each compact set containing the convergent paths. Its exponential is strictly positive and bounded above by etdL/2. Consequently its expectation is positive, finite, and continuous in (x,y) by dominated convergence; the density is jointly Borel. Its integral in y is one by step 2.1. Bridge reversal from step 1.2 interchanges x,y without changing the integral of H, and ht(y−x)=ht(x−y). Multiplication by e−U(x) proves the asserted symmetry. If Z<∞, Tonelli and the mass-one identity give ∫Z−1e−U(x)pt(x,y)dx=Z−1e−U(y)∫pt(y,x)dx=Z−1e−U(y), proving invariance.

4.1F6F7step 1.1step 3.1algebra∎

By [F6], Esup⁡s≤t∥Bs∥2≤4dt, and sup⁡∥βs∥2≤8sup⁡∥Bs∥2. With a0=64dt, Markov's inequality (integrate 1{Y>a02}≤Y/a02 for Y=sup⁡∥β∥2) gives Pr⁡(sup⁡∥β∥≤a0)≥1/2. If both endpoints lie in the ball D={∥z−x⋆∥≤R}, on this event the bridge lies in the radius R+a0 ball. Therefore H(bsx,y)≥−dL/2−L2(R+a0)2/4 and the bridge expectation in step 3.1 is at least one half times the exponential of −t[dL/2+L2(R+a0)2/4]. The heat factor is at least (4πt)−d/2e−R2/t on D2, and e(U(x)−U(y))/2≥e−sup⁡DU/2>0. Thus a constant c>0 bounds pt below on D2. Let ν be normalized Lebesgue measure on D and ϵ=min⁡{cLeb⁡(D),1/2}>0. Integrating the density over A∩D proves the stated minorization. The radius is positive, so the normalizing volume is finite and nonzero.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

ULA invariant laws have uniform exponential moments on the needed step ranges

Statement

Assume AC and the hypotheses of ULA's Gaussian kernel satisfies an exponential drift bound. Let Rγ be the ULA kernel, V=eU/2, W=eU/4, and γ0=(2L)−1. For every 0<γ<L−1 there is a unique invariant probability πγ, and πγV<∞. There are finite constants MV,MW,Mg, independent of γ, such that sup⁡0<γ≤γ0πγV≤MV,sup⁡0<γ<L−1πγW≤MW,∥∇U(x)∥2+∥x−x⋆∥2≤MgV(x).

Facts & Assumptions

Given: AC, the stated potential and radial constants, and 0<γ<L−1.

[A1]

AC is inherited through the Gaussian and weighted Hahn/Jordan interfaces. The Axiom of Choice

[F1]

The ULA kernel has a positive continuous Gaussian density, with proposal x−γ∇U(x)+2γZ. Unadjusted Langevin algorithm (ULA) The ULA Gaussian proposal is a probability kernel with a positive density

[F2]

The fixed-step Gaussian kernel satisfies RγV≤e−γV+bγ1Dγ for a finite constant and a compact ball. ULA's Gaussian kernel satisfies an exponential drift bound

[F3]

Radial drift gives U(x)≥c∥x−x⋆∥α−C for some c>0; hence V-sublevel sets are contained in compact balls. Radial gradient drift forces potential coercivity

[F4]

Global geometric drift and minorization on a sufficiently large weight-sublevel set give invariant existence, a finite weight moment, and uniqueness among all invariant probabilities. Global drift and one-step minorization give weighted contraction and a unique invariant law

[F5]

An exponential with positive exponent dominates every fixed nonnegative integer power at infinity. The exponential dominates every fixed nonnegative integer power at +∞

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F3

Fix γ. Dropping the indicator in [F2] gives a global drift RγV≤e−γV+bγ with finite bγ. Each sufficiently large V-sublevel is contained in a compact ball by [F3]. On the product of that starting ball and any fixed positive-radius target ball, the continuous positive density [F1] has a positive minimum: explicitly its Gaussian exponent is bounded because both balls and the continuous gradient are bounded. Restriction to the target ball and normalization of its positive finite volume give a common minorization. These are precisely the drift and minorization hypotheses for the weight V.

1.2F6givenalgebra

By [F6], g(x⋆)=0, and therefore Lipschitz continuity gives ∥g(x)∥≤L∥x−x⋆∥. If r=∥x−x⋆∥ is positive and at least the radial radius, Cauchy–Schwarz and the radial hypothesis give ∥g(x)∥r≥⟨g(x),x−x⋆⟩≥ρrα, so ∥g(x)∥≥ρrα−1. For h=y−x, integrate the derivative along x+th and subtract ⟨g(x),h⟩ to obtain U(y)−U(x)−⟨g(x),h⟩=∫01⟨g(x+th)−g(x),h⟩dt≤L2∥h∥2.

1.3F7algebra

Completing the square, [F7] gives for c<1/2 and scalar v the identity (2π)−1/2∫Re−(1/2−c)z2+vzdz=(1−2c)−1/2ev2/(2(1−2c)). Finite multiplication and Tonelli therefore give Eec∥Z∥2+⟨v,Z⟩=(1−2c)−d/2e∥v∥2/(2(1−2c)) for Z∼Nd(0,Id).

2.1F4step 1.1

Apply [F4] to the fixed-step kernel and weight V verified in step 1.1. It supplies a unique invariant probability πγ with finite V moment.

2.2F1step 1.2step 1.3algebra

Put g=∇U(x) and Hs=esU for 0<s<1 with 2sLγ<1. Apply step 1.2 to Y=x−γg+2γZ, multiply by s, and exponentiate. Step 1.3, with quadratic coefficient sLγ and linear coefficient s2γ(1−Lγ)g, gives RγHs(x)Hs(x)≤(1−2sLγ)−d/2exp⁡ ⁣(−sγ(1−s−Lγ/2)1−2sLγ∥g∥2). The coefficient follows by combining sγ(−1+Lγ/2) with s2γ(1−Lγ)2/(1−2sLγ) over the common denominator. All Gaussian integrals are finite under 2sLγ<1.

3.1step 2.1step 1.2step 2.2algebra

For s=1/2, step 2.2 reduces to RγV≤Vexp⁡ ⁣(d2[−log⁡(1−Lγ)]−γ4∥g∥2). If γ≤γ0, then −log⁡(1−Lγ)≤2Lγ, since −log⁡(1−z)=∫0z(1−u)−1du≤2z for z≤1/2. Choose a radius R at least the radial radius and large enough that ρ2R2(α−1)/4≥dL+1. Outside this ball step 1.2 makes the exponent at most −γ. Inside it let M=sup⁡∥x−x⋆∥≤RV(x)<∞. Since eaγ−e−γ=∫−γaγeudu≤(a+1)γeaγ0 for a=dL, the preceding bound gives RγV≤e−γV+bγ,b=M(dL+1)edLγ0, uniformly for small steps. Integrate against the finite-V invariant law from step 2.1 to obtain πγV≤bγ/(1−e−γ)≤beγ0, using 1−e−γ=∫0γe−udu≥γe−γ0. This proves the first uniform bound.

4.1step 2.1step 1.2step 2.2step 3.1algebra

For s=1/4 and 0<γ<L−1, the logarithm of the prefactor in step 2.2 is at most dLγ/2, by the same integral estimate with z=Lγ/2<1/2. Moreover s(1−s−Lγ/2)/(1−2sLγ)≥1/16, because the numerator is at least 1/16 and the denominator is at most one. Choose R' at least the radial radius such that ρ2(R′)2(α−1)/16≥dL/2+1. Outside this ball RγW≤e−γW; inside use M′=sup⁡∥x−x⋆∥≤R′W(x) and the exponential-difference estimate from step 3.1 with a=dL/2 and upper horizon L−1. Thus RγW≤e−γW+b′γ,b′=M′(dL/2+1)ed/2, for the whole step range. Since W≤V, its invariant moment is finite by step 2.1. Integrating and using 1−e−γ≥γe−1/L gives πγW≤b′e1/L, uniformly for every allowed step.

5.1F3F5step 1.2step 3.1step 4.1algebra∎

Put r=∥x−x⋆∥. For r≥1, [F3] gives V(x)≥e−C/2ecrα/2≥e−C/2ecr/2 because α>1. By [F5], r2/ecr/2 is bounded on [1,∞); on [0,1] use r2≤1≤V. Thus r2≤AV for some finite A. The Lipschitz bound in step 1.2 gives ∥∇U(x)∥2≤L2r2. Taking Mg=(1+L2)A, MV=beγ0 and MW=b′e1/L proves all asserted estimates. All constants depend only on the fixed potential and its displayed parameters.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Radial drift gives weighted geometric contraction of Langevin diffusion

Statement

Assume AC and the smoothness, minimizer, normalization and radial hypotheses of Exponential Lyapunov drift for the formal Langevin generator. Suppose Z=∫e−U(x)dx∈(0,∞) and put π(dx)=Z−1e−U(x)dx. For 0<s<1, write Hs=esU and let as=sdL and bs=βs be the constants in that lemma. The Langevin semigroup of Langevin diffusion has a reversible density and compact minorization satisfies PtHs(x)≤e−astHs(x)+bsas(1−e−ast),πHs<∞. There are Cs<∞ and vs>0, depending on the potential and s, such that for any probability measures μ,ν with finite Hs moments and any t≥0, ∥μPt−νPt∥Hs≤Cse−vst∥μ−ν∥Hs. The norm is Weighted total variation for probability measures.

Facts & Assumptions

Given: AC, U, its constants, the semigroup, and s∈(0,1) in the Statement.

[A1]

AC is inherited through the stochastic and Hahn/Jordan interfaces. The Axiom of Choice

[F1]

The Langevin equation has a Borel Markov semigroup, invariant target π, and one-step minorization on every compact ball for every fixed positive time. Langevin diffusion has a reversible density and compact minorization

[F2]

For Hs=esU the formal generator satisfies LUHs≤−asHs+bs1{∥x−x⋆∥≤Ks}, with as>0 and finite bs. Exponential Lyapunov drift for the formal Langevin generator

[F3]

Radial drift gives U(x)≥c∥x−x⋆∥α−C for c>0. Consequently every sublevel set of Hs is contained in a finite-radius ball. Radial gradient drift forces potential coercivity

[F4]

Ito's formula applies to the solution; after stopping in a compact ball its stochastic integral is square-integrable and has mean zero. Multidimensional Ito formula for Brownian-driven processes Stopping an Ito integral Ito isometry and linearity in predictable L2

[F5]

Fatou passes nonnegative stopped estimates to the unstopped limit; Tonelli integrates the resulting nonnegative kernel bounds over initial laws. Fatou's lemma Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F6]

Global geometric drift and a common minorization on one sufficiently large weight-sublevel set give a unique invariant probability, finite weight moment, and geometric contraction in that weighted norm. Uniqueness holds among all invariant probabilities. Global drift and one-step minorization give weighted contraction and a unique invariant law

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F4F5algebra

Fix a deterministic starting point x and horizon t. Stop the continuous solution at its first exit τn from the radius-n ball about x⋆, taking n>∥x−x⋆∥. Apply [F4] to easuHs(Xu) up to t∧τn. Its drift is at most bseasu by [F2]. Its stochastic integrand is bounded on this stopped finite cylinder, so its expectation is zero. Hence Ex[eas(t∧τn)Hs(Xt∧τn)]≤Hs(x)+bsas(east−1). The globally defined continuous paths in [F1] are bounded on [0,t], so τn>t eventually on each such path. Fatou [F5] and division by east give the claimed semigroup moment bound.

2.1F1F3F6step 1.1

In particular P1Hs≤aHs+b with a=e−as∈(0,1) and b=(bs/as)(1−e−as)<∞. Any sufficiently large level set {Hs≤R} is contained in a ball by [F3], and inherits the common minorization for P1 from [F1]. The weighted drift-minorization result [F6] therefore gives an invariant law ξs with finite Hs moment and constants Ms<∞, rs∈(0,1) such that ∥μPn−νPn∥Hs≤Msrsn∥μ−ν∥Hs(n∈N). Since [F1] already makes π invariant and [F6] gives uniqueness among every invariant probability, ξs=π and πHs<∞.

3.1F5F6step 1.1step 2.1algebra∎

For 0≤u<1, step 1.1 gives PuHs≤Hs+bs/as≤(1+bs/as)Hs, since Hs≥1. For every Borel f with ∣f∣≤Hs, therefore ∣Puf∣≤(1+bs/as)Hs. Taking the test-function supremum shows ∥μPu−νPu∥Hs≤(1+bs/as)∥μ−ν∥Hs. All integrals are finite by step 1.1 and [F5]. Write t=n+u with n=⌊t⌋ and apply this estimate after the integer contraction in step 2.1. With vs=−log⁡rs>0 and Cs=Ms(1+bs/as)rs−1, the result follows from rsn≤rs−1e−vst. This includes t=0 and all stated finite-moment initial laws.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

ULA's invariant-law bias under smoothness and radial drift

Statement

Assume AC (The Axiom of Choice) and the hypotheses of Unadjusted Langevin algorithm (ULA). In addition, let U∈C2(Rd), let ∇U be L-Lipschitz for L>0, and suppose there are a global minimizer x⋆, ρ>0, α∈(1,2], and Mρ≥0 such that ⟨∇U(x),x−x⋆⟩≥ρ∥x−x⋆∥αwhenever ∥x−x⋆∥≥Mρ. Assume 0<ZU=∫e−U(x)dx<∞ and normalize U(x⋆)=0; subtracting a constant leaves the target and ULA kernel unchanged and only rescales the weight by a constant. Put πU(dx)=ZU−1e−U(x)dx and V(x)=eU(x)/2. For every 0<γ<L−1, the ULA kernel has a unique invariant probability πγ, both πU and πγ have finite V1/2 moments, and ∥πU−πγ∥V1/2≤Cγ1/2, where the finite source-dependent constant C is independent of γ. The norm is the weighted total-variation norm of Weighted total variation for probability measures.

Facts & Assumptions

Given: AC and the potential, target, weights and step size in the Statement.

[A1]

AC is inherited through the Brownian/Gaussian, Ito, change-of-measure and Hahn/Jordan interfaces. The Axiom of Choice

[F1]

The ULA kernel Rγ is that of Unadjusted Langevin algorithm (ULA). It has a unique invariant πγ with finite V moment for every 0<γ<L−1. With γ0=(2L)−1, constants MV,MW,Mg<∞ independent of the step satisfy πγV≤MV for γ≤γ0, πγW≤MW for all allowed steps, and ∥∇U(x)∥2+∥x−x⋆∥2≤MgV(x), where W=V1/2. ULA invariant laws have uniform exponential moments on the needed step ranges

[F2]

The Langevin semigroup leaves πU invariant, has πUV<∞, satisfies PtV≤V+BV for a fixed finite BV, and contracts zero-mass differences in the W norm: ∥μPt−νPt∥W≤CWe−vWt∥μ−ν∥W, with CW<∞ and vW>0. Radial drift gives weighted geometric contraction of Langevin diffusion

[F3]

From any finite-second-moment initial probability, the endpoint relative entropy of an m-step Euler interpolation against the Langevin endpoint satisfies D(Law⁡(Xm)∥Law⁡(Ymγ))≤(L2/4)∑k=0m−1(γ3E∥∇U(Xk)∥2/3+dγ2). Pathwise relative-entropy error of the Langevin Euler interpolation

[F4]

For probabilities with finite V moments, weighted Pinsker with W2=V gives ∥μ−ν∥W2≤2(μV+νV)D(μ∥ν). A weighted total-variation bound from relative entropy

[F5]

Weighted total variation is the supremum over Borel tests ∣f∣≤W and obeys the triangle inequality; it is at most μW+νW for two probabilities with finite W moments. Weighted total variation for probability measures

Proof

Given: The hypotheses in the Statement, with W=eU/4 and γ0=(2L)−1.

1.1A1F1F2algebrachoose

By [F1], for each allowed step the unique invariant probability πγ exists and has finite V moment, hence finite W moment since 1≤W≤V. By [F2], πUV<∞, so its W moment is finite too. Choose a fixed T0>0 so that CWe−vWT0≤1/2, possible because vW>0. All these constants depend only on the potential and its hypotheses.

2.1A1F1F3step 1.1algebraconstruct

First suppose 0<γ≤γ0. Put m=⌈T0/γ⌉ and T=mγ, so T0≤T<T0+γ≤T0+γ0. Start Euler with law μ=πγ, independently of its Brownian increments; every grid-time law is μ by invariance. Its second moment is finite by [F1], since ∥x∥2≤2∥x−x⋆∥2+2∥x⋆∥2. Moreover E∥∇U(Xk)∥2≤MgMV at every grid time. Apply [F3] to the diffusion with the same initial law. Euler's endpoint law is μ and diffusion's is μPT, giving D(μ∥μPT)≤L24m(γ33MgMV+dγ2)≤KDγ,KD=L24(T0+γ0)(d+γ03MgMV). The initial Brownian/Gaussian construction uses only the inherited AC assumption.

3.1F1F2F4F5step 1.1step 2.1algebra

By [F1], μV≤MV; by [F2], (μPT)V≤MV+BV. Weighted Pinsker [F4] and step 2.1 therefore imply ∥μ−μPT∥W≤KEγ,KE=2(2MV+BV)KD. Since πUPT=πU, the contraction [F2], the choice of T0, and T≥T0 give ∥μ−πU∥W≤KEγ+∥μPT−πUPT∥W≤KEγ+12∥μ−πU∥W. The last norm is finite by step 1.1, so subtraction yields ∥πγ−πU∥W≤2KEγ throughout the small-step range.

4.1F1F5step 1.1step 3.1algebra∎

If γ0<γ<L−1, [F1] and [F5] give ∥πγ−πU∥W≤MW+πUW≤(MW+πUW)γ0−1/2γ. Together with step 3.1, this proves the stated bound with C=max⁡{2KE,(MW+πUW)γ0−1/2}<∞, independent of γ over the entire specified open interval. Step 1.1 supplies both finite weight moments and uniqueness/existence for every such step.

5 · Examples, counterexamples and false statements

None yet.

Sources