Alphabeta Math
Pipeline-generated
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

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite Gaussian forward chain and Gaussian reverse model

Definition

Assume AC. Let d,T≥1 be finite integers, let Id be the d×d identity matrix, and let β1,…,βT∈(0,1). Set αt=1−βt, αˉ0=1, and αˉt=∏s=1tαs. Write λd for Lebesgue measure on Rd and define, for v>0, ϕd,v(y;m)=(2πv)−d/2exp⁡ ⁣(−∥y−m∥222v),y,m∈Rd. The notation ∥z∥22=∑i=1dzi2 is the squared Euclidean norm. The displayed function is the Lebesgue density of Nd(m,vId).

For each fixed x0∈Rd, the forward chain has path density on (Rd)T q(x1:T∣x0)=∏t=1Tϕd,βt(xt;αt xt−1). Thus its transition from xt−1 to xt is Gaussian with mean αt xt−1 and covariance βtId. 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 μθ,t:Rd→Rd and fixed variances σt2∈(0,∞), for 1≤t≤T. It is the joint density pθ(x0:T)=ϕd,1(xT;0)∏t=1Tϕd,σt2(xt−1;μθ,t(xt)). Its prior is p(xT)=Nd(0,Id), and its marginal density at x0 is pθ(x0)=∫(Rd)Tpθ(x0:T) dλd(x1)⋯dλd(xT), 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 t=1, the forward-chain conditional q(x0∣x1,x0) assigns probability one to every Borel set containing x0 and zero to every Borel set not containing x0; it is not a Lebesgue density. The separate learned reverse likelihood pθ(x0∣x1) is the Gaussian density above with variance σ12>0.

Definition references

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Reverse KL between isotropic Gaussian laws

Statement

Assume AC. Let d≥1, m,n∈Rd, and v,w>0. If Q=Nd(m,vId) and P=Nd(n,wId), then DKL(Q∥P)=d2(vw−1+log⁡wv)+∥m−n∥222w, where the KL divergence is directional, its first argument is absolutely continuous with respect to its second, and log⁡ is the natural logarithm.

Statement references

Facts & Assumptions

Given: AC, Q=Nd(m,vId) and P=Nd(n,wId) with d≥1 and v,w>0.

[A1]

AC is assumed by the Gaussian-density supplier and the library KL definition. The Axiom of Choice.

[F1]

A positive-definite multivariate normal law has its displayed Lebesgue density. A positive-definite multivariate normal law has its Gaussian density.

[F2]

A multivariate normal law has its specified mean and covariance. Multivariate normal law, including singular covariance.

[F3]

For probability measures Q≪P, the library divergence is the expectation under Q of the log Radon–Nikodym density ratio. Kullback–Leibler divergence.

[F4]

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

Proof

technique · expand the Gaussian log-density ratio and integrate its quadratic terms

Given: The hypotheses in the Statement.

1.1A1F1F3given

By [F1], both Lebesgue densities are strictly positive, so Q≪P. Expanding their Gaussian density formulas gives the log-density ratio log⁡dQdP(x)=d2log⁡wv−∥x−m∥222v+∥x−n∥222w. All terms are integrable under Q because its covariance is finite.

2.1A1F2F3F4step 1.1algebra∎

Under Q, [F2] gives EQ∥X−m∥22=dv, and expansion of X−n=(X−m)+(m−n) gives EQ∥X−n∥22=dv+∥m−n∥22 because EQ(X−m)=0. Integrating the ratio in step 1.1 and applying the AC-dependent convention [F3] and expectation definition [F4] yields DKL(Q∥P)=d2log⁡wv−d2+dv+∥m−n∥222w, which is the stated formula.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Closed Gaussian forward marginal and conditioned posterior

Statement

Assume AC and the finite Gaussian forward chain with dimension d≥1, horizon T≥1, and schedule 0<βt<1 from the preceding definition. For each x0∈Rd and 1≤t≤T, q(xt∣x0)=Nd ⁣(αˉt x0,(1−αˉt)Id). For every 2≤t≤T, the conditional law given both endpoints is q(xt−1∣xt,x0)=Nd ⁣(αˉt−1βt1−αˉtx0+αt(1−αˉt−1)1−αˉtxt, β~tId),β~t=βt(1−αˉt−1)1−αˉt>0. The formula for q(xt−1∣xt,x0) is only asserted for t≥2; at t=1 the conditioning on x0 makes q(x0∣x1,x0) a point mass, not a Lebesgue density. The Gaussian conditional above does not assert that the unconditional reverse law q(xt−1∣xt) 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 x0∈Rd, finite d,T≥1, and 0<βt<1 for every t.

[A1]

AC is assumed by the Gaussian-stack construction and the multivariate-normal conditional-law theorem. The Axiom of Choice.

[F1]

The forward path density factors into normalized transition densities ϕd,βs(xs;αsxs−1), with αs=1−βs and αˉs=∏r=1sαr. Finite Gaussian forward chain and Gaussian reverse model.

[F2]

A multivariate normal law is characterized by its scalar projection laws and has the stated mean and covariance. Multivariate normal law, including singular covariance.

[F3]

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.

[F4]

If (X,Y) is jointly Gaussian with positive-semidefinite block covariance and the observed block covariance B is positive definite, then its conditional law has mean a+CB−1(y−b) and covariance A−CB−1CT. Conditional law of a jointly Gaussian block with positive-definite observed covariance.

Proof

technique · standardize each transition to an independent Gaussian innovation, compute its finite affine sum, and apply the positive-definite-observation conditional-law formula to adjacent states

Given: The hypotheses in the Statement.

1.1A1F1F2givenalgebra

Under the forward path law with fixed x0, for each s put ξs=(Xs−αsXs−1)/βs. Changing variables xs=αsxs−1+βsz in the last transition density in [F1] gives the conditional density ϕd,1(z;0), independent of the past. Thus for Borel past events A and Borel B⊆Rd, P(X1:s−1∈A,ξs∈B)=P(X1:s−1∈A)Nd(0,Id)(B). Each ξs is standard Gaussian and independent of the previous path; since earlier innovations are measurable functions of that path, ξ1,…,ξt are mutually independent for every t.

2.1A1F1F2F3givenstep 1.1algebra

Iterating Xt=αtXt−1+βtξt gives Xt=αˉtx0+∑s=1tβs∏r=s+1tαr ξs. By step 1.1 and [F3], the finite innovation stack is jointly Gaussian. Thus each scalar projection of Xt is normal with mean u⋅αˉtx0 and, by independence, variance uT(∑s=1tβs∏r=s+1tαrId)u; [F2] identifies its law as multivariate normal with that mean and covariance. Since βs∏r=s+1tαr=∏r=s+1tαr−∏r=stαr, the covariance sum telescopes to (1−αˉt)Id.

3.1A1F1F2F3step 1.1step 2.1algebra

Fix t≥2. By step 2.1, Xt−1 is Gaussian, and by step 1.1, ξt is independent of the past and standard Gaussian. The finite-stack result [F3] makes (Xt−1,ξt) jointly Gaussian. For any u,v∈Rd, the projection of (Xt−1,Xt) is (u+αtv)⋅Xt−1+βtv⋅ξt, a scalar projection of that Gaussian stack; hence [F2] makes the pair jointly Gaussian. Its means are αˉt−1x0 and αˉtx0, and its covariance blocks are A=(1−αˉt−1)Id, C=αt(1−αˉt−1)Id, and B=(1−αˉt)Id. The full block covariance is positive semidefinite because each of its quadratic forms is the variance of a scalar projection of (Xt−1,Xt). Since 0<αs<1, we have 0<αˉt<1, so B is positive definite.

4.1A1F1F4step 3.1algebra∎

Applying [F4] with these blocks gives conditional covariance A−CB−1CT=((1−αˉt−1)−αt(1−αˉt−1)21−αˉt)Id=βt(1−αˉt−1)1−αˉtId and conditional mean αˉt−1x0+αt(1−αˉt−1)1−αˉt(xt−αˉtx0)=αˉt−1βt1−αˉtx0+αt(1−αˉt−1)1−αˉtxt. For t≥2, αˉt−1<1 and βt>0, so β~t>0. This is the asserted conditional law; no density for the degenerate t=1 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Epsilon-prediction diffusion objective estimator

Definition

Fix finite integers d,N,T≥1, a data set D=(x0(1),…,x0(N))∈(Rd)N, forward variances β1,…,βT∈(0,1), reverse variances σ12,…,σT2∈(0,∞), a Borel map ϵθ:Rd×{1,…,T}→Rd, and a mode from {weighted-elbo,simple}. Set αt=1−βt and αˉt=∏s=1tαs. Use the noise-prediction means μθ,t(y)=1αt(y−βt1−αˉt ϵθ(y,t)),1≤t≤T, and the reverse Gaussian model with these means, variances σt2, and prior Nd(0,Id) to define pθ. In weighted-elbo mode, require for each x0(i) that 0<pθ(x0(i))<∞, the forward path law be absolutely continuous with respect to the normalized reverse posterior path law, and Eq(⋅∣x0(i)) ⁣[∣log⁡q(x1:T∣x0(i))∣+∣log⁡pθ(x0:T)∣]<∞. In simple mode, require for every i and t that Eϵ∼Nd(0,Id) ⁣[∥ϵ−ϵθ ⁣(αˉtx0(i)+1−αˉtϵ,t)∥22]<∞. This procedure returns one stochastic loss estimate; it does not prescribe a parameter optimizer or claim optimizer convergence.

  1. Choose I uniformly from {1,…,N}, choose J uniformly from {1,…,T} independently of I, and draw ϵ∼Nd(0,Id) independently of both.

  2. Set xJ=αˉJ x0(I)+1−αˉJ ϵ.

  3. If the mode is simple, return ∥ϵ−ϵθ(xJ,J)∥22.

  4. If the mode is weighted-elbo, first compute the exact terminal-prior term KT(x0(I))=12[αˉT∥x0(I)∥22+d(−αˉT−log⁡(1−αˉT))]. If J=1, return KT(x0(I))−Tlog⁡pθ(x0(I)∣xJ). If J≥2, return KT(x0(I))+T[CJ+wJ∥ϵ−ϵθ(xJ,J)∥22], where wJ and CJ are the exact per-step coefficient and variance constant in the DDPM objective theorem.

Each branch returns one sampled objective contribution. The J=1 weighted branch uses the positive-variance learned reconstruction likelihood; it never evaluates a density for the degenerate forward conditional q(x0∣x1,x0). 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.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Expected output of the diffusion objective estimator

Statement

Assume AC. Use the admissible inputs of the epsilon-prediction diffusion objective estimator, and let Y be its returned real random variable. Its expectation is finite. In simple mode, E[Y]=1N∑i=1NLsimple(θ;x0(i)). In weighted-elbo mode, E[Y]=1N∑i=1N[−ELBO⁡θ(x0(i))]. Here the simple loss and ELBO use the same schedule, reverse model and predictor as the estimator. Both identities include N=1 and T=1.

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; I,J,ϵ and Y are as in its instructions.

[A1]

The Gaussian and KL interfaces assume AC. The Axiom of Choice.

[F1]

The estimator samples independent uniform indices I,J and independent standard Gaussian noise, and returns the prescribed branch value under its mode-specific integrability assumptions. Epsilon-prediction diffusion objective estimator.

[F2]

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 Ct+wt∥ϵ−ϵθ(xt,t)∥22 for t≥2. Its proof makes every such expectation finite under its hypotheses. DDPM variational objective and weighted noise-prediction terms.

[F3]

The forward marginal is Nd(αˉtx0,(1−αˉt)Id). Closed Gaussian forward marginal and conditioned posterior.

[F4]

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.

[F5]

Expectation is integration against the probability law, finite for an integrable real random variable. Expectation of a nonnegative or integrable random variable.

Proof

technique · integrate over the finite uniform indices and apply the exact objective decomposition

Given: The hypotheses in the Statement.

1.1A1F1F2F3F5givenalgebra

Conditional on I=i,J=t, 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 Y integrable, and independence and uniform sampling give E[Y]=(NT)−1∑i=1N∑t=1TEϵ∥ϵ−ϵθ(αˉtx0(i)+1−αˉtϵ,t)∥22=N−1∑iLsimple(θ;x0(i)).

1.2A1F1F2F3F4F5givenalgebra

In weighted-elbo mode, [F3] and [F4] with v=1−αˉT, w=1, m=αˉTx0(i) and n=0 identify the algorithm's KT(x0(i)) 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 i,t therefore make Y integrable, even though a decoder contribution may be negative. For fixed i, averaging the branch values over J and the noise cancels each factor T and counts KT once, giving E[Y∣I=i]=KT(x0(i))+Eq(x1∣x0(i))[−log⁡pθ(x0(i)∣x1)]+∑t=2TEϵ[Ct+wt∥ϵ−ϵθ(xt,t)∥22]=−ELBO⁡θ(x0(i)).

2.1F1F5step 1.1step 1.2algebra∎

Averaging step 1.2 over the uniform index I proves the weighted identity. When N=1 the data average has one term, and when T=1 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.

Sources