signed_graph_isNetRegular_of_netDegree_eq
If every vertex v of a finite signed graph G has net-degree equal to a constant integer d, then G is net-regular.
Statement
theorem signed_graph_isNetRegular_of_netDegree_eq {V : Type*} [Fintype V] (G : SignedGraph V) (d : ℤ) (h : ∀ v : V, G.netDegree v = d) : G.IsNetRegular
- Source
- arXiv:2611.13901 Section 3.2
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- SignedGraph.IsNetRegularA 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…
- 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.
- 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}.
Read back from the Lean
For any finite type V, any signed graph G on V, and any integer d, if for every vertex v : V the net degree of v in G equals d (that is, ∀ v : V, G.netDegree v = d), then G is net-regular (G.IsNetRegular).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
By definition, a signed graph is net-regular if there exists an integer $d$ such that every vertex has net-degree $d$. The theorem follows immediately by taking the given constant $d$ and the hypothesis $h$ as the witness for this existential claim.
$G$ is net-regular ($G.\mathrm{IsNetRegular}$)
By definition, a signed graph $G$ is net-regular if there exists an integer $d'$ such that every vertex $v$ has net-degree equal to $d'$. Supplying $d$ and the hypothesis $h$ provides the existential witness directly.
theorem signed_graph_isNetRegular_of_netDegree_eq {V : Type*} [Fintype V] (G : SignedGraph V) (d : ℤ) (h : ∀ v : V, G.netDegree v = d) : G.IsNetRegular := ⟨d, h⟩
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- A signed graph is net-regular if all vertices have net-degree equal to d. -/theorem signed_graph_isNetRegular_of_netDegree_eq {V : Type*} [Fintype V] (G : SignedGraph V) (d : ℤ) (h : ∀ v : V, G.netDegree v = d) : G.IsNetRegular := ⟨d, h⟩