Pith. sign in
theorem

e_012020

proved
show as:
module
IndisputableMonolith.Gravity.Analysis.ReggeExactMidpointM2TTIdentity4DM2NumChunk01
domain
Gravity
line
153 · github
papers citing
none yet

plain-language theorem explainer

For the fixed index sextuple (0,1,2,0,2,0) on Fin 4, the folded numerator m2Num equals eight times the explicit kernel value explicitZ. Gravity analysts cite it when assembling the full 4D Regge midpoint M2–TT identity. The proof is a single kernel decide on the concrete integers.

Claim. For indices $a{=}0,\,b{=}1,\,c{=}2,\,d{=}0,\,i{=}2,\,j{=}0$ in $\mathrm{Fin}\,4$, the folded coupling numerator equals eight times the explicit integer kernel: $m_2^{\mathrm{num}}(0,1,2,0,2,0)=8\,Z_{\mathrm{expl}}(0,1,2,0,2,0)$.

background

This module is one of the 256-case decide chunks that certify the algebraic identity $m_2^{\mathrm{num}}=8,Z_{\mathrm{expl}}$ for the 4D Regge midpoint M2–TT kernel. The local setting is pure integer arithmetic on six Fin-4 indices: no continuum limit, no curvature hypotheses.

Upstream, $m_2^{\mathrm{num}}(a,b,c,d,i,j)$ is defined as the fold of a fixed coupling list, summing each contribution at those indices. The companion $Z_{\mathrm{expl}}$ is an explicit piecewise integer table on the same six indices (typical nonzero entries are $\pm 2,,4$). The claim is that the fold evaluates to eight times the table entry at one concrete point.

proof idea

One-line computational proof: by decide. Lean reduces both sides of the equality on the fixed Fin-4 sextuple to concrete integers (the fold of couplingZList versus 8 * explicitZ 0 1 2 0 2 0) and checks they match. No lemmas beyond the two definitions are invoked.

why it matters

Feeds the assembler m2Num_eq_eight_explicitZ, which states the identity for every sextuple in $(\mathrm{Fin},4)^6$ by exhaustive fin_cases. That global equality is the certified numerator form of the 4D Regge midpoint M2–TT identity used in the gravity analysis stack. The chunking (256 kernel decides) keeps each goal inside the decide budget while still covering the full discrete index space. No Recognition forcing-chain landmark (T5–T8, RCL, phi) is touched here; the result is pure discrete kernel bookkeeping inside the gravity layer.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.