Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

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 σt2∈(0,∞). For the noise-prediction parameterization, let ϵθ:Rd×{1,…,T}→Rd be Borel and set μθ,t(xt)=1αt(xt−βt1−αˉt ϵθ(xt,t)),1≤t≤T. For each fixed observed x0, require 0<pθ(x0)<∞, define the proper posterior density πθ(x1:T∣x0)=pθ(x0:T)pθ(x0), and let Qx0 and Πθ,x0 be the path probability measures with Lebesgue densities q(x1:T∣x0) and πθ(x1:T∣x0). Require Qx0≪Πθ,x0 and Eq(⋅∣x0) ⁣[∣log⁡q(x1:T∣x0)∣+∣log⁡pθ(x0:T)∣]<∞. Here Eq[f] means the integral of f against the path law with density q(⋅∣x0). Define ELBO⁡θ(x0)=Eq ⁣[log⁡pθ(x0:T)−log⁡q(x1:T∣x0)]. Then log⁡pθ(x0)=ELBO⁡θ(x0)+DKL(Qx0∥Πθ,x0),DKL(Qx0∥Πθ,x0)≥0. The negative ELBO has the exact decomposition −ELBO⁡θ(x0)=DKL ⁣(q(xT∣x0)∥Nd(0,Id))+Eq(x1∣x0)[−log⁡pθ(x0∣x1)]+∑t=2TEq(xt∣x0) ⁣[DKL ⁣(q(xt−1∣xt,x0)∥pθ(xt−1∣xt))]. In particular, for t≥2, write μ~t(xt,x0)=αˉt−1βt1−αˉtx0+αt(1−αˉt−1)1−αˉtxt,wt=βt22σt2αt(1−αˉt),Ct=d2(β~tσt2−1+log⁡σt2β~t). If xt=αˉtx0+1−αˉt ϵ with ϵ∼Nd(0,Id), then the corresponding per-step KL term is Eϵ ⁣[wt∥ϵ−ϵθ(xt,t)∥22+Ct]. At t=1, the reconstruction term is the separate learned likelihood pθ(x0∣x1) with variance σ12>0; no Lebesgue density for q(x0∣x1,x0) is used. For finite T, the terminal-prior KL is retained; no equality q(xT∣x0)=Nd(0,Id) is assumed. The common unweighted objective Lsimple(θ;x0)=1T∑t=1TEϵ ⁣[∥ϵ−ϵθ ⁣(αˉtx0+1−αˉtϵ,t)∥22] 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 x0, a Borel noise predictor, and finite absolute q-expectations of the log path densities in the Statement.

[A1]

AC is assumed by the Gaussian conditional-law supplier and the library KL/ELBO interface. The Axiom of Choice.

[F1]

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.

[F2]

The forward marginal and, for t≥2, the exact Gaussian law of xt−1 conditioned on xt,x0 are as stated. Closed Gaussian forward marginal and conditioned posterior.

[F3]

The variational-family interface requires 0<Z<∞ before it normalizes π=γ/Z. Variational family and evidence lower bound.

[F9]

An admissible density has the required support and finite q-integrability of ∣log⁡γ∣+∣log⁡q∣. Variational family and evidence lower bound.

[F4]

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.

[F5]

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.

[F6]

Expectation of an integrable function is its integral with respect to the stated probability law. Expectation of a nonnegative or integrable random variable.

[F7]

A probability law is the pushforward probability measure of its random element. Law or distribution of a random element.

[F8]

The library KL is directional: its first argument must be absolutely continuous with respect to its second. Kullback–Leibler divergence.

[F10]

A multivariate normal law has its specified mean and covariance, so a standard d-dimensional normal residual has second moment d. Multivariate normal law, including singular covariance.

Proof

technique · verify the path-space ELBO hypotheses, telescope the forward-density ratios, and evaluate the remaining Gaussian divergences

Given: The hypotheses in the Statement.

1.1F1F7givenconstruct

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 x1:T is a probability density by successive integration of its reverse kernels and prior. For fixed x0, the decoder density satisfies pθ(x0∣x1)≤(2πσ12)−d/2, so integrating against that path marginal gives pθ(x0)<∞. It is strictly positive: on the positive-measure box [−1,1]dT, the sets {pθ(x0:T)≥1/n} for positive integers n 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 πθ(⋅∣x0) is a proper positive density.

1.2F1F6F7F10given

The forward path density is a probability density and is positive everywhere. Its log is the finite sum log⁡q(x1:T∣x0)=∑t=1T[−d2log⁡(2πβt)−∥xt−αtxt−1∥222βt]. Under q, each normalized residual (xt−αtxt−1)/βt has law Nd(0,Id) and finite second moment d by [F10], so Eq∣log⁡q∣<∞. Since the reverse density is also positive everywhere, πθ>0 everywhere and the support condition Qx0≪Πθ,x0 holds.

2.1A1F3F4F6F8F9step 1.1step 1.2

Let γ(x1:T)=pθ(x0:T) on path space with base measure λdT. Step 1.1 gives Z=∫γ dλdT=pθ(x0)∈(0,∞) and the normalized target π=γ/Z; step 1.2 gives the support condition, and the Statement's integrability hypothesis together with step 1.2 gives Eq(∣log⁡γ∣+∣log⁡q∣)<∞. The direction is Qx0≪Πθ,x0, as required by [F8]. Therefore [F3], [F6], and [F9] apply, and [F4] gives the exact log-evidence identity and nonnegative reverse KL.

2.2F1F2step 1.2algebra

For t≥2, the Markov property and positive Gaussian densities give q(xt∣xt−1)=q(xt−1∣xt,x0)q(xt∣x0)/q(xt−1∣x0). Substitute this into pθ(x0:T)/q(x1:T∣x0). The ratios q(xt−1∣x0)/q(xt∣x0) telescope, leaving pθ(x0:T)/q(x1:T∣x0)=[p(xT)/q(xT∣x0)]pθ(x0∣x1)∏t=2Tpθ(xt−1∣xt)/q(xt−1∣xt,x0). 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 t=1 term −Eq(x1∣x0)log⁡pθ(x0∣x1).

3.1F2F5step 2.2algebra

For t≥2, substitute xt=αˉtx0+1−αˉtϵ into the posterior mean in [F2]. Using αˉt=αtαˉt−1 and βt=1−αt gives μ~t(xt,x0)=1αt(xt−βt1−αˉtϵ). The reverse mean is the same expression with ϵθ(xt,t) in place of ϵ, so ∥μ~t−μθ,t∥22=βt2αt(1−αˉt)∥ϵ−ϵθ(xt,t)∥22. Both posterior and reverse variances are positive for t≥2, so [F5] applies with v=β~t and w=σt2; it gives exactly the coefficient wt and constant Ct in the Statement.

4.1F1F2F5step 2.2step 3.1algebra∎

The terminal term remains DKL(q(xT∣x0)∥Nd(0,Id)) in step 2.2 because finite T and 0<βt<1 give αˉT>0; the t=1 term remains the separate positive-variance decoder log-likelihood. For an explicit counterexample, take d=1, T=2, β1=14, β2=12, σ12=(2π)−1, and σ22=β~2=15. Then αˉ1=34, αˉ2=38, w2=(1/2)22(1/5)(1/2)(5/8)=2, and C2=12(1−1+log⁡1)=0. For a fixed datum x0, set ϵθ(x1,1)=(x1−3/4 x0)/1/4 and ϵθ(x2,2)=(x2−3/8 x0)/5/8+c, with any c∈R. These are finite Borel maps, and their Gaussian log densities have finite q-expectations because they are quadratic functions of finite-dimensional Gaussian variables. The first map makes μθ,1(x1)=x0, so the decoder density at its mean is (2πσ12)−1/2=1; integrating it against the normalized reverse path density gives pθ(x0)=1 for every c. Under the forward chain, the t=1 noise error is zero and the t=2 error is c, so Lsimple=c2/2, while the exact weighted t=2 ELBO contribution is 2c2 and its prior term is independent of c. Taking c≠0 gives Lsimple>0 but exact negative log-likelihood −log⁡pθ(x0)=0. 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.

Depends on

Used by

Dependency tree · two levels

60 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