simple_graph_face_sum
def
Given 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 : G.Dart, simple_graph_face_sum G σ c d is the sum of c v over all vertices v in simple_graph_face_verts G σ d.
Statement
def simple_graph_face_sum {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
(σ : Equiv.Perm G.Dart) (c : Fin n → ℕ) (d : G.Dart) : ℕ- Defined in
- arXiv:2611.18384 Sec. 2.1, Eq. (1.1)
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 1
- simple_graph_face_vertsGiven 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…
- Used by 2
- simple_graph_has_facial_distinguishing_labelingA simple graph G on Fin n with decidable adjacency and dart permutation σ admits an adjacent-facial-sum-distinguishing proper vertex…
- facial_distinguishing_labeling_monotoneFor any simple graph G on Fin n with decidable adjacency, dart permutation σ, and natural numbers k ≤ k', if G admits an…
Read back from the Lean
For a natural number n, a simple graph G on Fin n with decidable adjacency, a permutation σ of the darts of G, a vertex-weight function c : Fin n → ℕ, and a dart d of G, simple_graph_face_sum G σ c d is the natural number defined as the sum of c v over all vertices v in simple_graph_face_verts G σ d.
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 facial sum of the face containing dart d under vertex weighting c. -/ def simple_graph_face_sum {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj] (σ : Equiv.Perm G.Dart) (c : Fin n → ℕ) (d : G.Dart) : ℕ := ∑ v ∈ simple_graph_face_verts G σ d, c v