poset_height_two
def
A poset has height two when it contains no chain of three elements.
Statement
def poset_height_two (P : Type*) [PartialOrder P] : Prop
- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 3
- 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…
- 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 with a partial order, for all elements a, b, c in P, it is not the case that both a < b and b < c (that is, P contains no three elements forming a strictly increasing chain a < b < c).
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
/-- A poset has height two if it contains no chain of three elements. -/ def poset_height_two (P : Type*) [PartialOrder P] : Prop := ∀ a b c : P, ¬ (a < b ∧ b < c)