Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fibonacci heap: realize a mathematical decrease as a Call contract

Proved
FibonacciModuleAnalysis.realize_decrease_run

by lunjia · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

For a DecreaseRun with specified before/after snapshots and cut count, a valid concrete layout representing the initial snapshot and a present target handle admit a final heap satisfying UpdateContract. The final snapshot is precisely the mathematical result. The run premise supplies the decrease operation's structural conditions.

<!-- algo2lean-provenance-v0.1.4 -->

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.

Preamble
import Definitions.Def_Algo_dijkstra_support_fibonacci_heap_Analysis
import Theorems.Thm_FibonacciModuleAnalysis_decrease_effect_summary
import Theorems.Thm_FibonacciModuleAnalysis_realize_cascade_run

set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true

set_option autoImplicit false
Formal statement
theorem FibonacciModuleAnalysis.realize_decrease_run :
    ∀ (before after : Algo2Lean.Fibonacci.Snapshot) (vertex key : Int) (cuts : Nat),
      Algo2Lean.Fibonacci.DecreaseRun before after vertex key 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 →
              Ne.{1} (heap.read layout.present vertex) (0 : Int) →
                Exists.{1} fun finalHeap =>
                  Exists.{1} fun finalLayout =>
                    FibonacciModuleAnalysis.UpdateContract heap finalHeap queue layout finalLayout
                        vertex key cuts ∧
                      Eq.{1} (FibonacciModuleAnalysis.snapshot finalHeap finalLayout) after := by
  sorry
Source
https://github.com/lunjiah/algo2lean/blob/0f79d5e4242e6477531c9ee4410409f5b1c92f76/examples/analysis/dijkstra/support/fibonacci_heap.lean#L4789-L4890

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