Section 3.2.2 -- the Metropolis-Hastings chain for a general base chain
ProvedMarkovMixing.metropolized_stationaryLet be an arbitrary stochastic matrix on a finite state space (a base chain, not assumed symmetric), and let be a strictly positive probability distribution on . The Metropolis–Hastings chain built from this pair proposes a move from to with probability and accepts it with probability
staying at on rejection; the acceptance ratio weighs the proposal probabilities of the two directions against the target masses.
The theorem asserts that this chain is a genuine Markov chain (nonnegative entries, rows summing to one), that it satisfies the detailed balance equations — reversibility with respect to — and that is a stationary distribution for it: for every . This is Exercise 3.1 of Levin–Peres–Wilmer, the general (non-symmetric) form of the Metropolis construction of §3.2.2.
import Definitions.Def_mm_mcmc
namespace MarkovMixing
/-- **§3.2.2, Exercise 3.1** (LPW): the Metropolized chain built from a
general stochastic base chain `Ψ` and a positive target distribution `π` is a
Markov chain, reversible with respect to `π`, with stationary distribution
`π`. -/
theorem metropolized_stationary {V : Type*} [Fintype V] [DecidableEq V]
(Ψ : Matrix V V ℝ) (hΨ : IsStochastic Ψ)
(π : V → ℝ) (hπ : IsDist π) (hpos : ∀ x : V, 0 < π x) :
IsStochastic (metropolized Ψ π) ∧
DetailedBalance (metropolized Ψ π) π ∧
IsStationary (metropolized Ψ π) π := by
sorry
end MarkovMixing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.