diagram_is_pre_ordered
def
A 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 $u$ and $v$ form a crossing (diagram_crossing u v).
Statement
def diagram_is_pre_ordered (D : Finset (ℕ × ℕ)) (u : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 3.2
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- diagram_crossingTwo cells $u, v \in \mathbb{N} \times \mathbb{N}$ form a crossing (
diagram_crossing u v) if…
- diagram_crossingTwo cells $u, v \in \mathbb{N} \times \mathbb{N}$ form a crossing (
- Used by 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 (
Read back from the Lean
Given a finite set $D$ of pairs of natural numbers and a pair of natural numbers $u$, diagram_is_pre_ordered D u asserts that $u \in D$ and there exists an element $v \in D$ such that $u$ and $v$ form a diagram crossing (that is, diagram_crossing u v).
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 box in a diagram is pre-ordered if it belongs to some crossing of the diagram. -/ def diagram_is_pre_ordered (D : Finset (ℕ × ℕ)) (u : ℕ × ℕ) : Prop := u ∈ D ∧ ∃ v ∈ D, diagram_crossing u v