AFTD Auto-Formalizing Theoretical Domains

doubled_triangle_point_to_vertex

def

Map a lattice point (i, j) in the triangle of side n to the corresponding vertex of T(n), identifying front and back on the boundary.

Statement

def doubled_triangle_point_to_vertex {n : ℕ} (front : Bool) (i j : Fin (n + 1)) (h : (i : ℕ) + j ≤ n) : DoubledTriangleVertex n
Defined in
arXiv:2611.12065, Section 2.3
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • DoubledTriangleVertexA vertex of the doubled equilateral triangle triangulation T(n), classified as either a boundary vertex or an interior vertex on the front…
Used by 2

Read back from the Lean

Given a natural number n, a boolean front, indices i, j : Fin (n + 1), and a hypothesis h : (i : ℕ) + j ≤ n, doubled_triangle_point_to_vertex produces an element of DoubledTriangleVertex n by case distinction: - If (i : ℕ) = 0 ∨ (j : ℕ) = 0 ∨ (i : ℕ) + j = n, it returns DoubledTriangleVertex.boundary i j h h_bd (disregarding front). - Otherwise (in which case 0 < (i : ℕ), 0 < (j : ℕ), and (i : ℕ) + j < n hold), it returns DoubledTriangleVertex.interior front i j hi hj h_lt.

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

/-- Map a lattice point in the triangle to the corresponding vertex of T(n). -/
def doubled_triangle_point_to_vertex {n : ℕ} (front : Bool) (i j : Fin (n + 1)) (h : (i : ℕ) + j ≤ n) : DoubledTriangleVertex n := if h_bd : (i : ℕ) = 0 ∨ (j : ℕ) = 0 ∨ (i : ℕ) + j = n then
    DoubledTriangleVertex.boundary i j h h_bd
  else
    have hi : 0 < (i : ℕ) := by omega
    have hj : 0 < (j : ℕ) := by omega
    have h_lt : (i : ℕ) + j < n := by omega
    DoubledTriangleVertex.interior front i j hi hj h_lt
See it in the graphDiscuss this resultChallenge it