Foundation Hierarchy Minimality Hierarchy Forces Golden Equation

The minimal ladder

The golden ratio φ ≈ 1.618 is the positive number that satisfies r² = r + 1, meaning that multiplying by φ is the same as adding 1. It appears throughout classical mathematics: in Euclid's construction of the regular pentagon, in the Fibonacci sequence where each term is the sum of the previous two, and in the continued fraction [1; 1, 1, 1, ...]. The equation r² = r + 1 has two solutions, but only one is positive, and that positive solution is exactly φ.

In Recognition Science, the framework starts from a discrete record of events called a ledger, a structured list of recognitions. The framework models a hierarchy as a geometric scale ladder: a sequence of ratios between successive levels. The minimal closure condition, written scale 0 + scale 1 = scale 2, states that the first non-trivial composition step closes: the sum of the first two scale ratios equals the third. This is the smallest algebraic condition that makes the ladder self-consistent.

The machine-checked library of formal theorems proves that this minimal condition alone forces the golden equation. The theorem hierarchy_forces_golden_equation states that for any such minimal hierarchy, the square of the scale ratio equals the ratio plus one: r² = r + 1. A companion theorem, hierarchy_forces_phi, derives that the ratio must equal φ. No further assumptions about the ladder's length, starting value, or specific entries are needed; the closure step itself determines the ratio uniquely.

This result matters because it shows how a single structural requirement, the first non-trivial composition step, can determine a fundamental constant. The framework does not choose φ as a parameter; the closure condition forces it. This is the first rung in a longer chain that the framework uses to derive further structure, though this declaration alone establishes only the golden equation, not the rest of that chain.

/-- The first closure step is exactly the Fibonacci relation. -/
theorem hierarchy_forces_golden_equation (H : MinimalHierarchy) :
    H.scales.ratio ^ 2 = H.scales.ratio + 1 :=
  closure_forces_golden_equation H.scales H.minimalClosure

/-- Minimal closure already forces the unique positive self-similar ratio `φ`. -/
theorem hierarchy_forces_phi (H : MinimalHierarchy) :
    H.scales.ratio = φ :=
  closed_ratio_is_phi H.scales H.minimalClosure

/-- Minimal discrete hierarchy: a geometric scale ladder closed under the first
    non-trivial composition step. -/
structure MinimalHierarchy where
  scales : GeometricScaleSequence
  minimalClosure : scales.isClosed

What this page does not claim

This declaration does not prove that any particular physical system actually forms a minimal hierarchy. This declaration does not derive the full chain of consequences that the framework builds on top of the golden ratio. This declaration does not claim that the golden ratio is the only possible self-similar ratio for all hierarchies, only for those satisfying this specific minimal closure.

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