AFTD Auto-Formalizing Theoretical Domains

SignedGraph.netDegree

def

The 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.

Statement

noncomputable def SignedGraph.netDegree {V : Type*} [Fintype V] (G : SignedGraph V) (v : V) : Int
Defined in
arXiv:2611.13901, Sec. 2.1
Verified
11 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.edgeSignThe extended edge sign between two vertices u and v in a signed graph G is the signature of the edge if u and v are adjacent, and 0…
Used by 2

Read back from the Lean

Given a type V with a Fintype V instance, a signed graph G : SignedGraph V, and a vertex v : V, SignedGraph.netDegree G v is defined as the integer given by the sum over all w : V of G.edgeSign v w.

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

/-- Net-degree of a vertex is the sum of edge signs incident to it. -/
noncomputable def SignedGraph.netDegree {V : Type*} [Fintype V] (G : SignedGraph V) (v : V) : Int :=
  open scoped BigOperators in open Classical in ∑ w : V, G.edgeSign v w
See it in the graphDiscuss this resultChallenge it