Theorem A.1, pp. 742–743 — the chain K(x, y) = π(y) has α = (1 − 2π_*)/log(1/π_* − 1)
ProvedLogSobolevMC.TwoPoint.theorem_A_1Let be a probability measure on a finite set with for every , and set . Consider the Markov chain , which has invariant measure . If , its log-Sobolev constant is
In particular, for the uniform measure on a set with points,
This is the exact log-Sobolev constant of the simplest nontrivial chain, the one that forgets its state in one step. Since its spectral gap is , it shows that can be of smaller order than (by a factor ) and gives the comparison bound of Corollary A.4 for every finite chain.
Formalization Note The page assumes only that is positive. The hypothesis (and in the uniform case) is added and disclosed: always holds when , and at (the uniform measure on two points) the printed formula is , which Lean would evaluate to , while the true value is (Theorem A.2 at ); on a one-point set and the formula is meaningless. The infimum (A.2) is Lean's sInf of the set of ratios.
import Mathlib import Definitions.Def_mm_basic import Definitions.Def_mm_lower import Definitions.Def_LogSobolevMC_TwoPoint_Setting
namespace LogSobolevMC.TwoPoint
open MarkovMixing
/-- Theorem A.1 (pp. 742–743): for a positive probability `π` on a finite set with
`π_* = min π < 1/2`, the chain `K(x, y) = π(y)` has invariant measure `π` and log-Sobolev constant
`(1 − 2π_*)/log(1/π_* − 1)`; in particular, for the uniform `π ≡ 1/|𝒳|` with `|𝒳| ≥ 3`,
`α = (1 − 2/|𝒳|)/log(|𝒳| − 1)`. -/
theorem theorem_A_1 {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
(π : V → ℝ) (hπ : IsDist π) (hπpos : ∀ x, 0 < π x) (hhalf : piMin π < 1 / 2) :
IsStationary (indepChain π) π ∧
LogSobolevMC.ChiSquare.logSobolev (indepChain π) π = (1 - 2 * piMin π) / Real.log (1 / piMin π - 1) ∧
(3 ≤ Fintype.card V →
LogSobolevMC.ChiSquare.logSobolev (indepChain (uniformDist V)) (uniformDist V) =
(1 - 2 / (Fintype.card V : ℝ)) / Real.log ((Fintype.card V : ℝ) - 1)) := by sorry
end LogSobolevMC.TwoPoint
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.