Encyclopedia Foundation Foundation Dalembert Ledger Factorization Combiner Unit Diagonal

ARTICLE 2 claims 2 theorems

Foundation Dalembert Ledger Factorization Combiner Unit Diagonal

In the Recognition Science framework, a single number, the value 6, pins down the cost of comparing a thing with itself.

The unit diagonal

The declaration combiner_unit_diagonal is a small but load-bearing step in the Recognition Science framework, a research program that derives physical and mathematical structure from the idea that reality keeps a ledger, a discrete record of recognition events, and that the cost of recognition is forced, not chosen. The declaration proves a theorem about a function called the combiner, which takes two costs and returns the cost of a compound comparison. The theorem states that when both inputs are 1, the combiner returns 6. This is not an arbitrary choice; it follows from the calibration of the cost function, which fixes the scale of the cost measurement.

To see why this matters, consider what the combiner does. The framework models comparisons between positive ratios, and the cost function J measures the mismatch between two things. When you compare a thing with itself, the ratio is 1 and the cost is 0. The combiner takes two such costs and produces the cost of a compound comparison. The unit diagonal, P(1,1) = 6, is the cost of comparing a self-comparison with another self-comparison. The number 6 is not fitted; it is forced by the calibration condition that the second derivative of the cost function at the identity equals 1. This single value, combined with symmetry and a linearity condition, pins down the entire form of the combiner: P(u,v) = 2uv + 2u + 2v.

The theorem itself is modest: it simply restates the assumption that P(1,1) = 6 as a conclusion. The real content is in the chain that leads to it. The framework proves that the combiner must be symmetric, that it must satisfy the zero boundary P(u,0) = 2u, and that it must be affine in each argument. The unit diagonal is the last piece. With these four properties, the framework's library of machine-checked formal theorems derives the full Recognition Composition Law, the polynomial that ultimately forces the golden ratio and the eight-tick cycle.

What the declaration does not claim is equally important. It does not prove that the unit diagonal must be 6 from first principles; it takes that value as a hypothesis, derived from calibration. The theorem only shows that if P(1,1) = 6, then P(1,1) = 6. It does not establish the calibration condition itself, nor does it prove the affine response property, which is encoded as an assumption rather than derived. The declaration is a link in a chain, not the whole chain.

THEOREM combiner_unit_diagonal · IndisputableMonolith/Foundation/DAlembert/LedgerFactorization.lean
/-- The unit diagonal `P(1, 1) = 6` follows from calibration.
When `J(x₀) = 1` (which exists by the intermediate value theorem
on a strictly convex cost), `P(1,1) = J(x₀²) + J(1)`.  The
calibration `(J∘exp)''(0) = 1` together with strict convexity
forces `J(x₀²) + J(1) = 6` at the canonical normalization. -/
theorem combiner_unit_diagonal
    (P : ℝ → ℝ → ℝ)
    (hP_zero : ∀ u, P u 0 = 2 * u)
    (hP_sym : ∀ u v, P u v = P v u)
    (hP_affine : ∀ u, ∃ α β, ∀ v, P u v = α * v + β)
    (hP11 : P 1 1 = 6) :
    P 1 1 = 6 := hP11
THEOREM ledger_forces_rcl · IndisputableMonolith/Foundation/DAlembert/LedgerFactorization.lean
/-- **Bridge B2 (unconditional)**: from ledger substitutivity and
regrouping, the RCL combiner `P(u,v) = 2uv + 2u + 2v` is forced. -/
theorem ledger_forces_rcl
    (J : ℝ → ℝ) (R : RegroupingInvariance J) :
    ∀ u v, R.combiner u v = 2 * u * v + 2 * u + 2 * v :=
  gate_forces_rcl R.combiner (regrouping_forces_gate J R)

What this page does not claim

The unit diagonal value 6 is not derived from first principles in this declaration; it is taken as a hypothesis. The affine response property is not proved in this module; it is encoded as an assumption. The calibration condition itself is not established by this 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/Foundation/DAlembert/LedgerFactorization.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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND