Fibonacci heap: logarithmic degree bound
ProvedAlgo2Lean.Fibonacci.degree_logarithmicLet d and n be natural numbers. If the minimum subtree size required for degree d is at most n, then
Here Lean's Nat.log2 is zero at zero. This integer bound is the degree estimate used in the heap's running-time proof. It corresponds to the Fibonacci-heap size/degree argument in CLRS's online Fibonacci-heap supplement (retained third-edition §19.4, Corollary 19.5).
Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.
import Definitions.Def_Algo2LeanLib_Fibonacci set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true set_option autoImplicit false
theorem Algo2Lean.Fibonacci.degree_logarithmic :
∀ {degree nodes : Nat},
LE.le.{0} (Algo2Lean.Fibonacci.minimumNodes degree) nodes →
LE.le.{0} degree (HAdd.hAdd.{0, 0, 0} (HMul.hMul.{0, 0, 0} (2 : Nat) nodes.log2) (1 : Nat)) := by
sorry