Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

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

Depends on

Used by

Dependency tree · two levels

46 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