Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, TEST(V), p. 38 — rounding decreases each edge-length by at most Vε/(n − 1) and each path-length by at most Vε

Proved
HassinRSP.Rounding.rounding_error

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

p2o-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 with n≥2n\ge 2n≥2, edges (i,j)(i,j)(i,j) with i<ji<ji<j, and positive integer lengths cijc_{ij}cij​. Let ε>0\varepsilon>0ε>0 and V>0V>0V>0, and put δ=Vε/(n−1)\delta=V\varepsilon/(n-1)δ=Vε/(n−1). TEST(V) replaces each length cijc_{ij}cij​ by δ⌊cij/δ⌋=δ c~ijV\delta\lfloor c_{ij}/\delta\rfloor=\delta\,\tilde c^V_{ij}δ⌊cij​/δ⌋=δc~ijV​, where c~ijV=⌊cij(n−1)/(Vε)⌋\tilde c^V_{ij}=\lfloor c_{ij}(n-1)/(V\varepsilon)\rfloorc~ijV​=⌊cij​(n−1)/(Vε)⌋.

Then for every edge (i,j)∈E(i,j)\in E(i,j)∈E,

δ c~ijV≤cijandcij−δ c~ijV≤δ,\delta\,\tilde c^V_{ij}\le c_{ij}\qquad\text{and}\qquad c_{ij}-\delta\,\tilde c^V_{ij}\le \delta,δc~ijV​≤cij​andcij​−δc~ijV​≤δ,

and for every path ppp in EEE (between any two vertices), with c~V(p)\tilde c^V(p)c~V(p) the sum of the rounded lengths of its edges,

δ c~V(p)≤c(p)andc(p)−δ c~V(p)≤Vε.\delta\,\tilde c^V(p)\le c(p)\qquad\text{and}\qquad c(p)-\delta\,\tilde c^V(p)\le V\varepsilon .δc~V(p)≤c(p)andc(p)−δc~V(p)≤Vε.

In the paper's words: "This decreases each edge-length by at most Vε/(n−1)V\varepsilon/(n-1)Vε/(n−1), and each path-length by at most VεV\varepsilonVε." The path bound rests on the fact that, because every edge goes from a smaller to a larger vertex, a path has at most n−1n-1n−1 edges. Both TEST(V) and the final step of the Rounding Algorithm rely on this error estimate.

Formalization Note. The time bound TTT and the upper bound ε<1\varepsilon<1ε<1 play no role and are omitted. The path bound is stated for paths between arbitrary vertices, as in the paper's "each path-length".

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

theorem rounding_error (I : Instance) (hI : I.WellFormed) (ε : ℝ) (hε0 : 0 < ε)
    (V : ℝ) (hV : 0 < V) :
    (∀ e ∈ I.E, V * ε / ((I.n : ℝ) - 1) * roundLen I ε V e ≤ I.c e ∧
      (I.c e : ℝ) - V * ε / ((I.n : ℝ) - 1) * roundLen I ε V e ≤ V * ε / ((I.n : ℝ) - 1)) ∧
    (∀ (i j : ℕ) (p : List ℕ), IsPathIn I.E i j p →
      V * ε / ((I.n : ℝ) - 1) * roundPathLen I ε V p ≤ pathLen I p ∧
      (pathLen I p : ℝ) - V * ε / ((I.n : ℝ) - 1) * roundPathLen I ε V p ≤ V * ε) := by sorry

end HassinRSP.Rounding
Source
Hassin, Approximation schemes for the restricted shortest path problem, Math. Oper. Res. 17 (1992), p. 38, §3, paragraph after the rounding formula
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