list_descent_at
def
A list of cells $l$ has a row descent at index $k$ (list_descent_at l k) if there exist cells $u$ and $v$ such that $l[k]? = some u$, $l[k+1]? = some v$, and $u.1 < v.1$ (the element at index $k$ has strictly smaller row index than the element at index $k+1$).
Statement
def list_descent_at (l : List (ℕ × ℕ)) (k : ℕ) : Prop
- Defined in
- arXiv:2611.07715, Definition 4.1
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 2
- 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… - diagram_slide_expansion_agrees_with_descentsA sliding tree
ton a finite diagram $D$ satisfiesdiagram_slide_expansion_agrees_with_descents D tif for every list $l$ representing…
- open_problem_1285_partial_no_crossingsFor every finite diagram $D \subseteq \mathbb{N} \times \mathbb{N}$ having no crossings (
Read back from the Lean
Given a list l of pairs of natural numbers and an index k : ℕ, list_descent_at l k asserts that there exist pairs u, v : ℕ × ℕ such that u is the element of l at index k, v is the element of l at index k + 1, and the first component of u is strictly less than the first component of 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 list of cells has a row descent at index k if the cell at index k + 1 lies strictly below the cell at index k. -/ def list_descent_at (l : List (ℕ × ℕ)) (k : ℕ) : Prop := ∃ (u v : ℕ × ℕ), l[k]? = some u ∧ l[k + 1]? = some v ∧ u.1 < v.1