AFTD Auto-Formalizing Theoretical Domains

simple_graph_V3

def

For a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_V3 G is the finset of all vertices v in V whose degree in G is equal to 3.

Statement

def simple_graph_V3 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Finset V
Defined in
arXiv:2610.21868 Sec. 1
Verified
24 Oct 2026
Axioms
none listed
Used by 9

Read back from the Lean

Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_V3 G is defined as the Finset V of all vertices v : V whose degree in G is equal to 3 (that is, Finset.filter (fun v => G.degree v = 3) Finset.univ).

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

/-- The finset of vertices of degree 3 in a finite simple graph. -/
def simple_graph_V3 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Finset V :=
  Finset.univ.filter (fun v => G.degree v = 3)
See it in the graphDiscuss this resultChallenge it