Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.7 — max degree ≤ d: no hardcore zeros for |λ| < (d−1)^{d−1}/d^d, no Potts zeros for |β − 1| < 0.35/d

Proved
ZeroFreeRRG.Hardcore.lemma_5_7

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

hardcore-modelp2o-gran-per-chapterp2o-plan-paperp2o-v1partition-function-zerospotts-model

For every simple graph GGG of maximum degree at most ddd, the hardcore partition function ZG,fug(λ)Z_{G,\mathrm{fug}}(\lambda)ZG,fug​(λ) has no zero in

∣λ∣<(d−1)d−1dd|\lambda|<\frac{(d-1)^{d-1}}{d^d}∣λ∣<dd(d−1)d−1​

(Shearer's bound), and for every q≥2q\ge2q≥2 the Potts partition function ZG,q(β)Z_{G,q}(\beta)ZG,q​(β) has no zero in ∣β−1∣<0.35/d|\beta-1|<0.35/d∣β−1∣<0.35/d. It covers the independent-spin endpoints α=0\alpha=0α=0 and β=1\beta=1β=1 in Theorem 5.1.

Differences from the source:

  • reading: d (maximum degree) → 3 ≤ d; reason: §2.4 standing convention 'We use d ≥ 3 for an integer regular degree'; the lemma is applied with that d
  • encoding: every simple graph G of maximum degree at most d → every SimpleGraph on a finite type V : Type with degree v ≤ d for all v; reason: finite vertex sets; Type 0 suffices for graphs
Preamble
import Mathlib
import Definitions.Def_ZeroFreeRRG_Hardcore_Models

open scoped Classical
Formal statement
namespace ZeroFreeRRG.Hardcore

/-- **Lemma 5.7** (deterministic zero-freeness near trivial endpoints; p. 40). For every simple
graph `G` of maximum degree at most `d`, the hardcore partition function `Z_{G,fug}(λ)` has no zero
with `|λ| < (d − 1)^{d−1}/d^d`, and for every `q ≥ 2` the Potts partition function `Z_{G,q}(β)` has
no zero with `|β − 1| < 0.35/d`. -/
theorem lemma_5_7 (d : ℕ) (hd : 3 ≤ d) :
    (∀ (V : Type) [Fintype V] (G : SimpleGraph V), (∀ v, G.degree v ≤ d) →
      ∀ lam : ℂ, ‖lam‖ < ((d : ℝ) - 1) ^ (d - 1) / (d : ℝ) ^ d → hardcoreZfug G lam ≠ 0) ∧
    (∀ q : ℕ, 2 ≤ q → ∀ (V : Type) [Fintype V] (G : SimpleGraph V), (∀ v, G.degree v ≤ d) →
      ∀ β : ℂ, ‖β - 1‖ < 0.35 / (d : ℝ) → pottsZ q G β ≠ 0) := by sorry

end ZeroFreeRRG.Hardcore
Source
Chen, Wang, Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, arXiv:2610.40510 (held version, sha256 f1cbb4d9…), p. 40, Lemma 5.7 (cited from [She85, SS05, BS17])
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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