Kruskal.UF.SamePartition.rfl
theoremverifiedimported Lean
Reflexivity of the same-partition relation. Fix $n \in \bbn$, and recall that a union-find state on $n$ nodes is a function $\mathrm{Fin}\,n \to \bbn$ assigning to each node a representative label. Every such state $\mathit{uf}$ induces the same partition as itself: for all nodes $i, j : \mathrm{Fin}\,n$, one has $\mathit{uf}(i) = \mathit{uf}(j)$ if and only if $\mathit{uf}(i) = \mathit{uf}(j)$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in @[refl] lemma Kruskal.UF.SamePartition.rfl {n : ℕ} (uf : UF n) : UF.SamePartition uf uf
- Source
- TCSlib, `Kruskal.UF.SamePartition.rfl`
- 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.rfl← Kruskal.UF.SamePartition.rfl (TCSlib/GraphTheory/Kruskal/UnionFind.lean:30): 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.mergeAll_cons_eqPeeling 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…
- 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 @[refl] lemma Kruskal.UF.SamePartition.rfl {n : ℕ} (uf : UF n) : UF.SamePartition uf uf := fun _ _ => Iff.rfl