Kruskal.mergeAll_cons_eq
theoremverifiedimported Lean
Peeling the leading edge off a merge fold. Let $\mathit{uf} : \mathrm{Fin}\,n \to \bbn$ be a union-find state on $n$ nodes, let $e$ be a weighted edge with endpoints $u$ and $v$ over these nodes, and let $S$ be a list of weighted edges over the same nodes. Folding the list $e :: S$ into $\mathit{uf}$ and folding the list $S$ into the union-find state that merges the components of $u$ and $v$ in $\mathit{uf}$ induce the same partition of the nodes: for all nodes $i$ and $j$, folding $e :: S$ into $\mathit{uf}$ assigns $i$ and $j$ a common representative if and only if folding $S$ into the merge of $u$ and $v$ assigns $i$ and $j$ a common representative.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.mergeAll_cons_eq {n : ℕ} (uf : UF n) (e : WEdge n) (S : List (WEdge n)) : UF.SamePartition (uf.mergeAll (e :: S)) ((uf.merge e.u e.v).mergeAll S)
- Source
- TCSlib, `Kruskal.mergeAll_cons_eq`
- Lean proof
- By Harsha Polavaram, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Harsha Polavaram. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.Kruskal.mergeAll_cons_eq← Kruskal.mergeAll_cons_eq (TCSlib/GraphTheory/Kruskal/UnionFind.lean:126): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 7
- Kruskal.UFThe union-find state for $n$ nodes is defined as a function $\mathrm{Fin}\,n \to \mathbb{N}$ mapping each node to its current…
- Kruskal.UF.SamePartition.rflReflexivity of the same-partition relation. Fix $n \in \bbn$, and recall that a union-find state on $n$ nodes is a function…
- Kruskal.UF.find_defFind equals direct lookup. Let $\mathit{uf} \colon \mathrm{Fin}\,n \to \bbn$ be a union-find state on $n$ nodes, and let $i$ be one of its…
- Kruskal.WEdgeA weighted edge over $n$ vertices is a structure with two endpoints $u, v : \mathrm{Fin}\,n$ and a natural-number weight…
- Kruskal.UF.SamePartition$\mathtt{SamePartition}\,\mathit{uf}_1\,\mathit{uf}_2$ holds when two union-find states induce the same equivalence relation on nodes: for…
- Kruskal.UF.merge$\mathtt{merge}\,\mathit{uf}\,i\,j$ unifies the components of nodes $i$ and $j$ by reassigning every node whose representative equals…
- Kruskal.UF.mergeAll$\mathtt{mergeAll}\,\mathit{uf}\,\mathit{es}$ folds a list of weighted edges $\mathit{es}$ into the union-find $\mathit{uf}$ by calling…
- Used by 1
- Kruskal.processEdges_optimalOptimality of the greedy edge-selection sweep. Let $\mathit{edges}$ be a list of weighted edges on $n$ vertices, sorted in nondecreasing…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.mergeAll_cons_eq {n : ℕ} (uf : UF n) (e : WEdge n) (S : List (WEdge n)) : UF.SamePartition (uf.mergeAll (e :: S)) ((uf.merge e.u e.v).mergeAll S) := UF.SamePartition.rfl _