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

Forward path law is admissible for the finite masked model

Statement

Let V be finite and nonempty, m∉V, L,N≥1, and 1=α0>⋯>αN=0. For each position, reverse step, state with a masked position, and clean token, assume hi,j(z)(v)>0. Fix x∈VL, let qx be the forward path probability vector on SN+1 conditioned on X=x, let γx(z0,…,zN)=p(x,z0,…,zN) be the finite joint model mass, and put Zx=∑zγx(z) and πx=γx/Zx. Then 0<Zx≤1, qx=0 wherever πx=0, and ∑z:qx(z)>0qx(z)(∣log⁡γx(z)∣+∣log⁡qx(z)∣)<∞. With weighted log terms set to zero where qx=0, as in the variational definition, qx is an admissible variational density for the finite joint target γx.

Statement references

Finite masked-diffusion generative model: the joint mass is the terminal point mass times the learned reverse kernels and the decoder.

Finite masking diffusion chain: the forward path starts at x, masks are absorbing, and the terminal state is mL.

Variational family and evidence lower bound: admissibility requires support domination and absolute log-integrability for a finite positive normalizer.

Facts & Assumptions

Given: The finite forward path law, the finite reverse generative model, the strict endpoints, and full-support clean-token vectors at every masked reverse state. Prove the forward path density is admissible for the model's conditional joint target.

[F1]

Finite masking diffusion chain: a forward path starts at x, each clean token either survives or becomes m, and m remains masked thereafter.

[F2]

Finite-grid masked reverse sampler: reverse rows copy clean tokens and assign mass cjhi,j(z)(v) to a clean token from a masked position and dj=(1−αj−1)/(1−αj) to retaining the mask.

[F3]

Finite masking-chain transitions define a probability law: qx is a normalized probability vector on the finite path space.

[F4]

Finite masked-diffusion joint model is normalized: the joint model mass is a probability vector, so Zx≤1.

[F5]

Variational family and evidence lower bound: admissibility is qx≪πx and finite ∑qx(∣log⁡γx∣+∣log⁡qx∣), with zero-density terms set to zero.

Proof

1.1givenF1F2constructalgebra

The forward survival ratios telescope to ∏j=1Nrj=αN=0, so for each coordinate the event of remaining clean at N has probability zero; hence every qx-positive path has zN=mL, while the defining path mass forces z0=x. Fix such a path. A clean-to-clean forward transition copies its token, and the learned reverse row assigns that transition probability one. A clean-to-mask transition has learned reverse probability cjhi,j(zj)(xi)>0. A mask-to-mask transition can occur only for j≥2, because z0=x is clean; then αj−1<1 and its learned reverse probability dj=(1−αj−1)/(1−αj)>0. These are all positive-probability forward transitions by [F1]. Thus every factor in the learned reverse path mass is positive, and the terminal prior and clean-state decoder are also positive; hence γx(z0,…,zN)>0.

2.1F3F4step 1.1algebra

By [F3], at least one path has positive qx mass. Step 1.1 makes its joint model mass positive, so Zx>0; [F4] gives Zx≤1. On every qx-positive path, step 1.1 gives γx>0, hence πx>0 and qx≪πx.

3.1F5step 1.1step 2.1algebra∎

The path space is finite. On each of its finitely many qx-positive states, both qx(z) and γx(z) are positive finite real numbers, so both logarithms are finite. Their finite weighted sum is finite; on qx=0 states the variational convention contributes zero. This verifies [F5] and proves admissibility.

Depends on

Used by

Dependency tree · two levels

22 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