AFTD Auto-Formalizing Theoretical Domains

palette_active_vertices

def

Given a finite type V, a natural number k, and a palette system P : V → Finset (Fin k), palette_active_vertices P is the Finset of all vertices v : V such that P v ≠ ∅.

Statement

noncomputable def palette_active_vertices {V : Type*} [Fintype V] {k : ℕ} (P : V → Finset (Fin k)) : Finset V
Defined in
arXiv:2610.31489, Section 2
Verified
23 Oct 2026
Axioms
none listed
Used by 1
  • mem_palette_active_verticesFor a finite type V, a natural number k, a palette system P : V → Finset (Fin k), and a vertex v : V, v is in palette_active_vertices P if…

Read back from the Lean

Given a finite type V, a natural number k, and a function P : V → Finset (Fin k), palette_active_vertices P is the finite set of all elements v : V such that P v ≠ ∅.

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 active vertices of a palette system, having nonempty palette. -/
noncomputable def palette_active_vertices {V : Type*} [Fintype V] {k : ℕ} (P : V → Finset (Fin k)) : Finset V := by classical exact Finset.univ.filter (fun v => P v ≠ ∅)
See it in the graphDiscuss this resultChallenge it