EncodedTTHessianLichnerowiczResidualKernelFormulaData5
plain-language theorem explainer
Certificate packaging the residual edge-kernel matrix as Regge Hessian minus lattice Lichnerowicz on the encoded 5×5×5 periodic Freudenthal torus, plus a generator-map reconstruction of every residual entry from row coefficients. Gravity auditors cite it when chaining Track 1.D TT Hessian/Lichnerowicz reductions into MasterTheorem handoff endpoints. As a structure definition it only records the two equalities later of-constructors discharge.
Claim. A residual-kernel certificate on the encoded $5\times5\times5$ periodic Freudenthal torus consists of three edge-operator kernels (Regge Hessian, lattice Lichnerowicz, residual) and a residual row-coefficient map from periodic edges and TT normal-equation indices into $\mathbb{R}$, such that the residual kernel equals the entrywise encoded difference of the Regge and Lichnerowicz kernels, and each residual entry equals the periodic TT normal-equation generator map applied to those residual row coefficients at the corresponding edges.
background
Track 1.D opens the tensor/shear sector of weak-field gravity on Recognition Science lattices. The conformal Track 1.B ansatz assigns one scalar potential per vertex and induces edge-length changes by averaging endpoints; that slice cannot represent pure shear, hence cannot cover transverse-traceless gravitational-wave modes. This module separates independent edge perturbations from vertex-conformal ones and records the elementary rectangle obstruction for conformal strain.
The ambient space is the canonical encoded $5\times5\times5$ periodic Freudenthal torus. An encoded edge-operator kernel is a real matrix on the finite edge index set of that triangulation. The combined TT normal-equation index packages fixed conformal vertex-delta generators with fixed longitudinal vertex-vector (gauge) generators.
The residual under study is the already-subtracted difference between the discrete Regge Hessian and the lattice Lichnerowicz operator on edges. Packaging that residual as a kernel certificate lets finite calculations emit the subtracted matrix once, prove it is Regge minus Lichnerowicz, and compare it directly to a generator-map reconstruction.
proof idea
Structure definition, not a proved theorem. It declares three encoded edge kernels, a residual row-coefficient function on typed periodic edges and normal-equation indices, and two propositional fields any inhabitant must satisfy: the residual kernel equals the encoded edgewise residual of Regge Hessian minus lattice Lichnerowicz, and every residual entry equals the periodic TT normal-equation generator map applied to the residual row coefficients at the matching edges. Downstream of-constructors (from displacement-row data, raw origin-column data, etc.) build concrete inhabitants; the structure only fixes the certificate shape.
why it matters
Handoff node in the Track 1.D TT Hessian/Lichnerowicz reduction chain. MasterTheoremHandoffIntegration endpoints consume it: the residual-kernel formula reduction, the residual displacement-row formula reduction, the raw origin-column reduction, and the translated coefficient full-chain endpoint all require Nonempty of this certificate (or produce it via of-constructors). Those endpoints are the Track 7 consumption surface.
In the Recognition gravity program this is the discrete check that the Regge second variation agrees with the lattice wave operator up to controlled gauge and conformal pieces, on the D=3 lattice forced by the forcing chain (T8). The residual comparison is the finite audit target before continuum matching of transverse-traceless modes.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.