Fibonacci heap: realize degree-bucket collisions with exact link costs
ProvedFibonacciModuleAnalysis.realize_bucket_collisionsEvery finite mathematical bucket-collision run can be realized by the concrete pointer-update relation CollisionEffect from a valid matching layout. The final snapshot, current root handle and its degree match the model; this degree is the collision loop's current degree, not a global maximum-degree bound. Each link contributes one heap_comparisons tick and one heap_links tick, and the theorem records the resulting clock values from their actual initial values.
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_Algo_dijkstra_support_fibonacci_heap_Analysis set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true set_option autoImplicit false
theorem FibonacciModuleAnalysis.realize_bucket_collisions :
∀ (before after : Algo2Lean.Fibonacci.Snapshot) (vertex degree finalVertex finalDegree : Int)
(links : Nat),
Algo2Lean.Fibonacci.BucketCollisions before vertex degree after finalVertex finalDegree links →
∀ (heap : Algo2LeanGenerated.Heap)
(queue : Algo.fibonacci_heap.Algo2LeanGenerated.Ref_FibonacciHeap)
(layout : FibonacciModuleAnalysis.Layout),
layout.Valid heap queue →
Eq.{1} (FibonacciModuleAnalysis.snapshot heap layout) before →
Exists.{1} fun finalHeap =>
FibonacciModuleAnalysis.CollisionEffect layout heap vertex degree finalHeap finalVertex
finalDegree links ∧
layout.Valid finalHeap queue ∧
Eq.{1} (FibonacciModuleAnalysis.snapshot finalHeap layout) after ∧
∀ (clock : String),
Eq.{1} (finalHeap.clocks clock)
(HAdd.hAdd.{0, 0, 0}
(HAdd.hAdd.{0, 0, 0} (heap.clocks clock)
(Algo2LeanGenerated.Clocks.single "heap_comparisons" links clock))
(Algo2LeanGenerated.Clocks.single "heap_links" links clock)) := by
sorry