Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, p.9 — λ_D(u,v) is the max-flow and the minimum (u,v)-cut

Proved
DirKECC1549.Main.sec2_maxflow_mincut

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 u≠vu\ne vu=v vertices. Then λD(u,v)\lambda_D(u,v)λD​(u,v), the maximum number of pairwise edge-disjoint directed u→vu\to vu→v paths, equals the u→vu\to vu→v max-flow with unit capacities, and

λD(u,v)=min⁡S: (u,v)-cutoutD(S).\lambda_D(u,v)=\min_{S:\ (u,v)\text{-cut}}\mathrm{out}_D(S).λD​(u,v)=S: (u,v)-cutmin​outD​(S).

This is the edge version of Menger's theorem; the rest of the mission uses it to pass between path counts and cuts.

Formalization Note The max-flow is the largest value of an integral unit-capacity u→vu\to vu→v flow, given by the set of edges carrying flow 111; the minimum is taken over all vertex sets SSS with u∈Su\in Su∈S, v∉Sv\notin Sv∈/S.

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
  • encoding: the u → v max-flow → the maximum value of an integral unit-capacity flow, represented by the set of edges carrying flow 1; reason: by the integrality theorem a unit-capacity network has an integral maximum flow; same value
Preamble
import Mathlib
import Definitions.Def_DirKECC1549_Main_Alg3

set_option autoImplicit false
Formal statement
namespace DirKECC1549.Main

/-- §2, p.9 (max-flow/min-cut display): for distinct vertices `u, v` of a directed multigraph,
`λ_D(u, v)` equals the `u → v` max-flow (the largest value of an integral unit-capacity flow) and
`λ_D(u, v) = min_{S : (u,v)-cut} out_D(S)`. -/
theorem sec2_maxflow_mincut {n m : ℕ} (D : Fin m → Fin n × Fin n) (u v : Fin n) (huv : u ≠ v) :
    IsGreatest {q : ℕ | ∃ F : Finset (Fin m), IsUnitFlow D F u v q} (lam D u v) ∧
    IsLeast ((fun S => outCount D S) '' {S : Finset (Fin n) | IsCut S u v}) (lam D u v) := by sorry

end DirKECC1549.Main
Source
Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Christos Pergaminelis, STOC 2027 submission #1549 (October 2026), Section 2, display after the definition of λ_D, 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