Fibonacci heap: realize a forest cascade in mutable storage
ProvedFibonacciModuleAnalysis.realize_cascade_runA finite CascadeRun between mathematical snapshots, with c cuts, can be realized from any valid concrete layout representing its initial snapshot. The result has a CascadeEffect with the same cut count, a valid final layout, and exactly the specified final snapshot. No complete Dijkstra transcript is needed.
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_cascade_run :
∀ (before after : Algo2Lean.Fibonacci.Snapshot) (vertex : Int) (cuts : Nat),
Algo2Lean.Fibonacci.CascadeRun before after vertex cuts →
∀ (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 =>
Exists.{1} fun finalLayout =>
FibonacciModuleAnalysis.CascadeEffect queue heap layout vertex finalHeap finalLayout
cuts ∧
finalLayout.Valid finalHeap queue ∧
Eq.{1} (FibonacciModuleAnalysis.snapshot finalHeap finalLayout) after := by
sorry