Encyclopedia Gravity Gravity Seven Gaps Stationarity Bridge Closure

ARTICLE 5 claims 4 theorems 1 model

Gravity Seven Gaps Stationarity Bridge Closure

A bridge in the framework's library that derives a ratio relation from a stationary action, closing a previously open loop.

The stationarity bridge

The stationarity bridge closure is a result in the Recognition Science framework's machine-checked library of formal theorems. It addresses a specific gap: how a ratio relation, a central object in the framework, can be derived from a principle of stationarity rather than assumed. The module constructs a bridge, a formal structure that connects stationarity to the ratio relation, and proves that the bridge is inhabited, meaning the derivation is complete.

The construction starts with a ledger, a discrete record of events, and a cost function that assigns a price to each possible state. The module defines a specific action, a kind of total cost, that includes a deficit-source coupling. This coupling is a disclosed constitutive premise, a modeling choice about how deficits and sources interact. The key theorem, `stationaryRatio_cubic`, shows that the log of the ratio, derived from the unique minimizer of this action, satisfies a cubic bound: |log x* - c| ≤ (n/6) * h^3, where c is the total source strength and h is the mesh scale. This bound holds whenever the source strength is dominated by the mesh.

The module also resolves a subtlety about the family of admissible deficit functions. A naive linear family, where the deficit is proportional to the mesh, is shown to be inadmissible under the framework's own criteria. The correct family is quadratic in the mesh, and the module proves this family is genuinely nontrivial and satisfies the admissibility condition with uniform constants. This ensures the derivation covers a real limit as the mesh goes to zero, not just a single point.

The headline constructor, `recognitionRatioBridge_ofStationarity`, takes as input the channel count, mesh scale, and a source-domination bound. It does not take the ratio relation as a hypothesis; instead, it defines the ratio as the exponential of the total strain of the minimizer. The module then proves the ratio relation holds. A concrete example is instantiated with four channels, a mesh of 1/8, and signed deficits, demonstrating the bridge is non-vacuous. The status flags confirm the bridge is closed via this constitutive action, and explicitly deny that it is derived from the bare ledger alone, a route that is proven dead.

The consequence is that the framework now has a principled path from a stationary action to a ratio relation, with the error term under control. This is a step toward a fuller asymptotic object, a tower of bridges for all mesh scales, which remains a target for future work.

THEOREM stationarityBridgeClosureStatus_flags · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- Status flags record (rfl-forced; documentation, not new
mathematics). -/
theorem stationarityBridgeClosureStatus_flags :
    stationarityBridgeClosureStatus.constitutive_stationarity_bridge_closed
        = true ∧
      stationarityBridgeClosureStatus.derivation_from_bare_ledger = false :=
  ⟨rfl, rfl⟩
THEOREM stationaryRatio_cubic · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- **THEOREM (T1, the bridge-shaped cubic bound).** If the total source
strength c = kappa*delta is dominated by the mesh, |c| <= n*h, then the
sourced stationary log-ratio log x* = n * arsinh(c/n) (the log of the
exponential of the minimizer's total strain) matches c up to the
bridge-shaped cubic remainder:

  |log x* - c| <= (n/6) * h^3.

The h-dependence is EXPLICIT: h enters only through the domination
hypothesis, and the constant n/6 is inherited from the 1/6 of
`sourced_ratio_cubic_error` via |c|^3/(6 n^2) <= (n h)^3/(6 n^2)
= (n/6) h^3. The analysis is reused from `HingeStationarityCore`, not
re-derived. (No 0 <= h hypothesis is taken: it is implied by the
domination hypothesis, since 0 <= |c| <= n*h and n >= 1.) -/
theorem stationaryRatio_cubic (n : ℕ) (hn : 1 ≤ n) (c h : ℝ)
    (hdom : |c| ≤ (n : ℝ) * h) :
    |Real.log (Real.exp ((n : ℝ) * Real.arsinh (c / n))) - c|
      ≤ (n : ℝ) / 6 * h ^ 3 := by
  have hn0 : (0 : ℝ) < n := by exact_mod_cast hn
  have hne : (n : ℝ) ≠ 0 := ne_of_gt hn0
  rw [Real.log_exp]
  have hcube : |c| ^ 3 ≤ ((n : ℝ) * h) ^ 3 :=
    pow_le_pow_left₀ (abs_nonneg c) hdom 3
  have hden : (0 : ℝ) ≤ (6 * (n : ℝ) ^ 2)⁻¹ := by positivity
  calc |(n : ℝ) * Real.arsinh (c / n) - c|
      ≤ |c| ^ 3 / (6 * (n : ℝ) ^ 2) := sourced_ratio_cubic_error n hn c
    _ ≤ ((n : ℝ) * h) ^ 3 / (6 * (n : ℝ) ^ 2) := by
        rw [div_eq_mul_inv, div_eq_mul_inv]
        exact mul_le_mul_of_nonneg_right hcube hden
    _ = (n : ℝ) / 6 * h ^ 3 := by
        field_simp
THEOREM linear_deficit_family_not_isAdmissible · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
linear_deficit_family_not_isAdmissible · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean:318
/-- **THEOREM (kill record for the panel's literal linear family).** For
every n >= 1, kappa ≠ 0, h0 > 0 and EVERY pair of constants (C_K, C_R),
the linear-deficit sourced family delta(h) = (n/kappa) * h (the
mesh-indexed form of the panel's delta_m = 1/(m+1), h_m = |kappa|/(n(m+1)),
which has kappa*delta/n = h) is NOT admissible: the curvature conjunct
|delta(h)| <= C_K h^2 of `RecognitionRatioFamily.IsAdmissible` fails at
small h because a linear deficit cannot be dominated by h^2 uniformly.
This is why T2 is closed with the quadratic-deficit family below; the
deviation from the panel's literal spec is forced by the predicate's
curvature conjunct, and this theorem is the receipt. -/
theorem linear_deficit_family_not_isAdmissible (n : ℕ) (hn : 1 ≤ n)
    (h₀ kappa C_K C_R : ℝ) (hh₀ : 0 < h₀) (hκ : kappa ≠ 0) :
    ¬ (sourcedRatioFamily n kappa
        (fun h => (n : ℝ) / kappa * h)).IsAdmissible h₀ kappa C_K C_R := by
  intro hadm
  have hn0 : (0 : ℝ) < n := by exact_mod_cast hn
  have hk : 0 < |kappa| := abs_pos.mpr hκ
  set M := max C_K 0 with hMdef
  have hM0 : 0 ≤ M := le_max_right _ _
  have hden : 0 < |kappa| * (M + 1) := by positivity
  set h := min (h₀ / 2) ((n : ℝ) / (|kappa| * (M + 1))) with hdef
  have hhpos : 0 < h := lt_min (by linarith) (div_pos hn0 hden)
  have hhlt : h < h₀ := lt_of_le_of_lt (min_le_left _ _) (by linarith)
  obtain ⟨hcurv, _⟩ := hadm h ⟨hhpos, hhlt⟩
  have hcurv' : (n : ℝ) / |kappa| * h ≤ C_K * h ^ 2 := by
    have hc : |(n : ℝ) / kappa * h| ≤ C_K * h ^ 2 := hcurv
    rw [abs_mul, abs_div, abs_of_pos hn0, abs_of_pos hhpos] at hc
    exact hc
  have hCM : C_K * h ^ 2 ≤ M * h ^ 2 :=
    mul_le_mul_of_nonneg_right (le_max_left _ _) (sq_nonneg h)
  have e1 : (n : ℝ) * h ≤ |kappa| * M * h ^ 2 := by
    calc (n : ℝ) * h = |kappa| * ((n : ℝ) / |kappa| * h) := by
          field_simp
      _ ≤ |kappa| * (M * h ^ 2) :=
          mul_le_mul_of_nonneg_left (le_trans hcurv' hCM) hk.le
      _ = |kappa| * M * h ^ 2 := by ring
  have e2 : h * (|kappa| * (M + 1)) ≤ (n : ℝ) := by
    have hmin : h ≤ (n : ℝ) / (|kappa| * (M + 1)) := by
      rw [hdef]
      exact min_le_right _ _
    exact (le_div_iff₀ hden).mp hmin
  have e3 : h * (|kappa| * (M + 1)) * (M * h) ≤ (n : ℝ) * (M * h) :=
    mul_le_mul_of_nonneg_right e2 (mul_nonneg hM0 hhpos.le)
  have e4 : (n : ℝ) * h * (M + 1) ≤ |kappa| * M * h ^ 2 * (M + 1) :=
    mul_le_mul_of_nonneg_right e1 (by linarith)
  have hnh : 0 < (n : ℝ) * h := mul_pos hn0 hhpos
  nlinarith [e3, e4, hnh]
MODEL recognitionRatioBridge_ofStationarity · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- **THEOREM-tier constructor (T3, the headline).** Builds a
`RecognitionRatioBridge` from the constitutive deficit-source action data,
PROVING the `ratio_relation` field from J-stationarity.

Hypothesis audit (every hypothesis is structural; NONE is the ratio
relation or equivalent to it):
* `hn : 1 ≤ n` — at least one recognition channel (positivity side
  condition of `sourced_ratio_cubic_error`).
* `hh : 0 < h` — positive mesh scale (the structure's own
  `meshScale_pos` field).
* `hdom : ∀ σ, |kappa σ * geomDeficit σ| ≤ n * h` — source domination: the
  total source strength at each hinge is bounded by the mesh budget n*h.
  This bounds the INPUT data (coupling times deficit); it says nothing
  about xRatio, log xRatio, or the remainder, so it cannot smuggle the
  conclusion.

Fields produced BY DERIVATION:
* `xRatio σ := exp(n * arsinh(kappa σ * geomDeficit σ / n))` — DEFINED as
  the exponential of the total strain of the unique global minimizer of
  the sourced action `sourcedAction n (kappa σ * geomDeficit σ)`
  (`sourcedMinimizer`; uniqueness and global minimality are
  `sourced_unique_minimizer`, re-exported for this bridge as
  `ofStationarity_minimizer_grounding`).
* `remBound := n / 6` — the explicit constant inherited from the 1/6 of
  `sourced_ratio_cubic_error`.
* `ratio_relation` — PROVED, by `stationaryRatio_cubic`; not passed in.

MODEL disclosure: the sourced action's coupling term is the explicit
deficit-source constitutive choice of `HingeStationarityCore`. Every
bridge this constructor produces is derived from an explicit
deficit-source constitutive action plus J-stationarity, never from the
bare RecognitionLedger. -/
noncomputable def recognitionRatioBridge_ofStationarity {H : Type*}
    (n : ℕ) (hn : 1 ≤ n) (kappa geomDeficit : H → ℝ) (h : ℝ) (hh : 0 < h)
    (hdom : ∀ σ, |kappa σ * geomDeficit σ| ≤ (n : ℝ) * h) :
    RecognitionRatioBridge H where
  xRatio := fun σ =>
    Real.exp ((n : ℝ) * Real.arsinh (kappa σ * geomDeficit σ / n))
  xRatio_pos := fun _ => Real.exp_pos _
  kappa := kappa
  geometricDeficit := geomDeficit
  meshScale := h
  meshScale_pos := hh
  remBound := (n : ℝ) / 6
  remBound_nonneg := by positivity
  ratio_relation := fun σ =>
    stationaryRatio_cubic n hn (kappa σ * geomDeficit σ) h (hdom σ)
THEOREM ofStationarity_log_xRatio_eq_minimizer_strain · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
ofStationarity_log_xRatio_eq_minimizer_strain · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean:247
/-- **THEOREM (the derivation receipt).** The log of the constructed ratio
IS the total strain of the sourced minimizer with source
c = kappa σ * delta σ: this is the sense in which xRatio is defined FROM
the stationary point of the constitutive action, not posited. -/
theorem ofStationarity_log_xRatio_eq_minimizer_strain {H : Type*}
    (n : ℕ) (hn : 1 ≤ n) (kappa geomDeficit : H → ℝ) (h : ℝ) (hh : 0 < h)
    (hdom : ∀ σ, |kappa σ * geomDeficit σ| ≤ (n : ℝ) * h) (σ : H) :
    Real.log ((recognitionRatioBridge_ofStationarity n hn kappa geomDeficit
        h hh hdom).xRatio σ)
      = ∑ i, sourcedMinimizer n (kappa σ * geomDeficit σ) i := by
  rw [ofStationarity_log_xRatio n hn kappa geomDeficit h hh hdom σ]
  exact (stationaryLogRatio_total_strain n (kappa σ * geomDeficit σ)).symm

What this page does not claim

This module proves a derivation from the bare RecognitionLedger without any additional modeling premise. This module constructs the full asymptotic object of a tower of bridges for all mesh scales. This module provides a physical interpretation of the deficit-source coupling or the ratio relation.

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