Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, pp. 12–13 — the relaxed network-flow system (6)–(11) on any arc subset has 0/1 extreme points

Proved
OnlineTaxiRouting.Integrality.flowRelax_extreme_zeroOne

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

extreme-pointsintegralitynetwork-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1total-unimodularity

Let C\mathcal CC and K\mathcal KK be finite sets of customers and taxis, and let A⊆C×CA \subseteq \mathcal C \times \mathcal CA⊆C×C and B⊆K×CB \subseteq \mathcal K \times \mathcal CB⊆K×C be arbitrary sets of arcs. Let PA,BP_{A,B}PA,B​ be the set of (x,y,p)(x, y, p)(x,y,p) with

pc=∑kyk,c+∑c′xc′,c ∀c,∑cxc′,c≤pc′ ∀c′,∑cyk,c≤1 ∀k,0≤x,y,p≤1,p_c = \sum_{k} y_{k,c} + \sum_{c'} x_{c',c}\ \forall c, \quad \sum_{c} x_{c',c} \le p_{c'}\ \forall c', \quad \sum_c y_{k,c} \le 1\ \forall k, \quad 0 \le x, y, p \le 1,pc​=k∑​yk,c​+c′∑​xc′,c​ ∀c,c∑​xc′,c​≤pc′​ ∀c′,c∑​yk,c​≤1 ∀k,0≤x,y,p≤1,

and xc′,c=0x_{c',c} = 0xc′,c​=0 for (c′,c)∉A(c',c) \notin A(c′,c)∈/A, yk,c=0y_{k,c} = 0yk,c​=0 for (k,c)∉B(k,c) \notin B(k,c)∈/B. Then every extreme point of PA,BP_{A,B}PA,B​ has all coordinates xc′,cx_{c',c}xc′,c​, yk,cy_{k,c}yk,c​, pcp_cpc​ in {0,1}\{0,1\}{0,1}.

The paper observes that the constraints (6)–(11) describe a max-flow problem with integer bounds, so that the extreme points of the relaxation are integral and the simplex method returns an integral optimum; the proof of Theorem 1 ends by applying the same fact to the system in which some variables have been removed.

Formalization Note The page states the claim for the variables on the arcs of G\mathcal GG (and, in the proof of Theorem 1, for the system with variables removed). The statement here quantifies over every arc subset, which covers both cases (AAA, BBB everything is the system (6)–(11) as printed). No acyclicity is assumed: AAA may contain cycles and loops (c,c)(c, c)(c,c).

Preamble
import Mathlib
import Definitions.Def_OnlineTaxiRouting_Integrality_Setting
Formal statement
namespace OnlineTaxiRouting.Integrality

theorem flowRelax_extreme_zeroOne {C K : Type*} [Fintype C] [Fintype K]
    (A : C → C → Prop) (B : K → C → Prop) :
    ∀ w ∈ Set.extremePoints ℝ (flowRelax A B), IsZeroOneFlow w := by sorry

end OnlineTaxiRouting.Integrality
Source
Bertsimas–Jaillet–Martin, accepted manuscript (March 2018), §3.2, Max Flow Heuristic, pp. 12–13; proof of Theorem 1, p. 13
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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