Kruskal.UF.SamePartition.trans
theoremverifiedimported Lean
Transitivity of the same-partition relation. Let $n$ be a natural number, and let $\mathit{uf}_1, \mathit{uf}_2, \mathit{uf}_3 : \mathrm{Fin}\,n \to \bbn$ be three union-find states on $n$ nodes. Suppose that $\mathit{uf}_1$ and $\mathit{uf}_2$ induce the same partition of the nodes, and that $\mathit{uf}_2$ and $\mathit{uf}_3$ induce the same partition. Then $\mathit{uf}_1$ and $\mathit{uf}_3$ induce the same partition: for all nodes $i, j$, one has $\mathit{uf}_1(i) = \mathit{uf}_1(j)$ if and only if $\mathit{uf}_3(i) = \mathit{uf}_3(j)$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in @[trans] lemma Kruskal.UF.SamePartition.trans {n : ℕ} {uf1 uf2 uf3 : UF n} (h1 : UF.SamePartition uf1 uf2) (h2 : UF.SamePartition uf2 uf3) : UF.SamePartition uf1 uf3
- Source
- TCSlib, `Kruskal.UF.SamePartition.trans`
- 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.UF.SamePartition.trans← Kruskal.UF.SamePartition.trans (TCSlib/GraphTheory/Kruskal/UnionFind.lean:37): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- 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.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.UF.SamePartition$\mathtt{SamePartition}\,\mathit{uf}_1\,\mathit{uf}_2$ holds when two union-find states induce the same equivalence relation on nodes: for…
- Used by 3
- Kruskal.mergeAll_permPermutation invariance of edge merging. Fix $n$ and an initial union-find state $\mathit{uf} : \mathrm{Fin}\,n \to \bbn$. If two lists of…
- Kruskal.processEdges_optimalOptimality of the greedy edge-selection sweep. Let $\mathit{edges}$ be a list of weighted edges on $n$ vertices, sorted in nondecreasing…
- Kruskal.reduce_to_restDropping a redundant edge from a candidate set. Let $\mathit{uf}$ be a union-find state on $n$ nodes, let $e$ be a weighted edge with…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in @[trans] lemma Kruskal.UF.SamePartition.trans {n : ℕ} {uf1 uf2 uf3 : UF n} (h1 : UF.SamePartition uf1 uf2) (h2 : UF.SamePartition uf2 uf3) : UF.SamePartition uf1 uf3 := fun i j => (h1 i j).trans (h2 i j)