Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of COROLLARY 1, p. 604 — F_{k+2} ≥ φ^k

Proved
FibHeap.Amort.fib_add_two_ge_goldenRatio_pow

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

fibonacci-numbersgolden-ratiop2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FkF_kFk​ be the Fibonacci numbers, F0=0F_0 = 0F0​=0, F1=1F_1 = 1F1​=1, Fk=Fk−2+Fk−1F_k = F_{k-2} + F_{k-1}Fk​=Fk−2​+Fk−1​ for k≥2k \ge 2k≥2, and let φ=(1+5)/2\varphi = (1+\sqrt5)/2φ=(1+5​)/2 be the golden ratio. Then for every k≥0k \ge 0k≥0,

Fk+2  ≥  φk.F_{k+2} \;\ge\; \varphi^{k} .Fk+2​≥φk.

The paper calls this inequality well known; it converts the Fibonacci lower bound on tree sizes into an exponential one, and hence ranks into logarithms.

Formalization Note FkF_kFk​ is Mathlib's Nat.fib and φ\varphiφ is Real.goldenRatio.

Preamble
import Mathlib
Formal statement
namespace FibHeap.Amort
theorem fib_add_two_ge_goldenRatio_pow (k : ℕ) :
    Real.goldenRatio ^ k ≤ (Nat.fib (k + 2) : ℝ) := by sorry
end FibHeap.Amort
Source
Fredman and Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), p. 604, proof of COROLLARY 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me