One-edge Potts replacement with a free neighbor
ProvedZeroFreeRRG.Hardcore.potts_edge_free_replacementFix the color of one endpoint of an edge , leaving unassigned. If two symmetric edge-interaction systems agree away from that edge and the old edge coefficients are nonzero, then the new restricted partition sum equals the sum, over colors of , of the old restricted sum with multiplied by the ratio of the new and old edge coefficients.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsWeighted set_option autoImplicit false open ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_edge_free_replacement {V : Type} [Fintype V] (q : ℕ) (G : SimpleGraph V)
(W W' : Sym2 V → Fin q → Fin q → ℂ)
(hW : ∀ e i j, W e i j = W e j i) (hW' : ∀ e i j, W' e i j = W' e j i)
(S : Finset V) (τ : V → Fin q) (v u : V) (hv : v ∈ S) (hu : u ∉ S)
(he : s(v,u) ∈ G.edgeFinset)
(hother : ∀ e ≠ s(v,u), ∀ i j, W' e i j = W e i j)
(hnz : ∀ c : Fin q, W s(v,u) (τ v) c ≠ 0) :
pottsWeightedPartial q G W' hW' S τ =
∑ c : Fin q, (W' s(v,u) (τ v) c / W s(v,u) (τ v) c) *
pottsWeightedPartial q G W hW (insert u S) (Function.update τ u c) := by sorrySource
Supporting identity 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.