Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, p.9 — k-edge-connectivity is an equivalence relation

Proved
DirKECC1549.Main.sec2_kecc_equivalence

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

directed-graphsedge-connectivityp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let DDD be a directed multigraph and k≥0k\ge0k≥0 an integer. The relation u↔kDvu\leftrightarrow^D_k vu↔kD​v (u=vu=vu=v, or at least kkk pairwise edge-disjoint directed paths from uuu to vvv and at least kkk from vvv to uuu) is reflexive, symmetric and transitive. Its classes are the kkk-edge-connected components, forming the partition Pk(D)P_k(D)Pk​(D).

This makes Pk(D)P_k(D)Pk​(D) well defined, which every later statement uses.

Differences from the source:

  • generalization: directed graph with parallel edges (p.9) → self-loops also allowed; reason: a loop leaves no vertex set and can be deleted from any path, so it changes no out_D, no λ_D and no component; on loop-free multigraphs the statement is exactly the source's
  • encoding: vertex set V and edge multiset E → vertices Fin n, edge ids Fin m, an edge map Fin m → Fin n × Fin n; reason: Lean convention; parallel edges are distinct ids, so every count includes multiplicities as on p.9; same instances
  • encoding: edge-disjoint directed paths; λ_D(u,v) ≥ k → pairwise edge-disjoint trails (walks using no edge id twice); λ ≥ k as "k such trails exist"; reason: edge-disjoint walks shorten to edge-disjoint paths, so the counts agree
  • generalization: the fixed integer k ≥ 2 of p.9 → every k ≥ 0; reason: the relation is defined for every k and the statement specializes to k ≥ 2
Preamble
import Mathlib
import Definitions.Def_DirKECC1549_Main_Graph

set_option autoImplicit false
Formal statement
namespace DirKECC1549.Main

/-- §2, p.9: the `k`-edge-connectivity relation of a directed multigraph is an equivalence
relation (its classes are the `k`-edge-connected components `P_k(D)`). -/
theorem sec2_kecc_equivalence {n m : ℕ} (k : ℕ) (D : Fin m → Fin n × Fin n) :
    Equivalence (KEdgeConnected k D) := by sorry

end DirKECC1549.Main
Source
Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Christos Pergaminelis, STOC 2027 submission #1549 (October 2026), Section 2, p.9
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me