T
plain-language theorem explainer
Indexes the twelve Freudenthal tetrahedra in the two-cube strip: two unit cubes sharing a face, six tets each. Anyone working the multi-cube incidence graph or the global local-edge-slot partition cites this type. It is a one-line type synonym for Fin 12; no proof content.
Claim. Write $T$ for the finite type of cardinality $12$, used as the index set of the twelve Freudenthal tetrahedra in the two-cube strip (two unit cubes sharing one square face, six tetrahedra per cube).
background
The module builds the smallest nontrivial multi-cube Freudenthal example: two unit cubes that share one square face, each decomposed into six Freudenthal tetrahedra with compatible face triangulation. After deduplicating the five shared-face edges one obtains a global local-edge-slot partition; this is the first concrete multi-cube incidence instance beyond the single-cube sanity check.
Sibling abbreviations in the same file name the other discrete ingredients of that complex: vertex slots, edge slots, the map from local tet edges to global edges, and the strip itself. The present abbreviation simply fixes the tetrahedron index set at cardinality twelve (two cubes times six tets).
proof idea
Pure definitional abbreviation: $T$ is identified with Fin 12. No lemmas, no tactics, no proof obligations.
why it matters
Supplies the tetrahedron index type for every incidence statement in the two-cube Freudenthal strip (edge-in-tet membership, local-to-global edge maps, the strip complex itself). Downstream geometry lemmas that quantify over tetrahedra in this strip are typed against this finite index set. In the broader Recognition geometry stack it is the first multi-cell instance past the one-cube check, so it anchors the passage from single-cell Freudenthal data toward larger triangulated complexes used in discrete action and curvature arguments. It does not itself encode continuum limits or physical constants; it is pure combinatorial scaffolding for those later steps.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.