Union-find: compositional inverse-Ackermann running time for mixed operations
ProvedAlgo2Lean.UnionFind.Operations.amortizedLet Operations before after f u C be a finite sequence in the pure parent/rank model, with explicit find operations, union operations and charged cost . If the initial state is valid, the final state is valid and
A union's two internal finds are included in its union cost, not counted again in . A path of length costs for a find; a union with successive path lengths costs .
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 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_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
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