Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coloring Bethe convexity and strict conditions from degree slack

Proved
ZeroFreeRRG.Hardcore.lemma_4_27

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

Fix integers d,q≥3d,q\ge3d,q≥3 and consider the proper qqq-coloring model. If some real r>dr>dr>d satisfies Br,0(ν)≤0\mathcal B_{r,0}(\nu)\le0Br,0​(ν)≤0 for every admissible cavity law ν\nuν, then the strict variational Condition 1 and strict Kesten–Stigum Condition 2 hold at degree ddd.

Moreover, nonpositivity for every admissible law is preserved as the interpolated degree decreases through nonnegative values. For each nonconstant admissible cavity law ν\nuν, the function s↦Bs,0(ν)s\mapsto\mathcal B_{s,0}(\nu)s↦Bs,0​(ν) is convex on [0,∞)[0,\infty)[0,∞), with

B0,0(ν)=0,B1,0(ν)<0.\mathcal B_{0,0}(\nu)=0,\qquad \mathcal B_{1,0}(\nu)<0.B0,0​(ν)=0,B1,0​(ν)<0.

This connects the coloring threshold's real-degree slack to the hypotheses of the paper's zero-freeness theorem.

Preamble
import Definitions.Def_ZeroFreeRRG_Hardcore_BetheFunctional
open scoped Classical
Formal statement
namespace ZeroFreeRRG.Hardcore

/-- Lemma 4.27: real-degree slack yields strict coloring conditions, and degree convexity. -/
theorem lemma_4_27 (d q : ℕ) (hd : 3 ≤ d) (hq : 3 ≤ q) :
    ((∃ r : ℝ, (d : ℝ) < r ∧
      ∀ ν ∈ cavityLaws (.potts q) 0, betheR (.potts q) 0 r ν ≤ 0) →
      Condition1 (.potts q) d 0 ∧ Condition2 (.potts q) d 0) ∧
    (∀ r s : ℝ, 0 ≤ s → s ≤ r →
      (∀ ν ∈ cavityLaws (.potts q) 0, betheR (.potts q) 0 r ν ≤ 0) →
      ∀ ν ∈ cavityLaws (.potts q) 0, betheR (.potts q) 0 s ν ≤ 0) ∧
    (∀ ν ∈ cavityLaws (.potts q) 0, ν ≠ diracPi (.potts q) 0 →
      ConvexOn ℝ (Set.Ici 0) (fun s => betheR (.potts q) 0 s ν) ∧
      betheR (.potts q) 0 0 ν = 0 ∧ betheR (.potts q) 0 1 ν < 0) := by sorry
end ZeroFreeRRG.Hardcore
Source
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, Lemma 4.27, printed pp. 34–35.

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