AFTD Auto-Formalizing Theoretical Domains

poset_comparable_count

def

The number of points of P comparable with x (the 'degree' of x: for a height-one poset without isolated points this is the degree of x in the associated bipartite graph whose edges are the comparable pairs).

Statement

noncomputable def poset_comparable_count (P : Type*) [PartialOrder P] (x : P) : Nat
Source
step towards poset_height_one_reconstructible_of_no_isolated
Verified
24 Oct 2026
Axioms
none listed

Lean source view module on GitHub

/-- The number of points comparable with a given point (its 'degree'). -/
noncomputable def poset_comparable_count (P : Type*) [PartialOrder P] (x : P) : Nat := Nat.card {y : P // y < x ∨ x < y}
See it in the graphDiscuss this resultChallenge it