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 , define the product Gaussian density . The operator norm below is induced by the Euclidean norm on .
Assume the Axiom of Choice and the hypotheses of the compactly supported Gaussian smoothing setup: , , is a Borel probability measure supported in for finite , is continuously differentiable with , , and for . Fix . For and , define the probability measure
and the matrix
The density is positive and smooth, and its score satisfies
For all and ,
so is globally Lipschitz in , uniformly over this truncated time interval, with Lipschitz constant at most . No such bound is asserted uniformly as .
Statement references
Facts & Assumptions
Given: The compactly supported probability law, positive scalar time-dependent noise variance, explicit Gaussian convolution, and truncated interval in the statement.
The full Axiom of Choice is assumed by the inherited Itô and probability interfaces. The Axiom of Choice
For every , is a positive normalized density and is the Gaussian convolution of with covariance . Gaussian-smoothed data law and transition density
On every interval bounded away from zero, 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
Dominated convergence permits differentiation under an integral when the difference quotients converge pointwise and share an integrable majorant. Dominated convergence
The support of lies in , 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.
For fixed , positivity in [F1] makes the quotient defining meaningful. Its density relative to is measurable and nonnegative, and its integral equals , so it is a probability measure. By [F4], it is supported in and has finite first and second moments. The regularity conclusion [F2] applies on . On each compact set of values, every spatial derivative of is bounded uniformly for because 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.
For each coordinate , differentiation of gives Dividing by the positive proves .
Differentiate in coordinate . The quotient rule and yield 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 .
The matrix is positive semidefinite because for every , . Also Thus . Since is increasing and , the Jacobian formula in step 3.1 and the triangle inequality for operator norms give the stated uniform derivative bound. The mean satisfies , so the score formula in step 2.1 gives the displayed growth bound.
For any , the fundamental theorem of calculus along the segment gives . Taking norms and using step 4.1 proves the global Lipschitz bound uniformly for . Since , as ; 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
- Wenpin Tang, Nizar Touzi, Zikun Zhang, and Xun Yu Zhou, Tweedie's Formulae and Diffusion Generative Models Beyond Gaussian (standard reference, not scraped)
- John K. Hunter, Notes on Partial Differential Equations (standard reference, not scraped)