Foundation Ledger Canonicality

The canonical ledger

A ledger, in the plainest sense, is a discrete record of events. Recognition Science begins with the idea that reality keeps such a record, and that each event carries a cost of being recognized. The question behind foundation ledger canonicality is stark: if the ledger has no external knobs, no free parameters, what shape must that cost take? The answer, proved in a machine-checked library of formal theorems, is that any cost function satisfying five plain conditions must equal J(x) = (x + 1/x)/2 - 1. The conditions are reciprocal symmetry, zero cost at unity, strict convexity, continuity, and a calibration fixing the second derivative at 1.

The classical mathematics here is a uniqueness theorem for a functional equation. The equation J(x) = J(1/x) with J(1) = 0 plus convexity and continuity has a one-parameter family of solutions, not a single one. The calibration condition, which sets the log-curvature at 1, selects the unique member J(x) = (x + 1/x)/2 - 1. This is the only cost that satisfies all five axioms. The proof runs in the framework's library, and the result is unconditional: no hidden assumptions, no free parameters, no external input beyond the axioms themselves.

The module that establishes this is a formal structure called a zero-parameter local conserved comparison ledger. It packages five ingredients: a countable set of states, a local binary comparison with a symmetric cost, a conserved scalar quantity called log-charge, a trivial parameter record, and closure under composition. The name is long, but the idea is simple. The ledger can only compare events in pairs, it keeps a conserved number, and it has no dials to turn. Every downstream emergence theorem, the hierarchy, factorization, neutral dynamics, consumes this single interface.

In Recognition Science, this canonical ledger is the foundation. The framework models the universe as such a ledger, and the uniqueness theorem forces the cost function. From there the framework proves, in order, the golden ratio as the unique self-similar scaling, an eight-tick recognition cycle, the number 2^3, and three spatial dimensions. The ledger is the primitive object; everything else follows from it. The module also defines the neutral sector, the set of states with zero charge, and classes for multilevel and local composition, which are the scaffolding for the hierarchy theorems.

The consequence for a reader is concrete. The framework does not choose a cost function, it derives one. The five axioms are plain and checkable, and the uniqueness is proved, not assumed. This is the difference between a model with parameters and a theory with none. The ledger canonicality result is the reason the framework can claim to be unconditional: it starts with a discrete record and ends with a forced cost, and from that cost, the rest of the structure follows.

/-- A comparison cost on positive reals satisfying the minimal ledger
axioms: reciprocal symmetry, unit normalization, strict convexity,
continuity, and calibration. -/
structure AdmissibleCost where
  J : ℝ → ℝ
  reciprocal_sym : ∀ x : ℝ, 0 < x → J x = J (x⁻¹)
  unit_norm : J 1 = 0
  strict_convex : StrictConvexOn ℝ (Set.Ioi 0) J
  continuous : ContinuousOn J (Set.Ioi 0)
  calibration : (deriv (deriv (fun t => J (Real.exp t)))) 0 = 1

/-- A comparison cost on positive reals satisfying the minimal ledger
axioms: reciprocal symmetry, unit normalization, strict convexity,
continuity, and calibration. -/
structure AdmissibleCost where
  J : ℝ → ℝ
  reciprocal_sym : ∀ x : ℝ, 0 < x → J x = J (x⁻¹)
  unit_norm : J 1 = 0
  strict_convex : StrictConvexOn ℝ (Set.Ioi 0) J
  continuous : ContinuousOn J (Set.Ioi 0)
  calibration : (deriv (deriv (fun t => J (Real.exp t)))) 0 = 1

What this page does not claim

The module does not prove the golden ratio or any downstream emergence theorem; it only defines the primitive ledger structure. The five axioms are not claimed to be the only possible axioms for a cost function, only that they force this one.

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/Foundation/LedgerCanonicality.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: