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 — Examples
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
- Discrete diffusion chains and DDPM objectives
- 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
None yet.
4 · Examples, counterexamples and false statements
Two-step scalar Gaussian forward chain and posterior
Example
Assume AC and take a one-dimensional chain with , , , and fixed data value . Then , , , and . The forward marginal at step two is , and the posterior given is At step one, assigns probability one to every Borel set containing and zero to every Borel set not containing , so it is not a Lebesgue density.
Example references
Scalar specialization of the forward marginal and posterior formulas: Ho, Jain, and Abbeel, Eqs. (4), (6), and (7).
Independent Gaussian-kernel derivation: Prince, Chapter 18, “The diffusion kernel” and “The tractable conditional”.
Facts & Assumptions
Given: AC, , , , and fixed .
AC is inherited from the Gaussian law and posterior interfaces. The Axiom of Choice.
The schedule definitions are and . Finite Gaussian forward chain and Gaussian reverse model.
The forward marginal and conditioned posterior have the exact formulas in the theorem. Closed Gaussian forward marginal and conditioned posterior.
A scalar is a normal law with mean and variance . Multivariate normal law, including singular covariance.
Verification
Given: The hypotheses in the Example.
The schedule gives , , , and .
By [F2] and the scalar normal convention [F3], has mean and variance .
The posterior variance is . The coefficient is , and the coefficient is . Substitution into [F2] gives the displayed posterior.
Since the final conditioning includes the fixed value , the conditional law of itself is concentrated at that value. It is therefore a point mass and has no Lebesgue density for the reconstruction term.
Source notes
Gaussian marginal and posterior theorem: Closed Gaussian forward marginal and conditioned posterior.
Weighted ELBO term differs from the simple diffusion loss
Example
Assume AC, take the one-dimensional schedule , , , and set the reverse variance at step two to . For a fixed , define the Borel predictor at step two by For the step-one decoder, define Along the forward chain, the step-two noise-prediction error is identically one, while the step-one decoder mean equals . Thus the exact step-two ELBO contribution has coefficient , whereas the step-two contribution to the uniform-time is .
Example references
Exact Gaussian noise-prediction weight and the unweighted objective: Ho, Jain, and Abbeel, Eqs. (12) and (14).
Pedagogical derivation of weighted and unweighted noise-prediction terms; its finite-horizon ELBO simplification approximates the terminal-prior term by zero: Prince, Chapter 18, “The diffusion ELBO” and “Simplifying it”.
Facts & Assumptions
Given: AC, , , , , and fixed .
AC is inherited from the Gaussian model and ELBO interfaces. The Axiom of Choice.
The finite schedule has and . Finite Gaussian forward chain and Gaussian reverse model.
For , the exact negative-ELBO step term is , with , while the simple objective is the uniform average over of the unweighted squared noise-prediction error. DDPM variational objective and weighted noise-prediction terms.
Verification
Given: The hypotheses in the Example.
The schedule is , , , and . Hence and .
For the forward sample , the step-two predictor in the Example returns , so the squared error is for every . For , the step-one predictor returns , and its reverse mean is . Therefore the reconstruction log-likelihood contribution is the fixed Gaussian density at its mean, independent of the step-two error.
Substituting into [F2] gives and . Thus the exact step-two ELBO contribution is times the expected squared noise error.
The uniform-time simple objective in [F2] has step-two contribution (and step-one noise error zero), while the exact weighted negative-ELBO term at step two is . Thus the two step-two objective contributions differ.
Source notes
Exact weighted DDPM term: DDPM variational objective and weighted noise-prediction terms.
Uniform-time simple-loss definition: DDPM variational objective and weighted noise-prediction terms.