AFTD Auto-Formalizing Theoretical Domains

SignedGraph.IsSwitchPartner

def

A vertex w distinct from v is a switch partner of v in G if switching G at v and then at w is not isomorphic to G but has the same switching deck as G.

Statement

def SignedGraph.IsSwitchPartner {V : Type*} [DecidableEq V] [Fintype V] (G : SignedGraph V) (v w : V) : Prop
Source
step towards signed_graph_reconstructible_of_all_nonneg_net_degrees
Verified
11 Nov 2026
Axioms
none listed
Built on 4
  • SignedGraph.switchThe switching of a signed graph G at a vertex v is the signed graph with the same underlying graph where the sign of every edge incident…
  • SignedGraph.IsIsomorphicTwo signed graphs G1 and G2 are isomorphic if there is an isomorphism f between their underlying simple graphs that preserves the signs of…
  • SignedGraphA signed graph on vertex type V consists of an underlying simple graph and a signature assigning to each edge a value in {1, -1}.
  • SignedGraph.SameDeckTwo signed graphs G1 and G2 on finite types V1 and V2 with decidable equality have the same switching deck if there exists an equivalence…

Lean source view module on GitHub

/-- Switch partner of a vertex: the double switch at v and w is a non-isomorphic deck-mate. -/
def SignedGraph.IsSwitchPartner {V : Type*} [DecidableEq V] [Fintype V] (G : SignedGraph V) (v w : V) : Prop := v ≠ w ∧ ¬ SignedGraph.IsIsomorphic G ((G.switch v).switch w) ∧ G.SameDeck ((G.switch v).switch w)
See it in the graphDiscuss this resultChallenge it