IntervalPoset
An interval-poset is a strict partial order on a linearly ordered set satisfying the Tamari convexity conditions: if a < b < c and a ≺ c then b ≺ c, and if a < b < c and c ≺ a then b ≺ a.
Statement
structure IntervalPoset (α : Type*) [LinearOrder α]
- Defined in
- arXiv:1311.3922 Def. 2.7
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 2
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- LinearOrder.toTotalPreorderEvery
- Used by 2
- is_m_interval_posetAn m-interval-poset of size n is an interval-poset on Fin (n * m) where within each block of size m, the elements are ordered in…
- MIntervalPosetThe type MIntervalPoset m n is the subtype of interval-posets on Fin (n * m) satisfying the m-synchronization condition.
Read back from the Lean
Given a type α equipped with a linear order ([LinearOrder α]), the structure IntervalPoset α specifies a strict partial order on α that is compatible with the linear order in the sense of Chapoton's interval posets. It consists of:
1. rel : α → α → Prop: a binary relation on α.
2. irrefl: for all x : α, ¬ rel x x (rel is irreflexive).
3. trans: for all x y z : α, rel x y → rel y z → rel x z (rel is transitive).
4. convex_inc: for all a b c : α, if a < b and b < c, then rel a c → rel b c.
5. convex_dec: for all a b c : α, if a < b and b < c, then rel c a → rel b a.
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
/-- An interval-poset on a linearly ordered type α is a strict partial order satisfying Tamari convexity. -/ structure IntervalPoset (α : Type*) [LinearOrder α] where rel : α → α → Prop irrefl : ∀ x, ¬ rel x x trans : ∀ x y z, rel x y → rel y z → rel x z convex_inc : ∀ a b c : α, a < b → b < c → rel a c → rel b c convex_dec : ∀ a b c : α, a < b → b < c → rel c a → rel b a