Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 1, p. 604 — the ith child of a node, in linking order, has rank at least i − 2

Proved
FibHeap.Amort.lemma_1

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

cascading-cutfibonacci-heapinvariantp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rank

Let S\mathcal SS be a collection of F-heaps obtained from no heaps by an arbitrary sequence of F-heap operations. Let xxx be any node in a heap of S\mathcal SS, and arrange the children of xxx in the order in which they were linked to xxx, from earliest to latest. Then for every i≥1i \ge 1i≥1 up to the rank of xxx, the iiith child yiy_iyi​ of xxx satisfies

r(yi)  ≥  i−2.r(y_i) \;\ge\; i - 2 .r(yi​)≥i−2.

This lemma is what forces every tree of an F-heap, although not necessarily a binomial tree, to have size exponential in the rank of its root (Corollary 1).

Formalization Note Children are stored in linking order, so the iiith child is the list entry at index j=i−1j = i - 1j=i−1. The inequality is written j+1≤r(y)+2j + 1 \le r(y) + 2j+1≤r(y)+2 to avoid truncated natural-number subtraction. The statement quantifies over reachable collections only; for arbitrary forests it is false.

Preamble
import Mathlib
import Definitions.Def_FibHeap_Amort_Model
Formal statement
namespace FibHeap.Amort
theorem lemma_1 (s : Coll) (hs : Reachable s) :
    ∀ r ∈ s, ∀ τ ∈ r, ∀ x ∈ τ.subtrees, ∀ (j : ℕ) (hj : j < x.children.length),
      j + 1 ≤ (x.children[j]'hj).rank + 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, LEMMA 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