Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chapter I, Corollary 5.4 — unions and intersections of minimal cuts are minimal cuts

Proved
FlowsNetworks.MaxFlow.minimal_cuts_union_inter

by Shuze Chen · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

minimum-cutnetwork-flows

Let [N;A][N; \mathcal A][N;A] be a network with nonnegative capacities ccc and let s≠ts \neq ts=t. If (X,Xˉ)(X, \bar X)(X,Xˉ) and (Y,Yˉ)(Y, \bar Y)(Y,Yˉ) are minimal cuts separating sss and ttt, then

(X∪Y,X∪Y‾)and(X∩Y,X∩Y‾)(X \cup Y, \overline{X \cup Y}) \quad\text{and}\quad (X \cap Y, \overline{X \cap Y})(X∪Y,X∪Y)and(X∩Y,X∩Y)

are also minimal cuts.

So the source sides of minimal cuts form a lattice under union and intersection; in particular there is a smallest and a largest one, which Theorem 5.5 identifies.

Formalization Note The book's "two distinguished nodes" s,ts, ts,t are assumed distinct (s≠ts \neq ts=t). Cuts are given by their node sets.

Preamble
import Mathlib
import Definitions.Def_FlowsNetworks_MaxFlow_Network
Formal statement
namespace FlowsNetworks.MaxFlow

/-- Ford–Fulkerson, *Flows in Networks*, Chapter I, Corollary 5.4 (p. 23): if `(X, X̄)` and
`(Y, Ȳ)` are minimal cuts, then `(X ∪ Y, (X ∪ Y)‾)` and `(X ∩ Y, (X ∩ Y)‾)` are also minimal
cuts. -/
theorem minimal_cuts_union_inter {N : Type} [Fintype N] [DecidableEq N]
    (G : Network N) (s t : N) (hst : s ≠ t) (X Y : Finset N)
    (hX : IsMinCut G s t X) (hY : IsMinCut G s t Y) :
    IsMinCut G s t (X ∪ Y) ∧ IsMinCut G s t (X ∩ Y) := by sorry

end FlowsNetworks.MaxFlow
Source
Ford & Fulkerson, Flows in Networks, RAND Report R-375-PR (1962), Chapter I, p. 23, Corollary 5.4
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Let NNN be a finite node type with decidable equality, and let GGG be a network on NNN:

  • arc set A⊆N×N\mathcal A\subseteq N\times NA⊆N×N of ordered pairs with no loops;
  • capacity ccc with c≥0c\ge0c≥0 on arcs.

Let s,t∈Ns,t\in Ns,t∈N with s≠ts\ne ts=t. For a node set ZZZ, the cut capacity is

c(Z,Zˉ)=∑(x,y)∈A, x∈Z, y∉Zc(x,y).c(Z,\bar Z) = \sum_{(x,y)\in\mathcal A,\ x\in Z,\ y\notin Z} c(x,y).c(Z,Zˉ)=(x,y)∈A, x∈Z, y∈/Z∑​c(x,y).

ZZZ is a minimal cut if s∈Zs\in Zs∈Z, t∉Zt\notin Zt∈/Z, and c(Z,Zˉ)≤c(W,Wˉ)c(Z,\bar Z)\le c(W,\bar W)c(Z,Zˉ)≤c(W,Wˉ) for every WWW with s∈Ws\in Ws∈W and t∉Wt\notin Wt∈/W.

Conclusion. If XXX and YYY are both minimal cuts, then X∪YX\cup YX∪Y and X∩YX\cap YX∩Y are both minimal cuts.

Degenerate cases.

  • If X=YX = YX=Y, the statement is immediate.
  • If A\mathcal AA is empty, every set containing sss and not ttt has capacity 000 and is a minimal cut. The union and intersection again contain sss and not ttt.
  • NNN has at least two elements.
Human review
  • Endorsed by Community (Bot) · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 20, 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