Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 604 — decrease key increases the potential by at most three minus the number of cascading cuts

Proved
FibHeap.Amort.potential_decreaseKey_le

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

amortized-analysiscascading-cutfibonacci-heapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let Φ\PhiΦ be the potential of a collection of F-heaps (number of trees plus twice the number of marked nonroot nodes). If a decrease key operation turns the collection S\mathcal SS into S′\mathcal S'S′ and makes ccc cascading cuts, then

Φ(S′)+c  ≤  Φ(S)+3.\Phi(\mathcal S') + c \;\le\; \Phi(\mathcal S) + 3 .Φ(S′)+c≤Φ(S)+3.

With one unit charged per cut, decrease key costs 2+c2 + c2+c when the item is not in a root, so its amortized time is at most 555.

Formalization Note No reachability hypothesis is needed: the bound holds for every collection on which the operation can be performed. When the item is in a root, no cut is made and c=0c = 0c=0.

Preamble
import Mathlib
import Definitions.Def_FibHeap_Amort_Model
Formal statement
namespace FibHeap.Amort
theorem potential_decreaseKey_le (s s' : Coll) (Δ : ℝ) (i h : ℕ) (d : StepData)
    (hstep : Step s (.decreaseKey Δ i h) s' d) :
    potential s' + d.cascading ≤ potential s + 3 := 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 decrease key
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