Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Gaussian-mixture score identities and a global Lipschitz bound

Statement

For a>0, define the product Gaussian density ϕa(z)=∏j=1d(2πa)−1/2exp⁡(−zj2/(2a)). The operator norm below is induced by the Euclidean norm on Rd.

Assume the Axiom of Choice and the hypotheses of the compactly supported Gaussian smoothing setup: d≥1, T>0, μ is a Borel probability measure supported in B‾(0,R) for finite R≥0, g:[0,T]→(0,∞) is continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞, v(t)=∫0tg(r)2 dr, and pt(x)=∫ϕv(t)(x−z) μ(dz) for t>0. Fix 0<ϵ<T. For t∈[ϵ,T] and x∈Rd, define the probability measure

νt,x(dz)=ϕv(t)(x−z)pt(x) μ(dz),mt,x=∫z νt,x(dz),

and the matrix

Ct,x=∫(z−mt,x)(z−mt,x)T νt,x(dz).

The density pt is positive and smooth, and its score st(x):=∇xlog⁡pt(x) satisfies

st(x)=−x−mt,xv(t),Dxst(x)=−Idv(t)+Ct,xv(t)2.

For all t∈[ϵ,T] and x,y∈Rd,

∥Dxst(x)∥op≤1v(ϵ)+R2v(ϵ)2,∣st(x)∣≤∣x∣+Rv(ϵ),

so st is globally Lipschitz in x, uniformly over this truncated time interval, with Lipschitz constant at most 1/v(ϵ)+R2/v(ϵ)2. No such bound is asserted uniformly as ϵ↓0.

Facts & Assumptions

Given: The compactly supported probability law, positive scalar time-dependent noise variance, explicit Gaussian convolution, and truncated interval in the statement.

[A1]

The full Axiom of Choice is assumed by the inherited Itô and probability interfaces. The Axiom of Choice

[F1]

For every t>0, pt is a positive normalized density and is the Gaussian convolution of μ with covariance v(t)Id. Gaussian-smoothed data law and transition density

[F2]

On every interval bounded away from zero, pt is smooth in space and continuously differentiable in time; the spatial derivatives are obtained by differentiating the Gaussian kernel under the compactly supported measure. Gaussian smoothing density and forward equation

[F3]

Dominated convergence permits differentiation under an integral when the difference quotients converge pointwise and share an integrable majorant. Dominated convergence

[F4]

The support of μ lies in B‾(0,R), so every measure absolutely continuous with respect to μ is also supported there; all coordinate products in the displayed covariance integral are bounded and integrable. Moments, variance, and covariance on a probability space

Proof

Given: The statement's hypotheses and notation.

1.1A1F1F2F3F4given

For fixed t>0, positivity in [F1] makes the quotient defining νt,x meaningful. Its density relative to μ is measurable and nonnegative, and its integral equals pt(x)/pt(x)=1, so it is a probability measure. By [F4], it is supported in B‾(0,R) and has finite first and second moments. The regularity conclusion [F2] applies on [ϵ,T]. On each compact set of x values, every spatial derivative of ϕv(t)(x−z) is bounded uniformly for z∈B‾(0,R) because v(t)>0 is fixed and the Gaussian derivatives are polynomials times a Gaussian. The finite measure μ supplies an integrable constant majorant. Difference quotients have the same kind of bound on a slightly larger compact set by the fundamental theorem of calculus, so [F3] justifies differentiating the convolution and its bounded-moment numerators under the integral.

2.1F1F3step 1.1algebra

For each coordinate i, differentiation of pt gives ∂ipt(x)=∫−xi−ziv(t)ϕv(t)(x−z) μ(dz)=−xi−mt,x,iv(t)pt(x). Dividing by the positive pt(x) proves ∇log⁡pt(x)=−(x−mt,x)/v(t).

3.1F3F4step 1.1step 2.1algebra

Differentiate mt,x,j=pt(x)−1∫zjϕv(t)(x−z) μ(dz) in coordinate i. The quotient rule and ∂iϕv(t)(x−z)=−(xi−zi)ϕv(t)(x−z)/v(t) yield ∂imt,x,j=1v(t)(∫zjzi νt,x(dz)−mt,x,jmt,x,i)=(Ct,x)ji/v(t). All terms are finite by [F4], and the derivative is justified by step 1.1. Differentiating the score identity from step 2.1 therefore gives Dxst=−Id/v(t)+Ct,x/v(t)2.

4.1F4step 2.1step 3.1givenalgebra

The matrix Ct,x is positive semidefinite because for every u∈Rd, uTCt,xu=∫(u⋅(z−mt,x))2 νt,x(dz)≥0. Also uTCt,xu=∫(u⋅z)2 dνt,x−(∫u⋅z dνt,x)2≤∫∣u∣2∣z∣2 dνt,x≤R2∣u∣2. Thus ∥Ct,x∥op≤R2. Since v is increasing and v(t)≥v(ϵ)>0, the Jacobian formula in step 3.1 and the triangle inequality for operator norms give the stated uniform derivative bound. The mean satisfies ∣mt,x∣≤∫∣z∣ dνt,x≤R, so the score formula in step 2.1 gives the displayed growth bound.

5.1step 4.1givenalgebra∎

For any x,y, the fundamental theorem of calculus along the segment y+r(x−y) gives st(x)−st(y)=∫01Dxst(y+r(x−y))(x−y) dr. Taking norms and using step 4.1 proves the global Lipschitz bound uniformly for t∈[ϵ,T]. Since g≥gmin⁡>0, v(ϵ)↓0 as ϵ↓0; the bound therefore supplies no uniform-in-ϵ constant.

Depends on

Used by

Dependency tree · two levels

32 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