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.
Prior-preserving Crank–Nicolson sampler
Definition
Assume the Axiom of Choice. Let be a separable real Hilbert space, let be a centered Borel Gaussian probability measure on , let be Borel with , and let be Borel. Assume the evidence
satisfies . Extend the potential to all of by setting for and for , and define the target probability . For a scale , write . At state , draw independently and propose . Set the acceptance probability to if either or is , and otherwise set
Draw an independent uniform random variable on and move to if it is at most ; otherwise remain at . The resulting one-step transition rule is the prior-preserving Crank–Nicolson, or pCN, rule . States with infinite potential are absorbing under this total definition; they have -measure zero.
Definition references
Depends on
Used by
- A Gaussian pCN kernel leaves a normal posterior invariant Example
- The pCN accept-reject procedure defines a probability kernel Lemma
- The pCN Gaussian reference pair law is symmetric Lemma
- pCN stationary mean acceptance tends to one at small scale Theorem
- The pCN accept-reject kernel preserves the posterior Theorem
Dependency tree · two levels
36 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
- S. L. Cotter, G. O. Roberts, A. M. Stuart, and D. White, MCMC Methods for Functions: Modifying Old Algorithms to Make Them Faster, Statistical Science 28(3) (2013) (standard reference, not scraped)
- Yury Korolev and Jonas Latz, Inverse Problems: Lecture Notes, Michaelmas Term 2020 (University of Cambridge, 18 May 2021) (standard reference, not scraped)
- M. Hairer, A. M. Stuart, and S. J. Vollmer, Spectral gaps for a Metropolis–Hastings algorithm in infinite dimensions, Annals of Applied Probability 24(6) (2014) (standard reference, not scraped)