IndisputableMonolith.Geometry.PeriodicFreudenthalTorus
Defines the vertex set and bit-arithmetic of the periodic cubic lattice that carries the Freudenthal six-tetrahedron triangulation. Gravity continuum-limit, Dirichlet-instance, path-sum, and tensor-shear modules import this scaffold for exact stencil bookkeeping on the torus. Content is combinatorial: vertices as bit patterns, unit displacements by bit flips, and elementary identities for those operations.
claimThe module equips a periodic cubic lattice with vertices labeled by bit-strings and with displacement maps that add unit edge bits (modulo the torus identification), so that the Freudenthal six-tetrahedron decomposition of the unit cube extends by periodicity.
background
Recognition Science gravity work needs an exact discrete geometry on which continuum limits of quadratic actions can be stated without mesh ambiguity. The upstream Freudenthal module fixes the standard six-tetrahedron split of one unit cube along the body diagonal from binary vertex $0$ to vertex $7$, with cube corners labeled by three-bit coordinates.
This module lifts that single-cube incidence data to a periodic cubic torus: vertices remain bit-labeled lattice points, and translation by a cube edge is realized by flipping or adding the corresponding bit. Sibling definitions package single-bit and multi-bit displacements, together with elementary equalities (adding false is identity, true after false, non-fixed-point of a true flip, and so on).
The local setting is pure combinatorial geometry. No metric, measure, or continuum claim is made here; the torus is only the carrier for later stencil and path-sum constructions.
proof idea
This is primarily a definition module. It introduces the vertex type and bit-level displacement operations, then proves short algebraic identities (identity under false bits, commutation patterns of true/false flips, self-inequality after a true flip, and multi-bit variants) by direct case analysis on booleans and constructors. There is no deep geometric argument; the lemmas are bookkeeping facts that downstream stencil code can rewrite against.
why it matters in Recognition Science
The module is the shared periodic carrier for several gravity tracks. FreudenthalStencilPreflight uses it for exact general-$N$ stencil identities and moment tensors in the QG Phase 2b continuum-limit campaign. PhysicalSixTetCubicDirichletInstance packages theorem obligations that instantiate the physical six-tet Dirichlet model on this torus. SevenGaps.PathSumProbes records cheap honest facts linking the canonical periodic Freudenthal torus to scoped path-sum state spaces (probes only). TensorShearSector needs the same vertex lattice when extending beyond the conformal scalar ansatz toward shear and transverse-traceless modes.
In the broader RS geometry stack it sits above the single-cube Freudenthal triangulation and below action-level and path-sum gravity modules; it does not itself touch the T0–T8 forcing chain or the J-cost functional.
scope and limits
- Does not assert any continuum limit, measure, or path-sum value.
- Does not prove physical Dirichlet equality; only supplies the periodic vertex scaffold.
- Does not encode metric edge lengths, shear modes, or weak-field gravity dynamics.
- Does not extend the Freudenthal split beyond cubic periodicity and bit displacements.
- Does not claim uniqueness of the six-tet decomposition among all triangulations.
used by (4)
depends on (1)
declarations in this module (59)
-
abbrev
Vertex -
def
bit -
def
addBit -
theorem
addBit_false -
theorem
addBit_true_eq_mk -
theorem
addBit_false_after_true -
theorem
addBit_true_after_false -
theorem
addBit_true_ne_self -
def
addBits -
def
dispBits -
def
vertexBits -
def
addVertexBits -
theorem
addBit_true_injective -
theorem
addBit_injective -
theorem
addBits_injective -
theorem
addVertexBits_injective -
theorem
addVertexBits_surjective -
theorem
existsUnique_addVertexBits_eq -
theorem
sum_ite_eq_of_addVertexBits -
structure
PeriodicEdge -
def
cubeEdgeBase -
def
cubeEdgeDisp -
def
localEdgeOf -
abbrev
PeriodicTet -
def
vertexFinEquiv -
def
edgeFinEquiv -
def
tetFinEquiv -
def
canonicalEdgeSlot -
theorem
canonicalEdgeSlot_eq_some_implies -
theorem
canonicalEdgeSlot_eq_some_of_noDup -
def
canonicalEdgeVerts -
def
canonicalTetVerts -
def
canonicalEdgeInTet -
theorem
canonicalEdgeInTet_eq_some_implies -
def
CanonicalPeriodicLocalEdgeNoDup -
theorem
canonicalPeriodicLocalEdgeNoDup -
theorem
canonicalEdgeInTet_iff_of_noDup -
def
periodicDispSqEdge -
def
canonicalGlobalSqEdge -
theorem
freudenthalTet_sqEdge_eq_periodicDispSqEdge_localEdgeOf -
theorem
canonicalLocalSqEdge_eq_global -
theorem
canonicalLocalEdge_complete -
def
canonicalPeriodicTriangulation -
def
canonicalPeriodicEdgeEquiv -
def
canonicalPeriodicTetEquiv -
def
CanonicalPeriodicEndpointIncidence -
theorem
localEdgeOf_endpoints_match_tetVerts -
theorem
canonicalPeriodicEndpointIncidence -
def
canonicalPeriodicIncidenceConsistent_of_endpoint -
def
canonicalPeriodicIncidenceConsistent -
structure
EncodedPeriodicFreudenthalTorus -
def
canonicalEncodedPeriodicFreudenthalTorus_of_incidence -
def
canonicalEncodedPeriodicFreudenthalTorus_of_endpoint -
def
canonicalEncodedPeriodicFreudenthalTorus -
theorem
canonicalEncodedPeriodic_K_tetVerts_eq -
theorem
canonicalEncodedPeriodic_tetEquiv_eq -
theorem
canonicalEncodedPeriodic_tetVerts_addVertexBits -
def
edgeSlotPartition_of_encodedPeriodicFreudenthalTorus -
def
edgeSlotBookkeeping_of_encodedPeriodicFreudenthalTorus