doubled_triangle_vertex_faces
def
The set of faces incident to a vertex of the doubled equilateral triangle triangulation T(n).
Statement
def doubled_triangle_vertex_faces {n : ℕ} (v : DoubledTriangleVertex n) : Finset (DoubledTriangleFace n)- Defined in
- arXiv:2611.12065, Section 2.1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 3
- doubled_triangle_face_verticesThe set of three vertices incident to a face of the doubled equilateral triangle triangulation T(n).
- DoubledTriangleVertexA vertex of the doubled equilateral triangle triangulation T(n), classified as either a boundary vertex or an interior vertex on the front…
- 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)…
- Used by 2
- 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_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
Given a natural number $n$ and a vertex $v : DoubledTriangleVertex n$, doubled_triangle_vertex_faces v is defined as the finite set (Finset) of all faces $f : DoubledTriangleFace n$ that contain $v$ as a vertex (i.e., such that $v \in \text{doubled\_triangle\_face\_vertices } f$).
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 set of faces incident to a vertex of T(n). -/ def doubled_triangle_vertex_faces {n : ℕ} (v : DoubledTriangleVertex n) : Finset (DoubledTriangleFace n) := Finset.univ.filter (fun f => v ∈ doubled_triangle_face_vertices f)