Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

vλ(f,P1)≤vλ(f,P2)v_\lambda(f,P_1) \le v_\lambda(f,P_2)vλ​(f,P1​)≤vλ​(f,P2​) for 0≤λ<10 \le \lambda < 10≤λ<1 when P1⪰P2P_1 \succeq P_2P1​⪰P2​

Proved
TierneyMH.Peskun.vLam_monotone

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, let π\piπ be a probability measure on EEE, let P1,P2P_1, P_2P1​,P2​ be Markov kernels on EEE that are both reversible with respect to π\piπ, suppose P1⪰P2P_1 \succeq P_2P1​⪰P2​ (off-diagonal domination), and let f∈L02(π)f \in L^2_0(\pi)f∈L02​(π). Then for every 0≤λ<10 \le \lambda < 10≤λ<1,

vλ(f,P1)  ≤  vλ(f,P2),v_\lambda(f, P_1) \;\le\; v_\lambda(f, P_2),vλ​(f,P1​)≤vλ​(f,P2​),

where vλ(f,H)=⟨f,f⟩+2∑k≥1λk⟨f,Hkf⟩v_\lambda(f,H) = \langle f, f\rangle + 2\sum_{k\ge1}\lambda^k\langle f, H^k f\ranglevλ​(f,H)=⟨f,f⟩+2∑k≥1​λk⟨f,Hkf⟩ is the regularized asymptotic variance.

Letting λ↑1\lambda \uparrow 1λ↑1 turns this inequality into Theorem 4.

Formalization Note The series form of vλv_\lambdavλ​ replaces the paper's operator form ⟨f,(I−λH)−1(I+λH)f⟩\langle f,(I-\lambda H)^{-1}(I+\lambda H)f\rangle⟨f,(I−λH)−1(I+λH)f⟩ (see the definition of vλv_\lambdavλ​). Measurability of singletons is the paper's implicit assumption that A∖{x}A\setminus\{x\}A∖{x} is an event.

Preamble
import Mathlib
import Definitions.Def_TierneyMH_Shared_OffDiagDominates
import Definitions.Def_TierneyMH_Peskun_vLam

open TierneyMH.Shared

open MeasureTheory ProbabilityTheory
Formal statement
namespace TierneyMH.Peskun

/-- **Proof of Theorem 4** (Tierney 1998, p. 6), stated through the Neumann series of `vLam`.
Let `P₁ P₂` be reversible Markov kernels with invariant distribution `π`, `P₁ ⪰ P₂`, and
`f ∈ L²₀(π)`. Then for every `0 ≤ λ < 1`, `v_λ(f, P₂) ≥ v_λ(f, P₁)`. -/
theorem vLam_monotone {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₂ π)
    (hdom : OffDiagDominates π P₁ P₂)
    (f : E → ℝ) (hf_meas : Measurable f) (hf : MemLp f 2 π) (hf0 : ∫ x, f x ∂π = 0)
    (lam : ℝ) (hlam0 : 0 ≤ lam) (hlam1 : lam < 1) :
    vLam π P₁ f lam ≤ vLam π P₂ f lam := 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. 6, proof of Theorem 4 (v_λ(f, P_2) = h_λ(1) ≥ h_λ(0) = v_λ(f, P_1))
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