Encyclopedia Gravity Gravity Seven Gaps Stationarity Bridge Closure Linear Deficit Family Not Is Admi

ARTICLE 3 claims 2 theorems 1 model

Gravity Seven Gaps Stationarity Bridge Closure Linear Deficit Family Not Is Admi

A machine-checked theorem kills a tempting shortcut in a derivation, forcing the framework to use a different family of input values.

A rejected shortcut

In the Recognition Science framework, a recognition event is a discrete record of some quantity, and the framework's cost is the forced price of that record. A central derivation builds a mathematical bridge: from a stationary cost-minimization problem, it constructs a ratio of recognition values, with a bound on the error. The bridge is meant to work as the mesh scale h, the spacing of the discrete records, shrinks toward zero. That limit is the whole point: the derivation should hold for a whole family of finer and finer meshes, not just one fixed mesh.

The tempting shortcut is to let the deficit, the input that drives the cost, shrink linearly with h. The panel that proposed this literal family, delta_m = 1/(m+1) with h_m proportional to 1/(m+1), makes the source strength kappa*delta/n exactly equal to h up to sign. But the framework's admissibility predicate requires the deficit to shrink at least quadratically: |delta(h)| ≤ C_K h² for some constant C_K. A linear family violates that for every constant as h approaches zero. The declaration linear_deficit_family_not_isAdmissible is a kernel-checked proof of exactly that incompatibility: for any positive h₀, any nonzero kappa, and any constants C_K and C_R, the linear family fails the admissibility predicate. It is a kill record for the literal form of the shortcut.

The theorem does not say the derivation is impossible. It says the linear family is the wrong input. The correctly typed analogue is the quadratic-deficit family, delta(h) = (n/kappa) h², so that kappa*delta/n = h². That family is genuinely nontrivial: its deficit is never zero, its log-ratio is positive, and it satisfies the admissibility predicate with uniform constants C_K = n/|kappa| and C_R = n*h0³/6, constants that do not depend on h. The theorem quadraticSourceFamily_isAdmissible proves this. So the derivation covers a real h → 0 family, not a single point.

What the declaration does not claim is also sharp. It does not claim the bridge construction itself fails; the constructor recognitionRatioBridge_ofStationarity still builds the bridge for any family that meets the domination bound. It does not claim the linear family is useless in every context, only that it fails this specific admissibility predicate. And it does not claim the derivation comes from the bare recognition ledger alone: the deficit-source coupling is a disclosed constitutive MODEL premise, inherited from HingeStationarityCore, and the flag derivation_from_bare_ledger stays false. The theorem is a precise negative result about one input family, and the positive result is the quadratic family that replaces it.

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]
THEOREM quadraticSourceFamily_isAdmissible · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- **THEOREM (T2, uniform admissibility of the quadratic family).** For
kappa ≠ 0 the quadratic-deficit family is admissible on (0, h0) with the
UNIFORM constants C_K = n/|kappa| and C_R = n * h0^3 / 6: both constants
sit OUTSIDE the mesh scale, per the admissibility predicate, so the
derivation covers a genuine h -> 0 family, not a single point. Proof:
`sourced_ratio_isAdmissible` (reused, not re-derived) with the curvature
bound an exact equality |delta(h)| = (n/|kappa|) h^2, followed by the
constant simplification |kappa|^3 (n/|kappa|)^3 h0^3/(6 n^2)
= n h0^3/6. (As in `sourced_ratio_isAdmissible`: for h0 <= 0 the predicate
is vacuously true; the statement carries content exactly when 0 < h0.) -/
theorem quadraticSourceFamily_isAdmissible (n : ℕ) (hn : 1 ≤ n)
    (h₀ kappa : ℝ) (hκ : kappa ≠ 0) :
    (quadraticSourceFamily n kappa).IsAdmissible h₀ kappa
      ((n : ℝ) / |kappa|) ((n : ℝ) * h₀ ^ 3 / 6) := by
  have hn0 : (0 : ℝ) < n := by exact_mod_cast hn
  have hne : (n : ℝ) ≠ 0 := ne_of_gt hn0
  have hκ' : |kappa| ≠ 0 := abs_ne_zero.mpr hκ
  have hδ : ∀ h ∈ Set.Ioo (0 : ℝ) h₀,
      |(n : ℝ) / kappa * h ^ 2| ≤ (n : ℝ) / |kappa| * h ^ 2 := by
    intro h _
    rw [abs_mul, abs_div, abs_of_pos hn0, abs_of_nonneg (sq_nonneg h)]
  have hbase := sourced_ratio_isAdmissible n hn h₀ kappa
    ((n : ℝ) / |kappa|) (fun h => (n : ℝ) / kappa * h ^ 2) hδ
  have hconst : |kappa| ^ 3 * ((n : ℝ) / |kappa|) ^ 3 * h₀ ^ 3
      / (6 * (n : ℝ) ^ 2) = (n : ℝ) * h₀ ^ 3 / 6 := by
    field_simp
  rw [← hconst]
  exact hbase
MODEL stationarityBridgeClosureStatus · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- The canonical status record (documentation, not new mathematics). -/
def stationarityBridgeClosureStatus : StationarityBridgeClosureStatus where
  constitutive_stationarity_bridge_closed := true
  derivation_from_bare_ledger := false

What this page does not claim

The linear family is useless in every context, only that it fails this specific admissibility predicate. The bridge construction itself fails; the constructor still builds the bridge for any family that meets the domination bound. The derivation comes from the bare recognition ledger alone; the deficit-source coupling is a disclosed constitutive MODEL premise.

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