Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4 (Peskun's theorem on general state spaces): P1⪰P2⇒v(f,P1)≤v(f,P2)P_1 \succeq P_2 \Rightarrow v(f,P_1) \le v(f,P_2)P1​⪰P2​⇒v(f,P1​)≤v(f,P2​)

Proved
TierneyMH.Peskun.theorem4_peskun_ordering

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysismarkov-chainsmcmcp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let (E,E)(E,\mathcal E)(E,E) be a measurable space in which singletons are measurable, and let π\piπ be a probability measure on EEE. Let P1P_1P1​ and P2P_2P2​ be Markov transition kernels on EEE that are reversible with respect to π\piπ (so π\piπ is invariant for both), and let f∈L02(π)={g∈L2(π):∫g dπ=0}f \in L^2_0(\pi) = \{g \in L^2(\pi) : \int g\, d\pi = 0\}f∈L02​(π)={g∈L2(π):∫gdπ=0}. For a transition kernel HHH let

v(f,H)  =  lim⁡n→∞1nVar⁡H(∑i=1nf(Xi)),v(f, H) \;=\; \lim_{n\to\infty} \frac{1}{n}\operatorname{Var}_H\Bigl(\sum_{i=1}^{n} f(X_i)\Bigr),v(f,H)=n→∞lim​n1​VarH​(i=1∑n​f(Xi​)),

where X0,X1,…X_0, X_1, \dotsX0​,X1​,… is a Markov chain with initial distribution π\piπ and transition kernel HHH. If P1⪰P2P_1 \succeq P_2P1​⪰P2​, i.e. P1P_1P1​ dominates P2P_2P2​ off the diagonal, then both limits v(f,P1)v(f,P_1)v(f,P1​) and v(f,P2)v(f,P_2)v(f,P2​) exist in [0,∞][0,\infty][0,∞] and

v(f,P1)  ≤  v(f,P2).v(f, P_1) \;\le\; v(f, P_2).v(f,P1​)≤v(f,P2​).

This extends Peskun's (1973) finite-state theorem to general state spaces. The ergodic average of fff 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 αMH\alpha_{MH}αMH​ 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 [0,∞][0,\infty][0,∞] and the division by nnn is carried out in [0,∞][0,\infty][0,∞]. The existence of both limits, which the definition of vvv 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 π\piπ, and the sum runs over X1,…,XnX_1,\dots,X_nX1​,…,Xn​, excluding X0X_0X0​. Measurability of singletons is the paper's implicit assumption that A∖{x}A\setminus\{x\}A∖{x} is an event, and fff is a measurable representative of its L2L^2L2 class.

Preamble
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
Formal statement
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
Source
L. Tierney, A Note on Metropolis–Hastings Kernels for General State Spaces, Ann. Appl. Probab. 8(1) (1998) 1–9, DOI 10.1214/aoap/1027961031, p. 5, Theorem 4
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me