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.
Finite Gaussian forward chain and Gaussian reverse model
Definition
Assume AC. Let be finite integers, let be the identity matrix, and let . Set , , and . Write for Lebesgue measure on and define, for , The notation is the squared Euclidean norm. The displayed function is the Lebesgue density of .
For each fixed , the forward chain has path density on Thus its transition from to is Gaussian with mean and covariance . Each factor is a normalized density, and finite successive integration of the nonnegative product gives a probability density.
For a generic adjacent pair, the two model directions are shown below. The arrows indicate the direction in which each conditional density generates its target state; they assert no equality or inverse relation between the kernels.
diagram failed to render:
\begin{tikzpicture}[>=stealth]
\node (previous) at (0,0) {$x_{t-1}$};
\node (current) at (4,0) {$x_t$};
\draw[->] (previous) to[bend left=24] node[midway,above] {$q(x_t\mid x_{t-1})$} (current);
\draw[->] (current) to[bend left=24] node[midway,below] {$p_{\theta,t}(x_{t-1}\mid x_t)$} (previous);
\end{tikzpicture}A learned reverse Gaussian model consists of finite-valued Borel maps and fixed variances , for . It is the joint density Its prior is , and its marginal density at is whenever this integral is finite. The joint reverse density is normalized by successive integration of its Gaussian transition factors followed by the prior density.
For , the forward-chain conditional assigns probability one to every Borel set containing and zero to every Borel set not containing ; it is not a Lebesgue density. The separate learned reverse likelihood is the Gaussian density above with variance .
Definition references
Multivariate normal law and covariance convention: Multivariate normal law, including singular covariance.
Positive-definite multivariate normal density: A positive-definite multivariate normal law has its Gaussian density.
Lebesgue measure and its measurable sets: Lebesgue measurable sets, the family , and the restricted set function .
Finite product measure: For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique.
Iterated integration for nonnegative products: Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.
Product Euclidean Lebesgue measure: On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}.
Forward chain and reverse model: Ho, Jain, and Abbeel, §§2–3.
Forward Gaussian kernels: Prince, Chapter 18, “The diffusion kernel”.
Depends on
- The Axiom of Choice
- Lebesgue measurable sets, the family $\mathcal{L}(\mathbb{R}^n)$, and the restricted set function $\lambda_n$
- Multivariate normal law, including singular covariance
- On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}
- A positive-definite multivariate normal law has its Gaussian density
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
- Epsilon-prediction diffusion objective estimator Algorithm
- Two-step scalar Gaussian forward chain and posterior Example
- Weighted ELBO term differs from the simple diffusion loss Example
- Closed Gaussian forward marginal and conditioned posterior Theorem
- DDPM variational objective and weighted noise-prediction terms Theorem
Dependency tree · two levels
46 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
- Jonathan Ho, Ajay Jain, and Pieter Abbeel, Denoising Diffusion Probabilistic Models (2020) (standard reference, not scraped)
- Simon J. D. Prince, Understanding Deep Learning, Chapter 18: Diffusion models (2026), pp. 363–387 (standard reference, not scraped)