Gravity Analysis Regge Exact Midpoint M2 Ttidentity4 Dm2 Num Chunk03 E 030000

The chunk's arithmetic

The declaration e_030000 is one entry in a large, machine-checked table of arithmetic facts. The table concerns a function called m2Num, which takes six numbers as input and returns a number, and another function called explicitZ with the same kind of input. The theorem e_030000 states that for the particular input 0 3 0 0 0 0, the value of m2Num equals 8 times the value of explicitZ. The proof is a direct computation: the statement is checked by evaluating both sides, a method the library calls "decide." This is a finite, exact verification, not an approximation or a probabilistic check.

The identity sits inside a larger project in the Recognition Science framework, which derives physical structure from a ledger of recognition events. This particular file, ReggeExactMidpointM2TTIdentity4D, appears to be part of a numerical verification related to a four-dimensional identity, likely connected to Regge calculus, a discrete approach to general relativity. The file name suggests a midpoint evaluation and an identity involving the m2Num function. The declaration itself, however, does not state or prove any general principle. It only confirms one line in a table of 256 such lines, as the docstring notes: "m2Num = 8·explicitZ, chunk 3 (256 kernel decides)."

What the declaration does not claim is as important as what it does. It does not establish that the identity holds for all inputs, only for the one specific six-tuple. It does not derive the identity from the framework's foundational axioms about recognition or cost. It does not interpret what m2Num or explicitZ physically mean; those meanings come from definitions elsewhere in the library, not from this theorem. The theorem is a computational brick, verified by the kernel, that some larger argument may use, but this single declaration carries no physical or conceptual weight on its own.

In the Recognition Science account, this kind of exact numerical check is the ground floor of the framework's credibility. The framework's library of formal theorems is machine-checked, meaning every step of every proof is verified by a computer kernel. The e_030000 declaration is a small, concrete example of that process: a specific arithmetic fact, proved by direct computation, with no gaps. A reader should see this as a reliability marker for the larger project, not as a standalone scientific result.

theorem e_033333 : m2Num 0 3 3 3 3 3 = 8 * explicitZ 0 3 3 3 3 3 := by decide

theorem e_033333 : m2Num 0 3 3 3 3 3 = 8 * explicitZ 0 3 3 3 3 3 := by decide

What this page does not claim

The declaration does not prove the identity for all inputs, only for the single six-tuple 0 3 0 0 0 0. The declaration does not derive the identity from the framework's foundational axioms about recognition or cost. The declaration does not assign physical meaning to m2Num or explicitZ.

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/ReggeExactMidpointM2TTIdentity4DM2NumChunk03.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: