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.
Discrete diffusion chains and DDPM objectives
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- State-space model laws
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Variational inference and the evidence lower bound
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
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”.
Reverse KL between isotropic Gaussian laws
Statement
Assume AC. Let , , and . If and , then where the KL divergence is directional, its first argument is absolutely continuous with respect to its second, and is the natural logarithm.
Statement references
Gaussian density formula: A positive-definite multivariate normal law has its Gaussian density.
Directional KL convention: Kullback–Leibler divergence.
Natural logarithm: The natural logarithm as the inverse of the exponential function.
Gaussian reverse-KL terms in diffusion objectives: Ho, Jain, and Abbeel, §3.2.
Gaussian reverse-process loss: Prince, Chapter 18, “The reverse process and the tractable conditional”.
Facts & Assumptions
Given: AC, and with and .
AC is assumed by the Gaussian-density supplier and the library KL definition. The Axiom of Choice.
A positive-definite multivariate normal law has its displayed Lebesgue density. A positive-definite multivariate normal law has its Gaussian density.
A multivariate normal law has its specified mean and covariance. Multivariate normal law, including singular covariance.
For probability measures , the library divergence is the expectation under of the log Radon–Nikodym density ratio. Kullback–Leibler divergence.
Expectation of an integrable random variable is its integral with respect to its probability law. Expectation of a nonnegative or integrable random variable.
Proof
Given: The hypotheses in the Statement.
By [F1], both Lebesgue densities are strictly positive, so . Expanding their Gaussian density formulas gives the log-density ratio . All terms are integrable under because its covariance is finite.
Under , [F2] gives , and expansion of gives because . Integrating the ratio in step 1.1 and applying the AC-dependent convention [F3] and expectation definition [F4] yields , which is the stated formula.
Source notes
Expectation and covariance convention: Multivariate normal law, including singular covariance.
Natural logarithm: The natural logarithm as the inverse of the exponential function.
Closed Gaussian forward marginal and conditioned posterior
Statement
Assume AC and the finite Gaussian forward chain with dimension , horizon , and schedule from the preceding definition. For each and , For every , the conditional law given both endpoints is The formula for is only asserted for ; at the conditioning on makes a point mass, not a Lebesgue density. The Gaussian conditional above does not assert that the unconditional reverse law is Gaussian.
Statement references
Closed Gaussian forward marginal, posterior mean, and posterior variance: Ho, Jain, and Abbeel, Eqs. (4), (6), and (7).
Forward Gaussian composition and conditioned posterior: Prince, Chapter 18, “The diffusion kernel” and “The tractable conditional”.
Facts & Assumptions
Given: AC, a fixed , finite , and for every .
AC is assumed by the Gaussian-stack construction and the multivariate-normal conditional-law theorem. The Axiom of Choice.
The forward path density factors into normalized transition densities , with and . Finite Gaussian forward chain and Gaussian reverse model.
A multivariate normal law is characterized by its scalar projection laws and has the stated mean and covariance. Multivariate normal law, including singular covariance.
A finite stack of mutually independent Gaussian vectors is jointly multivariate normal, even when a covariance is singular. A finite stack of independent Gaussian vectors is jointly Gaussian.
If is jointly Gaussian with positive-semidefinite block covariance and the observed block covariance is positive definite, then its conditional law has mean and covariance . Conditional law of a jointly Gaussian block with positive-definite observed covariance.
Proof
Given: The hypotheses in the Statement.
Under the forward path law with fixed , for each put . Changing variables in the last transition density in [F1] gives the conditional density , independent of the past. Thus for Borel past events and Borel , . Each is standard Gaussian and independent of the previous path; since earlier innovations are measurable functions of that path, are mutually independent for every .
Iterating gives . By step 1.1 and [F3], the finite innovation stack is jointly Gaussian. Thus each scalar projection of is normal with mean and, by independence, variance ; [F2] identifies its law as multivariate normal with that mean and covariance. Since , the covariance sum telescopes to .
Fix . By step 2.1, is Gaussian, and by step 1.1, is independent of the past and standard Gaussian. The finite-stack result [F3] makes jointly Gaussian. For any , the projection of is , a scalar projection of that Gaussian stack; hence [F2] makes the pair jointly Gaussian. Its means are and , and its covariance blocks are , , and . The full block covariance is positive semidefinite because each of its quadratic forms is the variance of a scalar projection of . Since , we have , so is positive definite.
Applying [F4] with these blocks gives conditional covariance and conditional mean . For , and , so . This is the asserted conditional law; no density for the degenerate conditional was used.
Source notes
Joint Gaussian conditional law and its positive-definite observed covariance hypothesis: Conditional law of a jointly Gaussian block with positive-definite observed covariance.
Finite independent Gaussian stack: A finite stack of independent Gaussian vectors is jointly Gaussian.
DDPM variational objective and weighted noise-prediction terms
Statement
Assume AC. Fix a finite Gaussian forward chain and reverse model as defined above, with finite-valued Borel reverse means and fixed variances . For the noise-prediction parameterization, let be Borel and set For each fixed observed , require , define the proper posterior density and let and be the path probability measures with Lebesgue densities and . Require and Here means the integral of against the path law with density . Define Then The negative ELBO has the exact decomposition In particular, for , write If with , then the corresponding per-step KL term is At , the reconstruction term is the separate learned likelihood with variance ; no Lebesgue density for is used. For finite , the terminal-prior KL is retained; no equality is assumed. The common unweighted objective drops the schedule weights and replaces the separate endpoint terms with noise-prediction losses, so it is not in general the exact maximum-likelihood objective.
Statement references
Finite-chain ELBO decomposition and exact Gaussian posterior: Ho, Jain, and Abbeel, §§2–3 and Appendix A, Eqs. (5)–(7), (17)–(22).
Weighted noise prediction and the unweighted simple objective: Ho, Jain, and Abbeel, §3.2 and §3.4, Eqs. (8)–(14).
Pedagogical ELBO and noise-prediction derivation; its simplification approximates the finite-horizon terminal-prior term by zero: Prince, Chapter 18, “The diffusion ELBO” and “Simplifying it”.
Facts & Assumptions
Given: AC, a finite forward chain and reverse Gaussian model with positive finite variances, a fixed , a Borel noise predictor, and finite absolute -expectations of the log path densities in the Statement.
AC is assumed by the Gaussian conditional-law supplier and the library KL/ELBO interface. The Axiom of Choice.
The forward and reverse path densities factor into normalized Gaussian transitions; their variances are finite and strictly positive. Finite Gaussian forward chain and Gaussian reverse model.
The forward marginal and, for , the exact Gaussian law of conditioned on are as stated. Closed Gaussian forward marginal and conditioned posterior.
The variational-family interface requires before it normalizes . Variational family and evidence lower bound.
An admissible density has the required support and finite -integrability of . Variational family and evidence lower bound.
Under those conditions, the log-evidence equals the ELBO plus reverse KL under AC, and the KL is nonnegative. Evidence lower bound is log evidence minus reverse KL.
For positive isotropic Gaussian variances, the reverse KL is the sum of the variance term and squared-mean term in the proved formula. Reverse KL between isotropic Gaussian laws.
Expectation of an integrable function is its integral with respect to the stated probability law. Expectation of a nonnegative or integrable random variable.
A probability law is the pushforward probability measure of its random element. Law or distribution of a random element.
The library KL is directional: its first argument must be absolutely continuous with respect to its second. Kullback–Leibler divergence.
A multivariate normal law has its specified mean and covariance, so a standard -dimensional normal residual has second moment . Multivariate normal law, including singular covariance.
Proof
Given: The hypotheses in the Statement.
The reverse path density is strictly positive and finite at every finite path because every Gaussian variance is positive and each mean is finite. Its path marginal on is a probability density by successive integration of its reverse kernels and prior. For fixed , the decoder density satisfies , so integrating against that path marginal gives . It is strictly positive: on the positive-measure box , the sets for positive integers cover the box because the density is positive everywhere. If all these sets had measure zero, their countable union would have measure zero, contradicting the positive measure of the box; one set therefore has positive measure, and the integral is positive. Thus is a proper positive density.
The forward path density is a probability density and is positive everywhere. Its log is the finite sum . Under , each normalized residual has law and finite second moment by [F10], so . Since the reverse density is also positive everywhere, everywhere and the support condition holds.
Let on path space with base measure . Step 1.1 gives and the normalized target ; step 1.2 gives the support condition, and the Statement's integrability hypothesis together with step 1.2 gives . The direction is , as required by [F8]. Therefore [F3], [F6], and [F9] apply, and [F4] gives the exact log-evidence identity and nonnegative reverse KL.
For , the Markov property and positive Gaussian densities give . Substitute this into . The ratios telescope, leaving . Each reverse Gaussian log-density factor is bounded above; the assumed integrability of their finite sum therefore makes each factor integrable. The forward marginals and conditioned laws are Gaussian with finite quadratic moments, so their log-density terms are integrable as well. Taking expectations term by term now gives the stated endpoint-plus-step decomposition, with the term .
For , substitute into the posterior mean in [F2]. Using and gives . The reverse mean is the same expression with in place of , so . Both posterior and reverse variances are positive for , so [F5] applies with and ; it gives exactly the coefficient and constant in the Statement.
The terminal term remains in step 2.2 because finite and give ; the term remains the separate positive-variance decoder log-likelihood. For an explicit counterexample, take , , , , , and . Then , , , and . For a fixed datum , set and , with any . These are finite Borel maps, and their Gaussian log densities have finite -expectations because they are quadratic functions of finite-dimensional Gaussian variables. The first map makes , so the decoder density at its mean is ; integrating it against the normalized reverse path density gives for every . Under the forward chain, the noise error is zero and the error is , so , while the exact weighted ELBO contribution is and its prior term is independent of . Taking gives but exact negative log-likelihood . Thus the unweighted loss is a surrogate, not in general the maximum-likelihood objective.
Source notes
Variational-family support and log-integrability requirements: Variational family and evidence lower bound.
Exact ELBO/KL identity and its AC branch: Evidence lower bound is log evidence minus reverse KL.
Exact Gaussian posterior conditional and its positive observed-covariance hypothesis: Closed Gaussian forward marginal and conditioned posterior.
Isotropic Gaussian reverse-KL calculation: Reverse KL between isotropic Gaussian laws.
Epsilon-prediction diffusion objective estimator
Definition
Fix finite integers , a data set , forward variances , reverse variances , a Borel map , and a mode from . Set and . Use the noise-prediction means and the reverse Gaussian model with these means, variances , and prior to define . In weighted-elbo mode, require for each that , the forward path law be absolutely continuous with respect to the normalized reverse posterior path law, and In simple mode, require for every and that This procedure returns one stochastic loss estimate; it does not prescribe a parameter optimizer or claim optimizer convergence.
-
Choose uniformly from , choose uniformly from independently of , and draw independently of both.
-
Set
-
If the mode is , return
-
If the mode is , first compute the exact terminal-prior term If , return If , return where and are the exact per-step coefficient and variance constant in the DDPM objective theorem.
Each branch returns one sampled objective contribution. The weighted branch uses the positive-variance learned reconstruction likelihood; it never evaluates a density for the degenerate forward conditional . This algorithm specifies the sampling procedure only; it makes no optimizer-convergence claim.
Definition references
Finite Gaussian chain and reverse likelihood: Finite Gaussian forward chain and Gaussian reverse model.
Terminal KL and weighted per-step terms: DDPM variational objective and weighted noise-prediction terms.
Gaussian KL formula used for the terminal term: Reverse KL between isotropic Gaussian laws.
Stochastic epsilon-prediction objective and simple-loss convention: Ho, Jain, and Abbeel, Algorithm 1 and Eqs. (12)–(14).
Pedagogical treatment of weighted noise-prediction terms and the simplified training objective; its ELBO discussion approximates the terminal-prior term by zero: Prince, Chapter 18, “The diffusion ELBO” and “Simplifying it”.
Remarks
Finite expectation and the exact objective estimated in each mode are proved in lem-diffusion-objective-estimator-expectation.
Remarks references
Expected output of the diffusion objective estimator
Statement
Assume AC. Use the admissible inputs of the epsilon-prediction diffusion objective estimator, and let be its returned real random variable. Its expectation is finite. In simple mode, In weighted-elbo mode, Here the simple loss and ELBO use the same schedule, reverse model and predictor as the estimator. Both identities include and .
Statement references
Estimator inputs and sampling instructions: Epsilon-prediction diffusion objective estimator.
Definitions of the two objectives: DDPM variational objective and weighted noise-prediction terms.
Diffusion objective sampling and weighting: Ho, Jain, and Abbeel, Eqs. (5), (12), (14) and Algorithm 1.
Facts & Assumptions
Given: AC and admissible inputs in the selected estimator mode; and are as in its instructions.
The Gaussian and KL interfaces assume AC. The Axiom of Choice.
The estimator samples independent uniform indices and independent standard Gaussian noise, and returns the prescribed branch value under its mode-specific integrability assumptions. Epsilon-prediction diffusion objective estimator.
The simple objective is the uniform-time average of the squared noise errors. The negative ELBO is the terminal KL plus the decoder expectation plus the sum of the expectations of for . Its proof makes every such expectation finite under its hypotheses. DDPM variational objective and weighted noise-prediction terms.
The forward marginal is . Closed Gaussian forward marginal and conditioned posterior.
The directional KL of positive isotropic Gaussians is the variance term plus the squared-mean term in the Gaussian KL formula. Reverse KL between isotropic Gaussian laws.
Expectation is integration against the probability law, finite for an integrable real random variable. Expectation of a nonnegative or integrable random variable.
Proof
Given: The hypotheses in the Statement.
Conditional on , the sampled state has the forward marginal in [F3]. Every returned value is finite and measurable: the predictor is finite-valued Borel, all schedule denominators and variances are positive, and the decoder density is strictly positive. In simple mode, the stated finite squared-error expectations make integrable, and independence and uniform sampling give .
In weighted-elbo mode, [F3] and [F4] with , , and identify the algorithm's as the exact terminal KL. The mode's hypotheses are those of [F2], so the decoder log-density and the interior weighted squared errors are integrable. Finite sums over therefore make integrable, even though a decoder contribution may be negative. For fixed , averaging the branch values over and the noise cancels each factor and counts once, giving .
Averaging step 1.2 over the uniform index proves the weighted identity. When the data average has one term, and when only the decoder branch is selected and the interior sum is empty; the terminal term is still counted once. Thus both identities hold throughout the admitted domain.
4 · Examples, counterexamples and false statements
None yet.