is_m_interval_poset
def
An 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 decreasing order: (i * m + j₂) ≺ (i * m + j₁) for j₁ < j₂.
Statement
def is_m_interval_poset (m n : ℕ) (P : IntervalPoset (Fin (n * m))) : Prop
- Defined in
- arXiv:1311.3922 Def. 4.5
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 3
- IntervalPosetAn interval-poset is a strict partial order on a linearly ordered set satisfying the Tamari convexity conditions: if a < b < c and a ≺ c…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- Used by 1
- 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
For natural numbers m and n, and an IntervalPoset P over Fin (n * m), is_m_interval_poset m n P asserts that:
For all natural numbers i such that i < n, and for all natural numbers j₁ and j₂ such that j₁ < m and j₂ < m, if j₁ < j₂, then the relation P.rel holds from the element ⟨i * m + j₂, _⟩ to ⟨i * m + j₁, _⟩ in Fin (n * m).
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
/-- Predicate for a synchronized m-interval-poset of size n, whose blocks of size m are decreasingly ordered. -/ def is_m_interval_poset (m n : ℕ) (P : IntervalPoset (Fin (n * m))) : Prop := ∀ (i : ℕ) (hi : i < n) (j₁ j₂ : ℕ) (hj₁ : j₁ < m) (hj₂ : j₂ < m), j₁ < j₂ → P.rel ⟨i * m + j₂, by nlinarith⟩ ⟨i * m + j₁, by nlinarith⟩