diagram_is_outer_pre_ordered
A cell $u$ in a finite diagram $D$ is outer pre-ordered (diagram_is_outer_pre_ordered D u) if it is pre-ordered in $D$ and maximal among pre-ordered cells of $D$ under the componentwise order on $\mathbb{N} \times \mathbb{N}$ (if $v$ is pre-ordered with $u.1 \le v.1$ and $u.2 \le v.2$, then $u = v$).
Statement
def diagram_is_outer_pre_ordered (D : Finset (ℕ × ℕ)) (u : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 3.2 and Lemma 3.12
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- diagram_is_pre_orderedA cell $u$ in a finite diagram $D$ is pre-ordered (
diagram_is_pre_ordered D u) if $u \in D$ and there exists a cell $v \in D$ such that…
- diagram_is_pre_orderedA cell $u$ in a finite diagram $D$ is pre-ordered (
- Used by 2
- diagram_is_consecutive_admissible_pairAn admissible pair $(b_1, b_2)$ in a diagram $D$ is consecutive (
diagram_is_consecutive_admissible_pair D b_1 b_2) if it is admissible… - diagram_is_admissible_pairA pair of cells $(b_1, b_2)$ is an admissible pair of a diagram $D$ (
diagram_is_admissible_pair D b_1 b_2) if both $b_1$ and $b_2$ are…
- diagram_is_consecutive_admissible_pairAn admissible pair $(b_1, b_2)$ in a diagram $D$ is consecutive (
Read back from the Lean
A pair u ∈ ℕ × ℕ is "outer pre-ordered" with respect to a finite set D ⊆ ℕ × ℕ if: 1. u is pre-ordered in D (meaning u ∈ D and there exists some element in D crossing u); and 2. For every pair v ∈ ℕ × ℕ, if v is pre-ordered in D, u.1 ≤ v.1, and u.2 ≤ v.2, then u = v (that is, u is maximal among the pre-ordered elements of D with respect to the componentwise partial order on ℕ × ℕ).
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 outer pre-ordered box is a pre-ordered box that is maximal among pre-ordered boxes under the componentwise order. -/ def diagram_is_outer_pre_ordered (D : Finset (ℕ × ℕ)) (u : ℕ × ℕ) : Prop := diagram_is_pre_ordered D u ∧ ∀ v, diagram_is_pre_ordered D v → u.1 ≤ v.1 → u.2 ≤ v.2 → u = v