Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Union-find: inverse-Ackermann running time from singleton components

Proved
Algo2Lean.UnionFind.Operations.from_initial

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

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Starting from initial n, every pure mixed-operation sequence Operations (initial n) after f u C obeys

C≤f(2α(n)+3)+u(6α(n)+7).C\le f(2\alpha(n)+3)+u(6\alpha(n)+7).C≤f(2α(n)+3)+u(6α(n)+7).

The count fff records explicit finds; the two internal finds of each of the uuu unions are already included in its charge. This finite inequality covers arbitrary interleavings of these operations. It excludes the separate constructor cost n+1n+1n+1.

This is a theorem about the pure Operations relation. To use it with mutable code, use the independently checked method contracts relating each actual call to its model transition and exact increments. Kruskal instead telescopes the same local contracts directly through its scan.

Here nnn is the fixed number of elements, α(n)\alpha(n)α(n) is Algo2Lean.Ackermann.alpha, and Φ\PhiΦ is Algo2Lean.UnionFind.potential. Their definitions are in the separate Ackermann and union-find amortization definition bundles. The inverse is the least positive kkk with Ak(1)>nA_k(1)>nAk​(1)>n, where A0(r)=r+1A_0(r)=r+1A0​(r)=r+1 and Ak+1(r)A_{k+1}(r)Ak+1​(r) iterates AkA_kAk​ exactly r+1r+1r+1 times starting at rrr.

This result belongs to the Algo2Lean CLRS series, corresponding to Introduction to Algorithms, fourth edition, Chapter 19, §§19.3–19.4, especially the inverse-Ackermann analysis of Theorem 19.14. The API initializes a fixed universe in one constructor rather than interleaving individual MAKE-SET operations.

<!-- 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_Algo2LeanLib_UnionFindAmortized
import Theorems.Thm_Algo2Lean_UnionFind_Operations_amortized

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

set_option autoImplicit false
Formal statement
theorem Algo2Lean.UnionFind.Operations.from_initial :
    ∀ {n : Nat} {after : Algo2Lean.UnionFind.State n} {finds unions cost : Nat},
      Algo2Lean.UnionFind.Operations (Algo2Lean.UnionFind.initial n) after finds unions cost →
        LE.le.{0} cost
          (HAdd.hAdd.{0, 0, 0}
            (HMul.hMul.{0, 0, 0} finds
              (HAdd.hAdd.{0, 0, 0} (HMul.hMul.{0, 0, 0} (2 : Nat) (Algo2Lean.Ackermann.alpha n))
                (3 : Nat)))
            (HMul.hMul.{0, 0, 0} unions
              (HAdd.hAdd.{0, 0, 0} (HMul.hMul.{0, 0, 0} (6 : Nat) (Algo2Lean.Ackermann.alpha n))
                (7 : Nat)))) := by
  sorry
Source
https://github.com/lunjiah/algo2lean/blob/0f79d5e4242e6477531c9ee4410409f5b1c92f76/Algo2LeanLib/UnionFindAmortized.lean#L623-L630
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by lunjia · Oct 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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