e_320301
plain-language theorem explainer
Pointwise identity: the Regge midpoint mass-squared numerator at multi-index (3,2,0,3,0,1) equals eight times the explicit kernel value there. Gravity analysts cite it as one cell of the 4D midpoint M2–TT kernel certification. The proof is a pure kernel decide on two concrete integers.
Claim. For the multi-index $(a,b,c,d,i,j)=(3,2,0,3,0,1)$ in $(\mathrm{Fin}\,4)^6$, the folded coupling numerator $m_2^{\mathrm{num}}(a,b,c,d,i,j)$ equals $8$ times the explicit integer kernel $Z(a,b,c,d,i,j)$.
background
In the 4D Regge midpoint analysis, the mass-squared numerator is assembled by folding a fixed coupling list: each term contributes an integer depending on six $\mathrm{Fin},4$ indices, and $m_2^{\mathrm{num}}$ is that fold starting from zero. The companion map $Z_{\mathrm{explicit}}$ is a closed-form integer table on the same six indices (nonzero only on a sparse set of patterns such as paired equal legs with values $\pm 2,4$).
This module is chunk 14 of the exhaustive certification that $m_2^{\mathrm{num}}=8\cdot Z_{\mathrm{explicit}}$ at every multi-index. The local setting is pure integer arithmetic on a finite domain: no continuum limit or variational argument is invoked inside the chunk.
proof idea
Both sides evaluate to concrete integers once the six indices are fixed. The tactic decide runs the kernel decision procedure on the resulting closed integer equality and closes the goal. No lemmas beyond the definitions of the numerator fold and the explicit table are required.
why it matters
The parent assembly theorem m2Num_eq_eight_explicitZ states the identity for all six indices and discharges it by nested fin_cases; each leaf is one of these chunk theorems. Establishing the factor-of-eight match between the folded coupling numerator and the explicit kernel is the algebraic core of the Regge exact midpoint M2–TT identity in 4D, which sits in the gravity side of the Recognition stack (discrete curvature bookkeeping compatible with the eight-tick and $D=3$ forcing landmarks). Without the pointwise cells, the universal statement cannot be certified computationally.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.