Encyclopedia Foundation Foundation Primitive Recognition Calculus Prcchain Bridge
ARTICLE 4 claims 4 theorems
Foundation Primitive Recognition Calculus Prcchain Bridge
A machine-checked bridge shows that the framework's first physical output, the golden ratio, lives in a countable field, never needing the full continuum.
The bridge module
The golden ratio, φ = (1 + √5)/2, is the number that solves r² = r + 1. It appears throughout classical mathematics: as the ratio of diagonal to side in a regular pentagon, as the limit of ratios of consecutive Fibonacci numbers, and as the root of a quadratic that Euclid called the extreme and mean ratio. It is an irrational number, meaning it cannot be written as a fraction of two integers, yet it is algebraic: it solves a polynomial equation with integer coefficients. This page concerns a specific module in the Recognition Science framework that connects this classical constant to the framework's own machinery.
The module is called the foundation primitive recognition calculus prcchain bridge. In plain terms, it welds two parts of the framework together. The first part is the cost, a function that measures the price of a recognition event, where a recognition event is a discrete act of matching one thing to another. The second part is the chain of forced outputs that the framework derives from that cost. The bridge module proves, in a machine-checked library of formal theorems, that the cost's logarithm has a second derivative of exactly 1 at the unit point, and that the golden ratio belongs to a countable field the framework calls its minimal field.
The key equation is J(eᵗ) = cosh(t) − 1. In words, the cost function J, when its input is written as an exponential, equals the hyperbolic cosine minus one. This is the calibrated member of a family of costs, the one whose log-curvature at the unit is exactly 1. The bridge proves this equation and the curvature fact as theorems. It then proves that φ, the number 8, and the number 3 all belong to the same countable field, and that this field is countable: its elements can be listed one after another, unlike the real numbers as a whole, which cannot.
What this establishes is that the framework's forcing chain, which derives φ, the eight-tick cycle, and three spatial dimensions from the cost, runs entirely on a countable carrier. The continuum of real numbers is never needed as the home of any rung in that chain. This is a structural fact about the framework's own construction, not a claim about physical space itself. It means the framework's first physical output, the golden ratio, is not an arbitrary real number pulled from a continuous range, but an element of a small, explicitly built field that the framework can describe without invoking the uncountable continuum.
Within the framework, this bridge matters because it sharpens the claim that the chain is self-contained. The cost feeds the chain, and every named output of the chain, the ratio φ, the cadence 8, the dimension 3, sits inside the countable field. The continuum is not the carrier of the framework's own derivations. This is a theorem about the framework's internal structure, proved in the machine-checked library, and it clarifies what kind of mathematical object the framework's outputs are: they are countable-field elements, not arbitrary reals.
THEOREM jcost_log_eq_clog_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- `Cost.Jcost` in log coordinates is the `c = 1` member of the δ-forced cost
family: `Jcost(eᵗ) = cosh(1·t) − 1`. -/
theorem jcost_log_eq_clog_one (t : ℝ) :
Cost.Jcost (Real.exp t) = Real.cosh (1 * t) - 1 := by
simp only [Cost.Jcost, one_mul, Real.cosh_eq, Real.exp_neg]
THEOREM jcost_logCurvature_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- The RS chain's cost entry is the *calibrated* δ cost: its log-curvature at the
unit is exactly 1. So `Cost.Jcost` is not merely a member of the δ-forced gauge
family; it is the gauge-fixed (unit = 1) member that `Calibration` singles out as
J. -/
theorem jcost_logCurvature_one :
deriv (deriv (fun t => Cost.Jcost (Real.exp t))) 0 = 1 := by
have hfun : (fun t => Cost.Jcost (Real.exp t))
= (fun t => Real.cosh (1 * t) - 1) := by
funext t; exact jcost_log_eq_clog_one t
rw [hfun, Calibration.logCurvature 1]
norm_num
THEOREM phi_in_minimal_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- The T6 output φ is a countable-field element: it lives in the minimal RS
field, never requiring the uncountable continuum. -/
theorem phi_in_minimal_field : Real.goldenRatio ∈ MinimalField.rsField :=
MinimalField.rsField_mem_phi
THEOREM rs_chain_all_rungs_in_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- **Item 3, sharpened: every chain output lands in the countable field.** The
calibrated δ cost feeds the chain, and each of the chain's named outputs, the base
ratio φ (T6), the eight-tick cadence 8 = 2³ (T7), and the spatial dimension 3
(T8), is an element of the countable RS field. The forcing chain runs end to end on
a countable carrier; the continuum is never the home of any rung. -/
theorem rs_chain_all_rungs_in_field :
deriv (deriv (fun t => Cost.Jcost (Real.exp t))) 0 = 1
∧ Real.goldenRatio ∈ MinimalField.rsField
∧ (8 : ℝ) ∈ MinimalField.rsField
∧ (3 : ℝ) ∈ MinimalField.rsField
∧ (MinimalField.rsField : Set ℝ).Countable :=
⟨jcost_logCurvature_one, phi_in_minimal_field,
MinimalField.rsField_eight_tick, MinimalField.rsField_dimension,
MinimalField.rsField_countable⟩
What this page does not claim
The bridge does not prove that physical space itself is countable. The bridge does not derive the golden ratio from the cost; it proves that the golden ratio, already derived elsewhere, lies in the countable field. The bridge does not claim that the cost function is the only function with log-curvature 1; it identifies the calibrated member of a family.
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/PrimitiveRecognitionCalculus/PRCChainBridge.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:
- What exactly is the minimal field, and how is it constructed?
- Why does countability of the carrier matter for the framework's physical claims?
- How does the bridge module relate to the forcing chain that derives φ, 8, and 3?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM jcost_log_eq_clog_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- `Cost.Jcost` in log coordinates is the `c = 1` member of the δ-forced cost family: `Jcost(eᵗ) = cosh(1·t) − 1`. -/ theorem jcost_log_eq_clog_one (t : ℝ) : Cost.Jcost (Real.exp t) = Real.cosh (1 * t) - 1 := by simp only [Cost.Jcost, one_mul, Real.cosh_eq, Real.exp_neg]The cost function J, when its input is written as an exponential, equals the hyperbolic cosine minus one, J(eᵗ) = cosh(t) − 1. jcost_log_eq_clog_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.leanTHEOREM jcost_logCurvature_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- The RS chain's cost entry is the *calibrated* δ cost: its log-curvature at the unit is exactly 1. So `Cost.Jcost` is not merely a member of the δ-forced gauge family; it is the gauge-fixed (unit = 1) member that `Calibration` singles out as J. -/ theorem jcost_logCurvature_one : deriv (deriv (fun t => Cost.Jcost (Real.exp t))) 0 = 1 := by have hfun : (fun t => Cost.Jcost (Real.exp t)) = (fun t => Real.cosh (1 * t) - 1) := by funext t; exact jcost_log_eq_clog_one t rw [hfun, Calibration.logCurvature 1] norm_numThe cost's logarithm has a second derivative of exactly 1 at the unit point. jcost_logCurvature_one · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.leanTHEOREM phi_in_minimal_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- The T6 output φ is a countable-field element: it lives in the minimal RS field, never requiring the uncountable continuum. -/ theorem phi_in_minimal_field : Real.goldenRatio ∈ MinimalField.rsField := MinimalField.rsField_mem_phiThe golden ratio belongs to the countable minimal field of the framework. phi_in_minimal_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.leanTHEOREM rs_chain_all_rungs_in_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean
/-- **Item 3, sharpened: every chain output lands in the countable field.** The calibrated δ cost feeds the chain, and each of the chain's named outputs, the base ratio φ (T6), the eight-tick cadence 8 = 2³ (T7), and the spatial dimension 3 (T8), is an element of the countable RS field. The forcing chain runs end to end on a countable carrier; the continuum is never the home of any rung. -/ theorem rs_chain_all_rungs_in_field : deriv (deriv (fun t => Cost.Jcost (Real.exp t))) 0 = 1 ∧ Real.goldenRatio ∈ MinimalField.rsField ∧ (8 : ℝ) ∈ MinimalField.rsField ∧ (3 : ℝ) ∈ MinimalField.rsField ∧ (MinimalField.rsField : Set ℝ).Countable := ⟨jcost_logCurvature_one, phi_in_minimal_field, MinimalField.rsField_eight_tick, MinimalField.rsField_dimension, MinimalField.rsField_countable⟩The chain's named outputs, the ratio φ, the cadence 8, and the dimension 3, all lie in the countable minimal field. rs_chain_all_rungs_in_field · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCChainBridge.lean