Encyclopedia Gravity Gravity Seven Gaps Recognition Ratio Bridge Ratio Bridge Separates Deficit Obser

ARTICLE 3 claims 2 theorems 1 model

Gravity Seven Gaps Recognition Ratio Bridge Ratio Bridge Separates Deficit Obser

A bridge between recognition and geometry keeps two different deficit measurements separate, and a machine-checked proof shows why that separation is needed.

Verify this page

Two kinds of deficit

In the Recognition Science framework, a ledger (a discrete record of recognition events with a forced cost) and a geometric surface each carry something called a deficit. The ledger deficit measures how much the cost of recognition exceeds its minimum, and it can never be negative. The geometric deficit measures how much a hinge in a triangulated surface deviates from flat, and it can be positive or negative, meaning the surface bends one way or the other.

An earlier proposed bridge assumed these two deficits were directly equal, with sign included. That form failed: the ledger deficit is nonnegative, while the geometric deficit is signed, so a direct equality would force a nonnegative quantity to equal a negative one. The framework's library records this as a refutation, not a mystery.

The current bridge, called the recognition-ratio bridge, avoids the contradiction by relating the logarithm of a positive ratio at each hinge to the geometric deficit, with a remainder term that vanishes in the exact case. The declaration ratioBridge_separates_deficit_observables proves, for a two-hinge witness family, that the geometric deficit can be positive at one hinge and negative at the other, while the induced ledger deficit stays nonnegative and is even under flipping the sign of the geometric deficit. In plain terms, the two deficits are different observables: the geometric one keeps the signed bending information, the ledger one does not.

The framework also proves that the J-cost of the ratio equals cosh(log x) minus 1, which depends only on the even part of the relation. This means flipping the sign of the geometric deficit leaves the cost unchanged. The bridge is a definitional choice, tagged as a model, and the derivation of the ratio relation from stationarity of the ledger action remains open.

What the declaration does not claim is that the two deficits are equal, or that the bridge is derived from first principles. It establishes consistency between the odd geometric deficit and the even ledger deficit on a specific witness family, not a general derivation. The remainder bound at finite mesh scale is recorded, but the limit as mesh scale goes to zero is not proved.

THEOREM ratioBridge_separates_deficit_observables · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean
ratioBridge_separates_deficit_observables · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean:258 
/-- **THEOREM (deficit-observable separation: the reconciliation).** For
every d > 0 the exact, unit-coupled two-hinge witness simultaneously has:

* a SIGNED geometric deficit (value d at hinge 0, strictly negative value
  -d at hinge 1), which the sign no-go forbids for the LEDGER deficit; and
* an induced genuine `RecognitionLedger` whose deficit is NONNEGATIVE at
  every cell (`RecognitionLedger.deficit_nonneg`, the engine behind
  `bridge_forces_nonneg_geometricDeficit`) and EVEN under the sign flip
  d -> -d (`ledger_family_deficit_even_of_ratio_parity`, via
  `twoHingeWitness_ledger_deficit_even`).

The no-gos constrain the ledger deficit; the paper's odd bridge stores the
signed information in log x, hence in the geometric deficit. The two
observables are separated by this witness, so the no-gos and the paper's
bridge are jointly consistent. -/
theorem ratioBridge_separates_deficit_observables (d : ℝ) (hd : 0 < d) :
    (twoHingeWitnessBridge d).remBound = 0 ∧
    (∀ σ, (twoHingeWitnessBridge d).kappa σ = 1) ∧
    (twoHingeWitnessBridge d).geometricDeficit 0 = d ∧
    (twoHingeWitnessBridge d).geometricDeficit 1 < 0 ∧
    (∀ σ, 0 ≤ RecognitionLedger.deficit
        (ratioBridgeLedger (twoHingeWitnessBridge d)) σ) ∧
    (∀ σ, RecognitionLedger.deficit
          (ratioBridgeLedger (twoHingeWitnessBridge (-d))) σ
        = RecognitionLedger.deficit
          (ratioBridgeLedger (twoHingeWitnessBridge d)) σ) := by
  refine ⟨rfl, fun _ => rfl, (twoHingeWitnessBridge_deficit d).1, ?_,
    fun σ => RecognitionLedger.deficit_nonneg _ σ,
    fun σ => twoHingeWitness_ledger_deficit_even d σ⟩
  rw [(twoHingeWitnessBridge_deficit d).2]
  linarith
THEOREM jcost_of_ratioBridge_cosh · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean
jcost_of_ratioBridge_cosh · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean:295 
/-- **THEOREM.** For any bridge and hinge, the J-cost of the comparison
ratio is cosh of its logarithm minus one. Since cosh is even, the ledger
cost is blind to the sign of log x_sigma. -/
theorem jcost_of_ratioBridge_cosh {H : Type*}
    (B : RecognitionRatioBridge H) (σ : H) :
    Cost.Jcost (B.xRatio σ)
      = Real.cosh (Real.log (B.xRatio σ)) - 1 := by
  conv_lhs => rw [← Real.exp_log (B.xRatio_pos σ)]
  exact Cost.Jcost_exp_cosh _
MODEL RecognitionRatioBridge · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean
RecognitionRatioBridge · IndisputableMonolith/Gravity/SevenGaps/RecognitionRatioBridge.lean:70 
/-- **MODEL (explicit hypothesis, the paper's Def 6.2 recognition-ratio
admissibility clause; NOT yet derived, derivation target is wave 1b).**

A recognition-ratio bridge on a hinge type `H` assigns to each hinge
`sigma` a positive comparison ratio `xRatio sigma`, a coupling
`kappa sigma`, and a SIGNED geometric deficit `geometricDeficit sigma`,
together with a mesh scale `meshScale` and a remainder constant `remBound`,
subject to the odd admissibility relation

  |log (xRatio sigma) - kappa sigma * geometricDeficit sigma|
    <= remBound * meshScale ^ 3.

Scope note: this records the paper's remainder clause AT A FIXED MESH; the
h -> 0 asymptotic family behind the O(h^3) notation is not yet formalized
(open, lane 2). Contrast with the REFUTED
`LedgerToHingeBridge.bridge_assumed` (ledger deficit = geometric deficit):
here the relation is carried by log x, which can take either sign, and the
reconciliation with the sign and parity no-gos is proved below
(`ratioBridge_admits_negative_deficit`,
`ratioBridge_separates_deficit_observables`). -/
structure RecognitionRatioBridge (H : Type*) where
  /-- The positive comparison ratio x_sigma at each hinge. -/
  xRatio : H → ℝ
  /-- Positivity of the comparison ratio. -/
  xRatio_pos : ∀ σ, 0 < xRatio σ
  /-- The hinge coupling kappa_sigma. -/
  kappa : H → ℝ
  /-- The SIGNED geometric deficit delta_sigma at each hinge. -/
  geometricDeficit : H → ℝ
  /-- The mesh scale h. -/
  meshScale : ℝ
  /-- The mesh scale is positive. -/
  meshScale_pos : 0 < meshScale
  /-- The remainder constant of the cubic-mesh clause. -/
  remBound : ℝ
  /-- The remainder constant is nonnegative. -/
  remBound_nonneg : 0 ≤ remBound
  /-- The odd admissibility relation: log x_sigma matches
  kappa_sigma * delta_sigma up to the cubic mesh remainder. -/
  ratio_relation : ∀ σ,
    |Real.log (xRatio σ) - kappa σ * geometricDeficit σ|
      ≤ remBound * meshScale ^ 3

What this page does not claim

The two deficits are equal. The bridge is derived from first principles. The remainder bound vanishes in the limit of zero mesh scale.

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/SevenGaps/RecognitionRatioBridge.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