AFTD Auto-Formalizing Theoretical Domains

simple_graph_face_length

def

Given a simple graph G on Fin n with decidable adjacency, a permutation σ of G.Dart, and a dart d : G.Dart, simple_graph_face_length G σ d is the cardinality (as a natural number) of the Finset of darts in G.Dart that belong to the same cycle as d under simple_graph_rotation_face_perm G σ.

Statement

def simple_graph_face_length {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (σ : Equiv.Perm G.Dart) (d : G.Dart) : ℕ
Defined in
arXiv:2611.18384 Sec. 1.2
Verified
16 Nov 2026
Axioms
none listed
Built on 1
  • simple_graph_rotation_face_permFor a simple graph G (explicit argument) and a rotation system given as a permutation σ : Equiv.Perm G.Dart of the darts of G, the face…
Used by 1
  • simple_graph_is_fullereneA simple graph G on Fin n with decidable adjacency and dart permutation σ is a fullerene if G is 3-vertex-connected, every vertex of G has…

Read back from the Lean

simple_graph_face_length defines a function that, given a natural number n (implicit), a simple graph G on the vertex set Fin n, a decidability instance for the adjacency relation of G, a permutation σ on the darts of G (Equiv.Perm G.Dart), and a dart d of G, computes a natural number: the cardinality of the finite set of all darts d' of G that are in the same cycle as d under the permutation simple_graph_rotation_face_perm G σ.

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 length of the face containing dart d in rotation system σ. -/
def simple_graph_face_length {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (σ : Equiv.Perm G.Dart) (d : G.Dart) : ℕ := (Finset.univ.filter (fun d' => (simple_graph_rotation_face_perm G σ).SameCycle d d')).card
See it in the graphDiscuss this resultChallenge it