Kruskal.reach_mono
theoremverifiedimported Lean
Monotonicity of reachability under edge addition. Fix $n$, let $e_1$ and $e_2$ be lists of weighted edges on the vertex set $\mathrm{Fin}\,n$, and let $u, v : \mathrm{Fin}\,n$. Suppose $u$ and $v$ are connected by a path through the edges of $e_1$, and that every edge of $e_1$ also occurs in $e_2$. Then $u$ and $v$ are connected by a path through the edges of $e_2$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.reach_mono {n : ℕ} {e1 e2 : List (WEdge n)} {u v : Fin n} (h : Reach e1 u v) (hs : ∀ e ∈ e1, e ∈ e2) : Reach e2 u v
- Source
- TCSlib, `Kruskal.reach_mono`
- 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_mono← Kruskal.reach_mono (TCSlib/GraphTheory/Kruskal/Reach.lean:59): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- Kruskal.symAdj_monoMonotonicity of symmetric adjacency. Fix $n \in \bbn$ and two vertices $u, v \in \mathrm{Fin}\,n$, and let $e_1$ and $e_2$ be lists of…
- 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 7
- 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.reach_mem_iffReachability depends only on the edge set. Fix $n \in \bbn$, and let $l_1$ and $l_2$ be two lists of weighted edges on the vertex set…
- 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.kruskal_optimalOptimality of Kruskal's algorithm. Let $E$ be a list of weighted edges on $n$ vertices, and let $S$ be another such list in which every…
- Kruskal.reach_cons_iffHead–tail decomposition of reachability. Let $g$ be a weighted edge on $n$ vertices with endpoints $p$ and $q$, let $\mathit{rest}$ be a…
- Kruskal.mergeAll_iff_reachMerging preserves the reachability invariant. Fix $n$ and let $uf : \mathrm{Fin}\,n \to \bbn$ be a union-find state assigning each of the…
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_mono {n : ℕ} {e1 e2 : List (WEdge n)} {u v : Fin n} (h : Reach e1 u v) (hs : ∀ e ∈ e1, e ∈ e2) : Reach e2 u v := by induction h with | refl => exact Relation.ReflTransGen.refl | tail _ hcd ih => exact ih.tail (symAdj_mono hcd hs)