diagram_crossing
def
Two cells $u, v \in \mathbb{N} \times \mathbb{N}$ form a crossing (diagram_crossing u v) if $(u.1 < v.1 \land v.2 < u.2) \lor (v.1 < u.1 \land u.2 < v.2)$.
Statement
def diagram_crossing (u v : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 3.2
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 5
- open_problem_1285_partial_no_crossingsFor every finite diagram $D \subseteq \mathbb{N} \times \mathbb{N}$ having no crossings (
∀ u ∈ D, ∀ v ∈ D, ¬ diagram_crossing u v), the… - terminal_boxesGiven a sliding tree
t : DiagramSlidingTree Dand a list $l$ of boxes representing a tableau on $D$,terminal_boxes t ltransports $l$… - 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… - DiagramSlidingTreeA sliding tree
DiagramSlidingTree Don a diagram $D$ is either a leaf diagram with no crossings (… - open_problem_1285_exists_tree_of_no_crossingsFor every finite diagram $D \subseteq \mathbb{N} \times \mathbb{N}$ having no crossings (
∀ u ∈ D, ∀ v ∈ D, ¬ diagram_crossing u v),…
- open_problem_1285_partial_no_crossingsFor every finite diagram $D \subseteq \mathbb{N} \times \mathbb{N}$ having no crossings (
Read back from the Lean
diagram_crossing is a definition taking two pairs of natural numbers u and v (each in ℕ × ℕ) that evaluates to True if and only if either:
1. u.1 < v.1 and v.2 < u.2, or
2. v.1 < u.1 and u.2 < v.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
/-- Two cells in ℕ × ℕ cross if one lies strictly south-west of the other. -/ def diagram_crossing (u v : ℕ × ℕ) : Prop := (u.1 < v.1 ∧ v.2 < u.2) ∨ (v.1 < u.1 ∧ u.2 < v.2)