Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Indexed binary min-heap: named-line observations

Definition
Algo_indexed_heap_Points

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

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Named source locations and local-state observations for indexed_heap.algo. A standalone source label denotes the state before its following statement. Location predicates and getters describe the supplied configuration without requiring a whole transcript or a reachability hypothesis.

These optional observations help local proofs inspect intermediate states. They are compiled separately from the stable algorithm definitions, so a proof can change labels without changing its main call or output statement.

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

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

namespace Algo.«indexed_heap»

open _root_.Algo2LeanGenerated Algo2LeanGenerated

-- Named locations are independent of the compiled module body.

-- Before source line 22, column 9; location only, not reachability.
def MinHeap.swap.At.exchange : Configuration → Prop
  | .active _ (.fn_MinHeap_swap 7 _) _ => True
  | _ => False
def MinHeap.swap.Local.self : Configuration → Option Ref_MinHeap
  | .active _ (.fn_MinHeap_swap pc s) _ => if pc = 7 then some s.v0 else none
  | _ => none
def MinHeap.swap.Local.i : Configuration → Option Int
  | .active _ (.fn_MinHeap_swap pc s) _ => if pc = 7 then some s.v1 else none
  | _ => none
def MinHeap.swap.Local.j : Configuration → Option Int
  | .active _ (.fn_MinHeap_swap pc s) _ => if pc = 7 then some s.v2 else none
  | _ => none
def MinHeap.swap.Local.a : Configuration → Option Int
  | .active _ (.fn_MinHeap_swap pc s) _ => if pc = 7 then some s.v3 else none
  | _ => none
def MinHeap.swap.Local.b : Configuration → Option Int
  | .active _ (.fn_MinHeap_swap pc s) _ => if pc = 7 then some s.v4 else none
  | _ => none

-- Before source line 30, column 9; location only, not reachability.
def MinHeap.sift_up.At.up_loop : Configuration → Prop
  | .active _ (.fn_MinHeap_sift_up 4 _) _ => True
  | _ => False
def MinHeap.sift_up.Local.self : Configuration → Option Ref_MinHeap
  | .active _ (.fn_MinHeap_sift_up pc s) _ => if pc = 4 then some s.v0 else none
  | _ => none
def MinHeap.sift_up.Local.i : Configuration → Option Int
  | .active _ (.fn_MinHeap_sift_up pc s) _ => if pc = 4 then some s.v1 else none
  | _ => none

-- Before source line 40, column 9; location only, not reachability.
def MinHeap.sift_down.At.down_loop : Configuration → Prop
  | .active _ (.fn_MinHeap_sift_down 4 _) _ => True
  | _ => False
-- Before source line 48, column 13; location only, not reachability.
def MinHeap.sift_down.At.compare_child : Configuration → Prop
  | .active _ (.fn_MinHeap_sift_down 15 _) _ => True
  | _ => False
def MinHeap.sift_down.Local.self : Configuration → Option Ref_MinHeap
  | .active _ (.fn_MinHeap_sift_down pc s) _ => if pc = 4 ∨ pc = 15 then some s.v0 else none
  | _ => none
def MinHeap.sift_down.Local.i : Configuration → Option Int
  | .active _ (.fn_MinHeap_sift_down pc s) _ => if pc = 4 ∨ pc = 15 then some s.v1 else none
  | _ => none
def MinHeap.sift_down.Local.child : Configuration → Option Int
  | .active _ (.fn_MinHeap_sift_down pc s) _ => if pc = 15 then some s.v2 else none
  | _ => none
def MinHeap.sift_down.Local.right : Configuration → Option Int
  | .active _ (.fn_MinHeap_sift_down pc s) _ => if pc = 15 then some s.v3 else none
  | _ => none

end Algo.«indexed_heap»
Source
https://github.com/lunjiah/algo2lean/blob/0f79d5e4242e6477531c9ee4410409f5b1c92f76/examples/kruskal/indexed_heap.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