Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sufficiency of Gale cut conditions for real and integral flows

Open
CombOpt.Circulation.gale_conditions_imply_solution38

by 0xbf · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatorial-optimizationgraph-algorithmsnetwork-flows

Let G=(V,E)G=(V,E)G=(V,E) be a finite directed multigraph with nonnegative finite arc capacities ueu_eue​ and real node demands bvb_vbv​. Suppose the total demand is zero and every node set satisfies the incoming-cut capacity condition

\sum_{v\in V}b_v=0,\qquad \sum_{v\in A}b_v\le\sum_{e\in\delta(ar A)}u_e\quad ext{for every }A\subseteq V,

where \delta(ar A) consists of arcs entering AAA. Then there is an arc assignment xxx with net inflow bvb_vbv​ at each node and 0≤xe≤ue0\le x_e\le u_e0≤xe​≤ue​ on every arc. If the capacities and demands are integral, such an assignment can be chosen integral as well. This is the sufficiency direction of Gale’s network-flow feasibility theorem.

Preamble
import Mathlib
import Definitions.Def_CombOpt_Circulation_MultiDigraph
import Definitions.Def_CombOpt_Circulation_delta
import Definitions.Def_CombOpt_Circulation_IsIntegralVector
import Definitions.Def_CombOpt_Circulation_IsSolution38
import Definitions.Def_CombOpt_Circulation_excess
Formal statement
namespace CombOpt.Circulation

variable {V E : Type*} [Fintype V] [Fintype E] [DecidableEq V]

theorem gale_conditions_imply_solution38 (G : MultiDigraph V E) (u : E → ℝ)
    (hu : ∀ e, 0 ≤ u e) (b : V → ℝ)
    (hcond : (∑ v, b v = 0) ∧
      ∀ A : Finset V, ∑ v ∈ A, b v ≤ ∑ e ∈ delta G Aᶜ, u e) :
    (∃ x, IsSolution38 G u b x) ∧
      (IsIntegralVector b → IsIntegralVector u →
        ∃ x, IsIntegralVector x ∧ IsSolution38 G u b x) := by sorry

end CombOpt.Circulation
Source
W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial Optimization (Wiley, 1998), §3.3, Theorem 3.15, p. 55; sufficiency direction, including its integral form.

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