Properties of simultaneous symmetric row replacements
ProvedZeroFreeRRG.Hardcore.potts_row_set_propertiesFor symmetric Potts interactions whose edge coefficients lie on a common segment, replacing row a by row b on any finite edge set, together with its matching column, preserves symmetry and the common segment, leaves all other edges unchanged, and makes row a equal to the former row b on each selected edge.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsRowChain set_option autoImplicit false open MeasureTheory Set ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_row_set_properties {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)
(hseg : pottsSegmentWeights q G β W) (F : Finset (Sym2 V)) (a b : Fin q) :
let W' := pottsReplaceRows W F a b
(∀ e i j, W' e i j = W' e j i) ∧ pottsSegmentWeights q G β W' ∧
(∀ e ∉ F, ∀ i j, W' e i j = W e i j) ∧
(∀ e ∈ F, ∀ j, W' e a j = W e b j) := 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.