Encyclopedia Gravity Gravity Recognition Ledger Recognition Ledger One Statement
ARTICLE 4 claims 4 theorems
Gravity Recognition Ledger Recognition Ledger One Statement
A single theorem packages the core facts about a bookkeeping structure for gravity: it exists, it costs nothing when flat, and its cost is never negative.
The ledger's one statement
A ledger, in this framework, is a discrete record of events, and here the record tracks the cost of comparing every pair of cells in a finite lattice. The declaration recognition_ledger_one_statement bundles four properties of that record into one theorem. First, for any finite lattice, at least one such ledger exists. Second, the special ledger that assigns zero cost to every comparison has total cost zero. Third, every ledger's total cost is non-negative. Fourth, a ledger has total cost zero if and only if it is flat, meaning every individual comparison cost is zero.
The four properties are not independent curiosities; they form the consistency backbone for the framework's account of gravity. The existence property guarantees the bookkeeping structure is never empty. The flatness equivalence gives a clean characterization: zero total cost is exactly the absence of any recognition cost anywhere. The non-negativity property ensures the total cost behaves like a physical quantity that can be minimized, rather than an unbounded formal sum. Together they let the framework treat the ledger as a well-defined object with a meaningful ground state.
The theorem is proved in the framework's machine-checked library of formal theorems, with no unproved assumptions internal to the framework. It does not, however, claim that this ledger reproduces any specific gravitational phenomenon. The docstring lists three uses, including the continuum limit equaling the Regge action and the page curve, but those are separate statements, not part of this one theorem. The declaration is a structural result about the bookkeeping object itself, not a derivation of Einstein's equations or any observational prediction.
What the theorem changes is the status of the ledger as a starting point. Before it, one might worry the structure is inconsistent or that flatness is an arbitrary special case. After it, the framework has a certified foundation: the ledger exists, has a zero-cost ground state, and flatness is exactly the condition of zero total cost. That is the platform on which the gravitational claims are meant to stand, and it is the only thing this particular declaration establishes.
THEOREM recognitionLedgerCert_inhabited · IndisputableMonolith/Gravity/RecognitionLedger.lean
theorem recognitionLedgerCert_inhabited :
Nonempty RecognitionLedgerCert :=
⟨recognitionLedgerCert⟩
THEOREM flatLedger_totalCost_zero · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The flat ledger has zero total cost. -/
theorem flatLedger_totalCost_zero (Λ : Type*) [Fintype Λ] [DecidableEq Λ] :
totalCost (flatLedger Λ) = 0 :=
(totalCost_eq_zero_iff_flat _).mpr (flatLedger_isFlat Λ)
THEOREM totalCost_nonneg · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The total cost is non-negative. -/
theorem totalCost_nonneg {Λ : Type*} [Fintype Λ] [DecidableEq Λ]
(L : RecognitionLedger Λ) : 0 ≤ totalCost L := by
unfold totalCost
apply Finset.sum_nonneg
intro i _
apply Finset.sum_nonneg
intro j _
exact L.nonneg i j
THEOREM totalCost_eq_zero_iff_flat · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The total cost vanishes iff the ledger is flat. -/
theorem totalCost_eq_zero_iff_flat {Λ : Type*} [Fintype Λ] [DecidableEq Λ]
(L : RecognitionLedger Λ) : totalCost L = 0 ↔ isFlat L := by
constructor
· intro h0
unfold isFlat
intro i j
unfold totalCost at h0
have hsums : ∀ x ∈ Finset.univ, ∑ y : Λ, L.cost x y = 0 := by
rwa [Finset.sum_eq_zero_iff_of_nonneg
(fun x _ => Finset.sum_nonneg (fun y _ => L.nonneg x y))] at h0
have h0i := hsums i (Finset.mem_univ i)
have hsumj : ∀ y ∈ Finset.univ, L.cost i y = 0 := by
rwa [Finset.sum_eq_zero_iff_of_nonneg (fun y _ => L.nonneg i y)] at h0i
exact hsumj j (Finset.mem_univ j)
· intro hf
unfold totalCost
apply Finset.sum_eq_zero
intro i _
apply Finset.sum_eq_zero
intro j _
exact hf i j
What this page does not claim
The theorem does not derive any specific gravitational phenomenon, such as the Einstein field equations or the Regge action. The theorem does not assert that the ledger is unique for a given lattice. The theorem does not claim the framework's account of gravity is empirically confirmed.
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/RecognitionLedger.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:
- How does the continuum limit of the total ledger cost recover the Regge action?
- What conditions make the radiation entropy equal the von Neumann entropy of a reduced state?
- How is the vacuum ledger cost related to the ground state of the substrate lattice?
- What physical content does the RCL subadditivity gate carry beyond its algebraic form?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM recognitionLedgerCert_inhabited · IndisputableMonolith/Gravity/RecognitionLedger.lean
theorem recognitionLedgerCert_inhabited : Nonempty RecognitionLedgerCert := ⟨recognitionLedgerCert⟩for any finite lattice, at least one such ledger exists recognitionLedgerCert_inhabited · IndisputableMonolith/Gravity/RecognitionLedger.leanTHEOREM flatLedger_totalCost_zero · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The flat ledger has zero total cost. -/ theorem flatLedger_totalCost_zero (Λ : Type*) [Fintype Λ] [DecidableEq Λ] : totalCost (flatLedger Λ) = 0 := (totalCost_eq_zero_iff_flat _).mpr (flatLedger_isFlat Λ)the special ledger that assigns zero cost to every comparison has total cost zero flatLedger_totalCost_zero · IndisputableMonolith/Gravity/RecognitionLedger.leanTHEOREM totalCost_nonneg · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The total cost is non-negative. -/ theorem totalCost_nonneg {Λ : Type*} [Fintype Λ] [DecidableEq Λ] (L : RecognitionLedger Λ) : 0 ≤ totalCost L := by unfold totalCost apply Finset.sum_nonneg intro i _ apply Finset.sum_nonneg intro j _ exact L.nonneg i jevery ledger's total cost is non-negative totalCost_nonneg · IndisputableMonolith/Gravity/RecognitionLedger.leanTHEOREM totalCost_eq_zero_iff_flat · IndisputableMonolith/Gravity/RecognitionLedger.lean
/-- The total cost vanishes iff the ledger is flat. -/ theorem totalCost_eq_zero_iff_flat {Λ : Type*} [Fintype Λ] [DecidableEq Λ] (L : RecognitionLedger Λ) : totalCost L = 0 ↔ isFlat L := by constructor · intro h0 unfold isFlat intro i j unfold totalCost at h0 have hsums : ∀ x ∈ Finset.univ, ∑ y : Λ, L.cost x y = 0 := by rwa [Finset.sum_eq_zero_iff_of_nonneg (fun x _ => Finset.sum_nonneg (fun y _ => L.nonneg x y))] at h0 have h0i := hsums i (Finset.mem_univ i) have hsumj : ∀ y ∈ Finset.univ, L.cost i y = 0 := by rwa [Finset.sum_eq_zero_iff_of_nonneg (fun y _ => L.nonneg i y)] at h0i exact hsumj j (Finset.mem_univ j) · intro hf unfold totalCost apply Finset.sum_eq_zero intro i _ apply Finset.sum_eq_zero intro j _ exact hf i ja ledger has total cost zero if and only if it is flat totalCost_eq_zero_iff_flat · IndisputableMonolith/Gravity/RecognitionLedger.lean