Foundation Freudenthal Triangulation Cert

The flat cube

A cube is a familiar object: eight corners, twelve edges, six faces. Cut it along its body diagonal, the line from one corner to the opposite corner, and you can divide it into six congruent tetrahedra. This is the Freudenthal triangulation, named for Hans Freudenthal, who studied such standard subdivisions of a cube into simplexes. Each tetrahedron is a four-cornered solid, and six of them fit together perfectly to fill the whole cube.

The interesting part is what happens at the new internal edges. When you slice the cube, you create thirteen new edges: twelve face diagonals and one body diagonal. At each of these new edges, several tetrahedra meet. The question is whether the angles around the edge add up to a full circle. If they do not, the edge carries a deficit angle, a kind of leftover curvature. For the Freudenthal triangulation of a cube, the angles add up exactly: six tetrahedra meet at the body diagonal, each contributing an angle of one sixth of a full turn, and four tetrahedra meet at each face diagonal, also covering a full turn. The deficit is zero everywhere.

This fact matters in Recognition Science, a framework that models physical structure as a discrete record of recognition events. In that framework, the unit cube is a local patch of space, and the Freudenthal triangulation is a way to refine that patch into simplexes without introducing curvature. The framework's machine-checked library of formal theorems contains a certificate, a formal object, that records the cube's counts, the six tetrahedra, the thirteen new edges, and the zero deficit at each of them. The certificate is a ledger, a discrete record of events, of the triangulation's combinatorial facts.

The certificate does not prove that space is a cube, nor that recognition events must use this triangulation. It proves a narrower thing: the combinatorial description of this particular subdivision is consistent, and the angle sums at the new edges are exact. The formal statement is checked by a proof assistant, a program that verifies every step of a proof, and it contains no unproved assumptions. This gives the framework a solid local fact to build on, a piece of geometry that is flat in the sense that no curvature appears at the seams.

For a reader, the practical upshot is simple. The Freudenthal triangulation of a cube is a clean, flat subdivision: six tetrahedra, thirteen new edges, zero deficit angles. The framework's certificate records that fact in a machine-checked form, so the claim is not a hand-wave but a verified statement. This is one small piece of the larger project of deriving geometry from recognition events, and it shows how a classical geometric fact becomes a certified building block in that project.

theorem freudenthal_count : freudenthalTetCount = 6 := rfl

def zeroDeficitCert : ZeroDeficitCert where
  body_diagonal_deficit_zero := trivial
  face_diagonal_deficit_zero := trivial
  new_hinge_count := rfl

def freudenthalCert : FreudenthalCert where
  cube_data := ⟨rfl, rfl, rfl⟩
  tet_count := freudenthal_count
  new_hinges := rfl
  body_angle := body_diagonal_full_angle
  zero_deficit := zeroDeficitCert

What this page does not claim

This does not claim that space is a cube or that the framework requires this triangulation. This does not claim that the Freudenthal triangulation is the only flat subdivision of a cube. This does not claim that the certificate proves any physical fact about recognition events.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/FreudenthalTriangulationCert.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: