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.
Weakly convergent finite-step output laws need not be exact
Example
For each integer , let on , where is unit mass at , and let the target posterior be . For example, this target is the posterior from prior and the one-point observation model with likelihood one. The th output law is realized by a one-step instance of the reverse-kernel interface with , terminal law , zero Borel score field, a constant correction into a singleton space, the constant kernel , and no projection. Its exact kernel sampler uses at most independent Bernoulli draws and returns exactly when all draws equal , so it has finite budget for every . The output laws converge weakly to , yet at every finite because . This finite-kernel example illustrates the distinction between asymptotic weak convergence and exact posterior sampling; it is not a performance claim about a trained diffusion model.
Example references
Facts & Assumptions
Given: The distributions and one-step reverse-kernel procedure in the Example.
For each integer , is a probability measure on , and the target is .
Weak convergence of Borel probabilities is convergence of integrals against every bounded continuous real test function. Weak convergence of borel probability measures
The reverse-kernel procedure accepts a terminal probability law and Borel transition kernels whose samplers return a draw from the supplied law or a failure status. Measurement-guided reverse-kernel reconstruction
Verification
Given: The distributions and procedure in the Example. The weak-convergence and non-equality claims are to be established below.
Choose , , , state space , and observation space with . Take the unique forward map , likelihood relative to counting measure, terminal law with deterministic initialization at , zero score field, a singleton correction space with constant correction, the Borel constant kernel , and no projection. The kernel is a probability kernel because has total mass one. If are independent fair coin flips, the sampler that returns exactly when every and returns otherwise has law and uses at most flips. Thus [F2] permits the one-step instance and its returned state has law .
For every bounded continuous , . Thus the defining test integrals converge, so by [F1].
For each finite integer , , hence . In particular this holds at the first index as well as every later finite index.
The output laws therefore converge weakly to the target but are not equal to it at any finite index, so this convergence statement supplies no finite-index exactness claim.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Giannis Daras et al., A Survey on Diffusion Models for Inverse Problems (2024), arXiv:2410.00083 (standard reference, not scraped)