diagram_is_admissible_pair
A 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 outer pre-ordered in $D$, $b_1.1 < b_2.1$, and $b_2.2 < b_1.2$ (so $b_2$ lies strictly to the lower-left of $b_1$).
Statement
def diagram_is_admissible_pair (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 3.3
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- diagram_is_outer_pre_orderedA 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…
- diagram_is_outer_pre_orderedA cell $u$ in a finite diagram $D$ is outer pre-ordered (
- Used by 1
- 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_consecutive_admissible_pairAn admissible pair $(b_1, b_2)$ in a diagram $D$ is consecutive (
Read back from the Lean
Given a finite set of pairs of natural numbers D and two pairs of natural numbers b₁ and b₂, diagram_is_admissible_pair D b₁ b₂ asserts that:
1. b₁ is outer pre-ordered with respect to D,
2. b₂ is outer pre-ordered with respect to D,
3. the first component of b₁ is strictly less than the first component of b₂ (b₁.1 < b₂.1), and
4. the second component of b₂ is strictly less than the second component of b₁ (b₂.2 < b₁.2).
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 pair of outer pre-ordered boxes is admissible if the second lies strictly to the lower-left of the first. -/ def diagram_is_admissible_pair (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Prop := diagram_is_outer_pre_ordered D b₁ ∧ diagram_is_outer_pre_ordered D b₂ ∧ b₁.1 < b₂.1 ∧ b₂.2 < b₁.2