pith. sign in
module module high

IndisputableMonolith.Gravity.ReggeCalculus

show as:
view Lean formalization →

ReggeCalculus supplies the core geometric primitives for 4D Regge calculus: 4-simplices fixed by ten edge lengths, triangles, tetrahedra, dihedral angles, and deficit angles. Workers on discrete gravity models cite these definitions when building lattice approximations to general relativity. The module is purely definitional, establishing basic relations such as flat deficit zero without deeper theorems.

claimA $4$-simplex has five vertices and ten edges whose lengths fix the geometry. Dihedral angles are obtained from edge lengths via the cosine law; deficit angles measure curvature at hinges. Flat configurations satisfy zero deficit.

background

The module imports Constants, where the RS time quantum satisfies $\tau_0 = 1$ tick. It introduces Simplex4D as the $4$-simplex with five vertices and $\binom{5}{2}=10$ edges, together with Triangle, Tetrahedron, HingeData, dihedral_from_cosine, deficit_angle, and flat_deficit_zero. These objects encode the discrete geometry of Regge calculus inside the Recognition Science framework.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The definitions feed DiscreteBianchi, which formalizes the discrete Bianchi identity following Hamber and Kagel, and NonlinearConvergence, which axiomatizes the Cheeger-Müller-Schrader convergence of the Regge action to the Einstein-Hilbert action at $O(a^2)$. It supplies the simplicial building blocks required by both downstream results.

scope and limits

used by (2)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (24)