A safe-spin update preserves a supported multigraph configuration
ProvedZeroFreeRRG.Hardcore.safe_spin_preserves_supportIf all vertex weights are nonzero and a spin interacts nontrivially in both orientations with every spin, replacing a single vertex by that spin preserves nonzero configuration weight. The proof counts every matched edge occurrence, including loops and parallel edges.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_ConfigModel import Definitions.Def_ZeroFreeRRG_Hardcore_BetheFunctional set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false open Set Filter MeasureTheory AFIsingKS ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.safe_spin_preserves_support (m : Model) (t : ℝ) (d n : ℕ) (M : Matching n d)
(σ : Fin n → m.Spin) (v : Fin n) (a₀ : m.Spin)
(hπ : ∀ a, m.pi t a ≠ 0)
(hsafeL : ∀ a, m.M t a₀ a ≠ 0) (hsafeR : ∀ a, m.M t a a₀ ≠ 0)
(hw : weight m t M σ ≠ 0) :
weight m t M (Function.update σ v a₀) ≠ 0 := by sorrySource
Auxiliary support fact 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, Appendix E.3, Step 1, p. 77.