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.
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.
Depends on
- Unadjusted Langevin algorithm (ULA)
- Continuous functions on Euclidean spaces are Borel measurable
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- Lebesgue measurable sets, the family $\mathcal{L}(\mathbb{R}^n)$, and the restricted set function $\lambda_n$
- Multivariate normal law, including singular covariance
- AC supplies countable selections and prescribed serial paths
- The ULA Gaussian proposal is a probability kernel with a positive density
- Radial gradient drift forces potential coercivity
- The real-line exponential tail is Lebesgue integrable
- 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}
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Fermat's theorem: an interior differentiable local extremum has zero gradient
- The Gaussian integral $\int_{-\infty}^{\infty}e^{-x^2}\,dx=\sqrt{\pi}$
- Newton–Leibniz needs only continuity on $[a,b]$, differentiability on $(a,b)$, and a Riemann-integrable extension of the interior derivative
- A positive-definite multivariate normal law has its Gaussian density
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Dependency tree · two levels
114 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, Proposition 8 and proof §4.4 (standard reference, not scraped)