Gravity Recognition Ledger

The recognition ledger

In Recognition Science, the recognition ledger is a discrete record of comparison costs between cells in a finite lattice. It assigns a non-negative number to each ordered pair of cells, representing the cost of recognizing one cell in terms of another. The ledger is symmetric, so the cost from cell i to cell j equals the cost from j to i, and the cost of comparing a cell with itself is zero. This structure is the central bookkeeping device of recognition gravity, the framework's account of how spatial structure and gravitational action emerge from recognition events.

The ledger's defining constraint is a subadditivity condition. For any three cells i, j, and k, the cost from i to k is bounded by a gate function applied to the costs from i to j and from j to k. The gate is R(u,v) = 2uv + 2u + 2v. This is the forced composition law that the framework derives from its five plain conditions on cost; it is not chosen freely. The gate is symmetric and non-negative for non-negative inputs, and it reduces to 2v when u is zero, which keeps costs from blowing up when one leg of a comparison vanishes.

The formal development establishes several structural facts about this ledger. The total cost, the sum of all pairwise costs, is always non-negative. The total cost is zero if and only if the ledger is flat, meaning every pairwise cost is zero. A flat ledger always exists for any finite lattice, and its total cost is zero. The total cost also equals the sum of the per-cell deficits, where the deficit at a cell is the sum of costs involving that cell. These results are proved in a machine-checked library of formal theorems, with no axioms beyond the standard ones of the ambient type theory.

The ledger is used in three distinct ways in the framework. The continuum limit of the total ledger cost restricted to codimension-2 hinges equals the Regge action, a standard discrete form of the gravitational action. The radiation entropy at a retarded time, the page curve, is the von Neumann entropy of the reduced state obtained by tracing over cells on one side of a horizon boundary. And the vacuum ledger cost is the ground-state value of the total ledger cost over the full lattice. These are the framework's claims, not yet formalized as theorems; the formal development establishes the ledger's basic properties, not these applications.

What the formal development establishes, in plain language, is that the recognition ledger is a well-defined object with a clean mathematical character. It has a unique zero-cost state, the flat ledger, and its total cost behaves like a measure of deviation from flatness. This gives the framework a precise notion of what it means for a discrete structure to be curved: curvature is not a separate field but a property of the ledger's cost distribution. The flat ledger is the baseline, and any departure from it carries positive cost.

/-- 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

/-- 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

/-- 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 Λ)

/-- Total cost is the sum of deficits. -/
theorem totalCost_eq_sum_deficits {Λ : Type*} [Fintype Λ] [DecidableEq Λ]
    (L : RecognitionLedger Λ) : totalCost L = ∑ i, deficit L i :=
  rfl

What this page does not claim

The formal development does not prove that the continuum limit of the ledger cost equals the Regge action; that is a stated application, not a formalized theorem. The formal development does not establish the page curve or vacuum energy claims; these are stated uses of the ledger, not proved results. The gate function R(u,v) = 2uv + 2u + 2v is not derived in this formal development; it is taken as the forced composition law from the framework's cost theorem.

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: