simple_graph_rotation_face_count
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
- 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…
- poset_nonempty_order_iso_of_card_order_hom_eq_of_connectedLet X and Y be finite posets (possibly empty). If for every finite nonempty connected poset Z the number of order-preserving maps Z → X…
- Used by 3
- complete_three_rotation_face_countEvery rotation system of the triangle K_3 has exactly 2 faces (inside and outside), so V - E + F = 3 - 3 + 2 = 2 (sanity check of…
- simple_graph_is_plane_rotation_systemFor a finite simple graph G and a permutation σ : Equiv.Perm G.Dart of its darts, σ is a plane embedding of G given combinatorially,…
- exists_plane_rotation_system_complete_fourK_4 has a plane rotation system: 4 vertices, 6 edges, 4 faces (sanity check of simple_graph_is_plane_rotation_system).
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 σ)))