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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Brownian Path Properties
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Conformal Prediction and Exchangeable Ranks
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite-history linear prediction
- Forward Itô SDE Well-Posedness
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- General-state Markov kernels, invariance, and reversibility
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hamiltonian Monte Carlo and leapfrog correction
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Itos Formula and Brownian Martingales
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Metropolis–Hastings kernels
- Minimax Lower Bounds
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Recurrence Transience and Hitting Times for Markov Chains
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- SCM, DAGs, adjustment
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Stopping Times and Optional Stopping
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · 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
Weighted total variation for probability measures
Definition
Let , let be Borel measurable, and let be Borel probability measures on with and . Define their -weighted total-variation distance by The moment hypotheses make every integral in the supremum finite. This is the signed-measure test-function norm used in weighted-variation bounds. For 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.
Radial gradient drift forces potential coercivity
Statement
Let , , and suppose is -Lipschitz for some . Let be a global minimizer, normalize , and assume that for some , , and , Then every satisfies
Facts & Assumptions
Given: The hypotheses in the Statement; is the Euclidean coordinate gradient and and are the Euclidean inner product and norm.
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 on .
At an interior differentiable local minimum, the gradient vanishes. Fermat's theorem: an interior differentiable local extremum has zero gradient
The derivative of a composition with a differentiable path is given by the total-derivative chain rule. The chain rule for total derivatives:
A continuous derivative integrates to the endpoint difference. Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative
Proof
Given: The potential and constants in the Statement.
Put and . By [F1], . The path is continuously differentiable, and [F2]–[F3] give For , Lipschitz continuity gives , hence the integrand is at least by [F4].
If , integrating the bound from step 1.1 over yields . Since , this is at least .
Suppose and . On , the bound in step 1.1 integrates to at least . On , the radial assumption gives For , division by and show that the path derivative is at least .
Integrating the outer-segment bound in step 2.2 and adding the inner-segment bound gives Because , , so this is at least .
If , the claimed inequality reads and holds because . Steps 2.1 and 3.1 cover all other , proving the bound.
Exponential Lyapunov drift for the formal Langevin generator
Statement
Let , , and suppose is -Lipschitz with . Let be a global minimizer with , and assume the radial condition of Radial gradient drift forces potential coercivity with parameters , , and . For , set where is only the displayed formal differential operator here. Define Then for every ,
Facts & Assumptions
Given: , , and the constants in the Statement.
, its gradient is -Lipschitz, is a global minimizer with , and the stated radial drift condition holds. The Euclidean inner product and gradient are those of The Euclidean inner product on 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.
A differentiable function at an interior local minimum has zero gradient. Fermat's theorem: an interior differentiable local extremum has zero gradient
The chain rule computes derivatives of compositions. The chain rule for total derivatives:
The fundamental theorem of calculus integrates a continuous derivative along a compact interval. Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative
Proof
Given: The hypotheses and formal operator in the Statement.
By [F1], . For each coordinate vector , the Lipschitz bound gives Taking yields , so .
Applying [F2] coordinatewise to gives Substitution in the displayed definition of therefore gives
If and , radial drift and [F3] imply . Thus when , the formula in step 2.1 and give The same conclusion holds for by the definition of .
For and , Lipschitz continuity and [F1] give . The chain rule and [F4] therefore yield . Since , on we have . Also by step 1.1, so step 2.1 implies .
On use step 3.1, and on use step 3.2. These two regions cover and give the displayed drift inequality.
Unadjusted Langevin algorithm (ULA)
Definition
Assume AC (The Axiom of Choice). Let , let be Borel measurable in the sense of Borel measurable and Lebesgue measurable functions on and continuously differentiable with and define the target probability This is the measure with density relative to Lebesgue measure (The measure with density relative to and Lebesgue measurable sets, the family , and the restricted set function ); the probability-measure convention is Probability measures and probability spaces, and the normalizer makes its total mass one. Given a step size , an initial state , and an IID sequence , using the multivariate-normal law of Multivariate normal law, including singular covariance and standard-normal convention of Standard normal and normal laws, repeat for :
- Compute the Euclidean gradient using the convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case.
- Take the fixed-step gradient update , the fixed-step branch of Gradient descent.
- Set
The one-step transition law is The procedure applies the proposal at every step and has no accept/reject correction. The probability-kernel and density properties of 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 ; those are separate mathematical claims.
A weighted total-variation bound from relative entropy
Statement
Assume AC. Let be Borel probability measures on , and let be Borel measurable with . Then where are probability measures in the sense of Probability measures and probability spaces, is defined in Weighted total variation for probability measures and is the directional relative entropy of Kullback–Leibler divergence. If , the inequality is understood in the extended-real sense and is immediate.
Facts & Assumptions
Given: AC; probability measures ; a Borel weight with finite second moments under both measures.
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
If , then , the density is nonnegative, and with . Kullback–Leibler divergence Integrating against a Radon-Nikodym derivative recovers integration against the measure
The directional relative entropy has finite negative part and . Kullback–Leibler divergence Integrating against a Radon-Nikodym derivative recovers integration against the measure
Cauchy–Schwarz gives for square-integrable . Cauchy-Schwarz inequality for
For , and , because the integral logarithm agrees with the natural logarithm of The natural logarithm as the inverse of the exponential function. The integral logarithm satisfies for and The integral logarithm is the published natural logarithm The natural logarithm as the inverse of the exponential function
Differentiation obeys the sum, scalar-multiple and product rules on ; squares are products of two identical factors. The mean value theorem applies to the resulting continuously differentiable scalar functions. Sums, scalar multiples, products and quotients: , , , and when The integral logarithm satisfies for and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
Integrals of integrable real functions are linear. The Lebesgue integral is linear on
Proof
Given: The hypotheses in the Statement.
Define and for . For , the function satisfies and . The mean value theorem on gives , so . Now satisfies and by [F4]–[F5]; another application of the mean value theorem gives . At the inequality holds because .
For , put . By [F5], and using [F4] and for . The mean value theorem applied first to and then to shows and for . Combining with step 1.1 gives
It remains to consider finite . Let as in [F1]. For every Borel with , the Radon–Nikodym identity gives Applying step 2.1 pointwise and [F3] with factors and bounds this by The moment hypotheses make the first factor finite, and [F1], [F2], and [F6] identify the second integral with the directional relative entropy, using . Taking the supremum over proves the claim.
Global drift and one-step minorization give weighted contraction and a unique invariant law
Statement
Assume AC. Let be a Borel probability kernel on , , and let be finite and Borel. Suppose Suppose that for some the set is nonempty and there are a probability and such that Then has a unique invariant probability , uniqueness being among all Borel probabilities, and . There are and such that for all finite--moment probabilities and , In particular, The norm is that of Weighted total variation for probability measures. Explicitly, put The same contraction holds for finite signed with and , with replaced by .
Facts & Assumptions
Given: The kernel, finite weight, global drift and one-step sublevel minorization in the Statement.
AC, The Axiom of Choice, is assumed for the general signed-measure Jordan existence clause below.
Jordan decomposition of a signed measure into unique mutually singular positive parts gives a Hahn partition and mutually singular positive parts under AC; For a signed measure, total variation is nu-plus plus nu-minus, finite partitions suffice, and nu-plus and nu-minus are extremal identifies .
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.
Finite-total-variation signed measures are complete gives completeness of finite signed measures in the norm .
Measure kernel and probability kernel and Measurability of integration against a kernel give measurable kernel integrals.
Finite products of probability kernels are probability kernels gives finite probability products; Tonelli's theorem for nonnegative measurable functions on a sigma-finite product gives their marginal integration identities.
Invariant and stationary distribution for a Markov kernel defines and invariance. Dominated convergence applies to bounded measurable kernel evaluations under any probability.
Weighted total variation for probability measures uses the supremum over all Borel , without the event-distance factor of one half.
Proof
Given: The hypotheses and facts [A1], [F1]–[F7].
Put and, for finite signed with , define . Obtain a Hahn partition by [F1]. The upper bound and the test give . Multiplication 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 . Conversely, for any finite signed , multiplication by gives and is inverse to . The density integration identities follow first for indicators and simple functions, then by monotone convergence. Thus [F3] makes the finite--moment signed-measure space complete. Also .
Define . Each positive part acts by integration of the kernel evaluations. Countable additivity follows by monotone convergence. The inequality follows by bounding the variation sum on every countable measurable partition by the corresponding positive measure . The drift gives , so has finite moment whenever does. Kernel integration is Borel and finite for , and , by the indicator identity and monotone convergence applied separately to positive and negative parts. Total mass is preserved.
The constants satisfy and if , while if . Both displayed component rates are in . Fix Borel , and write . If , then . Since is decreasing for , this gives .
If , both states are in . The residual probabilities are well defined there. Fixing one point of the nonempty , the minorization and finite give . Consequently is finite, and the common term cancels from . Thus . The residual evaluations are Borel on , so these are legitimate kernel integrations; no selected optimal coupling is involved.
Let have zero mass and finite norm. If , its Jordan masses agree at some ; put and . They concentrate on disjoint Hahn sets. Integration of steps 3.1 and 4.1 against gives, for every , . Every integral is finite by the finite moments and step 2.1. For the inequality is immediate. Taking the supremum and iterating, using preservation of mass and moments, proves . Norm comparison in step 1.1 yields , including differences of the stated probabilities.
Fix and set . The difference has finite norm, and step 5.1 gives . The geometric tail sum makes Cauchy, so step 1.1 gives a signed-measure limit with finite norm. Norm convergence implies for every Borel and . Thus is a probability and . Step 5.1 gives ; since , it follows that . Finally drift iteration gives . Because , norm convergence gives , whence .
Apply step 5.1 to . Its norm is at most , giving the pointwise asserted bound. If is any invariant probability, without a moment assumption, then for each Borel the pointwise convergence and give 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.
The ULA Gaussian proposal is a probability kernel with a positive density
Statement
Assume AC and the hypotheses of Unadjusted Langevin algorithm (ULA). For , its proposal family is a probability kernel on and has the everywhere positive finite jointly continuous Lebesgue density
Facts & Assumptions
Given: AC, a finite , , , and the proposal in Unadjusted Langevin algorithm (ULA).
AC holds as required by the algorithm and multivariate normal law. The Axiom of Choice Unadjusted Langevin algorithm (ULA)
For positive-definite covariance, has the displayed Gaussian Lebesgue density. A positive-definite multivariate normal law has its Gaussian density
is a probability law when is symmetric positive semidefinite; its coordinates and projections follow the multivariate-normal convention. Multivariate normal law, including singular covariance
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
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
Lebesgue measure on is sigma-finite in the sense of Finite, sigma-finite, and semifinite measures, with finite mass on bounded boxes. Lebesgue measurable sets, the family , and the restricted set function Finite, sigma-finite, and semifinite measures Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure
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 ()
A continuous Euclidean map is Borel measurable in the sense of Borel measurable and Lebesgue measurable functions on , under countable choice. Continuous functions on Euclidean spaces are Borel measurable Borel measurable and Lebesgue measurable functions on
The Borel sigma-algebra The Borel sigma-algebra of a topological space of is the product of the two Borel sigma-algebras on . 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.
The covariance is symmetric positive definite. By [F2], the transition law in Unadjusted Langevin algorithm (ULA) is a probability measure for each . Applying [F1] with gives the displayed density; its normalizing factor is finite and positive because .
The map is continuous, so the displayed is Borel on by [F7], hence product-measurable by [F8]. For a Borel set , the constant kernel is uniformly sigma-finite: exhausts and has finite Lebesgue measure by [F5]. Applying [F4] to gives measurability of . Together with step 1.1 this is exactly [F3], so is a probability kernel.
The Gaussian ULA invariant law has variance
Statement
Assume AC, let on , and let . For every , the one-dimensional ULA kernel of Unadjusted Langevin algorithm (ULA) has the invariant probability Every invariant probability with finite second moment has variance . Thus its invariant variance is not the target variance . 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 .
AC is assumed in the standard-normal construction and characteristic-function uniqueness. The Axiom of Choice
For this potential, and the ULA update is , where is independent of the current state. Unadjusted Langevin algorithm (ULA) The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
The normal-law convention is Standard normal and normal laws; the characteristic function of is , and its mean and variance are and . Characteristic function of a normal law Moments, variance, and covariance on a probability space
Affine transforms and finite independent sums multiply the corresponding characteristic functions. Characteristic functions under affine maps and independent sums
Equal characteristic functions determine equal Borel probability laws. Uniqueness of a law from its characteristic function
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
A square-integrable variable is integrable by Cauchy–Schwarz on a probability space. Cauchy-Schwarz for random variables
Proof
Given: AC, , and the ULA transition in [F1].
Set and let be independent of . By [F2]–[F3], the updated state has characteristic function Direct algebra gives , so [F2] and [F4] imply . This proves that is invariant.
Let have any invariant law with finite second moment, independently of the fresh standard normal . By [F6], is integrable, and [F5] gives because and the cross-covariance of the independent variables is zero. Invariance gives , so Since , this exceeds .
ULA's Gaussian kernel satisfies an exponential drift bound
Statement
Assume AC. Let , , and suppose is -Lipschitz for . Let be a global minimizer with . Suppose that for , , and , For , define and let be the ULA proposal kernel. Then
Facts & Assumptions
Given: AC; as in the Statement; and the ULA update.
is twice continuously differentiable, has -Lipschitz gradient, has the stated global minimizer and radial drift, and is normalized by . The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
At a differentiable local minimum in Euclidean space, the gradient is zero. Fermat's theorem: an interior differentiable local extremum has zero gradient
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: Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative
The standard -dimensional normal has density , and the ULA proposal has the displayed Gaussian density. The Axiom of Choice Multivariate normal law, including singular covariance A positive-definite multivariate normal law has its Gaussian density The ULA Gaussian proposal is a probability kernel with a positive density Unadjusted Langevin algorithm (ULA) Lebesgue measurable sets, the family , and the restricted set function
The Borel function is measurable under countable choice; AC implies countable choice. Continuous functions on Euclidean spaces are Borel measurable AC supplies countable selections and prescribed serial paths The Axiom of Countable Choice ()
A nonnegative integral is unchanged by the stated change of variables, and . A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions The Gaussian integral
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
Under [A1], , where and is finite. Radial gradient drift forces potential coercivity
Under countable choice, . The real-line exponential tail is Lebesgue integrable
Proof
Given: The hypotheses in the Statement.
By [F1], . For , apply [F2] to and subtract from the endpoint difference. The remaining integral is by [A1] and [F3]. Thus for all .
Put . If and , the radial condition and [F3] give so .
For and , completing the square and applying [F6] gives For , apply this with for each . The product density in [F4], Lebesgue product identification, and Tonelli's theorem [F7] therefore give, for ,
Verify the target normalizer before using the proposal-kernel conclusion of [F4]. Put , , and . Since for and by [F3], [F8] gives Translation and scaling [F6], followed by [F7] and [F9], show that the right-hand side has finite integral. Step 1.1 also gives , so [F6]–[F7] imply Continuity supplies Borel measurability as in [F5]. Thus all target hypotheses of the ULA algorithm and its proposal-kernel lemma hold.
Write and , the ULA update. Step 1.1 and [F4] imply In step 1.3 take and . Since , expanding the exponent and collecting its terms gives
If , then step 1.2 and the definition of give Step 2.1 therefore yields on this region.
If , use step 1.1 with starting point and [F1] to obtain , so . Bounding the exponential factor in step 2.1 by one gives Together with step 3.1, this proves the asserted drift inequality on both regions.
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 , use the ULA Gaussian proposal whose kernel properties are in The ULA Gaussian proposal is a probability kernel with a positive density. The target density is . At state , propose from , set and use the Metropolis–Hastings transition kernel 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.
Finite-horizon Brownian change of drift and relative entropy
Statement
Assume AC. Let , let be a standard -dimensional Brownian motion on a complete usual filtered probability space, with increments after independent of , and let be predictable with almost surely. Set If is a true martingale on , then is equivalent to , its restriction to equals that of , and is standard Brownian motion under relative to the same filtration. If is bounded by a deterministic constant, is a true martingale. If additionally , then
Here is a sufficient condition that permits unbounded . Fix a globally Lipschitz vector field , a finite deterministic grid , and for . Let each of the two path drifts be one of , , or . Suppose where is adapted with continuous paths and the equation holds on one probability-one event for all , while is -measurable. For , the exponential above is a true martingale, and under the process has the unique path law with initial law and drift and dispersion . Moreover , so the entropy identity applies. Values of the piecewise coefficients at grid points do not affect any integral.
Finally, for any probability measures and measurable statistic , relative entropy decreases under pushforward: 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.
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 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
A continuous vector local martingale starting at zero with covariation matrix is Brownian relative to its filtration; its increments are independent of the earlier sigma-algebra. Vector Levy characterization
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 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 convergence Optional sampling for bounded stopping times
Each Brownian coordinate satisfies . 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
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
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 for , with . 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
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
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
By [F1], applied to , . Stopping at integer levels of , and makes the integral finite-energy, so is a positive continuous local martingale. All these stops tend beyond every time strictly less than , and stabilize at , because the paths and energy are bounded on . A nonnegative local martingale is a supermartingale: Fatou first gives integrability, and conditional Fatou gives 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 , and the same assertion applies to the stopped exponential for every scalar multiple of .
We record the continuous stopping consequence needed below. Let be a continuous true martingale on . For , round upward to stopping times on finite grids whose meshes tend to zero. Discrete bounded optional sampling in [F3] gives . This family is UI and converges almost surely to , hence in . If , then , as is checked by the defining stopped-event tests, so passage in those tests gives . In particular the family of all , , is UI. Stopping preserves true martingality: for fixed , choose the grids on to contain ; the finite-grid identity for follows by telescoping grid increments with the left-endpoint measurable stopping indicators. Continuity and the preceding UI argument pass it to . Thus both continuous stopping facts used below have been derived from the discrete supplier.
To prove data processing, write , and let be the density of relative to ; absolute continuity follows immediately by taking inverse images of null sets. Testing events in gives . If the desired inequality is immediate. Otherwise is integrable, where on and , since its negative part is bounded by . For positive rational , the tangent line lies below on , by differentiating their difference, and , including by . Conditional order gives . Intersect these countably many full events, take the supremum and then expectations. This yields , with left integrability following from the lower bound and the displayed conditional upper bound.
If , then at every stopping time , , whence by step 1.1 applied to the stopped integrand . Apply this bound to localizing stops for . Their terminal values are UI, since their tail integrals are at most above level . They converge almost surely, and hence in , to . The same holds at every earlier time, so passage in martingale event tests proves true martingality. In particular .
Suppose is true and put . Since almost surely, these probabilities are equivalent. For , by [F3], so ; at this is . The measures have identical null sets, so completeness and the usual filtration conditions persist. Let , whose drift has finite total variation by pathwise Cauchy–Schwarz. For a coordinate , let be the first time reaches , capped at . These are stopping times because continuous adapted path suprema are measurable by their rational-time suprema. Product Itô gives The finite-variation terms cancel against . The right side is locally square integrable, so the product is a -local martingale.
For every , . By step 1.2, , and these random variables form a UI family. Hence the localizing stopped products in step 2.2 are UI. Passing their event tests in makes a true -martingale. For , change of measure at times now gives . Thus is a -local martingale. Its localizers increase to the horizon because continuous paths are bounded on each compact interval.
If , [F1] gives and . Since , and is -integrable. The definition of relative entropy therefore gives . This establishes the asserted identity whenever is true; it does not yet presume true martingality in the unbounded-energy sufficient condition.
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 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 -probability: implies by integrability of . Consequently under , and [F2] proves that is -Brownian. The cited proof applies on because it uses only finite pairs of times. Equivalently, if the Brownian space is defined for all times, set after and keep constant; the argument applies on every horizon and uses [F2] literally. A space defined only up to can first be extended by an independent Brownian continuation.
Consider that sufficient condition. The three candidate drifts are predictable by [F5] and obey for some common . 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 . Set and . By step 2.1 it is a true martingale. Under , step 4.1 gives Brownian motion , and substitution in the additive equation gives The initial law is unchanged and the switched drift obeys the same bound.
Uniformly in , To establish finiteness without assuming it, first stop at its first exit from a ball of radius . If the stop is zero and the stopped path is , which retains its integrable second moment. Before stopping, the drift bound uses the corresponding stopped path supremum. Cauchy–Schwarz, , and [F4] therefore bound its expected squared supremum by . These quantities are finite for fixed . Put ; then and almost everywhere, so the integrating factor gives . The ball stops tend to on every bounded continuous path; Fatou proves the displayed bound.
For the integrands used here, elementary left-endpoint sums on deterministic partitions refining the Euler grid give the identity 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 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 . Equivalence identifies the probability limits; removing the extra increasing stops proves the displayed identity. The -Brownian integral has mean zero since its energy is at most . As , step 6.1 yields
Since , step 7.1 gives, for , . Thus is UI. On every path with , for all sufficiently large , so almost surely and in . In particular . 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 . 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 , so step 3.2 applies.
The target path law is uniquely determined, as follows. For target zero it is ; for Euler target it is the finite mesh recursion, a Borel function of . For target , use the Picard recursion starting with . Its iterates are Borel functions on : integration of a continuous path is a uniform limit of its deterministic Riemann sums. For every fixed input , put . The first iterate difference has supremum at most , and induction in the Lipschitz integral inequality bounds the th difference up to time by . 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 is the path supremum of their difference, , and the integrating factor forces . Under the changed measure, has Wiener law and is independent of , because its future increments are independent of ; independence of the entire path follows first on finite-time cylinder events and then on their generated Borel sigma-algebra by [F7]. Thus has the same product law on every such space, and its Borel solution map proves the asserted uniqueness in law.
If , then , 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 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.
MALA preserves its target probability exactly
Statement
Assume AC and the hypotheses of Metropolis-adjusted Langevin algorithm (MALA), with , , , and . The MALA transition kernel is reversible with respect to and therefore 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).
AC supplies the accepted-flow Radon–Nikodym version in the general Metropolis–Hastings construction. The Axiom of Choice Metropolis–Hastings kernel
MALA uses the ULA Gaussian proposal and explicit common-density acceptance ratio, with rejection mass placed at . Metropolis-adjusted Langevin algorithm (MALA)
The proposal is a probability kernel with finite, positive, jointly measurable density . The ULA Gaussian proposal is a probability kernel with a positive density
The target density 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
For a target density and jointly measurable proposal density 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
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
Lebesgue measure on is sigma-finite in the sense of Finite, sigma-finite, and semifinite measures. Lebesgue measurable sets, the family , and the restricted set function Finite, sigma-finite, and semifinite measures Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure
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.
By [F3], is a probability with positive finite density . By [F2], is a probability kernel with jointly measurable finite density 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 with , 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 .
Step 1.1 and [F1] show that is precisely the Metropolis–Hastings transition built from target , proposal , and an accepted-flow derivative version, including its rejected self-transition. Applying [F5] gives reversibility and invariance of . No ergodicity or convergence premise is among the hypotheses, so no such conclusion follows here.
Pathwise relative-entropy error of the Langevin Euler interpolation
Statement
Assume AC. Let , let have globally -Lipschitz gradient , and let , , on . On a complete usual filtered Brownian space, start with an -measurable satisfying and interpolate the Euler recursion by Let be its law on and let be the path law of with the same initial law. Then and are equivalent and In particular the same upper bound holds for . 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.
The finite-horizon change-of-drift lemma applies to drift choices and for globally Lipschitz , 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
The Langevin diffusion is strongly well-posed and has finite second path moment. Each Brownian coordinate has squared maximal expectation at most ; 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
Brownian increments after are independent of , centered and have covariance . -dimensional Brownian motion
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
AC is inherited from the Brownian, Itô, SDE, change-of-measure and relative-entropy suppliers. The Axiom of Choice
Proof
The finite Euler recursion and give by induction, using the finite Brownian second moments. Its interpolation has : on each of the finitely many intervals its supremum is bounded by , 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 , , and It is a true positive density, and under , has diffusion path law .
For , the increment representation and [F3] imply The mixed term vanishes because is -measurable and square integrable, while is centered and independent of that sigma-algebra. Lipschitz continuity and Tonelli now give Indeed integrate and on . The entropy identity of [F1] yields .
The exact path-law identity, rather than just its upper bound, follows because is a measurable function of the Euler path. In fact 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 , integrable by step 1.1. Dominated convergence and the Itô isometry therefore make the corresponding stochastic sums converge to in . Each sum is a Borel path functional, since both and the recovered Brownian increments are such functionals. Choose a subsequence whose squared errors are at most ; Markov's inequality bounds the probability of error exceeding by , so the union bound on the tails shows almost sure convergence. Define its Borel limit arbitrarily on the Borel nonconvergence set. Also is a Borel path functional, by ordinary interval Riemann approximation. Hence almost surely for some positive Borel function (reset its value to one where the constructed exponential is not finite and positive).
For every Borel path set , . Since almost everywhere, the two path laws are equivalent and . The logarithm is integrable under because its pullback equals , with the first term square integrable and the second integrable by step 2.1. Thus Combining with step 2.1 proves the asserted upper bound.
Terminal evaluation is a measurable statistic on continuous path space. Data processing in [F1] therefore gives . If , is constant, Euler interpolation already solves the diffusion and both entropies and the displayed bound are zero. At 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 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.
Langevin diffusion has a reversible density and compact minorization
Statement
Assume AC. Let , , be -Lipschitz, and let be a global minimizer with . The solutions of define a Borel Markov semigroup . For every it has a positive jointly Borel density relative to Lebesgue measure, and If , then is invariant. For every and , there are and a probability such that for every Borel and .
Facts & Assumptions
Given: AC and the potential, minimizer, and Brownian equation in the Statement.
AC is inherited through Brownian, Gaussian, Ito and change-of-measure constructions. The Axiom of Choice
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
A true stochastic exponential changes a Brownian drift by its integrand. Finite-horizon Brownian change of drift and relative entropy
Multidimensional Ito's formula applies to and to its exponential compositions. Multidimensional Ito formula for Brownian-driven processes
Brownian finite-dimensional laws are Gaussian with covariance , independent future increments, and continuous paths; uncorrelated jointly Gaussian finite blocks are independent. -dimensional Brownian motion Uncorrelated jointly Gaussian blocks are independent
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
The Gaussian increment has density . Each coordinate Brownian path obeys . A positive-definite multivariate normal law has its Gaussian density Doob maximal bound for the Ito integral
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
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.
Put . By [F8], , so ; the equation meets [F1]. Its additive-noise integral equation is . For each continuous input path the deterministic Picard iteration converges uniformly on finite intervals: successive differences are bounded by a fixed finite constant times , by repeated integration. The limit is the unique solution; subtraction and the same iterative integral bound give . 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 .
Define for . For any finite list of times its coordinates together with are jointly Gaussian and . By [F4] that finite bridge block is independent of . Apply [F5] to rational-time cylinders to obtain independence of the entire bridge path and . Thus Brownian paths disintegrate explicitly as when their endpoint has value , with endpoint density and bridge law independent of . 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 , which is unchanged when is replaced by ; its mean is zero. Gaussian finite-dimensional laws and [F5] therefore also give equality in law of and .
Under Brownian law put . The stochastic exponential with integrand is, by [F3], Lipschitz continuity gives by taking coordinate difference quotients. Since , for this positive local martingale is bounded above by . Stop at increasing energy/local-martingale levels. Dominated convergence [F7] in the stopped martingale identities makes a true martingale of mean one. By [F2], under times Brownian law the process is Brownian, so solves the Langevin equation. The explicit unique solution map of step 1.1 identifies its law with .
Put and . Combining steps 2.1 and 1.2 gives the density The integral is a continuous function of in the uniform path topology, since is continuous and uniformly continuous on each compact set containing the convergent paths. Its exponential is strictly positive and bounded above by . Consequently its expectation is positive, finite, and continuous in by dominated convergence; the density is jointly Borel. Its integral in is one by step 2.1. Bridge reversal from step 1.2 interchanges without changing the integral of , and . Multiplication by proves the asserted symmetry. If , Tonelli and the mass-one identity give proving invariance.
By [F6], , and . With , Markov's inequality (integrate for ) gives . If both endpoints lie in the ball , on this event the bridge lies in the radius ball. Therefore and the bridge expectation in step 3.1 is at least one half times the exponential of . The heat factor is at least on , and . Thus a constant bounds below on . Let be normalized Lebesgue measure on and . Integrating the density over proves the stated minorization. The radius is positive, so the normalizing volume is finite and nonzero.
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 be the ULA kernel, , , and . For every there is a unique invariant probability , and . There are finite constants , independent of , such that
Facts & Assumptions
Given: AC, the stated potential and radial constants, and .
AC is inherited through the Gaussian and weighted Hahn/Jordan interfaces. The Axiom of Choice
The ULA kernel has a positive continuous Gaussian density, with proposal . Unadjusted Langevin algorithm (ULA) The ULA Gaussian proposal is a probability kernel with a positive density
The fixed-step Gaussian kernel satisfies for a finite constant and a compact ball. ULA's Gaussian kernel satisfies an exponential drift bound
Radial drift gives for some ; hence V-sublevel sets are contained in compact balls. Radial gradient drift forces potential coercivity
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
An exponential with positive exponent dominates every fixed nonnegative integer power at infinity. The exponential dominates every fixed nonnegative integer power at
Fermat gives a zero gradient at the minimizer. The chain rule and the fundamental theorem integrate the derivative along a segment, and Euclidean Cauchy–Schwarz bounds its inner products. Fermat's theorem: an interior differentiable local extremum has zero gradient The chain rule for total derivatives: Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation
Standard Gaussian density, the scalar Gaussian integral, change of variables, Lebesgue product identification and Tonelli evaluate nonnegative finite-dimensional Gaussian integrals. A positive-definite multivariate normal law has its Gaussian density The Gaussian integral A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions 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
Proof
Given: The hypotheses in the Statement.
Fix . Dropping the indicator in [F2] gives a global drift with finite . 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.
By [F6], , and therefore Lipschitz continuity gives . If is positive and at least the radial radius, Cauchy–Schwarz and the radial hypothesis give , so . For , integrate the derivative along and subtract to obtain
Completing the square, [F7] gives for and scalar v the identity Finite multiplication and Tonelli therefore give for .
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.
Put and for with . Apply step 1.2 to , multiply by s, and exponentiate. Step 1.3, with quadratic coefficient and linear coefficient , gives The coefficient follows by combining with over the common denominator. All Gaussian integrals are finite under .
For , step 2.2 reduces to If , then , since for . Choose a radius R at least the radial radius and large enough that . Outside this ball step 1.2 makes the exponent at most . Inside it let . Since for , the preceding bound gives uniformly for small steps. Integrate against the finite-V invariant law from step 2.1 to obtain , using . This proves the first uniform bound.
For and , the logarithm of the prefactor in step 2.2 is at most , by the same integral estimate with . Moreover , because the numerator is at least and the denominator is at most one. Choose R' at least the radial radius such that . Outside this ball ; inside use and the exponential-difference estimate from step 3.1 with and upper horizon . Thus for the whole step range. Since , its invariant moment is finite by step 2.1. Integrating and using gives , uniformly for every allowed step.
Put . For , [F3] gives because . By [F5], is bounded on ; on use . Thus for some finite A. The Lipschitz bound in step 1.2 gives . Taking , and proves all asserted estimates. All constants depend only on the fixed potential and its displayed parameters.
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 and put . For , write and let and be the constants in that lemma. The Langevin semigroup of Langevin diffusion has a reversible density and compact minorization satisfies There are and , depending on the potential and , such that for any probability measures with finite moments and any , The norm is Weighted total variation for probability measures.
Facts & Assumptions
Given: AC, , its constants, the semigroup, and in the Statement.
AC is inherited through the stochastic and Hahn/Jordan interfaces. The Axiom of Choice
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
For the formal generator satisfies , with and finite . Exponential Lyapunov drift for the formal Langevin generator
Radial drift gives for . Consequently every sublevel set of is contained in a finite-radius ball. Radial gradient drift forces potential coercivity
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
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
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.
Fix a deterministic starting point and horizon . Stop the continuous solution at its first exit from the radius- ball about , taking . Apply [F4] to up to . Its drift is at most by [F2]. Its stochastic integrand is bounded on this stopped finite cylinder, so its expectation is zero. Hence The globally defined continuous paths in [F1] are bounded on , so eventually on each such path. Fatou [F5] and division by give the claimed semigroup moment bound.
In particular with and . Any sufficiently large level set is contained in a ball by [F3], and inherits the common minorization for from [F1]. The weighted drift-minorization result [F6] therefore gives an invariant law with finite moment and constants , such that Since [F1] already makes invariant and [F6] gives uniqueness among every invariant probability, and .
For , step 1.1 gives , since . For every Borel with , therefore . Taking the test-function supremum shows All integrals are finite by step 1.1 and [F5]. Write with and apply this estimate after the integer contraction in step 2.1. With and , the result follows from . This includes and all stated finite-moment initial laws.
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 , let be -Lipschitz for , and suppose there are a global minimizer , , , and such that Assume and normalize ; subtracting a constant leaves the target and ULA kernel unchanged and only rescales the weight by a constant. Put and . For every , the ULA kernel has a unique invariant probability , both and have finite moments, and where the finite source-dependent constant 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.
AC is inherited through the Brownian/Gaussian, Ito, change-of-measure and Hahn/Jordan interfaces. The Axiom of Choice
The ULA kernel is that of Unadjusted Langevin algorithm (ULA). It has a unique invariant with finite moment for every . With , constants independent of the step satisfy for , for all allowed steps, and , where . ULA invariant laws have uniform exponential moments on the needed step ranges
The Langevin semigroup leaves invariant, has , satisfies for a fixed finite , and contracts zero-mass differences in the W norm: , with and . Radial drift gives weighted geometric contraction of Langevin diffusion
From any finite-second-moment initial probability, the endpoint relative entropy of an m-step Euler interpolation against the Langevin endpoint satisfies . Pathwise relative-entropy error of the Langevin Euler interpolation
For probabilities with finite V moments, weighted Pinsker with gives . A weighted total-variation bound from relative entropy
Weighted total variation is the supremum over Borel tests and obeys the triangle inequality; it is at most for two probabilities with finite W moments. Weighted total variation for probability measures
Proof
Given: The hypotheses in the Statement, with and .
By [F1], for each allowed step the unique invariant probability exists and has finite V moment, hence finite W moment since . By [F2], , so its W moment is finite too. Choose a fixed so that , possible because . All these constants depend only on the potential and its hypotheses.
First suppose . Put and , so . Start Euler with law , independently of its Brownian increments; every grid-time law is by invariance. Its second moment is finite by [F1], since . Moreover at every grid time. Apply [F3] to the diffusion with the same initial law. Euler's endpoint law is and diffusion's is , giving The initial Brownian/Gaussian construction uses only the inherited AC assumption.
By [F1], ; by [F2], . Weighted Pinsker [F4] and step 2.1 therefore imply Since , the contraction [F2], the choice of , and give The last norm is finite by step 1.1, so subtraction yields throughout the small-step range.
If , [F1] and [F5] give . Together with step 3.1, this proves the stated bound with 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
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, §1, notation and conventions
- Gautam Iyer, Lecture 20: Langevin Monte Carlo, course notes, §3
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Lemma 6 and proof §4.2
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 7 and proof §4.3
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, §1, equation (2)
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Lemma 24 and proof §4.6
- Martin Hairer and Jonathan C. Mattingly, Yet another look at Harris' ergodic theorem for Markov chains
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, §3.3, Gaussian-target calculation
- Gautam Iyer, Lecture 20: Langevin Monte Carlo, course notes, §3.1
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 8 and proof §4.4
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, §2.1 and Proposition 2, printed pp. 5–6
- Gautam Iyer, Lecture 20: Langevin Monte Carlo, course notes, §4
- A.W. van der Vaart, Martingales, Diffusions and Financial Mathematics, Sections 6.3–6.4, Theorem 6.9 and Theorem 6.14
- Alain Durmus and Eric Moulines, Nonasymptotic convergence analysis for the unadjusted Langevin algorithm, v3, proof of Proposition 2
- Alain Durmus and Eric Moulines, Nonasymptotic convergence analysis for the unadjusted Langevin algorithm, v3, proof of Proposition 2, equations (12)–(15)
- Durmus and Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 2 and Proposition 7; local density-based replacement of the imported diffusion argument
- Durmus and Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 8 and Theorem 10; local uniform-moment refinement
- Durmus and Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 7 and section 4.3; local weighted-contraction proof
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Theorem 10 and proof §4.6