Encyclopedia Foundation Foundation Maximal Forcing Rsphi Universe Phi Universe Classifier

ARTICLE 4 claims 4 theorems

Foundation Maximal Forcing Rsphi Universe Phi Universe Classifier

A machine-checked theorem classifies every claim about a scale ratio into one of two outcomes: forced or independent.

The golden classifier

The golden ratio φ, about 1.618, is the positive solution to r² = r + 1. It appears throughout mathematics: in the regular pentagon, in the Fibonacci sequence, and as the limit of ratios of consecutive Fibonacci numbers. The number has been studied since antiquity; Euclid called it the extreme and mean ratio. What the Recognition Science framework adds is a precise, machine-checked statement about when a claim involving φ is forced to be true rather than merely possible.

The framework models reality as a ledger, a discrete record of recognition events, where each event carries a cost. A central theorem, proved in the framework's machine-checked library of formal theorems, derives the cost function J(x) = (x + 1/x)/2 − 1 from five plain conditions. From that cost function, a chain of theorems forces the golden ratio as the unique self-similar scaling. The declaration phiUniverse_classifier concerns a small formal universe built around this result.

In this universe, a candidate scale ratio r is any positive real number. The loose class Lphi0 admits all positive ratios. The gate class LphiGold admits only those satisfying the golden constraint r² = r + 1. The claim under examination is simply "r equals φ." The theorem phiUniverse_classifier proves that over the gate class, every claim in the universe that is in the closure is classified: it is forced, meaning every admissible candidate satisfies it. The proof wraps the earlier theorem phi_unique_self_similar, which says that a positive real satisfying r² = r + 1 must equal φ.

The tightening from the loose class to the gate class does real work. Over Lphi0, the claim "r = φ" is independent: φ itself is a positive candidate that satisfies it, but r = 1 is a positive candidate that does not. So the golden constraint is not cheap; it genuinely narrows the field. The theorem tightening_Lphi0_LphiGold_effective records both facts: independence over the loose class and forcing over the gate class. This mirrors the legitimacy evidence the cost layer produced for its own gate conditions.

What the classifier does not claim is broader. It does not say the golden ratio is physically realized in any particular system; it says that within this formal universe, under the golden constraint, the claim is forced. It does not derive φ from nothing; it assumes the golden constraint as a gate condition. And it does not prove that the physical recognition-to-linking bridge holds; that bridge remains open. The classifier is a statement about a formal model, not about the empirical world.

THEOREM phiUniverse_classifier · IndisputableMonolith/Foundation/MaximalForcing/RSPhiUniverse.lean
/-- The phi-layer universe is fully classified. -/
theorem phiUniverse_classifier :
    ∀ C : RealityClaim phiUniverse.Realization,
      InClosure Primitive.lawOfLogic phiUniverse C → ClaimClassification phiUniverse C := by
  intro C hC
  have hCeq : C = isPhiClaim := Set.mem_singleton_iff.mp hC
  subst hCeq
  exact ClaimClassification.forced forced_isPhi
THEOREM forced_isPhi · IndisputableMonolith/Foundation/MaximalForcing/RSPhiUniverse.lean
/-- **T6 as a forced invariant.** Over the gate class, "r = phi" is forced. Wraps
`PhiForcing.phi_unique_self_similar` with no new content. -/
theorem forced_isPhi : Forced LphiGold.admissible isPhiClaim := by
  intro r hr
  obtain ⟨hpos, hgold⟩ := hr
  exact phi_unique_self_similar hpos hgold
THEOREM isPhi_independent_over_Lphi0 · IndisputableMonolith/Foundation/MaximalForcing/RSPhiUniverse.lean
/-- Over the loose class `Lphi0`, "r = phi" is independent: `phi` is a positive
candidate that satisfies it, and `1` is a positive candidate that does not. -/
theorem isPhi_independent_over_Lphi0 : Independent Lphi0.admissible isPhiClaim := by
  refine ⟨φ, 1, ?_, ?_, ?_, ?_⟩
  · show (0 : ℝ) < φ
    exact phi_pos
  · show (0 : ℝ) < 1
    norm_num
  · rfl
  · intro h
    have h1 : (1 : ℝ) = φ := h
    exact (ne_of_lt phi_gt_one) h1
THEOREM tightening_Lphi0_LphiGold_effective · IndisputableMonolith/Foundation/MaximalForcing/RSPhiUniverse.lean
tightening_Lphi0_LphiGold_effective · IndisputableMonolith/Foundation/MaximalForcing/RSPhiUniverse.lean:109
/-- **The golden-constraint tightening is legitimate, not cheap.** `isPhiClaim`
is independent over `Lphi0` but forced over `LphiGold`. -/
theorem tightening_Lphi0_LphiGold_effective :
    Independent Lphi0.admissible isPhiClaim ∧ Forced LphiGold.admissible isPhiClaim :=
  ⟨isPhi_independent_over_Lphi0, forced_isPhi⟩

What this page does not claim

The golden ratio is physically realized in any particular system. The golden constraint is derived rather than assumed as a gate condition. The physical recognition-to-linking bridge is closed. The framework derives the fine-structure constant or any other empirical coupling.

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/MaximalForcing/RSPhiUniverse.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