Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 403 — for each arc α of a cut D, some chain from a to b meets D in α only

Proved
FordFulkerson56.Planar.exists_chain_meeting_cut_only_at

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

graph-theorynetwork-flowsp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let NNN be a network with source aaa and sink bbb, let DDD be a cut of NNN (a disconnecting set no proper subset of which is disconnecting), and let α∈D\alpha\in Dα∈D. Then there is a chain CCC joining aaa and bbb which meets DDD in α\alphaα only:

C∩D={α}.C\cap D=\{\alpha\}.C∩D={α}.

This is the step of the proof of Theorem 2 that uses the minimality of a cut: in that proof it is applied to two arcs α1,α2\alpha_1,\alpha_2α1​,α2​ of a cut that lie on the same chain. It holds in every network; no planarity is needed.

Preamble
import Mathlib
import Definitions.Def_FordFulkerson56_MinCut_Network
import Definitions.Def_FordFulkerson56_MinCut_IsChain
import Definitions.Def_FordFulkerson56_MinCut_IsDisconnecting
Formal statement
namespace FordFulkerson56.Planar

/-- Proof of Theorem 2, p. 403: since `D` is a cut, for each arc `α ∈ D` there is a chain joining the
source and the sink which meets `D` in `α` only. -/
theorem exists_chain_meeting_cut_only_at {V E : Type*} [Fintype V] [DecidableEq V] [Fintype E]
    [DecidableEq E] (N : FordFulkerson56.MinCut.Network V E) (D : Finset E) (hD : FordFulkerson56.MinCut.IsCut N D) (α : E) (hα : α ∈ D) :
    ∃ C : Finset E, FordFulkerson56.MinCut.IsChain N N.source N.sink C ∧ C ∩ D = {α} := by sorry

end FordFulkerson56.Planar
Source
Ford & Fulkerson, Maximal Flow Through a Network, Canad. J. Math. 8 (1956), p. 403, proof of Theorem 2, sentences beginning "Since D is a cut"
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