Kruskal.symAdj_symm
theoremverifiedimported Lean
Symmetry of symmetric adjacency. Fix a list of weighted edges on $n$ vertices, and let $u$ and $v$ be two vertices. Recall that $u$ and $v$ are symmetrically adjacent when some edge in the list has $\{u, v\}$ as its pair of endpoints, in either order. If $u$ and $v$ are symmetrically adjacent, then so are $v$ and $u$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.symAdj_symm {n : ℕ} {edges : List (WEdge n)} {u v : Fin n} (h : SymAdj edges u v) : SymAdj edges v u
- Source
- TCSlib, `Kruskal.symAdj_symm`
- 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.symAdj_symm← Kruskal.symAdj_symm (TCSlib/GraphTheory/Kruskal/Reach.lean:44): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- 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…
- Used by 1
- Kruskal.reach_symmSymmetry of reachability. Let $\mathit{edges}$ be a list of weighted edges on $n$ vertices, and call two vertices reachable when they are…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma Kruskal.symAdj_symm {n : ℕ} {edges : List (WEdge n)} {u v : Fin n} (h : SymAdj edges u v) : SymAdj edges v u := h.imp fun _ he => ⟨he.1, he.2.symm⟩