Algo.kruskal_bounds.Analysis definitions
DefinitionAlgo_kruskal_bounds_AnalysisDefinitions and required structural lemmas from Algo.kruskal_bounds.Analysis. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.
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_Ackermann set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true /-! Arithmetic bounds for the two Kruskal running-time statements. The sorting term and vertex initialization absorb the inverse-Ackermann contribution, even when the graph has many isolated vertices. These lemmas depend only on the existing Ackermann definition; they do not inspect an algorithm or heap. -/ namespace KruskalBounds open Algo2Lean.Ackermann end KruskalBounds