A reversible kernel is a self-adjoint contraction on
ProvedTierneyMH.Peskun.reversible_selfAdjoint_contractionLet be a probability measure on a measurable space and let be a Markov transition kernel on that is reversible with respect to , i.e. . Let and write and . Then represents a self-adjoint operator on with spectral radius at most one. Explicitly, for all :
- and , so maps into itself;
- ;
- .
These are the facts that allow the spectral theorem to be applied to in the proof of Theorem 4.
Formalization Note For a bounded self-adjoint operator the spectral radius equals the operator norm, so the norm bound (3) is the paper's "spectral radius bounded by one". Reversibility is Mathlib's Kernel.IsReversible, detailed balance on measurable rectangles, which implies invariance of . and are measurable representatives of their classes.
import Mathlib open MeasureTheory ProbabilityTheory
namespace TierneyMH.Peskun
/-- **Proof of Theorem 4** (Tierney 1998, p. 5): a reversible transition kernel `H` with
invariant distribution `π` represents a self-adjoint operator on
`L²₀(π) = {g ∈ L²(π) : ∫ g dπ = 0}` with spectral radius bounded by one.
Writing `(Hf)(x) = ∫ f(y) H(x, dy)`, for all `f, g ∈ L²₀(π)`:
1. `Hf ∈ L²(π)` and `∫ Hf dπ = 0` (so `H` maps `L²₀(π)` into itself);
2. `⟨Hf, g⟩ = ⟨f, Hg⟩` (self-adjointness);
3. `⟨Hf, Hf⟩ ≤ ⟨f, f⟩` (norm at most one).
For a self-adjoint bounded operator the spectral radius equals the operator norm, so (3) is
the paper's spectral-radius bound. Reversibility is `Kernel.IsReversible H π`, which is
detailed balance (2) on measurable rectangles and implies invariance. -/
theorem reversible_selfAdjoint_contraction {E : Type*} [MeasurableSpace E]
(π : Measure E) [IsProbabilityMeasure π]
(H : Kernel E E) [IsMarkovKernel H] (hH : Kernel.IsReversible H π)
(f g : E → ℝ) (hf_meas : Measurable f) (hf : MemLp f 2 π) (hf0 : ∫ x, f x ∂π = 0)
(hg_meas : Measurable g) (hg : MemLp g 2 π) (hg0 : ∫ x, g x ∂π = 0) :
MemLp (fun x => ∫ y, f y ∂(H x)) 2 π ∧
∫ x, (∫ y, f y ∂(H x)) ∂π = 0 ∧
∫ x, (∫ y, f y ∂(H x)) * g x ∂π = ∫ x, f x * (∫ y, g y ∂(H x)) ∂π ∧
∫ x, (∫ y, f y ∂(H x)) ^ 2 ∂π ≤ ∫ x, f x ^ 2 ∂π := by sorry
end TierneyMH.Peskun
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.