tableau_entries
def
For an abstract finite type α : Type* with [Fintype α] and a filling M : α → ℕ assigning natural numbers to elements of α, tableau_entries M is the multiset of natural numbers obtained by mapping M over Finset.univ of α.
Statement
def tableau_entries {α : Type*} [Fintype α] (M : α → ℕ) : Multiset ℕ
- Defined in
- arXiv:2611.07715, Section 4
- Verified
- 06 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a type α with a finite type instance ([Fintype α]) and a function M : α → ℕ, tableau_entries M is defined as the multiset of natural numbers obtained by mapping M over the multiset underlying the universal finset of α (Finset.univ.val.map M), i.e., the multiset of values M x for all x : α.
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 multiset of entries in a finite tableau filling. -/ def tableau_entries {α : Type*} [Fintype α] (M : α → ℕ) : Multiset ℕ := Finset.univ.val.map M