AFTD Auto-Formalizing Theoretical Domains

is_ranked_poset

def

A function rank : α → ℤ from a partially ordered type α to the integers ℤ is a ranked poset structure if it is monotone (for all a b : α, a ≤ b implies rank a ≤ rank b), increases by 2 along every cover relation (for all a b : α, a ⋖ b implies rank b = rank a + 2), and assigns integers of the same parity modulo 2 to all elements (for all a b : α, rank a ≡ rank b [ZMOD 2]).

Statement

def is_ranked_poset {α : Type*} [PartialOrder α] (rank : α → ℤ) : Prop
Defined in
arXiv:2610.24148, Section 2.3
Verified
21 Oct 2026
Axioms
none listed
Used by 2
  • young_lattice_rank_is_ranked_posetFor any m and n, the rank function young_lattice_rank makes L(m, n) into a ranked poset in the sense of is_ranked_poset.
  • weak_sl2_hall_conditionLet α be a finite partially ordered type with decidable equality and an integer rank function rank : α → ℤ. If rank makes α a ranked poset…

Read back from the Lean

Given a partially ordered type α and a function rank : α → ℤ, is_ranked_poset rank asserts that: 1. For all a, b : α, if a ≤ b, then rank a ≤ rank b; 2. For all a, b : α, if b covers a (a ⋖ b), then rank b = rank a + 2; and 3. For all a, b : α, rank a is congruent to rank b modulo 2 (i.e., all elements of α have ranks of the same parity).

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 ranked poset with integer rank stepping by 2 and uniform parity. -/
def is_ranked_poset {α : Type*} [PartialOrder α] (rank : α → ℤ) : Prop :=
  (∀ {a b : α}, a ≤ b → rank a ≤ rank b) ∧
  (∀ {a b : α}, a ⋖ b → rank b = rank a + 2) ∧
  (∀ a b : α, rank a ≡ rank b [ZMOD 2])
See it in the graphDiscuss this resultChallenge it