is_min_max_incomp_pair
def
A min-max incomparable pair (u, v) in a poset P consists of a minimal element u, a maximal element v, and u and v are incomparable.
Statement
def is_min_max_incomp_pair {P : Type*} [PartialOrder P] (u v : P) : Prop
- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 1
- 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 elements u, v : P, is_min_max_incomp_pair u v is the proposition that:
1. u is a minimal element of P (IsMin u, i.e., for all b : P, b ≤ u → u ≤ b),
2. v is a maximal element of P (IsMax v, i.e., for all b : P, v ≤ b → b ≤ v),
3. u is not less than or equal to v (¬ u ≤ v), and
4. v is not less than or equal to u (¬ v ≤ u).
(In other words, u is minimal, v is maximal, and u and v are incomparable.)
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 pair (u, v) is a min-max incomparable pair if u is minimal, v is maximal, and u and v are incomparable. -/ def is_min_max_incomp_pair {P : Type*} [PartialOrder P] (u v : P) : Prop := IsMin u ∧ IsMax v ∧ ¬ u ≤ v ∧ ¬ v ≤ u