poset_downset
def
For a poset P and an element v in P, the strict downset D_P(v) is the set of all elements x in P strictly smaller than v.
Statement
def poset_downset {P : Type*} [PartialOrder P] (v : P) : Set P
- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 2
- poset_downset_subset_minIn a poset of height two, every element strictly below any element v is minimal.
- standard_example_reduction_min_max_subposetLet P be a finite poset of height 2 and let (u, v) be a min-max incomparable pair in P. If d ≥ 3 and P is S_d-free, then the subposet…
Read back from the Lean
For a partially ordered type P and an element v : P, poset_downset v is defined as the set of all elements x : P such that x < v (strictly less than 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 strict downset D_P(v) of an element v in a poset P. -/ def poset_downset {P : Type*} [PartialOrder P] (v : P) : Set P := {x | x < v}