Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetric Potts edge-row replacement

Definition
ZeroFreeRRG_Hardcore_PottsRowChain

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

On a finite set of edges, this operation symmetrically replaces row aaa of each interaction matrix by row bbb of its original matrix, leaving all other entries unchanged.

Definition code
import Definitions.Def_ZeroFreeRRG_Hardcore_PottsSegment
import Mathlib
open scoped Classical
namespace ZeroFreeRRG.Hardcore

open Classical in
/-- Replace row a by old row b symmetrically on a prescribed set of edges. -/
noncomputable def pottsReplaceRows {V : Type} {q : ℕ}
    (W : Sym2 V → Fin q → Fin q → ℂ) (F : Finset (Sym2 V)) (a b : Fin q)
    (e : Sym2 V) (i j : Fin q) : ℂ :=
  if e ∈ F then if i=a then W e b j else if j=a then W e b i else W e i j else W e i j

end ZeroFreeRRG.Hardcore
Source
Auxiliary construction 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me