Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (15.8) — flow value is at most the capacity of any cut

Proved
VanderbeiLP.Networks.flow_le_cut_capacity

by mikedeng1 · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-programmingmax-flownetwork-flowsp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

In the maximum-flow problem on a network (N,A)(N,A)(N,A) with source sss, sink ttt and upper bounds uiju_{ij}uij​, let (x,xts)(x,x_{ts})(x,xts​) be a feasible flow and CCC a cut (s∈Cs\in Cs∈C, t∉Ct\notin Ct∈/C). Then

xts≤κ(C)=∑(i,j)∈Ai∈C, j∉Cuij.x_{ts}\le\kappa(C)=\sum_{\substack{(i,j)\in A\\ i\in C,\ j\notin C}}u_{ij}.xts​≤κ(C)=(i,j)∈Ai∈C, j∈/C​∑​uij​.

This is the weak-duality half of the Max-Flow Min-Cut Theorem 15.1; the book obtains it from the flow-balance identity (15.7).

Preamble
import Mathlib
import Definitions.Def_VanderbeiLP_Networks_MaxFlow
Formal statement
namespace VanderbeiLP.Networks

/-- **Eq. (15.8)** (Vanderbei, *Linear Programming*, 4th ed., p. 234). In the maximum-flow
problem, `x_{ts} ≤ κ(C)` for every feasible flow and every cut set `C`. -/
theorem flow_le_cut_capacity {N : Type*} [Fintype N] [DecidableEq N]
    (A : Finset (N × N)) (hA : IsNetwork A) (u : N × N → ℝ) (s t : N)
    (x : N × N → ℝ) (xts : ℝ) (hx : IsMaxFlowFeasible A u s t x xts)
    (C : Finset N) (hC : IsCut s t C) :
    xts ≤ cutCapacity A u C := by sorry

end VanderbeiLP.Networks
Source
Vanderbei, Linear Programming: Foundations and Extensions, 4th ed., Springer 2014, p. 234 (PDF 245), Eq. (15.8) in the proof of Theorem 15.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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