Heat-kernel spectral bound
ProvedMarkovMixing.heat_kernel_spectral_boundLet be an irreducible Markov chain on a finite state space with stationary distribution , reversible with respect to it (detailed balance: ). The heat kernel at real time is — the continuous-time chain driven by a rate-one Poisson clock. Among the eigenvalues of (real with for some nonzero ), is the largest eigenvalue different from , and is the spectral gap (Mission VII).
The theorem (Theorem 20.6 of Levin–Peres–Wilmer) asserts the pointwise estimate: for all states and all ,
In continuous time the convergence rate is governed by the spectral gap itself — not the absolute gap of the discrete theory: negative eigenvalues, which cause the discrete chain to oscillate, are killed by the Poisson smoothing, since 's eigenvalue becomes for the heat kernel. The prefactor comes from expanding the transition kernel in the -orthonormal eigenbasis of Mission VII's spectral representation. This estimate is the continuous-time engine behind the product-chain theorem of this mission.
import Definitions.Def_mm_continuous import Mathlib.Analysis.SpecialFunctions.Sqrt
namespace MarkovMixing
/-- **Theorem 20.6** (LPW): for a reversible irreducible chain with spectral
gap `γ`, the heat kernel satisfies
`|H_t(x,y) − π(y)| ≤ √(π(y)/π(x)) e^{-γt}`. -/
theorem heat_kernel_spectral_bound {V : Type*} [Fintype V] [DecidableEq V]
[Nonempty V] (P : Matrix V V ℝ) (hP : IsStochastic P)
(hirr : Irreducible P) (π : V → ℝ) (hπ : IsStationary P π)
(hrev : DetailedBalance P π) (x y : V) (t : ℝ) (ht : 0 ≤ t) :
|heatKernel P t x y - π y| ≤
Real.sqrt (π y / π x) * Real.exp (-(spectralGap P) * t) := by
sorry
end MarkovMixingRead-back
What the Lean code literally says, in plain math · claude-fable-5
Read-back: heat_kernel_spectral_bound
Let be a finite, nonempty type with decidable equality, and let be a real matrix that is stochastic (all entries ; each row sums, as a finite sum, to ) and irreducible (for all there is , possibly , with ). Let be stationary for ( pointwise, , as a row vector) and assume detailed balance: for all . Then for every pair of states and every real with , the theorem asserts the pointwise bound
where is the heat-kernel entry (a tsum over , taking the junk value if the family is not summable), and is the spectral gap defined as
i.e. one minus the real supremum of the set of real numbers that admit a nonzero real (right-)eigenvector of (eigenvectors of acting on column vectors; complex or defective spectrum is not seen by this definition). Junk-value behavior that the bound's meaning may depend on: the real supremum defining is when the eigenvalue set is empty (giving ); the quotient is real division, so if it takes the junk value and the right-hand side collapses to , making the claim at such an exact equality requirement ; and is the real square root, which returns on negative inputs (not relevant here since , but part of the function used). The bound is asserted entrywise for each separately, with the same exponential rate for all entries.
Confirmed by the mission captain (proposal self-audit).