Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Phase coherence for restricted Potts sums

Open
ZeroFreeRRG.Hardcore.potts_phase_coherence

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

For d≥3d\ge3d≥3, q≥2q\ge2q≥2, and ∣β−1∣<0.35/d|\beta-1|<0.35/d∣β−1∣<0.35/d, suppose a graph has maximum degree at most ddd and every one-vertex extension of a partial coloring has nonzero weighted Potts sum uniformly over interactions on the segment from 111 to β\betaβ. Then, at any such interaction matrix, the normalized phases of these extension sums all lie within distance 1/21/21/2 of a common unit complex number. This is the remaining phase-coherence step for the Potts zero-free disk.

Preamble
import Mathlib
import Definitions.Def_ZeroFreeRRG_Hardcore_PottsSegment
open MeasureTheory Set ZeroFreeRRG.Hardcore
open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_phase_coherence (d q : ℕ) (hd : 3 ≤ d) (hq : 2 ≤ q)
    (V : Type) [Fintype V] (G : SimpleGraph V) (hG : ∀ v, G.degree v ≤ d)
    (β : ℂ) (hβ : ‖β-1‖ < 0.35/(d:ℝ))
    (S : Finset V) (τ : V → Fin q) (v : V) (hv : v ∉ S)
    (hchild : ∀ (W : Sym2 V → Fin q → Fin q → ℂ) (hW : ∀ e i j, W e i j = W e j i),
      pottsSegmentWeights q G β W → ∀ c : Fin q,
        pottsWeightedPartial q G W hW (insert v S) (Function.update τ v c) ≠ 0)
    (W : Sym2 V → Fin q → Fin q → ℂ) (hW : ∀ e i j, W e i j = W e j i)
    (hseg : pottsSegmentWeights q G β W) :
    ∃ u : ℂ, ‖u‖ = 1 ∧ ∀ c : Fin q,
      ‖u - pottsWeightedPartial q G W hW (insert v S) (Function.update τ v c) /
        (‖pottsWeightedPartial q G W hW (insert v S) (Function.update τ v c)‖ : ℂ)‖ ≤ 1/2 := by sorry
Source
Auxiliary induction target for 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, Lemma 5.7.

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