poset_upset
def
For a poset P and an element u in P, the strict upset U_P(u) is the set of all elements y in P strictly greater than u.
Statement
def poset_upset {P : Type*} [PartialOrder P] (u : P) : Set P
- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 2
- 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…
- poset_upset_subset_maxIn a poset of height two, every element strictly above any element u is maximal.
Read back from the Lean
Given a type P equipped with a partial order and an element u : P, poset_upset u is defined as the set of elements y : P strictly greater than u (i.e., {y : P | u < y}).
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 upset U_P(u) of an element u in a poset P. -/ def poset_upset {P : Type*} [PartialOrder P] (u : P) : Set P := {y | u < y}