Nonnegative and strictly positive hardcore log-product gap
ProvedZeroFreeRRG.Hardcore.hardcore_log_product_supermodular_gapFor nonnegative vectors on a finite set and , let with on and elsewhere. Then . It is strictly positive when , two coordinates increase strictly, and all other coordinates of are positive. This is the pointwise inequality used after the size-bias coupling in the hardcore comparison.
Preamble
import Mathlib open scoped BigOperators
Formal statement
namespace ZeroFreeRRG.Hardcore
theorem hardcore_log_product_supermodular_gap {ι : Type} [Fintype ι] [DecidableEq ι] (θ : ℝ) (hθ : 0 ≤ θ)
(x y : ι → ℝ) (hx : ∀ i, 0 ≤ x i) (hxy : ∀ i, x i ≤ y i) :
let g := fun S : Finset ι => Real.log (1+θ*∏ a, if a ∈ S then y a else x a)
g Finset.univ ≥ g ∅ + ∑ i, (g {i}-g ∅) ∧
(0 < θ → ∀ i j, i ≠ j → x i < y i → x j < y j →
(∀ a, a ≠ i → a ≠ j → 0 < x a) →
g Finset.univ > g ∅ + ∑ i, (g {i}-g ∅)) := by sorry
end ZeroFreeRRG.HardcoreSource
Chen, Wang, and Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1461.pdf, proof of Lemma 4.17, printed p. 30.