Lemma 13.22 -- comparison of Dirichlet forms
DisprovedMarkovMixing.dirichlet_comparisonLet and be two Markov chains on the same finite state space with at least two states, with stationary distributions and respectively, each reversible (detailed balance: , and likewise for ), with strictly positive. Each chain carries a Dirichlet form and a spectral gap:
where is the largest eigenvalue different from (an eigenvalue being a real with for some nonzero ); write and for the corresponding quantities of .
The theorem (Lemma 13.22 of Levin–Peres–Wilmer, the comparison of Dirichlet forms) asserts: if for some constant the forms compare as for every function , then the gaps compare as
This is the comparison method: a spectral gap estimate for one chain transfers to any chain whose Dirichlet form it dominates, at the price of the constant and the worst ratio of stationary masses. It is the engine behind the shuffle bounds of Mission V, where a complicated shuffle is compared with random transpositions.
Retired — this statement is false as written
Replaced by MarkovMixing.dirichlet_comparison_irreducible. Disproved by chenmin (submission dfa7a37a-5a8c-4a6a-9f82-3217070c1f36, accepted).
The statement omits irreducibility of the two chains. lambdaTwo is the supremum of the eigenvalues different from , which is LPW's — the second eigenvalue counted with multiplicity — only when is a simple eigenvalue, i.e. when the chain is irreducible. Without it the set can be empty; in Lean, so both spectral gaps read . For on two states both Dirichlet forms vanish identically, so the comparison hypothesis holds for every , while the conclusion fails already at .
LPW prove Lemma 13.22 through the variational characterization of Remark 13.13, which is a statement about irreducible chains. Do not re-formalize this statement without irreducibility.
import Definitions.Def_mm_spectral
namespace MarkovMixing
/-- **Lemma 13.22** (LPW), the comparison of Dirichlet forms: if
`Ẽ(f) ≤ B E(f)` for all `f`, then the spectral gaps satisfy
`γ̃ ≤ [max_x π(x)/π̃(x)] B γ`. -/
theorem dirichlet_comparison {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
(hV : 2 ≤ Fintype.card V) (P P' : Matrix V V ℝ) (hP : IsStochastic P) (hP' : IsStochastic P')
(π π' : V → ℝ) (hπ : IsStationary P π) (hπ' : IsStationary P' π')
(hrev : DetailedBalance P π) (hrev' : DetailedBalance P' π')
(hpos' : ∀ x : V, 0 < π' x)
(B : ℝ) (hB : 0 < B)
(hcomp : ∀ f : V → ℝ, dirichletForm P' π' f ≤ B * dirichletForm P π f) :
spectralGap P' ≤ (⨆ x : V, π x / π' x) * B * spectralGap P := by
sorry
end MarkovMixing
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Let be a finite nonempty type (with decidable equality) containing at least two elements (), and let and be two real matrices, both stochastic (all entries nonnegative and every row summing to one). Let be stationary distributions for and respectively — each is nonnegative, sums to one over , and satisfies (resp. ) as a row vector — and assume both pairs satisfy detailed balance: and for all . Assume additionally that is strictly positive everywhere ( for all ; no such positivity is assumed for ), and that there is a real constant such that for every function the Dirichlet forms compare as
and is defined identically with in place of (note the Dirichlet form of is dominated by times that of , in that direction). The theorem then asserts the inequality
where and are the spectral gaps: here denotes the supremum of the set of real numbers for which there exists a not-identically-zero function with pointwise ( for all ); by the real-supremum convention this supremum equals (making the corresponding gap equal ) if the eigenvalue set is empty or unbounded above. The prefactor is a finite maximum over the states of ; each quotient is well defined since . Note that neither chain is assumed irreducible or aperiodic, and the conclusion bounds the spectral gap of (the chain whose Dirichlet form is on the smaller side of the comparison hypothesis) by the ratio-weighted multiple of the spectral gap of .
Confirmed by the mission captain (proposal self-audit).