doubled_triangle_is_good_coloring
A 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.
Statement
def doubled_triangle_is_good_coloring {n : ℕ} (C : DoubledTriangleFace n → Bool) : Prop
- Defined in
- arXiv:2611.12065, Definition 2.1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 3
- doubled_triangle_vertex_facesThe set of faces incident to a vertex 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 1
- 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.
Read back from the Lean
For a given (implicit) natural number $n$, a 2-coloring $C : \text{DoubledTriangleFace } n \to \text{Bool}$ of the faces of the doubled triangle is defined to be "good" (doubled_triangle_is_good_coloring) if and only if:
For every vertex $v : \text{DoubledTriangleVertex } n$:
Let $faces$ be the set of faces $f : \text{DoubledTriangleFace } n$ containing $v$ among their vertices.
Let $b$ be the number of faces in $faces$ with $C(f) = \text{true}$.
Let $w$ be the number of faces in $faces$ with $C(f) = \text{false}$.
Then $b \equiv w \pmod 3$ (as integers).
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
/-- Predicate for a face coloring of T(n) to be a good coloring. -/ def doubled_triangle_is_good_coloring {n : ℕ} (C : DoubledTriangleFace n → Bool) : Prop := ∀ v : DoubledTriangleVertex n, let faces := doubled_triangle_vertex_faces v let b := (faces.filter (fun f => C f = true)).card let w := (faces.filter (fun f => C f = false)).card (b : ℤ) ≡ (w : ℤ) [ZMOD 3]