AFTD Auto-Formalizing Theoretical Domains

DoubledTriangleVertex

inductive

A vertex of the doubled equilateral triangle triangulation T(n), classified as either a boundary vertex or an interior vertex on the front or back.

Statement

inductive DoubledTriangleVertex (n : ℕ) : Type
Defined in
arXiv:2611.12065, Section 2.3
Verified
10 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

An inductive type family DoubledTriangleVertex (n : ℕ) : Type, equipped with derived DecidableEq and Fintype instances, having two constructors: 1. DoubledTriangleVertex.boundary: takes i : Fin (n + 1), j : Fin (n + 1), a proof h_le : (i : ℕ) + j ≤ n, and a proof h_bd : (i : ℕ) = 0 ∨ (j : ℕ) = 0 ∨ (i : ℕ) + j = n. 2. DoubledTriangleVertex.interior: takes front : Bool, i : Fin (n + 1), j : Fin (n + 1), and proofs hi : 0 < (i : ℕ), hj : 0 < (j : ℕ), and h_lt : (i : ℕ) + j < n.

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

/-- Vertices of the doubled equilateral triangle triangulation T(n). -/
inductive DoubledTriangleVertex (n : ℕ) : Type where
  | boundary (i j : Fin (n + 1)) (h_le : (i : ℕ) + j ≤ n)
      (h_bd : (i : ℕ) = 0 ∨ (j : ℕ) = 0 ∨ (i : ℕ) + j = n) : DoubledTriangleVertex n
  | interior (front : Bool) (i j : Fin (n + 1))
      (hi : 0 < (i : ℕ)) (hj : 0 < (j : ℕ)) (h_lt : (i : ℕ) + j < n) : DoubledTriangleVertex n
deriving DecidableEq, Fintype
See it in the graphDiscuss this resultChallenge it