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.
Generator and martingale problem for reversed Gaussian smoothing
Statement
Assume AC and the compactly supported Gaussian smoothing setup: , with compactly supported, scalar bounded above and away from zero, , for , and forward transition density . Fix , put for , and use the Bayes-reversed kernels from the preceding definition. For , define Then is Markov with those reversed kernels, and for every the process is a martingale in the natural reversed filtration. The assertion is restricted to forward times at least ; it makes no score or density claim at .
Statement references
Tang and Zhao, Section 2.2, PDF pp. 3–5: gives the plus-score reverse-drift formula and identifies the derivation as heuristic; the local argument below supplies the generator and martingale proof.
Anderson, Section 5, printed pp. 322–324: context for the reverse Kolmogorov calculation.
Facts & Assumptions
Given: AC, , , , , , and as in the statement.
AC is assumed by the Gaussian smoothing, density, and score suppliers; their actual positive-time density and heat-equation claims apply to compactly supported arbitrary Borel and do not assert a density at zero. The Axiom of Choice Gaussian-smoothed data law and transition density Gaussian smoothing density and forward equation Gaussian-mixture score identities and a global Lipschitz bound
For , is positive and smooth and satisfies ; is the Gaussian transition density and obeys the forward marginal and Chapman–Kolmogorov identities. Gaussian-smoothed data law and transition density Gaussian smoothing density and forward equation
The score obeys and is smooth on every interval . Gaussian-mixture score identities and a global Lipschitz bound
The reverse kernels are probability kernels satisfying reverse Chapman–Kolmogorov, including the endpoint posterior against . Bayes-reversed Gaussian smoothing kernels
Dominated convergence justifies the positive-time small-interval limit on compact test supports; Fubini justifies composing the transition integrals. Dominated convergence Fubini's theorem for L^1 functions on a sigma-finite product
Proof
Given: the hypotheses and notation in the Statement.
The Gaussian forward process is Markov by independent increments of its deterministic Itô integral. Bayes' formula gives the reversed conditional law of given as ; the density supplier's marginal identity normalizes it, and [F3] gives reverse Chapman–Kolmogorov. Thus is Markov with these kernels.
Put and for . For , the reverse transition formula gives The heat-kernel expansion, justified on the compact support of by [F1, F4], is Since , the product rule gives The remainder is locally uniform in and dominated on the compact test support because .
Fix , put , and write . For , put . The explicit kernel gives . Differentiate in , using the heat equation and integrating the Gaussian Laplacian onto the compactly supported function , to obtain Away from , differentiation is justified by [F4]: the variance is positive, the spatial support is fixed compact, and and the needed state derivatives are uniformly bounded there for . The product rule gives the last equality. By [F2], uniformly in on the truncated interval, so the probability-kernel property bounds the derivative by . Integrate from to and let : step 1.2 gives , while the bound controls the omitted integral. Thus . For , Markovness and bounded conditional Fubini give This proves the martingale claim.
Depends on
Used by
Dependency tree · two levels
35 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
- Y. Tang and H. Zhao, Score-based diffusion models via stochastic differential equations: a technical tutorial, Section 2.2 (standard reference, not scraped)
- B. D. O. Anderson, Reverse-time diffusion equation models, Section 5 (standard reference, not scraped)