AFTD Auto-Formalizing Theoretical Domains

SignedGraph

structure

A signed graph on vertex type V consists of an underlying simple graph and a signature assigning to each edge a value in {1, -1}.

Statement

structure SignedGraph (V : Type*)
Defined in
arXiv:2611.13901, Sec. 2.1
Verified
11 Nov 2026
Axioms
none listed
Used by 15

Read back from the Lean

A SignedGraph on a type of vertices V consists of: 1. graph: a simple graph on vertex type V (SimpleGraph V), 2. sgn: an edge-labeling function assigning an integer (Int) to each edge e in the edge set of graph (graph.edgeSet), 3. sgn_mem: a condition requiring that for every edge e : graph.edgeSet, sgn e = 1 or sgn e = -1.

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

/-- A signed graph consists of a simple graph and an edge signature with values in {-1, 1}. -/
structure SignedGraph (V : Type*) where
  graph : SimpleGraph V
  sgn : graph.edgeSet → Int
  sgn_mem : ∀ e, sgn e = 1 ∨ sgn e = -1
See it in the graphDiscuss this resultChallenge it