Kruskal.reach_lift
theoremverifiedimported Lean
Lifting reachability along an edge set. Let $\mathit{edges}$ and $\mathit{edges}'$ be two lists of weighted edges on $n$ vertices, and suppose that whenever two vertices $a$ and $b$ are symmetrically adjacent in $\mathit{edges}$ — that is, some edge of $\mathit{edges}$ has endpoints $\{a,b\}$ — the vertices $a$ and $b$ are connected by a path through $\mathit{edges}'$. Then for any vertices $u$ and $v$, if $u$ and $v$ are connected by a path through $\mathit{edges}$, they are also connected by a path through $\mathit{edges}'$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.reach_lift {n : ℕ} {edges edges' : List (WEdge n)} (h : ∀ a b, SymAdj edges a b → Reach edges' a b) {u v : Fin n} (hr : Reach edges u v) : Reach edges' u v
- Source
- TCSlib, `Kruskal.reach_lift`
- Lean proof
- By [Your Name], [Partner's Name (if applicable)], from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 [Your Name] and [Partner's Name (if applicable)]. 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.reach_lift← Kruskal.reach_lift (TCSlib/GraphTheory/Kruskal/Reach.lean:69): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- Kruskal.SymAdjGiven a list of weighted edges $\mathit{edges}$ on $n$ vertices, $\mathtt{SymAdj}\,\mathit{edges}\,u\,v$ holds when there exists an edge…
- Kruskal.WEdgeA weighted edge over $n$ vertices is a structure with two endpoints $u, v : \mathrm{Fin}\,n$ and a natural-number weight…
- Kruskal.Reach$\mathtt{Reach}\,\mathit{edges}$ is the reflexive--transitive closure of $\mathtt{SymAdj}\,\mathit{edges}$; that is,…
- Used by 4
- Kruskal.exchange_take_headHead-edge exchange preserves reachability. Let $\mathit{base}$ and $\mathit{rest}$ be lists of weighted edges on $n$ vertices, and let $g$…
- Kruskal.exchange_with_baseBase-relative exchange of an edge in Kruskal's algorithm. Let $\mathit{base}$ and $S$ be lists of weighted edges on $n$ vertices, and let…
- Kruskal.uf_exchangeUnion-find form of the exchange argument. Let $\mathit{uf}\colon \mathrm{Fin}\,n \to \bbn$ be a union-find state whose classes coincide…
- Kruskal.exchange_take_head'Edge exchange preserving reachability, reversed orientation. Fix $n$ and consider weighted edges on a vertex set of size $n$, each edge…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inlemma Kruskal.reach_lift {n : ℕ} {edges edges' : List (WEdge n)} (h : ∀ a b, SymAdj edges a b → Reach edges' a b) {u v : Fin n} (hr : Reach edges u v) : Reach edges' u v := by induction hr with | refl => exact Relation.ReflTransGen.refl | tail _ hcd ih => exact ih.trans (h _ _ hcd)