def
definition
fib
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Gap45.Derivation on GitHub at line 49.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
phi_pow_44_fib -
phi_pow_fib -
phi_pow_44_gt_1pt5e9 -
phi_pow_44_lt_1pt6e9 -
phi_pow_fib_succ -
thirteen_is_fib_7 -
FibonacciPhiCert -
fib_strict_mono -
fib_values -
phi_pow_bounded_by_fib -
phi_pow_fib -
fib_0 -
fib_1 -
fib_2 -
fib_3 -
fib_4 -
fib_5 -
fib_6 -
fib_coprime_4_5 -
fibonacci_5_is_5 -
fibonacci_6_is_8 -
fibonacci_factor_is_fib -
gap_forced_from_eight_tick_and_fibonacci -
F_12_is_fibonacci_12 -
coherence_exponent_from_fibonacci -
coherence_exponent_is_fib_5 -
coherence_exponent_unique -
D_is_fib_4 -
fib_4_eq -
fib_5_eq -
fib_6_eq -
fibonacci_deficit -
fib_recurrence_at_6 -
octave_is_fib_6 -
fib3_eq_2 -
fib4_eq_3 -
fib4_eq_D -
fib5_eq_5 -
fib6_eq_2cubeD -
fib6_eq_8
formal source
46/-! ## Fibonacci Sequence -/
47
48/-- The Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21, ... -/
49def fib : ℕ → ℕ
50 | 0 => 1
51 | 1 => 1
52 | n + 2 => fib n + fib (n + 1)
53
54@[simp] lemma fib_0 : fib 0 = 1 := rfl
55@[simp] lemma fib_1 : fib 1 = 1 := rfl
56@[simp] lemma fib_2 : fib 2 = 2 := rfl
57@[simp] lemma fib_3 : fib 3 = 3 := rfl
58@[simp] lemma fib_4 : fib 4 = 5 := rfl
59@[simp] lemma fib_5 : fib 5 = 8 := rfl
60@[simp] lemma fib_6 : fib 6 = 13 := rfl
61
62/-- Fibonacci(4) = 5 -/
63theorem fibonacci_5_is_5 : fib 4 = 5 := rfl
64
65/-- Fibonacci(5) = 8 -/
66theorem fibonacci_6_is_8 : fib 5 = 8 := rfl
67
68/-- Consecutive Fibonacci numbers are coprime.
69 This is a classical result; we prove specific cases by computation. -/
70theorem fib_coprime_4_5 : Nat.gcd (fib 4) (fib 5) = 1 := by decide
71
72/-- 5 and 8 are consecutive Fibonacci numbers, hence coprime. -/
73theorem five_eight_coprime : Nat.gcd 5 8 = 1 := by decide
74
75/-! ## Eight-Tick Structure -/
76
77/-- The eight-tick period from T8. -/
78def eight_tick_period : ℕ := 8
79