poset_minimals
def
Given a partial order P on a type α and a finite subset S of α, poset_minimals P S is the subset of elements x in S such that no element y in S is strictly smaller than x under P.
Statement
noncomputable def poset_minimals {α : Type*} (P : PartialOrder α) (S : Finset α) : Finset α
- Defined in
- arXiv:2610.18740 Section 5
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 1
- crucial_weightGiven a partial order P on Fin n and a solution with lower set L and selected element e, the crucial comparisons weight is a_s + b_s,…
Read back from the Lean
Given a type α, a partial order P on α, and a finite set S : Finset α, poset_minimals P S is defined to be the sub-finset of S consisting of all elements x ∈ S such that for every y ∈ S, if y ≤ x (with respect to the partial order P), then y = x (i.e., the minimal elements of S with respect to 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 minimal elements of a finite subset under a partial order. -/ noncomputable def poset_minimals {α : Type*} (P : PartialOrder α) (S : Finset α) : Finset α := open scoped Classical in S.filter (fun x => ∀ y ∈ S, @LE.le α P.toLE y x → y = x)