poset_down_sets
def
Given a natural number n, a partial order P on Fin n, and a natural number k, the finite set (as a Finset of Finsets) of all down-sets of Fin n of cardinality k with respect to P.
Statement
noncomputable def poset_down_sets (n : ℕ) (P : PartialOrder (Fin n)) (k : ℕ) : Finset (Finset (Fin n))
- Defined in
- arXiv:2610.18740 Section 5
- Verified
- 21 Oct 2026
- Axioms
- none listed
Read back from the Lean
Given a natural number $n$, a partial order $P$ on $\mathrm{Fin}(n)$, and a natural number $k$, poset_down_sets n P k is defined as the finite set of all subsets $L \subseteq \mathrm{Fin}(n)$ (as Finset (Fin n)) such that $L$ has cardinality $k$ and $L$ is a lower set (down-set) with respect to the partial order $P$.
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 finite set of down-sets of cardinality k in a partial order on Fin n. -/ noncomputable def poset_down_sets (n : ℕ) (P : PartialOrder (Fin n)) (k : ℕ) : Finset (Finset (Fin n)) := open scoped Classical in letI := P Finset.filter (fun L => L.card = k ∧ IsLowerSet (L : Set (Fin n))) Finset.univ