Zero-freeness for restricted Potts sums with segment-valued edge weights
ProvedZeroFreeRRG.Hardcore.potts_weighted_segment_nonzeroLet , , and let a finite graph have maximum degree at most . Fix any subset of vertices and prescribe their colors. Suppose all symmetric edge interaction entries lie on the complex segment joining to , where . The restricted weighted Potts partition sum is nonzero. This stronger induction target implies the Potts assertion of Lemma 5.7.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsWeighted open MeasureTheory Set ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_weighted_segment_nonzero (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:ℝ))
(W : Sym2 V → Fin q → Fin q → ℂ) (hW : ∀ e i j, W e i j = W e j i)
(hseg : ∀ e ∈ G.edgeFinset, ∀ i j, ∃ t : ℝ, t ∈ Icc 0 1 ∧ W e i j = 1+(t:ℂ)*(β-1))
(S : Finset V) (τ : V → Fin q) : pottsWeightedPartial q G W hW S τ ≠ 0 := 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.