Proof of Theorem A.1, p. 746 — ℰ(|f|, |f|) ≤ ℰ(f, f)
ProvedLogSobolevMC.TwoPoint.dirichlet_abs_ledirichlet-formmarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Markov kernel on a finite set with invariant probability , and its Dirichlet form. For every real function on ,
Since also , the infimum defining the log-Sobolev constant may be taken over nonnegative functions only; this is the first step of the proof of Theorem A.1.
Preamble
import Mathlib import Definitions.Def_mm_basic import Definitions.Def_mm_lower import Definitions.Def_LogSobolevMC_TwoPoint_Setting
Formal statement
namespace LogSobolevMC.TwoPoint
open MarkovMixing
/-- Proof of Theorem A.1, p. 746: `ℰ(|f|, |f|) ≤ ℰ(f, f)` for every real function `f`. -/
theorem dirichlet_abs_le {V : Type*} [Fintype V] [DecidableEq V]
(K : Matrix V V ℝ) (hK : IsStochastic K) (π : V → ℝ) (hπ : IsStationary K π)
(hπpos : ∀ x, 0 < π x) (f : V → ℝ) :
LogSobolevMC.ChiSquare.dirichlet K π (fun x => |f x|) (fun x => |f x|) ≤ LogSobolevMC.ChiSquare.dirichlet K π f f := by sorry
end LogSobolevMC.TwoPoint
Source
Diaconis and Saloff-Coste, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab. 6 (1996), p. 746, proof of Theorem A.1, first paragraph after (A.2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.