Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Algo.kruskal_sorted.Facts definitions

Definition
Algo_kruskal_sorted_Facts

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

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Definitions and required structural lemmas from Algo.kruskal_sorted.Facts. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.

<!-- 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_kruskal_sorted_Generated
import Definitions.Def_Algo_union_find_Facts

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


-- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean

-- Optional proof certificate; execution remains the generated Step relation.
namespace «Algo».«kruskal_sorted»

open Algo2LeanCore _root_.Algo2LeanGenerated

namespace Algo2LeanGenerated

private def next_kruskal_sorted (h : Heap) (s : State_kruskal_sorted) (stack : Stack) : Nat → Configuration
  | 1 => (Algo2LeanCore.resumeConfig h (Result.fn_kruskal_sorted (s.t14)) stack)
  | 2 => (.active h (Frame.fn_kruskal_sorted 1 { s with t14 := s.v6 }) stack)
  | 3 => if s.t15 then (.active h (Frame.fn_kruskal_sorted 27 s) stack) else (.active h (Frame.fn_kruskal_sorted 2 s) stack)
  | 4 => (.active h (Frame.fn_kruskal_sorted 3 { s with t15 := (decide ((s.v8 < s.v4))) }) stack)
  | 5 => (.active h (Frame.fn_kruskal_sorted 4 { s with v8 := (s.v8 + (1 : Int)) }) stack)
  | 6 => (.active h (Frame.import_0 (Algo.«union_find».entry_UnionFind_union ((s.t18), s.t19, s.t20)) [] (fun value => match value with | .fn_UnionFind_union result => (Frame.fn_kruskal_sorted 5 { s with t17 := result }) | _ => .invalid)) stack)
  | 7 => (.active h (Frame.fn_kruskal_sorted 6 { s with t20 := s.v11 }) stack)
  | 8 => (.active h (Frame.fn_kruskal_sorted 7 { s with t19 := s.v10 }) stack)
  | 9 => (.active h (Frame.fn_kruskal_sorted 8 { s with t18 := s.t18 }) stack)
  | 10 => (.active h (Frame.fn_kruskal_sorted 9 { s with t18 := s.v7 }) stack)
  | 11 => (.active (h.write s.v6 s.v9 (1 : Int)) (Frame.fn_kruskal_sorted 10 s) stack)
  | 12 => if s.t16 then (.active h (Frame.fn_kruskal_sorted 11 s) stack) else (.active h (Frame.fn_kruskal_sorted 5 s) stack)
  | 13 => (.active h (Frame.fn_kruskal_sorted 12 { s with t16 := (decide ((s.v12 ≠ s.v13))) }) stack)
  | 14 => (.active h (Frame.fn_kruskal_sorted 13 { s with v13 := s.t21 }) stack)
  | 15 => (.active h (Frame.import_0 (Algo.«union_find».entry_UnionFind_find ((s.t22), s.t23)) [] (fun value => match value with | .fn_UnionFind_find result => (Frame.fn_kruskal_sorted 14 { s with t21 := result }) | _ => .invalid)) stack)
  | 16 => (.active h (Frame.fn_kruskal_sorted 15 { s with t23 := s.v11 }) stack)
  | 17 => (.active h (Frame.fn_kruskal_sorted 16 { s with t22 := s.t22 }) stack)
  | 18 => (.active h (Frame.fn_kruskal_sorted 17 { s with t22 := s.v7 }) stack)
  | 19 => (.active h (Frame.fn_kruskal_sorted 18 { s with v12 := s.t24 }) stack)
  | 20 => (.active h (Frame.import_0 (Algo.«union_find».entry_UnionFind_find ((s.t25), s.t26)) [] (fun value => match value with | .fn_UnionFind_find result => (Frame.fn_kruskal_sorted 19 { s with t24 := result }) | _ => .invalid)) stack)
  | 21 => (.active h (Frame.fn_kruskal_sorted 20 { s with t26 := s.v10 }) stack)
  | 22 => (.active h (Frame.fn_kruskal_sorted 21 { s with t25 := s.t25 }) stack)
  | 23 => (.active h (Frame.fn_kruskal_sorted 22 { s with t25 := s.v7 }) stack)
  | 24 => (.active (h.tick "kruskal" 1) (Frame.fn_kruskal_sorted 23 s) stack)
  | 25 => (.active h (Frame.fn_kruskal_sorted 24 { s with v11 := (h.read s.v2 s.v9) }) stack)
  | 26 => (.active h (Frame.fn_kruskal_sorted 25 { s with v10 := (h.read s.v1 s.v9) }) stack)
  | 27 => (.active h (Frame.fn_kruskal_sorted 26 { s with v9 := (h.read s.v5 s.v8) }) stack)
  | 28 => (.active (h.tick "kruskal" 1) (Frame.fn_kruskal_sorted 4 s) stack)
  | 29 => (.active h (Frame.fn_kruskal_sorted 28 { s with v8 := (0 : Int) }) stack)
  | 30 => (.active h (Frame.fn_kruskal_sorted 29 { s with v7 := s.t27 }) stack)
  | 31 => (.active h (Frame.import_0 (Algo.«union_find».entry_UnionFind s.t28) [] (fun value => match value with | .fn_UnionFind result => (Frame.fn_kruskal_sorted 30 { s with t27 := result }) | _ => .invalid)) stack)
  | 32 => (.active h (Frame.fn_kruskal_sorted 31 { s with t28 := s.v0 }) stack)
  | 33 => (.active h (Frame.fn_kruskal_sorted 32 { s with v6 := s.t29 }) stack)
  | 34 => (.active (h.allocate (fun _ => s.t30)) (Frame.fn_kruskal_sorted 33 { s with t29 := h.nextRef }) stack)
  | 35 => (.active h (Frame.fn_kruskal_sorted 34 { s with t30 := (0 : Int) }) stack)
  | pc => .active h (.fn_kruskal_sorted pc s) stack

/-- A total projection used only to certify uniqueness of actual transitions. -/
def next : Configuration → Configuration
  | .done h result => .done h result
  | .active h frame stack => match frame with
    | .invalid => .active h .invalid stack
    | .fn_kruskal_sorted pc s => next_kruskal_sorted h s stack pc
    | .import_0 frame inner resume =>
      ModuleCall.config Frame.import_0 resume stack (Algo.«union_find».Algo2LeanGenerated.next (.active h frame inner))

/-- Each generated rule agrees with the projection; guards remain in Step. -/
theorem step_next {before after : Configuration} (transition : Step before after) :
    next before = after := by
  cases transition with
  | kruskal_sorted_pc1 h s stack defined => rfl
  | kruskal_sorted_pc2 h s stack => rfl
  | kruskal_sorted_pc3_true h s stack condition => simp [next, next_kruskal_sorted, condition]
  | kruskal_sorted_pc3_false h s stack condition => simp [next, next_kruskal_sorted, condition]
  | kruskal_sorted_pc4 h s stack => rfl
  | kruskal_sorted_pc5 h s stack => rfl
  | kruskal_sorted_pc6 h s stack => rfl
  | kruskal_sorted_pc7 h s stack => rfl
  | kruskal_sorted_pc8 h s stack => rfl
  | kruskal_sorted_pc9 h s stack defined => rfl
  | kruskal_sorted_pc10 h s stack => rfl
  | kruskal_sorted_pc11 h s stack defined => rfl
  | kruskal_sorted_pc12_true h s stack condition => simp [next, next_kruskal_sorted, condition]
  | kruskal_sorted_pc12_false h s stack condition => simp [next, next_kruskal_sorted, condition]
  | kruskal_sorted_pc13 h s stack => rfl
  | kruskal_sorted_pc14 h s stack => rfl
  | kruskal_sorted_pc15 h s stack => rfl
  | kruskal_sorted_pc16 h s stack => rfl
  | kruskal_sorted_pc17 h s stack defined => rfl
  | kruskal_sorted_pc18 h s stack => rfl
  | kruskal_sorted_pc19 h s stack => rfl
  | kruskal_sorted_pc20 h s stack => rfl
  | kruskal_sorted_pc21 h s stack => rfl
  | kruskal_sorted_pc22 h s stack defined => rfl
  | kruskal_sorted_pc23 h s stack => rfl
  | kruskal_sorted_pc24 h s stack => rfl
  | kruskal_sorted_pc25 h s stack defined => rfl
  | kruskal_sorted_pc26 h s stack defined => rfl
  | kruskal_sorted_pc27 h s stack defined => rfl
  | kruskal_sorted_pc28 h s stack => rfl
  | kruskal_sorted_pc29 h s stack => rfl
  | kruskal_sorted_pc30 h s stack => rfl
  | kruskal_sorted_pc31 h s stack => rfl
  | kruskal_sorted_pc32 h s stack => rfl
  | kruskal_sorted_pc33 h s stack => rfl
  | kruskal_sorted_pc34 h s stack => rfl
  | kruskal_sorted_pc35 h s stack => rfl
  | import_0 h frame inner resume caller after transition =>
    exact congrArg (ModuleCall.config Frame.import_0 resume caller) (Algo.«union_find».Algo2LeanGenerated.step_next transition)

/-- Imported determinism composes without reopening imported transition rules. -/
theorem deterministic : Deterministic Step := by
  intro before left right first second
  exact (step_next first).symm.trans (step_next second)

end Algo2LeanGenerated

end «Algo».«kruskal_sorted»

namespace Algo.«kruskal_sorted»

open Algo2LeanCore _root_.Algo2LeanGenerated Algo2LeanGenerated

theorem kruskal_sorted.Run.eq_of_call {before after expectedHeap input output expected}
    (run : _root_.Algo.«kruskal_sorted».kruskal_sorted.Run before input after output)
    (call : _root_.Algo.«kruskal_sorted».kruskal_sorted.Call before input expectedHeap expected) :
    after = expectedHeap ∧ output = expected := by
  have same := Reaches.eq_of_terminal (step := Step) deterministic
    run.2 call.2.root (terminal _ _) (terminal _ _)
  cases same
  exact ⟨rfl, rfl⟩

end Algo.«kruskal_sorted»
Source
https://github.com/lunjiah/algo2lean/blob/9755b41d188977ae1aafdaf9eccdac0b0edb0420/examples/kruskal/kruskal_sorted.algo

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