poset_lt_pair_count
def
The number of comparable pairs (ordered pairs a < b) of an ordered set, as a natural number.
Statement
noncomputable def poset_lt_pair_count (P : Type*) [PartialOrder P] : Nat
- Source
- step towards poset_height_one_reconstructible
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 3
- poset_lt_pair_count_eq_of_order_isoOrder-isomorphic ordered sets have the same number of comparable pairs.
- poset_hypomorphic_isolated_iffLet finite ordered sets P, Q have |P| ≥ 3 and the same deck, witnessed by the bijection σ with P − x ≅ Q − σ(x) for all x. Then for every…
- poset_delete_isolated_lt_pair_count_iffIn a finite ordered set, the one-element deletion P − x has the same number of comparable pairs as P if and only if x is incomparable with…
Lean source view module on GitHub
/-- The number of strict-comparable ordered pairs of an ordered set. -/ noncomputable def poset_lt_pair_count (P : Type*) [PartialOrder P] : Nat := Nat.card {p : P × P // p.1 < p.2}