Strict increase of the hardcore vertex entropy contribution
ProvedZeroFreeRRG.Hardcore.hardcore_vertex_entropy_strict_derivativeLet , and let be a mean-zero probability law supported on that is not concentrated at zero. For independent messages and , set
Then . This is the strict vertex-entropy monotonicity step in the hardcore parameter comparison.
Preamble
import Mathlib set_option autoImplicit false open MeasureTheory Set open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.hardcore_vertex_entropy_strict_derivative (d : ℕ) (hd : 2 ≤ d) (η : Measure ℝ) [IsProbabilityMeasure η]
(θ : ℝ) (hθ : 0 < θ) (hθ1 : θ < 1)
(hb : ∀ᵐ h ∂η, -1 ≤ h ∧ h ≤ 1)
(hint : Integrable (fun h : ℝ => h) η)
(hmean : (∫ h : ℝ, h ∂η) = 0) (hn : ¬(∀ᵐ h ∂η, h=0)) :
0 < deriv (fun t : ℝ => ∫ hs : Fin d → ℝ,
let V := ((∏ i, (1+t*hs i)) + t*(∏ i, (1-hs i)))/(1+t)
V * Real.log V ∂(Measure.pi fun _ : Fin d => η)) θ := by sorrySource
Chen–Wang–Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/1461.pdf, proof of Lemma 4.17, equation (25), pp. 29–31.