doubled_triangle_fold_count
The fold count of a face 2-coloring C of the doubled equilateral triangle triangulation T(n), defined as the number of edges e : DoubledTriangleEdge n whose two incident faces under doubled_triangle_edge_faces have different colors under C.
Statement
def doubled_triangle_fold_count {n : ℕ} (C : DoubledTriangleFace n → Bool) : ℕ- Defined in
- arXiv:2611.12065, Definition 2.1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 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…
- DoubledTriangleEdgeThe inductive type DoubledTriangleEdge n of edges in the doubled equilateral triangle triangulation T(n), with six constructors:…
- 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 3
- doubled_triangle_isoperimetric_ratioThe Eisenstein isoperimetric ratio eta(C) of a face 2-coloring C of the doubled equilateral triangle triangulation T(n), defined as the…
- doubled_triangle_two_sided_coloring_isoperimetric_ratioFor any positive integer n > 0, the Eisenstein isoperimetric ratio of the two-sided coloring B_n of T(n) is equal to 9 / 2 in Q.
- 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
For a given natural number n and a Boolean assignment C : DoubledTriangleFace n → Bool on the faces of a doubled triangle of size n, doubled_triangle_fold_count C is defined as the number (cardinality) of edges e : DoubledTriangleEdge n such that the first and second faces incident to e (as given by doubled_triangle_edge_faces e) are assigned different values by C (i.e., C (doubled_triangle_edge_faces e).1 ≠ C (doubled_triangle_edge_faces e).2).
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 fold count of a face coloring of T(n). -/ def doubled_triangle_fold_count {n : ℕ} (C : DoubledTriangleFace n → Bool) : ℕ := Finset.card (Finset.univ.filter (fun e : DoubledTriangleEdge n => C (doubled_triangle_edge_faces e).1 ≠ C (doubled_triangle_edge_faces e).2))