Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict monotonicity of hardcore vertex entropy

Proved
ZeroFreeRRG.Hardcore.hardcore_vertex_entropy_strict_mono

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

For d≥2d\ge2d≥2 and a nontrivial mean-zero cavity law supported on [−1,1][-1,1][−1,1], the expected hardcore vertex entropy E[Vθlog⁡Vθ]\mathbb E[V_\theta\log V_\theta]E[Vθ​logVθ​] is strictly increasing on 0<θ<10<\theta<10<θ<1, with VθV_\thetaVθ​ as displayed in the formal statement.

Preamble
import Mathlib
set_option autoImplicit false
open MeasureTheory Set
open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.hardcore_vertex_entropy_strict_mono (d : ℕ) (hd : 2 ≤ d) (η : Measure ℝ) [IsProbabilityMeasure η]
    (hb : ∀ᵐ h ∂η, -1 ≤ h ∧ h ≤ 1)
    (hint : Integrable (fun h : ℝ => h) η)
    (hmean : (∫ h : ℝ, h ∂η) = 0) (hn : ¬(∀ᵐ h ∂η, h=0)) :
    StrictMonoOn (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 => η)) (Ioo 0 1) := by sorry
Source
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, pp. 29–31.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me