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.
Exact Gibbs block update
Definition
Inputs: The finite product state space and target law from Proper full conditional kernel, a nonempty block , its supplied proper full conditional kernel , and a current state .
Output: A new state whose retained coordinates equal and whose updated block is sampled from .
The transition kernel is Operationally, retain every coordinate outside , draw from the full conditional kernel at the retained value, and replace the coordinates in by . The finite product sigma-algebra makes the splice map measurable; the kernel-integral theorem makes the displayed evaluation measurable in . The well-definedness result is The Gibbs block update is a probability kernel ↗.
Depends on
Used by
- Random and systematic Gibbs scan schemes Algorithm
- A constrained support can make single-site Gibbs reducible Example
- An invariant Gibbs target can still give reducible dynamics Example
- Full conditionals for a bivariate normal target Example
- A Gibbs refresh is conditionally independent of the old block Lemma
- Each exact Gibbs block update is reversible and invariant Lemma
- The Gibbs block update is a probability kernel Lemma
- A systematic Gibbs sweep preserves the target Theorem
Dependency tree · two levels
17 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
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Chapter 12 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms (standard reference, not scraped)