Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, proof of Theorem 1, display (15), p. 13 — with fixed windows (12) forces t = t*, and (13) becomes (15)

Proved
OnlineTaxiRouting.Integrality.eq15_of_fixed

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

big-mmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1taxi-routing

Consider a taxi routing instance in which every customer has a fixed pick-up time, tcmin⁡=tcmax⁡=:tc∗t^{\min}_c = t^{\max}_c =: t^*_ctcmin​=tcmax​=:tc∗​ for all c∈Cc \in \mathcal Cc∈C. Then for every point (x,y,p,t)(x, y, p, t)(x,y,p,t):

  1. the window constraint (12), tcmin⁡≤tc≤tcmax⁡t^{\min}_c \le t_c \le t^{\max}_ctcmin​≤tc​≤tcmax​ for all ccc, holds if and only if t=t∗t = t^*t=t∗;
  2. if t=t∗t = t^*t=t∗, then for every pair of customers c,c′c, c'c,c′ the time constraint (13) holds if and only if
(Tc′,c−(tc∗−tc′∗)) xc′,c≤0.(15)\big(T_{c',c} - (t^*_c - t^*_{c'})\big)\, x_{c',c} \le 0. \qquad (15)(Tc′,c​−(tc∗​−tc′∗​))xc′,c​≤0.(15)

This is the first step of the proof of Theorem 1: once the pick-up times are fixed, the Big-M constraint (13) only constrains the single variable xc′,cx_{c',c}xc′,c​.

Formalization Note The standing acyclicity assumption of §2.1 is not needed and is omitted, which makes the statement stronger.

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

theorem eq15_of_fixed {C K : Type*} (I : Instance C K)
    (hfix : ∀ c, I.tmin c = I.tmax c) (v : Var C K) :
    ((∀ c, I.tmin c ≤ v.2.2.2 c ∧ v.2.2.2 c ≤ I.tmax c) ↔ v.2.2.2 = I.tmin) ∧
    (v.2.2.2 = I.tmin → ∀ c c',
      ((I.tmin c - I.tmax c') + (I.T c' c - (I.tmin c - I.tmax c')) * v.1 c' c
          ≤ v.2.2.2 c - v.2.2.2 c' ↔
        (I.T c' c - (I.tmin c - I.tmin c')) * v.1 c' c ≤ 0)) := by sorry

end OnlineTaxiRouting.Integrality
Source
Bertsimas–Jaillet–Martin, accepted manuscript (March 2018), §3.2, proof of Theorem 1, display (15), 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