Theorem 4 (Peskun's theorem on general state spaces):
ProvedTierneyMH.Peskun.theorem4_peskun_orderingLet be a measurable space in which singletons are measurable, and let be a probability measure on . Let and be Markov transition kernels on that are reversible with respect to (so is invariant for both), and let . For a transition kernel let
where is a Markov chain with initial distribution and transition kernel . If , i.e. dominates off the diagonal, then both limits and exist in and
This extends Peskun's (1973) finite-state theorem to general state spaces. The ergodic average of along a chain that moves off the diagonal more readily has asymptotic variance no larger than along the other chain. Combined with the maximality of the Metropolis–Hastings acceptance probability, this makes the optimal acceptance function in terms of asymptotic variance.
Formalization Note The asymptotic variance may be infinite, so variances are Mathlib's extended variances with values in and the division by is carried out in . The existence of both limits, which the definition of presupposes and the paper's proof asserts ("the limit is guaranteed to exist, but it may be infinite", p. 6), is part of the conclusion. The path measure is the Ionescu–Tulcea trajectory measure of the chain started from , and the sum runs over , excluding . Measurability of singletons is the paper's implicit assumption that is an event, and is a measurable representative of its class.
import Mathlib import Definitions.Def_TierneyMH_Shared_OffDiagDominates import Definitions.Def_TierneyMH_Peskun_chainMeasure open TierneyMH.Shared open MeasureTheory ProbabilityTheory Filter open scoped ENNReal Topology
namespace TierneyMH.Peskun
/-- **Theorem 4** (Tierney 1998, p. 5). Let `P₁ P₂` be reversible Markov kernels on `E` with
invariant distribution `π`, and let `f ∈ L²₀(π)`. For a kernel `H`, let
`v(f, H) = lim_{n→∞} (1/n) Var_H(∑_{i=1}^{n} f(X_i))`, where `X₀, X₁, …` is the Markov chain
with initial distribution `π` and kernel `H` (`chainMeasure π H`). If `P₁ ⪰ P₂`
(`OffDiagDominates π P₁ P₂`), then `v(f, P₁) ≤ v(f, P₂)`.
Both limits are asserted to exist in `[0, ∞]` (`ℝ≥0∞`-valued `evariance`, division in
`ℝ≥0∞`), which the definition of `v` presupposes and the proof asserts ("the limit is
guaranteed to exist, but it may be infinite", p. 6). `MeasurableSingletonClass E` is the
paper's implicit assumption that `A \ {x}` is an event. -/
theorem theorem4_peskun_ordering {E : Type*} [MeasurableSpace E] [MeasurableSingletonClass E]
(π : Measure E) [IsProbabilityMeasure π]
(P₁ P₂ : Kernel E E) [IsMarkovKernel P₁] [IsMarkovKernel P₂]
(hrev₁ : Kernel.IsReversible P₁ π) (hrev₂ : Kernel.IsReversible P₂ π)
(f : E → ℝ) (hf_meas : Measurable f) (hf : MemLp f 2 π) (hf0 : ∫ x, f x ∂π = 0)
(hdom : OffDiagDominates π P₁ P₂) :
∃ v₁ v₂ : ℝ≥0∞,
Tendsto (fun n : ℕ => evariance (pathSum f n) (chainMeasure π P₁) / n) atTop (𝓝 v₁) ∧
Tendsto (fun n : ℕ => evariance (pathSum f n) (chainMeasure π P₂) / n) atTop (𝓝 v₂) ∧
v₁ ≤ v₂ := by sorry
end TierneyMH.Peskun
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.