IsASPath
def
An ascending shallow (AS) path coordinate function a : ℤ → ℤ satisfies 0 ≤ a(t+1) - a(t) ≤ 1 and a(t+2) ≥ a(t) + 1 for all t ∈ ℤ.
Statement
def IsASPath (a : ℤ → ℤ) : Prop
- Defined in
- arXiv:2611.12329 Piercing a Chessboard with Restricted Slopes, Eq. (1)
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Used by 2
- isASPath_idThe identity function a(t) = t is an ascending shallow path coordinate function.
- as_dt_path_intersection_le_twoFor any natural number n and any coordinate functions a1 and a2 satisfying IsASPath, the intersection of asTrace n a1 and dtTrace n a2 has…
Read back from the Lean
A function a : ℤ → ℤ satisfies IsASPath if and only if for every integer t : ℤ, all of the following hold:
1. 0 ≤ a (t + 1) - a t,
2. a (t + 1) - a t ≤ 1, and
3. a t + 1 ≤ a (t + 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
/-- Predicate for an ascending shallow (AS) path coordinate function a : ℤ → ℤ. -/ def IsASPath (a : ℤ → ℤ) : Prop := ∀ t : ℤ, 0 ≤ a (t + 1) - a t ∧ a (t + 1) - a t ≤ 1 ∧ a t + 1 ≤ a (t + 2)