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
- doubled_triangle_corner_ring_not_monochromaticFor any integer n > 0 and any good coloring C of T(n), the corner ring DoubledTriangleRing.x ⟨n - 1, by omega⟩ is not monochromatic under C.
- 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.
- doubled_triangle_face_verticesThe set of three vertices incident to a face of the doubled equilateral triangle triangulation T(n).
- doubled_triangle_vertex_facesThe set of faces incident to a vertex of the doubled equilateral triangle triangulation T(n).
- doubled_triangle_is_good_coloringA face 2-coloring of T(n) is good if at every vertex, the number of black faces is congruent to the number of white faces modulo 3.
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