Holley's inequality
ProvedFamousTheorems.holley_inequalityHolley's inequality. Let be a finite distributive lattice and let , with monotone. Suppose and
Then
In probabilistic terms, a measure dominating in this lattice sense stochastically dominates it on increasing events. The inequality generalises the FKG inequality and is a basic tool in statistical mechanics and percolation.
Formalization note. Mathlib's holley, specialised here to real-valued functions.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem holley_inequality {α : Type*} [DistribLattice α] [Fintype α] (f g μ : α → ℝ) (hμ₀ : 0 ≤ μ) (hf₀ : 0 ≤ f) (hg₀ : 0 ≤ g)
(hμ : Monotone μ) (hfg : ∑ a, f a = ∑ a, g a) (h : ∀ a b, f a * g b ≤ f (a ⊓ b) * g (a ⊔ b)) :
∑ a, μ a * f a ≤ ∑ a, μ a * g a := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `holley`. Proof here reduces to that Mathlib result.