simple_graph_face_verts
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_verts G σ d is the Finset of vertices in Fin n defined as the image under (fun d' => d'.fst) of the Finset of darts in the same cycle as d under simple_graph_rotation_face_perm G σ.
Statement
def simple_graph_face_verts {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
(σ : Equiv.Perm G.Dart) (d : G.Dart) : Finset (Fin n)- Defined in
- arXiv:2611.18384 Sec. 2.1
- 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_face_sumGiven a simple graph G on Fin n with decidable adjacency, a permutation σ of G.Dart, a vertex weighting c : Fin n → ℕ, and a dart d :…
Read back from the Lean
Given a natural number $n$, a simple graph $G$ on vertex set Fin n with decidable adjacency, a permutation $\sigma$ of the darts of $G$, and a dart $d$ of $G$, simple_graph_face_verts G σ d is the finite set of vertices (Finset (Fin n)) obtained by taking the first endpoint (fst) of every dart $d'$ of $G$ that belongs to 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 set of vertices incident to the face containing dart d in rotation system σ. -/ def simple_graph_face_verts {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj] (σ : Equiv.Perm G.Dart) (d : G.Dart) : Finset (Fin n) := (Finset.univ.filter (fun d' => (simple_graph_rotation_face_perm G σ).SameCycle d d')).image (fun d' => d'.fst)