Proof of Theorem 2.17, p. 16 — the RWM acceptance probability satisfies α(x) ≤ (1 + 2λδ)^{−m/2} exp(Σ δλ²i²x_i²/(2δλ + 1)) for λ ∈ [0, 1]
ProvedMHSpectralGap.RWM.acceptance_boundConsider random walk Metropolis on for the Gaussian target of (2.5) (coordinates independent, ), with step size : proposal , , and acceptance . Let be the expected acceptance probability of a proposal from . Then for every and every ,
For in a fixed ball of and decaying as suitable powers of , the first factor decays faster than any power of while the second stays bounded; this collapse of the acceptance probability is what drives Theorem 2.17 (1).
Formalization Note The range is the one where the elementary bound used on the page holds; the paper applies it with . Coordinates are indexed by Fin m, coordinate carrying the weight (the paper's ). The power is a real power of a positive base.
import Mathlib import Definitions.Def_MHSpectralGap_RWM_MHKernel import Definitions.Def_MHSpectralGap_RWM_L2Gap import Definitions.Def_MHSpectralGap_RWM_Conductance import Definitions.Def_MHSpectralGap_RWM_RWMKernel open MeasureTheory ProbabilityTheory open scoped ENNReal
namespace MHSpectralGap.RWM
/-- The acceptance bound in the proof of Theorem 2.17, p. 16: for `0 < δ`, `λ ∈ [0, 1]` and
every `x ∈ ℝ^m`,
`α(x) ≤ (1 + 2λδ)^{−m/2} exp(∑_{i=1}^m δλ² i² x_i² / (2δλ + 1))`. -/
theorem acceptance_bound (m : ℕ) (δ : ℝ) (hδ : 0 < δ) (lam : ℝ) (hlam : lam ∈ Set.Icc (0 : ℝ) 1)
(x : Fin m → ℝ) :
accBar (rwmProposal m δ) (rwmAccept m) x ≤
ENNReal.ofReal ((1 + 2 * lam * δ) ^ (-(m : ℝ) / 2) *
Real.exp (∑ i : Fin m, δ * lam ^ 2 * ((i : ℝ) + 1) ^ 2 * x i ^ 2 / (2 * δ * lam + 1))) := by sorry
end MHSpectralGap.RWM
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.