Union-find: a rank link adds at most inverse-Ackermann potential
ProvedAlgo2Lean.UnionFind.link_potentialLet be valid and let distinct roots satisfy . Then
This is a bound on potential growth, not on elapsed program work. It is combined with compression bounds to pay for a complete union.
Here is the fixed number of elements, is Algo2Lean.Ackermann.alpha, and is Algo2Lean.UnionFind.potential. Their definitions are in the separate Ackermann and union-find amortization definition bundles. The inverse is the least positive with , where and iterates exactly times starting at .
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_UnionFindAmortized import Theorems.Thm_Algo2Lean_UnionFind_link_valid set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true set_option autoImplicit false
theorem Algo2Lean.UnionFind.link_potential :
∀ {n : Nat} {state : Algo2Lean.UnionFind.State n},
Algo2Lean.UnionFind.Valid state →
∀ (loser winner : Fin n),
Ne.{1} loser winner →
Eq.{1} (state.parent loser) loser →
Eq.{1} (state.parent winner) winner →
LE.le.{0} (state.rank loser) (state.rank winner) →
LE.le.{0}
(Algo2Lean.UnionFind.potential (Algo2Lean.UnionFind.link state loser winner))
(HAdd.hAdd.{0, 0, 0} (Algo2Lean.UnionFind.potential state)
(Algo2Lean.Ackermann.alpha n)) := by
sorry