IndisputableMonolith.Gravity.Analysis.ReggeHinge4DFlatKernel
Combinatorial incidence layer for 4D Regge calculus on the Freudenthal (Kuhn) triangulation of the unit 4-cube. It enumerates the 24 axis permutations, vertex masks, and local edge-class data that label hinges and edges inside each simplex. Downstream flat-Hessian, dihedral, orbit, and star-kernel modules import this API without redefining it. The content is definitional scaffolding plus elementary mask lemmas, not a deep analytic proof.
claimOn the Freudenthal triangulation of the unit $4$-cube, the $24$ ordered simplices are indexed by permutations $\sigma\in S_4$ via axis tuples $(\sigma(0),\sigma(1),\sigma(2),\sigma(3))$. Each simplex carries a vertex mask, local edge pairs, and a local edge-class label compatible with the $15$-class $4$D edge stencil. These data form the incidence skeleton used to assemble the flat hinge Hessian.
background
Recognition Science gravity analysis builds discrete Regge kernels on Freudenthal triangulations (Kuhn cubes split into simplices). In 4D the unit cube decomposes into $24=4!$ oriented $4$-simplices, one per axis permutation. The upstream module ReggeEdgeStencil4D supplies the $15$ combinatorial edge classes of the $4$-cube and a provisional finite quadratic form; this module sits one layer above that stencil and never redefines it.
Objects introduced here are purely combinatorial: lexicographic permAxes maps an index $s\in\mathrm{Fin},24$ to $(\sigma(0),\ldots,\sigma(3))$; vertexMask records which cube vertices belong to a simplex; localEdgePair / localEdgeMask / localEdgeClass identify edges inside a simplex and attach the stencil class. Bounds lemmas (localEdgeMask_bounds, vertexMask_start/end) keep indices in range.
The setting is the QG full-theory campaign's kernel-checked path: after edge TT attachment and the $4$D stencil, one needs a stable incidence API before dihedral cosines, orbit classification, or Bloch folds can be stated.
proof idea
This is primarily a definition module. Permutations of Fin 4 are enumerated lexicographically; masks and edge pairs are computed by pure arithmetic on those permutations. Supporting lemmas are short bounds and classification facts (mask ranges, class consistency, simplexHasClass). There is no analytic curvature argument here; the module only freezes the combinatorial API that later kernels import.
why it matters in Recognition Science
Every subsequent $4$D hinge kernel treats this module as the frozen Freudenthal incidence layer. ReggeHinge4DDihedralKernel builds the seed-hinge dihedral cosine kernel at flat on top of it; ReggeHinge4DOrbitClassification uses the $24$ Kuhn simplices and vertexMask API as the combinatorial prerequisite for assembling the flat Hessian from per-orbit star kernels; ReggeHinge4DStarKernel (and the $12$/$13$ variants) import the same incidence layer plus the $15$-class stencil. ReggeBlochFold4D folds the committed true-weight flat Hessian for type-$(1,1)$ triangle hinges using the midpoint plane-wave convention tied to this skeleton. Regge4DSchlaefliPathwise lifts the $3$D six-edge Schläfli identity to the $4$-simplex ($n_H=n_E=10$). The audit module records the expected axiom footprint [propext, Classical.choice, Quot.sound]. In the RS gravity stack this is the $4$D analogue of the $3$D TT edge-class packaging that feeds hinge-aware zero-mode analysis.
scope and limits
- Does not compute dihedral angles, deficit angles, or any curvature scalar.
- Does not assemble or diagonalize the flat Hessian; only supplies incidence data.
- Does not redefine the 15-class edge stencil from ReggeEdgeStencil4D.
- Does not treat curved backgrounds, continuum limits, or continuum Einstein equations.
- Does not prove Schläfli identities or Bloch-fold spectral claims; those live downstream.
used by (9)
-
IndisputableMonolith.Gravity.Analysis.Regge4DSchlaefliPathwise -
IndisputableMonolith.Gravity.Analysis.ReggeBlochFold4D -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DDihedralKernel -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DFlatKernelAudit -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DOrbitClassification -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DStarKernel -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DStarKernel12 -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DStarKernel13 -
IndisputableMonolith.Gravity.Analysis.ReggeHinge4DStarKernel22
depends on (1)
declarations in this module (48)
-
def
permAxes -
def
permOf -
def
axisMask -
def
vertexMask -
theorem
vertexMask_start -
theorem
vertexMask_end -
def
localEdgePair -
def
localEdgeMask -
theorem
localEdgeMask_bounds -
def
localEdgeClass -
theorem
localEdgeClass_mask -
def
simplexHasClass -
theorem
permOf_eq_of_eq -
def
containsSeedHinge -
theorem
containsSeedHinge_iff -
theorem
seedHinge_simplex_count -
theorem
seedHinge_simplices -
def
simplex0Classes -
def
simplex1Classes -
theorem
simplex0Classes_correct -
theorem
simplex1Classes_correct -
theorem
simplex0Classes_complete -
theorem
simplex1Classes_complete -
def
seedHingeIncidenceNat -
theorem
seedHingeIncidenceNat_values -
theorem
sum_seedHingeIncidenceNat -
theorem
seedHingeIncidence_nonvacuous -
def
swap23Mask -
theorem
swap23Mask_bounds -
def
swap23Class -
theorem
seedHingeIncidence_swap23 -
def
decoyClass4 -
def
decoyClass8 -
def
decoyClass12 -
theorem
seedHingeIncidence_decoy_zero -
def
hingeBoundaryClass -
theorem
hingeBoundary_incidence_pos -
def
classInSimplexNat -
theorem
simplex_class_count -
theorem
cell_covers_all_classes -
def
flatHessianOrbitForm -
def
seedOrbitAssembly -
theorem
seedOrbitAssembly_decoy_area -
def
supportProject -
theorem
seedOrbitAssembly_support_projection -
structure
Hinge4DFlatKernelStatus -
def
hinge4DFlatKernelStatus -
theorem
hinge4DFlatKernelStatus_flags