AFTD Auto-Formalizing Theoretical Domains

SignedGraph.IsNetRegular

def

A signed graph G on a finite vertex set V is net-regular if there exists an integer d such that every vertex v of G has net-degree equal to d.

Statement

def SignedGraph.IsNetRegular {V : Type*} [Fintype V] (G : SignedGraph V) : Prop
Defined in
arXiv:2611.13901 Section 3.2
Verified
12 Nov 2026
Axioms
none listed
Built on 2
  • 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.netDegreeThe net-degree of a vertex v in a finite signed graph G is the sum over all vertices w of the extended edge sign between v and w.
Used by 1

Read back from the Lean

Given a finite type V and a signed graph G on V, SignedGraph.IsNetRegular G asserts that there exists an integer d : ℤ such that for every vertex v : V, G.netDegree v = d.

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 is net-regular if all vertices have the same net-degree. -/
def SignedGraph.IsNetRegular {V : Type*} [Fintype V] (G : SignedGraph V) : Prop := ∃ d : ℤ, ∀ v : V, G.netDegree v = d
See it in the graphDiscuss this resultChallenge it