AFTD Auto-Formalizing Theoretical Domains

simple_graph_rotation_face_count

def

For a finite simple graph G (explicit argument) and a permutation σ : Equiv.Perm G.Dart of its darts, the number of faces of σ is the number of cycles of the face permutation simple_graph_rotation_face_perm G σ, counting fixed points as cycles: the cardinality of the quotient of G.Dart by the relation 'in the same cycle of the face permutation'.

Statement

open Classical in
noncomputable def simple_graph_rotation_face_count {V : Type*} [Fintype V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (σ : Equiv.Perm G.Dart) : ℕ
Defined in
Faces of a rotation system (Mohar-Thomassen, Graphs on Surfaces, Sec. 3.2); arXiv:2610.25886 (Extremal arborescences in graph orientations)
Verified
27 Oct 2026
Axioms
none listed
Built on 2
Used by 3

Read back from the Lean

Given a finite vertex type V, a simple graph G on V with decidable adjacency, and a permutation σ of the darts of G, simple_graph_rotation_face_count G σ defines the natural number equal to the number of cycles (orbits) of the dart permutation simple_graph_rotation_face_perm G σ on G.Dart.

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

open Classical in
/-- Number of faces of a rotation system: orbits of the face permutation. -/
noncomputable def simple_graph_rotation_face_count {V : Type*} [Fintype V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (σ : Equiv.Perm G.Dart) : ℕ :=
  Fintype.card (Quotient (Equiv.Perm.SameCycle.setoid (simple_graph_rotation_face_perm G σ)))
See it in the graphDiscuss this resultChallenge it