Source audit
Definitions, theorems, assumptions, proof route, and exact anchors.
Stable source-facing chapter environment inside the shared Samplinglib reader.
Definitions, theorems, assumptions, proof route, and exact anchors.
Use one canonical shared node where types match. Formal/source audit is still required.
Only genuinely missing mathematical edges become theorem-sized tasks.
Dependencies, consumers, cross-library bridges, and reusable shared interfaces.
ASTIS extended material, not a chapter of Fearnhead–Nemeth–Oates–Sherlock. No Lean closure asserted.
Stationarity is only the starting point. Determine from which states the law converges, and whether the rate is qualitative, geometric or uniform.
Primary §1.3; Roberts–Rosenthal §§2–4 (PDF pp.4–32).
Do not infer mixing from detailed balance alone. Preserve exceptional null starting sets, small-set conditions and theorem quantifiers; the displayed conditions are a blueprint, not a complete theorem.
Planned consumers: mcmc, discrete-sampling, log-concave-sampling. Planned sharing is not a compiled dependency or a priority claim.
General state space Markov chains and MCMC algorithms ↗
Gareth O. Roberts, Jeffrey S. Rosenthal · math/0404033v4
§2 construction; §§3–4 convergence/drift/coupling; §5 CLT; §6 scaling. Probability Surveys 1 (2004), 20–71; arXiv v4 (2007).
version-and-sha256-pinned
Convergence Bounds for Monte Carlo Markov Chains ↗
Qian Qin · 2409.14656v1
Handbook contribution on quantitative convergence; theorem-level anchor required for each bound
version-pinned; theorem-level audit pending