Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by Epsilon-prediction diffusion objective estimator.

Dependency tree · two levels

20 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