theorem
proved
fib_6_eq
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Masses.CoherenceExponent on GitHub at line 38.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
35theorem fib_5_eq : fib 5 = 5 := by native_decide
36
37/-- F₆ = 8 (the octave = 2^D) -/
38theorem fib_6_eq : fib 6 = 8 := by native_decide
39
40/-! ## The Fibonacci Identity -/
41
42/-- The Fibonacci recurrence: F₆ = F₅ + F₄ -/
43theorem fib_recurrence_at_6 : fib 6 = fib 5 + fib 4 := by
44 rw [fib_6_eq, fib_5_eq, fib_4_eq]
45
46/-- Key identity: 8 - 3 = 5, or F₆ - F₄ = F₅ -/
47theorem fibonacci_deficit : fib 6 - fib 4 = fib 5 := by
48 rw [fib_6_eq, fib_5_eq, fib_4_eq]
49
50/-! ## Dimension Constraint -/
51
52/-- D = 3 is the spatial dimension (from T8 dimension forcing) -/
53def D : ℕ := 3
54
55/-- The octave period is 2^D -/
56def octave : ℕ := 2 ^ D
57
58/-- Verify: octave = 8 -/
59theorem octave_eq_8 : octave = 8 := by
60 unfold octave D
61 norm_num
62
63/-- D equals F₄ -/
64theorem D_is_fib_4 : D = fib 4 := by
65 unfold D
66 rw [fib_4_eq]
67
68/-- Octave (2^D) equals F₆ -/