AFTD Auto-Formalizing Theoretical Domains

inst_partial_order_diamond_poset

instance

The partial order on DiamondPoset j where bot is less than or equal to every element, every element is less than or equal to top, and two middle elements mid a and mid b are comparable if and only if a = b.

Statement

instance inst_partial_order_diamond_poset (j : ℕ) : PartialOrder (DiamondPoset j)
Defined in
arXiv:2610.20545, The k-color poset Ramsey number of the diamond is 2k
Verified
18 Oct 2026
Axioms
none listed
Built on 1
  • DiamondPosetFor a natural number j, DiamondPoset j is the type consisting of a bottom element bot, a top element top, and j middle elements indexed by…
Used by 10

Read back from the Lean

For each natural number j, defines a PartialOrder instance on DiamondPoset j where: - bot ≤ y holds for all y : DiamondPoset j; - x ≤ top holds for all x : DiamondPoset j; - mid a ≤ mid b holds if and only if a = b (for a, b : Fin j); - all other relations (e.g. mid a ≤ bot, top ≤ mid b, top ≤ bot) are false.

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

/-- Partial order on DiamondPoset j where bot is minimum, top is maximum, and middle elements are pairwise incomparable. -/
instance inst_partial_order_diamond_poset (j : ℕ) : PartialOrder (DiamondPoset j) where
  le x y := match x, y with
    | .bot, _ => True
    | _, .top => True
    | .mid a, .mid b => a = b
    | _, _ => False
  le_refl := by
    rintro (_ | _ | _) <;> trivial
  le_trans := by
    rintro (_ | _ | _) (_ | _ | _) (_ | _ | _) <;>
      aesop
  le_antisymm := by
    rintro (_ | _ | _) (_ | _ | _) <;>
      aesop
See it in the graphDiscuss this resultChallenge it