AFTD Auto-Formalizing Theoretical Domains

palette_degree

def

Given a finite type V, a simple graph G on V, a natural number k, a palette system P : V → Finset (Fin k), a vertex v : V, and a color i : Fin k, palette_degree G P v i is the cardinality of the Finset of neighbors u in G.neighborFinset v such that i ∈ P u.

Statement

noncomputable def palette_degree {V : Type*} [Fintype V] (G : SimpleGraph V) {k : ℕ} (P : V → Finset (Fin k)) (v : V) (i : Fin k) : ℕ
Defined in
arXiv:2610.31489, Section 2
Verified
23 Oct 2026
Axioms
none listed
Used by 1
  • palette_degree_le_card_univFor a finite type V, a simple graph G on V, a natural number k, a palette system P : V → Finset (Fin k), a vertex v : V, and a color i :…

Read back from the Lean

Given a finite type $V$, a simple graph $G$ on $V$, a natural number $k$, a palette function $P : V \to \mathrm{Finset}(\mathrm{Fin}\ k)$, a vertex $v : V$, and a color $i : \mathrm{Fin}\ k$, palette_degree G P v i is defined as the number (cardinality) of neighbors $u$ of $v$ in $G$ such that $i \in P(u)$.

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 palette degree of a vertex for a given color in a palette system. -/
noncomputable def palette_degree {V : Type*} [Fintype V] (G : SimpleGraph V) {k : ℕ} (P : V → Finset (Fin k)) (v : V) (i : Fin k) : ℕ := by classical exact ((G.neighborFinset v).filter (fun u => i ∈ P u)).card
See it in the graphDiscuss this resultChallenge it