AFTD Auto-Formalizing Theoretical Domains

isASPath_id

theoremverified

The identity function a(t) = t is an ascending shallow path coordinate function.

Statement

theorem isASPath_id : IsASPath (fun t => t)
Source
arXiv:2611.12329 Piercing a Chessboard with Restricted Slopes, Eq. (1)
Verified
13 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • IsASPathAn 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 ∈ ℤ.
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • wave_equation_zeroThe zero function is a solution to the one-dimensional wave equation.

Read back from the Lean

The identity function on the integers, mapping each integer $t$ to $t$, satisfies IsASPath.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

To show that the identity function a(t) = t is an ascending shallow path coordinate function, we unfold the definition of `IsASPath`. This requires checking that for every integer t, the consecutive difference a(t + 1) - a(t) = (t + 1) - t = 1 lies in [0, 1] and that a(t) + 1 = t + 1 ≤ t + 2 = a(t + 2). All three conditions reduce to elementary integer arithmetic (0 ≤ 1, 1 ≤ 1, and 1 ≤ 2), which holds trivially.

  1. The identity function t ↦ t satisfies the definition of an ascending shallow path coordinate function.

    We unfold the definition of `IsASPath` using `simp only [IsASPath] at *`, which reduces the goal to verifying that for all integers t, 0 ≤ (t + 1) - t ≤ 1 and t + 1 ≤ t + 2. The tactic script tries several candidate moves via `first`, eventually succeeding with `simpa using wave_equation_zero`. Lean's simplifier reduces (t + 1) - t to 1 and simplifies the three inequalities 0 ≤ 1, 1 ≤ 1, and t + 1 ≤ t + 2 to True, closing the goal via elementary integer arithmetic while ignoring the unrelated hypothesis `wave_equation_zero`.

    line 2

    uses IsASPath, wave_equation_zero

    theorem isASPath_id : IsASPath (fun t => t) := by first | exact wave_equation_zero | (apply wave_equation_zero <;> assumption) | (apply wave_equation_zero <;> simp_all) | simpa using wave_equation_zero | (simp only [IsASPath] at *; first | exact wave_equation_zero | (apply wave_equation_zero <;> assumption) | (apply wave_equation_zero <;> simp_all) | simpa using wave_equation_zero)
IsASPath
A function a : ℤ → ℤ is an ascending shallow path coordinate function if for all t : ℤ, the step a(t + 1) - a(t) is between 0 and 1, and a(t) + 1 ≤ a(t + 2).
wave_equation_zero
The constant zero function satisfies the one-dimensional wave equation with wave speed c.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The identity function is an AS path coordinate function. -/theorem isASPath_id : IsASPath (fun t => t) := by first | exact wave_equation_zero | (apply wave_equation_zero <;> assumption) | (apply wave_equation_zero <;> simp_all) | simpa using wave_equation_zero | (simp only [IsASPath] at *; first | exact wave_equation_zero | (apply wave_equation_zero <;> assumption) | (apply wave_equation_zero <;> simp_all) | simpa using wave_equation_zero)
See it in the graphDiscuss this resultChallenge it