Foundation Phi Forcing Derived Closure Forces Golden Equation

The golden equation

The golden ratio, usually written φ, is the number that satisfies r² = r + 1. Its value is (1 + √5)/2, about 1.618. Euclid knew it as the division of a line so that the whole is to the longer part as the longer part is to the shorter. It appears in pentagons, in the Fibonacci sequence, and in many natural spirals.

A geometric sequence is a list of numbers where each is a fixed multiple of the previous one: 1, r, r², r³, and so on. The question is what happens if you require such a sequence to be closed under a simple operation: adding two terms always gives another term in the sequence. For the first two terms, 1 and r, their sum is 1 + r. Closure demands this sum be some term in the sequence, and the simplest choice is the next one, r². That single requirement, 1 + r = r², is exactly the golden equation. The positive solution is φ; the other solution is negative and is excluded by the requirement that scales be positive.

In Recognition Science, a framework that models reality as a discrete record of events called a ledger, this closure rule is not arbitrary. The framework's cost function J(x) = ½(x + 1/x) − 1 measures the cost of recognizing a scale x. When two independent events combine, their costs add. For the scale structure to respect this additivity, scales themselves must combine by addition, which is exactly the operation the closure rule uses. The theorem closure_forces_golden_equation states this result formally: for any geometric scale sequence that is closed under this composition, the ratio must satisfy r² = r + 1.

The framework's machine-checked library of formal theorems proves this in full. The theorem takes a geometric sequence, assumes the closure condition 1 + r = r², and derives the golden equation. A companion theorem, closed_ratio_is_phi, goes further and identifies the ratio as φ itself. The derivation is short: unfold the definitions, simplify the powers, and rearrange. The significance is that the golden ratio is not put in by hand; it is forced by the closure axiom alone.

What this does not claim is that the closure axiom is itself derived. The theorem takes closure as a premise; it does not prove why the ledger must be closed. That deeper question, why the ledger exhibits this closure, is a separate matter. The theorem also does not claim that every geometric sequence is closed, only that if one is, its ratio is φ. It says nothing about what happens with more than two terms, or with different composition rules. The result is a conditional statement: given closure, the golden ratio follows.

/-- **THEOREM**: Closure forces the golden ratio equation.

If a geometric scale sequence is closed under additive composition,
then the ratio r must satisfy r² = r + 1. -/
theorem closure_forces_golden_equation (S : GeometricScaleSequence)
    (h_closed : S.isClosed) : S.ratio ^ 2 = S.ratio + 1 := by
  -- Unfold the closure condition
  unfold GeometricScaleSequence.isClosed at h_closed
  unfold ledgerCompose at h_closed
  unfold GeometricScaleSequence.scale at h_closed
  -- h_closed : r^0 + r^1 = r^2
  -- This simplifies to: 1 + r = r^2
  simp only [pow_zero, pow_one] at h_closed
  -- Rearrange to r^2 = r + 1
  linarith

/-- **THEOREM**: The unique positive closed ratio is φ.

Combining with the previous theorem: the only positive ratio that
makes a geometric scale sequence closed is φ = (1 + √5)/2. -/
theorem closed_ratio_is_phi (S : GeometricScaleSequence)
    (h_closed : S.isClosed) : S.ratio = phi := by
  have h_eq := closure_forces_golden_equation S h_closed
  have h_pos := S.ratio_pos
  -- Both S.ratio and φ satisfy x² = x + 1
  -- For x > 0, this equation has unique solution φ
  have h_phi_eq : phi ^ 2 = phi + 1 := phi_sq_eq
  -- The difference (r - φ) satisfies: (r-φ)(r+φ) = r² - φ² = (r+1) - (φ+1) = r - φ
  -- So (r - φ)(r + φ - 1) = 0
  have h_factor : (S.ratio - phi) * (S.ratio + phi - 1) = 0 := by
    have := h_eq  -- r² = r + 1
    have := h_phi_eq  -- φ² = φ + 1
    ring_nf
    nlinarith [sq_nonneg S.ratio, sq_nonneg phi]
  -- Since r > 0 and φ > 1, we have r + φ - 1 > 0, so r - φ = 0
  rcases mul_eq_zero.mp h_factor with h_diff | h_sum
  · linarith
  · -- If r + φ - 1 = 0, then r = 1 - φ < 0, contradiction with r > 0
    have : S.ratio = 1 - phi := by linarith
    have : S.ratio < 0 := by
      have hphi : phi > 1 := one_lt_phi
      linarith
    linarith

/-- **THEOREM**: Closure forces the golden ratio equation.

If a geometric scale sequence is closed under additive composition,
then the ratio r must satisfy r² = r + 1. -/
theorem closure_forces_golden_equation (S : GeometricScaleSequence)
    (h_closed : S.isClosed) : S.ratio ^ 2 = S.ratio + 1 := by
  -- Unfold the closure condition
  unfold GeometricScaleSequence.isClosed at h_closed
  unfold ledgerCompose at h_closed
  unfold GeometricScaleSequence.scale at h_closed
  -- h_closed : r^0 + r^1 = r^2
  -- This simplifies to: 1 + r = r^2
  simp only [pow_zero, pow_one] at h_closed
  -- Rearrange to r^2 = r + 1
  linarith

What this page does not claim

The closure axiom is not derived; it is assumed as a premise. The theorem does not apply to sequences with more than two terms or different composition rules. The result does not claim that every geometric sequence is closed.

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/PhiForcingDerived.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: