AFTD Auto-Formalizing Theoretical Domains

DoubledTriangleEdge

inductive

The inductive type DoubledTriangleEdge n of edges in the doubled equilateral triangle triangulation T(n), with six constructors: horiz_boundary (i : Fin n), horiz_interior (front : Bool) (i j : Fin n) (h : (i : ℕ) + j < n) (hj : 0 < (j : ℕ)), vert_boundary (j : Fin n), vert_interior (front : Bool) (i j : Fin n) (h : (i : ℕ) + j < n) (hi : 0 < (i : ℕ)), diag_boundary (i : Fin n), and diag_interior (front : Bool) (i j : Fin n) (h : (i : ℕ) + j + 1 < n), deriving DecidableEq and Fintype.

Statement

inductive DoubledTriangleEdge (n : ℕ) : Type
Defined in
arXiv:2611.12065, Section 2.3
Verified
10 Nov 2026
Axioms
none listed
Used by 3
  • doubled_triangle_edge_facesGiven an edge e of type DoubledTriangleEdge n in the doubled equilateral triangle triangulation T(n), doubled_triangle_edge_faces returns…
  • doubled_triangle_fold_countThe fold count of a face 2-coloring C of the doubled equilateral triangle triangulation T(n), defined as the number of edges e :…
  • doubled_triangle_two_sided_coloring_fold_countFor every natural number $n$, the fold count of the two-sided coloring of the doubled triangle triangulation of size $n$ is equal to $3n$.

Read back from the Lean

DoubledTriangleEdge is an inductive type family parameterized by a natural number n : ℕ, representing edges of a doubled triangle of side length n. It has six constructors: 1. horiz_boundary (i : Fin n): constructs an edge from an index i : Fin n. 2. horiz_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j < n) (hj : 0 < (j : ℕ)): constructs an edge from a boolean flag front, indices i, j : Fin n, a proof h that (i : ℕ) + j < n, and a proof hj that 0 < (j : ℕ). 3. vert_boundary (j : Fin n): constructs an edge from an index j : Fin n. 4. vert_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j < n) (hi : 0 < (i : ℕ)): constructs an edge from a boolean flag front, indices i, j : Fin n, a proof h that (i : ℕ) + j < n, and a proof hi that 0 < (i : ℕ). 5. diag_boundary (i : Fin n): constructs an edge from an index i : Fin n. 6. diag_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j + 1 < n): constructs an edge from a boolean flag front, indices i, j : Fin n, and a proof h that (i : ℕ) + j + 1 < n. The type derives instances for DecidableEq and Fintype.

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

/-- Edges of the doubled equilateral triangle triangulation T(n). -/
inductive DoubledTriangleEdge (n : ℕ) : Type where
  | horiz_boundary (i : Fin n) : DoubledTriangleEdge n
  | horiz_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j < n) (hj : 0 < (j : ℕ)) : DoubledTriangleEdge n
  | vert_boundary (j : Fin n) : DoubledTriangleEdge n
  | vert_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j < n) (hi : 0 < (i : ℕ)) : DoubledTriangleEdge n
  | diag_boundary (i : Fin n) : DoubledTriangleEdge n
  | diag_interior (front : Bool) (i : Fin n) (j : Fin n) (h : (i : ℕ) + j + 1 < n) : DoubledTriangleEdge n
deriving DecidableEq, Fintype
See it in the graphDiscuss this resultChallenge it