Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 39 — along the Rounding Algorithm, LB stays a positive lower bound on OPT and UB an upper bound

Proved
HassinRSP.Rounding.rounding_run_bounds

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

approximation-schemep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1restricted-shortest-pathrounding-and-scaling

Consider an instance of the restricted shortest path problem (vertices 1,…,n1,\dots,n1,…,n, n≥2n\ge2n≥2, edges (i,j)(i,j)(i,j) with i<ji<ji<j, positive integer lengths and transition times), a time budget TTT and ε>0\varepsilon>0ε>0. Run Step 1 of the Rounding Algorithm from initial bounds (LB0,UB0)(LB_0,UB_0)(LB0​,UB0​), where LB0>0LB_0>0LB0​>0 and every TTT-path has length at least LB0LB_0LB0​, and let (LBk,UBk)(LB_k,UB_k)(LBk​,UBk​) be the bounds after kkk passes: each pass with UB>2LBUB>2LBUB>2LB tests V=(LB⋅UB)1/2V=(LB\cdot UB)^{1/2}V=(LB⋅UB)1/2 and sets LB←VLB\leftarrow VLB←V on YES, UB←V(1+ε)UB\leftarrow V(1+\varepsilon)UB←V(1+ε) on NO.

Then for every kkk:

  1. LBk>0LB_k>0LBk​>0;
  2. every TTT-path qqq satisfies LBk≤c(q)LB_k\le c(q)LBk​≤c(q);
  3. if some TTT-path has length at most UB0UB_0UB0​, then some TTT-path has length at most UBkUB_kUBk​.

This is the paper's "TEST(V) can be applied now to improve the bounds on OPT. Specifically either LB is increased to VVV or UB is decreased to V(1+ε)V(1+\varepsilon)V(1+ε)": the bounds remain valid bounds on OPT throughout the run.

Formalization Note. "LB ≤\le≤ OPT" is stated as a bound on every TTT-path, and "OPT ≤\le≤ UB" as the existence of a TTT-path of length at most UB, assumed at the start and concluded at every stage. The hypothesis ε<1\varepsilon<1ε<1 is not needed and is omitted; UB0UB_0UB0​ is arbitrary.

Preamble
import Mathlib
import Definitions.Def_HassinRSP_Rounding_Setting
Formal statement
namespace HassinRSP.Rounding

theorem rounding_run_bounds (I : Instance) (hI : I.WellFormed) (T : ℕ) (ε : ℝ)
    (hε0 : 0 < ε) (LB0 UB0 : ℝ) (hLB0 : 0 < LB0)
    (hLB0_le : ∀ q, IsTPath I T q → LB0 ≤ pathLen I q) (k : ℕ) :
    0 < (roundingRun I T ε LB0 UB0 k).1 ∧
    (∀ q, IsTPath I T q → (roundingRun I T ε LB0 UB0 k).1 ≤ pathLen I q) ∧
    ((∃ q, IsTPath I T q ∧ (pathLen I q : ℝ) ≤ UB0) →
      ∃ q, IsTPath I T q ∧ (pathLen I q : ℝ) ≤ (roundingRun I T ε LB0 UB0 k).2) := by sorry

end HassinRSP.Rounding
Source
Hassin, Approximation schemes for the restricted shortest path problem, Math. Oper. Res. 17 (1992), p. 39, §4, second paragraph and Rounding Algorithm Step 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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