Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Union-find: compositional inverse-Ackermann running time for mixed operations

Proved
Algo2Lean.UnionFind.Operations.amortized

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

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Let Operations before after f u C be a finite sequence in the pure parent/rank model, with fff explicit find operations, uuu union operations and charged cost CCC. If the initial state is valid, the final state is valid and

C+2Φ(after)≤2Φ(before)+f(2α(n)+3)+u(6α(n)+7).C+2\Phi(after)\le2\Phi(before)+f(2\alpha(n)+3)+u(6\alpha(n)+7).C+2Φ(after)≤2Φ(before)+f(2α(n)+3)+u(6α(n)+7).

A union's two internal finds are included in its union cost, not counted again in fff. A path of length ppp costs 2p+12p+12p+1 for a find; a union with successive path lengths p,qp,qp,q costs 2(p+q)+32(p+q)+32(p+q)+3.

This theorem quantifies over Operations, not directly over arbitrary mutable program transcripts. The compiled constructor and method contracts connect those model transitions and costs to actual calls. Retaining the initial potential makes the theorem reusable on a suffix of an existing computation.

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.

<!-- 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_compress_valid
import Theorems.Thm_Algo2Lean_UnionFind_link_valid
import Theorems.Thm_Algo2Lean_UnionFind_link_potential
import Theorems.Thm_Algo2Lean_UnionFind_compressPath_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.amortized :
    ∀ {n : Nat} {before after : Algo2Lean.UnionFind.State n} {finds unions cost : Nat},
      Algo2Lean.UnionFind.Operations before after finds unions cost →
        Algo2Lean.UnionFind.Valid before →
          Algo2Lean.UnionFind.Valid after ∧
            LE.le.{0}
              (HAdd.hAdd.{0, 0, 0} cost
                (HMul.hMul.{0, 0, 0} (2 : Nat) (Algo2Lean.UnionFind.potential after)))
              (HAdd.hAdd.{0, 0, 0}
                (HAdd.hAdd.{0, 0, 0}
                  (HMul.hMul.{0, 0, 0} (2 : Nat) (Algo2Lean.UnionFind.potential before))
                  (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#L601-L620

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