Encyclopedia Gap45 Gap45 Derivation
ARTICLE 4 claims 4 theorems
Gap45 Derivation
A machine-checked derivation shows how the number 45, and with it the three dimensions of space, emerges from a counting cycle of eight steps.
The 45-gap derivation
The number 45 is the ninth triangular number: 1 + 2 + 3 + ... + 9 = 45. Triangular numbers count objects arranged in an equilateral triangle, and the ninth one appears whenever you sum the integers from 1 to 9. The number 45 also has a simple factorization: 9 × 5, or 3² × 5.
The 45-gap derivation in Recognition Science starts from a discrete record of events called a ledger, a step-by-step count of what happens. The framework's earlier work forces a recognition cycle of eight ticks, meaning eight distinct steps repeat. The derivation asks what number naturally completes a full cycle: eight steps plus one return to the start gives 9, and multiplying by 5, the fourth Fibonacci number, gives 45. The key equation is 45 = (8 + 1) × 5.
The module proves this in a machine-checked library of formal theorems. It shows that 45 equals the product of a closure factor, 9, and a Fibonacci factor, 5, and that 5 is coprime with 8, meaning they share no common divisor other than 1. The same result appears as a triangular number: 45 = T(9), the cumulative sum of steps over the closed cycle.
The derivation then connects 45 to the dimensions of space. The eight-tick period equals 2³, and the least common multiple of 8 and 45 is 360. The module proves that the only natural number D for which the least common multiple of 2^D and 45 equals 360 is D = 3. In plain language, the structure forces three spatial dimensions, because 2³ = 8 and lcm(8, 45) = 360.
In Recognition Science, this means 45 is not an arbitrary constant. It emerges from the eight-tick cycle, the closure principle of returning to the start, and the cumulative phase counted by the triangular number. The full period of 360 then synchronizes the eight-tick and 45-gap cycles, and that synchronization uniquely selects three dimensions.
THEOREM gap_forced_from_eight_tick_and_fibonacci · IndisputableMonolith/Gap45/Derivation.lean
/-- The gap is forced by eight-tick and Fibonacci structure. -/
theorem gap_forced_from_eight_tick_and_fibonacci :
gap = closure_factor * fibonacci_factor ∧
closure_factor = eight_tick_period + 1 ∧
fibonacci_factor = fib 4 := by
exact ⟨rfl, rfl, rfl⟩
THEOREM lcm_360_forces_D_eq_3 · IndisputableMonolith/Gap45/Derivation.lean
/-- lcm(2^D, 45) = 360 only when D = 3. -/
theorem lcm_360_forces_D_eq_3 :
∀ D : ℕ, Nat.lcm (2^D) 45 = 360 ↔ D = 3 := by
intro D
constructor
· intro h
have hgcd : Nat.gcd (2 ^ D) 45 = 1 := by
have hcop : Nat.Coprime 2 45 := by native_decide
exact Nat.Coprime.pow_left D hcop
have hlcm : Nat.lcm (2 ^ D) 45 = 2 ^ D * 45 / Nat.gcd (2 ^ D) 45 :=
Nat.lcm_eq_mul_div (2 ^ D) 45
have hlcm' : Nat.lcm (2 ^ D) 45 = 2 ^ D * 45 := by
simpa [hgcd] using hlcm
have hmul : 2 ^ D * 45 = 360 := by
simpa [hlcm'] using h
have h360 : (360 : ℕ) = 8 * 45 := by norm_num
have h8eq : 2 ^ D = 8 := by
apply Nat.mul_right_cancel (by norm_num : 0 < 45)
simpa [h360] using hmul
have hpow : 2 ^ D = 2 ^ 3 := by
have h8 : (2 ^ 3 : ℕ) = 8 := by norm_num
simpa [h8] using h8eq
exact Nat.pow_right_injective (by norm_num : 1 < 2) hpow
· intro hD
subst hD
native_decide
THEOREM full_period_eq_360 · IndisputableMonolith/Gap45/Derivation.lean
/-- **Key Result**: lcm(8, 45) = 360. -/
@[simp] theorem full_period_eq_360 : full_period = 360 := by
simp [full_period, eight_tick_period, gap]
decide
THEOREM five_eight_coprime · IndisputableMonolith/Gap45/Derivation.lean
/-- 5 and 8 are consecutive Fibonacci numbers, hence coprime. -/
theorem five_eight_coprime : Nat.gcd 5 8 = 1 := by decide
What this page does not claim
The module does not derive the value of any physical constant such as the fine-structure constant. The derivation does not claim that the Fibonacci number 5 is the only possible factor; it is the one selected by the coprime condition. The proof does not establish that physical space must be three-dimensional; it shows that within this framework, the structure forces D = 3.
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/Gap45/Derivation.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 physical mechanism connects the least common multiple of two cycle lengths to the number of spatial dimensions?
- How does the eight-tick recognition cycle itself follow from the cost function J?
- What empirical evidence would distinguish this derivation's prediction of three dimensions from other explanations?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM gap_forced_from_eight_tick_and_fibonacci · IndisputableMonolith/Gap45/Derivation.lean
/-- The gap is forced by eight-tick and Fibonacci structure. -/ theorem gap_forced_from_eight_tick_and_fibonacci : gap = closure_factor * fibonacci_factor ∧ closure_factor = eight_tick_period + 1 ∧ fibonacci_factor = fib 4 := by exact ⟨rfl, rfl, rfl⟩45 equals the product of a closure factor, 9, and a Fibonacci factor, 5. gap_forced_from_eight_tick_and_fibonacci · IndisputableMonolith/Gap45/Derivation.leanTHEOREM lcm_360_forces_D_eq_3 · IndisputableMonolith/Gap45/Derivation.lean
/-- lcm(2^D, 45) = 360 only when D = 3. -/ theorem lcm_360_forces_D_eq_3 : ∀ D : ℕ, Nat.lcm (2^D) 45 = 360 ↔ D = 3 := by intro D constructor · intro h have hgcd : Nat.gcd (2 ^ D) 45 = 1 := by have hcop : Nat.Coprime 2 45 := by native_decide exact Nat.Coprime.pow_left D hcop have hlcm : Nat.lcm (2 ^ D) 45 = 2 ^ D * 45 / Nat.gcd (2 ^ D) 45 := Nat.lcm_eq_mul_div (2 ^ D) 45 have hlcm' : Nat.lcm (2 ^ D) 45 = 2 ^ D * 45 := by simpa [hgcd] using hlcm have hmul : 2 ^ D * 45 = 360 := by simpa [hlcm'] using h have h360 : (360 : ℕ) = 8 * 45 := by norm_num have h8eq : 2 ^ D = 8 := by apply Nat.mul_right_cancel (by norm_num : 0 < 45) simpa [h360] using hmul have hpow : 2 ^ D = 2 ^ 3 := by have h8 : (2 ^ 3 : ℕ) = 8 := by norm_num simpa [h8] using h8eq exact Nat.pow_right_injective (by norm_num : 1 < 2) hpow · intro hD subst hD native_decideThe only natural number D for which the least common multiple of 2^D and 45 equals 360 is D = 3. lcm_360_forces_D_eq_3 · IndisputableMonolith/Gap45/Derivation.leanTHEOREM full_period_eq_360 · IndisputableMonolith/Gap45/Derivation.lean
/-- **Key Result**: lcm(8, 45) = 360. -/ @[simp] theorem full_period_eq_360 : full_period = 360 := by simp [full_period, eight_tick_period, gap] decideThe full period of 360 synchronizes the eight-tick and 45-gap cycles. full_period_eq_360 · IndisputableMonolith/Gap45/Derivation.leanTHEOREM five_eight_coprime · IndisputableMonolith/Gap45/Derivation.lean
/-- 5 and 8 are consecutive Fibonacci numbers, hence coprime. -/ theorem five_eight_coprime : Nat.gcd 5 8 = 1 := by decide5 is coprime with 8, meaning they share no common divisor other than 1. five_eight_coprime · IndisputableMonolith/Gap45/Derivation.lean