Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 604 — delete min increases the potential by at most log n / log φ minus the number of linking steps

Proved
FibHeap.Amort.potential_deleteMin_le

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

amortized-analysisdelete-minfibonacci-heapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let S\mathcal SS be a collection of F-heaps obtained from no heaps by an arbitrary sequence of F-heap operations, and let Φ\PhiΦ be the potential (number of trees plus twice the number of marked nonroot nodes). Suppose a delete min on the heap hhh, which holds nnn items, turns S\mathcal SS into S′\mathcal S'S′ using LLL linking steps. Then

Φ(S′)  ≤  Φ(S)+log⁡nlog⁡φ−L,\Phi(\mathcal S') \;\le\; \Phi(\mathcal S) + \frac{\log n}{\log\varphi} - L ,Φ(S′)≤Φ(S)+logφlogn​−L,

where φ=(1+5)/2\varphi = (1+\sqrt5)/2φ=(1+5​)/2.

Together with the cost 1+L+scan1 + L + \mathrm{scan}1+L+scan, this gives delete min an O(log⁡n)O(\log n)O(logn) amortized time.

Formalization Note The paper writes "at most 1.4404log⁡n1.4404 \log n1.4404logn minus the number of linking steps". The constant 1.44041.44041.4404 is a rounding slip (1/log⁡2φ=1.44042…1/\log_2\varphi = 1.44042\ldots1/log2​φ=1.44042…), with which the bound would be false for large heaps; the statement uses log⁡φn=log⁡n/log⁡φ\log_\varphi n = \log n / \log\varphilogφ​n=logn/logφ, the quantity the paper's own argument produces.

Preamble
import Mathlib
import Definitions.Def_FibHeap_Amort_Model
Formal statement
namespace FibHeap.Amort
theorem potential_deleteMin_le (s s' : Coll) (hs : Reachable s) (h : ℕ) (d : StepData)
    (hstep : Step s (.deleteMin h) s' d) :
    (potential s' : ℝ) ≤
      potential s + Real.logb Real.goldenRatio (heapSize (s.getD h [])) - d.links := 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, §2, potential analysis of delete min
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