Encyclopedia Gravity Gravity Analysis Regge Ttcontinuum Certificate Spike

ARTICLE 3 claims 3 theorems

Gravity Analysis Regge Ttcontinuum Certificate Spike

A machine-checked proof that a discrete gravity sum collapses to a simple continuum formula, with no free parameters.

The continuum certificate

In numerical relativity, the Regge calculus approximates curved spacetime by a lattice of flat simplices, and the Einstein equations become algebraic conditions on the edge lengths. The module under discussion takes one piece of that discrete machinery, a sum over six tetrahedral blocks, and proves a clean continuum limit: on the transverse-traceless constraints, the whole 216-term sum equals -(1/4) times the squared norm of the position vector times the squared Frobenius norm of the metric perturbation. The proof is carried out in a machine-checked library of formal theorems, so the algebraic identity is verified by the kernel rather than by hand.

The statement is precise. Let E be a symmetric, traceless 3x3 matrix representing a metric perturbation, and let x be a vector satisfying the transversality condition E·x = 0. The theorem tt_continuum_certificate then asserts that the sum of six block functions, each a literal transcription of 36 terms from the Regge action, equals -(1/4)|x|²||E||²_F. The proof proceeds by expanding each block with a ring tactic, which re-verifies the cancellation of the auxiliary parameters s2, s3, and p, and then discharges the resulting polynomial identity with an explicit cofactor certificate via linear_combination.

What makes this nontrivial is that the auxiliary parameters s2, s3, and p, which stand for sqrt 2, sqrt 3, and pi, are completely free in the block definitions. The theorem shows that despite their presence, the sum collapses to a form independent of them. This is a structural fact about the Regge action: the discrete sum knows about the continuum limit without being told. The result is a certificate in the sense that it provides a formal guarantee that the discrete-to-continuum passage is algebraically exact on the transverse-traceless subspace.

In Recognition Science, this certificate provides a bridge between the discrete ledger of recognition events and the smooth geometry of general relativity. The framework models gravity as a discrete record of events, and this theorem shows that the discrete Regge sum reproduces the continuum wave operator in the appropriate limit. The practical consequence is that the discrete theory is not an approximation to be patched, but an exact rewriting of the continuum physics on a lattice.

The theorem does not claim that the Regge action is the unique discrete action, nor does it address the dynamics of the lattice. It establishes one algebraic identity, fully verified, and leaves the physical interpretation of the discrete ledger as a separate question. What the reader can take away is a concrete example of how a discrete gravity sum, with all its apparent complexity, reduces to a simple continuum formula under the standard constraints.

THEOREM tt_continuum_certificate · IndisputableMonolith/Gravity/Analysis/ReggeTTContinuumCertificateSpike.lean
/-- TT continuum certificate: the literal 216-term per-tet sum (s2, s3, p
COMPLETELY FREE, standing for sqrt 2, sqrt 3, pi) equals
-(1/4) * |x|^2 * ||E||_F^2 on the TT constraints.  Proof: collapse each
per-tet block by `tetBlock*_eq` (kernel re-verifies the s2/s3/p
cancellation), then discharge the pure-QQ identity with the explicit offline
cofactor certificate via `linear_combination`. -/
theorem tt_continuum_certificate (E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p : ℝ)
    (hsym01 : E01 = E10) (hsym02 : E02 = E20) (hsym12 : E12 = E21)
    (htr : E00 + E11 + E22 = 0)
    (htrans0 : x0 * E00 + x1 * E10 + x2 * E20 = 0)
    (htrans1 : x0 * E01 + x1 * E11 + x2 * E21 = 0)
    (htrans2 : x0 * E02 + x1 * E12 + x2 * E22 = 0) :
    ((tetBlock0 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock1 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock2 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock3 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock4 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock5 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p))
    =
    -((1 : ℝ)/4) * (x0^2 + x1^2 + x2^2) * (E00^2 + E01^2 + E02^2 + E10^2 + E11^2 + E12^2 + E20^2 + E21^2 + E22^2) := by
  rw [tetBlock0_eq, tetBlock1_eq, tetBlock2_eq, tetBlock3_eq,
      tetBlock4_eq, tetBlock5_eq]
  linear_combination
      (E00*x0*x1/2 - E01*x0^2/4 + E01*x1^2/4 + E01*x2^2/8 + E02*x1*x2/4 - E10*x0^2/4 - E10*x1^2/4 - E10*x2^2/8 - E12*x0*x2/4 - E20*x1*x2/4 - E21*x0*x2/4 + E22*x0*x1/2) * hsym01
      + (E00*x0*x2/2 - E02*x0^2/4 + E02*x1^2/8 + E02*x2^2/4 + E11*x0*x2/2 - E12*x0*x1/4 - E20*x0^2/4 - E20*x1^2/8 - E20*x2^2/4 - E21*x0*x1/4) * hsym02
      + (E00*x1*x2/2 - E02*x0*x1/2 + E11*x1*x2/2 + E12*x0^2/8 - E12*x1^2/4 + E12*x2^2/4 - E21*x0^2/8 - E21*x1^2/4 - E21*x2^2/4) * hsym12
      + (-E00*x0^2/4 + E00*x1^2/4 + E00*x2^2/4 - E01*x0*x1 - E02*x0*x2/2 + E11*x0^2/4 - E11*x1^2/4 + E11*x2^2/4 - E12*x1*x2/2 + E22*x0^2/4 + E22*x1^2/4 + E22*x2^2/4) * htr
      + (E00*x0/2 + E01*x1/2 + E02*x2/2) * htrans0
      + (E01*x0/2 + E11*x1/2 + E12*x2/2) * htrans1
      + (-E00*x2/2 + E02*x0/2 - E11*x2/2 + E12*x1/2) * htrans2
THEOREM tetBlock0_eq · IndisputableMonolith/Gravity/Analysis/ReggeTTContinuumCertificateSpike.lean
/-- Tet 0 collapses to a pure-QQ polynomial (every s2/s3/p entry of G
carries a literal (0)^2 midpoint factor). -/
theorem tetBlock0_eq (E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p : ℝ) :
    tetBlock0 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p
    =
    (-E00^2*x2^2/32 - E00*E01*x2^2/16 - E00*E02*x2^2/32 - E00*E10*x2^2/16 - E00*E11*x0*x1/16 - E00*E11*x0*x2/16 - E00*E11*x1^2/32 - E00*E11*x1*x2/16 + E00*E11*x2^2/32 - E00*E12*x0*x1/16 + E00*E12*x0*x2/16 - E00*E12*x1^2/32 - E00*E12*x1*x2/16 - E00*E20*x2^2/32 - E00*E21*x0*x1/16 + E00*E21*x0*x2/16 - E00*E21*x1^2/32 - E00*E21*x1*x2/16 + E00*E22*x0^2/32 + E00*E22*x0*x1/8 + E00*E22*x0*x2/8 + 3*E00*E22*x1^2/16 + E00*E22*x1*x2/8 + E00*E22*x2^2/32 - E01^2*x2^2/32 - E01*E02*x2^2/32 - E01*E10*x2^2/16 + E01*E11*x0^2/32 + E01*E11*x2^2/16 + E01*E12*x0^2/32 + E01*E12*x0*x2/8 + E01*E12*x2^2/32 - E01*E20*x2^2/32 + E01*E21*x0^2/32 + E01*E21*x0*x2/8 + E01*E21*x2^2/32 - E01*E22*x0*x1/16 + E01*E22*x0*x2/16 - E01*E22*x1^2/32 - E01*E22*x1*x2/16 - E02*E10*x2^2/32 + E02*E11*x0^2/32 - E02*E11*x0*x2/8 + E02*E11*x2^2/32 - E02*E12*x0^2/32 - E02*E21*x0^2/32 - E02*E22*x0^2/32 - E10^2*x2^2/32 + E10*E11*x0^2/32 + E10*E11*x2^2/16 + E10*E12*x0^2/32 + E10*E12*x0*x2/8 + E10*E12*x2^2/32 - E10*E20*x2^2/32 + E10*E21*x0^2/32 + E10*E21*x0*x2/8 + E10*E21*x2^2/32 - E10*E22*x0*x1/16 + E10*E22*x0*x2/16 - E10*E22*x1^2/32 - E10*E22*x1*x2/16 + E11^2*x0^2/32 + E11^2*x2^2/32 + E11*E12*x0^2/16 + E11*E12*x2^2/32 + E11*E20*x0^2/32 - E11*E20*x0*x2/8 + E11*E20*x2^2/32 + E11*E21*x0^2/16 + E11*E21*x2^2/32 + E11*E22*x0^2/32 - E11*E22*x0*x1/16 - E11*E22*x0*x2/16 - E11*E22*x1^2/32 - E11*E22*x1*x2/16 - E12^2*x0^2/32 - E12*E20*x0^2/32 - E12*E21*x0^2/16 - E12*E22*x0^2/16 - E20*E21*x0^2/32 - E20*E22*x0^2/32 - E21^2*x0^2/32 - E21*E22*x0^2/16 - E22^2*x0^2/32) := by
  unfold tetBlock0
  ring

set_option maxHeartbeats 1600000 in
THEOREM tt_continuum_certificate · IndisputableMonolith/Gravity/Analysis/ReggeTTContinuumCertificateSpike.lean
/-- TT continuum certificate: the literal 216-term per-tet sum (s2, s3, p
COMPLETELY FREE, standing for sqrt 2, sqrt 3, pi) equals
-(1/4) * |x|^2 * ||E||_F^2 on the TT constraints.  Proof: collapse each
per-tet block by `tetBlock*_eq` (kernel re-verifies the s2/s3/p
cancellation), then discharge the pure-QQ identity with the explicit offline
cofactor certificate via `linear_combination`. -/
theorem tt_continuum_certificate (E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p : ℝ)
    (hsym01 : E01 = E10) (hsym02 : E02 = E20) (hsym12 : E12 = E21)
    (htr : E00 + E11 + E22 = 0)
    (htrans0 : x0 * E00 + x1 * E10 + x2 * E20 = 0)
    (htrans1 : x0 * E01 + x1 * E11 + x2 * E21 = 0)
    (htrans2 : x0 * E02 + x1 * E12 + x2 * E22 = 0) :
    ((tetBlock0 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock1 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock2 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock3 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock4 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p)
      + (tetBlock5 E00 E01 E02 E10 E11 E12 E20 E21 E22 x0 x1 x2 s2 s3 p))
    =
    -((1 : ℝ)/4) * (x0^2 + x1^2 + x2^2) * (E00^2 + E01^2 + E02^2 + E10^2 + E11^2 + E12^2 + E20^2 + E21^2 + E22^2) := by
  rw [tetBlock0_eq, tetBlock1_eq, tetBlock2_eq, tetBlock3_eq,
      tetBlock4_eq, tetBlock5_eq]
  linear_combination
      (E00*x0*x1/2 - E01*x0^2/4 + E01*x1^2/4 + E01*x2^2/8 + E02*x1*x2/4 - E10*x0^2/4 - E10*x1^2/4 - E10*x2^2/8 - E12*x0*x2/4 - E20*x1*x2/4 - E21*x0*x2/4 + E22*x0*x1/2) * hsym01
      + (E00*x0*x2/2 - E02*x0^2/4 + E02*x1^2/8 + E02*x2^2/4 + E11*x0*x2/2 - E12*x0*x1/4 - E20*x0^2/4 - E20*x1^2/8 - E20*x2^2/4 - E21*x0*x1/4) * hsym02
      + (E00*x1*x2/2 - E02*x0*x1/2 + E11*x1*x2/2 + E12*x0^2/8 - E12*x1^2/4 + E12*x2^2/4 - E21*x0^2/8 - E21*x1^2/4 - E21*x2^2/4) * hsym12
      + (-E00*x0^2/4 + E00*x1^2/4 + E00*x2^2/4 - E01*x0*x1 - E02*x0*x2/2 + E11*x0^2/4 - E11*x1^2/4 + E11*x2^2/4 - E12*x1*x2/2 + E22*x0^2/4 + E22*x1^2/4 + E22*x2^2/4) * htr
      + (E00*x0/2 + E01*x1/2 + E02*x2/2) * htrans0
      + (E01*x0/2 + E11*x1/2 + E12*x2/2) * htrans1
      + (-E00*x2/2 + E02*x0/2 - E11*x2/2 + E12*x1/2) * htrans2

What this page does not claim

The Regge action is the unique discrete action for gravity. The theorem establishes the dynamics of the lattice or the physical meaning of the discrete ledger. The identity holds for arbitrary metric perturbations without the transverse-traceless constraints.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Gravity/Analysis/ReggeTTContinuumCertificateSpike.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND