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.
A constrained support can make single-site Gibbs reducible
Example
Let the ambient product state space be with its full product sigma-algebra, and let . Its support is the constrained diagonal set . Each single-site full conditional is the point mass at the retained coordinate, so either coordinate-update kernel restricts to the identity transition matrix on . The chain on is reducible under Reducibility of a finite Markov chain.
Facts & Assumptions
Given: The finite state space and target law in the Example.
A Gibbs block update retains the other coordinate and draws the updated coordinate from its full conditional. Exact Gibbs block update.
A finite chain is reducible when it has a nonempty proper closed subset. Reducibility of a finite Markov chain.
A proper full conditional kernel is an everywhere probability kernel satisfying the conditional event identities. Proper full conditional kernel.
Measurable rectangles generate the finite product sigma-algebra. The product sigma-algebra and its finite iterates.
Verification
Given: The hypotheses in the Example and facts [F1]–[F3].
The coordinate marginals are uniform on . For coordinate 1 set ; for any measurable and , , where . Exchanging the coordinates gives the same identity for . Each section is a probability measure at every conditioning value, and the identities for all prove that these are proper full conditional kernels by [F3].
Starting from either state , updating coordinate 1 draws from , and updating coordinate 2 draws from . Thus both component transition matrices restricted to are the identity. Each singleton and is nonempty, proper, and closed, so [F2] makes the restricted finite chain reducible.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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)