Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fibonacci Dijkstra: running-time growth scale

Definition
SubmissionAnalysis_FibonacciDijkstra

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

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

The definition CLRS.FibonacciDijkstra.runtimeScale V E = E + 1 + V * (Nat.log2 V + 1) expresses the growth of the thirteen selected source clocks. It has scale O(E + V log V); additions by one handle small instances. This supplemental analysis does not change any compiled algorithm definition.

<!-- algo2lean-supplemental-source -->

This supplemental handwritten analysis is separate from the released compiler source. Its additional analysis archive location is here, file SubmissionAnalysis/FibonacciDijkstra.lean (SHA-256 0f0948f6ed2b4e461ca95bea606aa06eff534af028a0f893f42468e93dd9950d). Publication and archive verification are tracked separately; the source is not raw compiler output.

<!-- 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.

Definition code
import Definitions.Def_Algo_dijkstra_dijkstra_fibonacci_Analysis

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



/-!
Supplemental analysis for the Algo2Lean CLRS formalization series.
This file proves a uniform-constant corollary of the exact bound;
it does not change the algorithm or its generated definitions.
-/
namespace CLRS.FibonacciDijkstra

open Algo2LeanGenerated Algo2Lean.Dijkstra

/-- The growth scale for the selected source clocks. The additions by one
keep the bound meaningful for small vertex and edge counts. -/
def runtimeScale (vertices edges : Nat) : Nat :=
  edges + 1 + vertices * (vertices.log2 + 1)





end CLRS.FibonacciDijkstra
Source
https://github.com/lunjiah/algo2lean/releases/download/v0.1.4/algo2lean-clrs-analysis.zip

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