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-step leapfrog energy error
Example
For the one-dimensional standard-normal potential , unit mass, , one leapfrog step, and initial phase point , the proposed energy rises by and the Metropolis acceptance probability is .
Facts & Assumptions
Given: AC, , , , and .
A leapfrog step applies a half kick, full drift, then half kick; the proposal flips the final momentum. One-step leapfrog map as force and drift shears The HMC correction uses . Hamiltonian Monte Carlo
The algorithm retains the original position if the proposal is rejected. Leapfrog Hamiltonian Monte Carlo
The exponential is positive and strictly increasing, and for every real ; at , positivity and the reciprocal identity give , hence . The exponential is positive and satisfies , The exponential function is strictly increasing
Proof
The first half kick gives . The drift gives . The final half kick gives , so the flipped proposal is .
The initial energy is , while the proposed energy is . The discrete step therefore does not conserve at this point.
The acceptance probability is , since and [F3] gives ; rejection retains by [F2]. This finite calculation distinguishes energy error from the exact target-invariance statement proved for the full Metropolized kernel.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- Radford M. Neal, MCMC Using Hamiltonian Dynamics, Handbook of Markov Chain Monte Carlo, Chapter 5 (standard reference, not scraped)
- Michael Betancourt, A Conceptual Introduction to Hamiltonian Monte Carlo (standard reference, not scraped)