SignedGraph.IsIsomorphic
def
Two signed graphs G1 and G2 are isomorphic if there is an isomorphism f between their underlying simple graphs that preserves the signs of all edges.
Statement
def SignedGraph.IsIsomorphic {V1 V2 : Type*} (G1 : SignedGraph V1) (G2 : SignedGraph V2) : Prop
- Defined in
- arXiv:2611.13901, Sec. 2.1
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- 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}.
- Used by 7
- signed_graph_reconstructible_balanced_mono_pair_fixedLet G be a connected balanced signed graph on at least seven vertices, with a specified balance partition. Suppose distinct vertices a and…
- 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…
- signed_graph_reconstructible_balanced_mono_invariantA connected balanced signed graph is reconstructible from its switching deck if its underlying graph has an automorphism-invariant vertex…
- signed_graph_reconstructible_balanced_three_fixedEvery connected balanced signed graph on at least seven vertices is reconstructible from its switching deck if its underlying graph has…
- SignedGraph.IsReconstructibleA signed graph G on a finite type V with decidable equality is reconstructible from its switching deck if every signed graph G' on a…
- signed_graph_reconstructible_balanced_mixed_twin_pairLet G be a connected balanced signed graph on at least five vertices, with a specified balance partition. Suppose distinct vertices a and…
- SignedGraph.IsSwitchPartnerA 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…
Read back from the Lean
Two signed graphs G1 (on vertex type V1) and G2 (on vertex type V2) are isomorphic if and only if there exists a simple graph isomorphism f : G1.graph ≃g G2.graph such that for every pair of vertices u, v : V1 and every adjacency proof h : G1.graph.Adj u v, the sign assigned by G2 to the edge {f(u), f(v)} equals the sign assigned by G1 to the edge {u, v}.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Isomorphism of signed graphs preserving edge signs. -/ def SignedGraph.IsIsomorphic {V1 V2 : Type*} (G1 : SignedGraph V1) (G2 : SignedGraph V2) : Prop := ∃ (f : G1.graph ≃g G2.graph), ∀ (u v : V1) (h : G1.graph.Adj u v), G2.sgn ⟨s(f u, f v), f.map_adj_iff.mpr h⟩ = G1.sgn ⟨s(u, v), h⟩