Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11.6, lower bound (radial part): 2nCcˉ≤z∗2\frac{n}{C}\bar c \le z^*2Cn​cˉ≤z∗

Proved
SupplyChainTheory.vrp_radial_bound

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

lower-boundsoperations-researchvehicle-routing

For a unit-demand VRP instance on n≥1n \ge 1n≥1 customers with capacity C≥1C \ge 1C≥1 and metric distances, 2nCcˉ≤z∗2\frac{n}{C}\bar c \le z^*2Cn​cˉ≤z∗, where cˉ\bar ccˉ is the average distance from the depot to the customers. Each route serving the customer set NkN_kNk​ has length at least 2max⁡i∈Nkc0i2\max_{i \in N_k} c_{0i}2maxi∈Nk​​c0i​ by the triangle inequality, hence at least 2∑i∈Nkc0i/∣Nk∣≥2∑i∈Nkc0i/C2\sum_{i \in N_k} c_{0i}/|N_k| \ge 2\sum_{i \in N_k} c_{0i}/C2∑i∈Nk​​c0i​/∣Nk​∣≥2∑i∈Nk​​c0i​/C, and summing over the routes gives the bound. The radial term dominates for large nnn (Theorem 11.7).

Preamble
import Definitions.Def_SupplyChainTheory_vrp
Formal statement
namespace SupplyChainTheory

theorem vrp_radial_bound {n : ℕ} (c : Fin (n + 1) → Fin (n + 1) → ℝ) (hc : VRPMetric c)
    (hn : 1 ≤ n) (C : ℕ) (hC : 1 ≤ C) :
    2 * ((n : ℝ) / C) * avgDepotDist c ≤ vrpOpt c C := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 495, Sect. 11.4.1, the proof of Theorem 11.6 ('We prove the lower bound first')
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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