diagram_is_consecutive_admissible_pair
An 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 and there is no outer pre-ordered cell $b$ of $D$ whose row index lies strictly between that of $b_1$ and $b_2$ ($b_1.1 < b.1 < b_2.1$).
Statement
def diagram_is_consecutive_admissible_pair (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 3.3
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 2
- 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_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_admissible_pairA pair of cells $(b_1, b_2)$ is an admissible pair of a diagram $D$ (
- Used by 2
- terminal_boxesGiven a sliding tree
t : DiagramSlidingTree Dand a list $l$ of boxes representing a tableau on $D$,terminal_boxes t ltransports $l$… - DiagramSlidingTreeA sliding tree
DiagramSlidingTree Don a diagram $D$ is either a leaf diagram with no crossings (…
- terminal_boxesGiven a sliding tree
Read back from the Lean
Given a finite set of pairs of natural numbers D and two pairs b₁ b₂ : ℕ × ℕ, diagram_is_consecutive_admissible_pair D b₁ b₂ asserts that:
1. (b₁, b₂) is an admissible pair for D (diagram_is_admissible_pair D b₁ b₂), and
2. For all pairs b : ℕ × ℕ, if b is outer pre-ordered in D (diagram_is_outer_pre_ordered D b), then the first component of b is not strictly between the first component of b₁ and the first component of b₂ (that is, ¬ (b₁.1 < b.1 ∧ b.1 < b₂.1)).
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 admissible pair is consecutive if no outer pre-ordered box lies strictly between them in row index. -/ def diagram_is_consecutive_admissible_pair (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Prop := diagram_is_admissible_pair D b₁ b₂ ∧ ∀ b, diagram_is_outer_pre_ordered D b → ¬ (b₁.1 < b.1 ∧ b.1 < b₂.1)