Encyclopedia Gravity Gravity Seven Gaps Stationarity Bridge Closure Quadratic Source Family Deficit N

ARTICLE 4 claims 4 theorems

Gravity Seven Gaps Stationarity Bridge Closure Quadratic Source Family Deficit N

A machine-checked theorem shows a specific family of source deficits is never zero, a small but necessary step in a larger derivation about how ratios emerge from a principle of stationarity.

The quadratic deficit family

In the Recognition Science framework, a ledger (a discrete record of events) can be studied through a cost (a forced price of recognition). A central question is how a ratio between two quantities emerges from a deeper principle of stationarity, where some action is minimized. The declaration quadraticSourceFamily_deficit_ne_zero is a small, precise result about one family of possible inputs to that question.

The family in question is defined by a simple formula: the deficit, a measure of imbalance at a point, is set to be proportional to the square of the mesh scale h, written as (n/kappa) * h^2. The theorem states that for any positive number of channels n, any nonzero coupling constant kappa, and any nonzero mesh scale h, this deficit is not zero. In plain terms, the imbalance never vanishes, no matter how fine the mesh becomes. The proof is a direct algebraic check: a product of nonzero terms cannot be zero.

This result is not an isolated curiosity. It is one of two theorems that together show this quadratic family is genuinely nontrivial. The other, quadraticSourceFamily_logRatio_pos, proves that the logarithm of the resulting ratio is always positive. These two facts are prerequisites for the family to be admitted into the framework's analysis. They show that the family produces real, nonzero effects at every scale, which is what makes it a valid test case for the derivation.

The importance lies in what the family is used for. The framework's library of formal theorems contains a constructor, recognitionRatioBridge_ofStationarity, that builds a bridge from stationarity to a ratio relation. This constructor requires a family of deficits that satisfies a certain admissibility condition. A previously considered family, where the deficit was linear in h, was shown to fail this condition. The quadratic family, by contrast, is proven admissible with uniform constants. The theorem quadraticSourceFamily_deficit_ne_zero is a key part of that proof, ensuring the family is not degenerate.

What this declaration does not claim is equally important. It does not claim that the quadratic family is the only valid one, nor does it claim anything about the physical meaning of the deficit. It is a purely mathematical statement about a specific formula. Most significantly, it does not claim that the bridge derivation works from the bare ledger alone. The framework is explicit that the deficit-source coupling is a constitutive model premise, not something forced by the ledger itself. This theorem is a supporting step within a larger, carefully scoped argument, not a standalone claim about the nature of reality.

THEOREM quadraticSourceFamily_deficit_ne_zero · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- **THEOREM (nontriviality of the family: nonzero deficit).** For
kappa ≠ 0 and every nonzero mesh h, the quadratic family's deficit is
nonzero: the admissibility above is about a genuinely sourced family, not
the trivial delta = 0 one. -/
theorem quadraticSourceFamily_deficit_ne_zero (n : ℕ) (hn : 1 ≤ n)
    (kappa h : ℝ) (hκ : kappa ≠ 0) (hh : h ≠ 0) :
    (quadraticSourceFamily n kappa).deficit h ≠ 0 := by
  have hn0 : (0 : ℝ) < n := by exact_mod_cast hn
  show (n : ℝ) / kappa * h ^ 2 ≠ 0
  exact mul_ne_zero (div_ne_zero (ne_of_gt hn0) hκ) (pow_ne_zero 2 hh)
THEOREM quadraticSourceFamily_logRatio_pos · IndisputableMonolith/Gravity/SevenGaps/StationarityBridgeClosure.lean
/-- **THEOREM (nontriviality of the family: nonzero log ratio).** For
kappa ≠ 0 and every nonzero mesh h, the family's stationary log ratio
log x(h) = n * arsinh(h^2) is strictly positive: the bridge relation the
admissibility certifies is a relation between genuinely nonzero
quantities. -/
theorem quadraticSourceFamily_logRatio_pos (n : ℕ) (hn : 1 ≤ n)
    (kappa h : ℝ) (hκ : kappa ≠ 0) (hh : h ≠ 0) :
    0 < Real.log ((quadraticSourceFamily n kappa).ratio h) := by
  have hn0 : (0 : ℝ) < n := by exact_mod_cast hn
  have hne : (n : ℝ) ≠ 0 := ne_of_gt hn0
  show 0 < Real.log (Real.exp
    ((n : ℝ) * Real.arsinh (kappa * ((n : ℝ) / kappa * h ^ 2) / n)))
  rw [Real.log_exp]
  have harg : kappa * ((n : ℝ) / kappa * h ^ 2) / n = h ^ 2 := by
    field_simp
  rw [harg]
  have hh2 : 0 < h ^ 2 :=
    lt_of_le_of_ne (sq_nonneg h) (Ne.symm (pow_ne_zero 2 hh))
  exact mul_pos hn0 (Real.arsinh_pos_iff.mpr hh2)
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

What this page does not claim

The quadratic family is the only admissible deficit family in the framework. The deficit itself has a direct physical meaning beyond its role in the formal model. The bridge derivation works from the bare RecognitionLedger without the 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