Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

100 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