Fixed-color weighted Potts recursion
ProvedZeroFreeRRG.Hardcore.potts_weighted_vertex_recursionA weighted Potts sum with one additional unassigned vertex is the sum over all possible colors assigned to that vertex.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsWeighted import Definitions.Def_ZeroFreeRRG_Hardcore_PottsPartial set_option autoImplicit false open ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_weighted_vertex_recursion {V : Type} [Fintype V] (q : ℕ) (G : SimpleGraph V)
(W : Sym2 V → Fin q → Fin q → ℂ) (hW : ∀ e i j, W e i j = W e j i) (S : Finset V) (τ : V → Fin q) (v : V) (hv : v ∉ S) :
pottsWeightedPartial q G W hW S τ = ∑ c : Fin q, pottsWeightedPartial q G W hW (insert v S) (Function.update τ v c) := by sorrySource
Auxiliary step 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.