AFTD Auto-Formalizing Theoretical Domains

doubled_triangle_face_vertices

def

The set of three vertices incident to a face of the doubled equilateral triangle triangulation T(n).

Statement

def doubled_triangle_face_vertices {n : ℕ} (f : DoubledTriangleFace n) : Finset (DoubledTriangleVertex n)
Defined in
arXiv:2611.12065, Section 2.3
Verified
10 Nov 2026
Axioms
none listed
Built on 3
  • DoubledTriangleFaceA face of the doubled equilateral triangle triangulation T(n) of side n, which is either an up-triangle U(i,j) or a down-triangle D(i,j)…
  • DoubledTriangleVertexA vertex of the doubled equilateral triangle triangulation T(n), classified as either a boundary vertex or an interior vertex on the front…
  • doubled_triangle_point_to_vertexMap 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.
Used by 2

Read back from the Lean

Given a natural number n and a face f : DoubledTriangleFace n, doubled_triangle_face_vertices f is the Finset (DoubledTriangleVertex n) of vertices associated with f, defined by pattern matching on f: 1. If f = DoubledTriangleFace.up front i j h (with front : Bool, i, j : Fin n, and h : (i : ℕ) + j < n): It is the 3-element finset containing: - doubled_triangle_point_to_vertex front ⟨i, _⟩ ⟨j, _⟩ _ - doubled_triangle_point_to_vertex front ⟨i + 1, _⟩ ⟨j, _⟩ _ - doubled_triangle_point_to_vertex front ⟨i, _⟩ ⟨j + 1, _⟩ _ 2. If f = DoubledTriangleFace.down front i j h (with front : Bool, i, j : Fin n, and h : (i : ℕ) + j + 1 < n): It is the 3-element finset containing: - doubled_triangle_point_to_vertex front ⟨i + 1, _⟩ ⟨j, _⟩ _ - doubled_triangle_point_to_vertex front ⟨i, _⟩ ⟨j + 1, _⟩ _ - doubled_triangle_point_to_vertex front ⟨i + 1, _⟩ ⟨j + 1, _⟩ _

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 three vertices incident to a face of T(n). -/
def doubled_triangle_face_vertices {n : ℕ} (f : DoubledTriangleFace n) : Finset (DoubledTriangleVertex n) := match f with
  | .up front i j h =>
    have h1 : (i : ℕ) + j ≤ n := by omega
    have h2 : ((i : ℕ) + 1) + j ≤ n := by omega
    have h3 : (i : ℕ) + ((j : ℕ) + 1) ≤ n := by omega
    have i_lt : (i : ℕ) < n + 1 := by omega
    have j_lt : (j : ℕ) < n + 1 := by omega
    have i1_lt : (i : ℕ) + 1 < n + 1 := by omega
    have j1_lt : (j : ℕ) + 1 < n + 1 := by omega
    { doubled_triangle_point_to_vertex front ⟨i, i_lt⟩ ⟨j, j_lt⟩ h1,
      doubled_triangle_point_to_vertex front ⟨(i : ℕ) + 1, i1_lt⟩ ⟨j, j_lt⟩ h2,
      doubled_triangle_point_to_vertex front ⟨i, i_lt⟩ ⟨(j : ℕ) + 1, j1_lt⟩ h3 }
  | .down front i j h =>
    have h1 : ((i : ℕ) + 1) + j ≤ n := by omega
    have h2 : (i : ℕ) + ((j : ℕ) + 1) ≤ n := by omega
    have h3 : ((i : ℕ) + 1) + ((j : ℕ) + 1) ≤ n := by omega
    have i_lt : (i : ℕ) < n + 1 := by omega
    have j_lt : (j : ℕ) < n + 1 := by omega
    have i1_lt : (i : ℕ) + 1 < n + 1 := by omega
    have j1_lt : (j : ℕ) + 1 < n + 1 := by omega
    { doubled_triangle_point_to_vertex front ⟨(i : ℕ) + 1, i1_lt⟩ ⟨j, j_lt⟩ h1,
      doubled_triangle_point_to_vertex front ⟨i, i_lt⟩ ⟨(j : ℕ) + 1, j1_lt⟩ h2,
      doubled_triangle_point_to_vertex front ⟨(i : ℕ) + 1, i1_lt⟩ ⟨(j : ℕ) + 1, j1_lt⟩ h3 }
See it in the graphDiscuss this resultChallenge it