One phase step for the Potts zero-free induction
ProvedZeroFreeRRG.Hardcore.potts_local_phase_stepLet a finite graph have maximum degree at most , with colors and . If uniform nonvanishing and phase coherence hold for every strictly larger fixed vertex set, then phase coherence holds at the given fixed set. The predicates range over all symmetric interaction matrices whose entries lie on the segment from to .
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsInduction open ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_local_phase_step (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)
(hbig : ∀ T : Finset V, S ⊂ T → pottsNonzeroAt q G β T ∧ pottsCoherentAt q G β T) :
pottsCoherentAt q G β S := by sorrySource
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.