asTrace
def
The trace of an ascending shallow path with coordinate function a : ℤ → ℤ on the n × n chessboard is the finite set of cells in chessboard n satisfying a(x + y) = x.
Statement
def asTrace (n : ℕ) (a : ℤ → ℤ) : Finset (ℕ × ℕ)- Defined in
- arXiv:2611.12329 Piercing a Chessboard with Restricted Slopes, Section 1
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- chessboardFor any natural number n, the chessboard of size n is the finite set of pairs of natural numbers (Finset (ℕ × ℕ)) given by the Cartesian…
- Used by 2
- dtTraceThe trace of a descending steep (DT) path with underlying AS coordinate function a : ℤ → ℤ on the n × n chessboard is the image of asTrace…
- 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
Given a natural number n and a function a : ℤ → ℤ, asTrace n a is defined as the finite set of pairs (i, j) : ℕ × ℕ such that i < n, j < n, and a (i + j) = i (with natural numbers coerced to ℤ in the argument and right-hand side of the equality).
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
/-- The trace of an AS path on the n x n chessboard. -/ def asTrace (n : ℕ) (a : ℤ → ℤ) : Finset (ℕ × ℕ) := (chessboard n).filter (fun p => a (p.1 + p.2) = p.1)