Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, TEST(V), second case, p. 38 — if TEST(V) = YES, every T-path has length ≥ V

Proved
HassinRSP.Rounding.test_yes_spec

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 cijc_{ij}cij​ and transition times tijt_{ij}tij​), a time budget TTT, ε>0\varepsilon>0ε>0 and a real VVV. Hassin's test is specified at the top of §3: "This test has the following properties: If it outputs a positive answer then definitely OPT ⩾V\geqslant V⩾V. If it outputs a negative answer, then all we know is that OPT <V(1+ε)< V(1+\varepsilon)<V(1+ε)." This statement is the positive half.

If TEST(V) outputs YES — that is, for no integer c<(n−1)/εc<(n-1)/\varepsilonc<(n−1)/ε is there a 111–nnn path using only edges with cij≤Vc_{ij}\le Vcij​≤V, of transition time at most TTT and rounded length ∑⌊cij(n−1)/(Vε)⌋≤c\sum\lfloor c_{ij}(n-1)/(V\varepsilon)\rfloor\le c∑⌊cij​(n−1)/(Vε)⌋≤c — then every TTT-path qqq satisfies

c(q)≥V.c(q)\ge V .c(q)≥V.

In particular OPT ≥V\ge V≥V. The conclusion covers all TTT-paths, including those through edges with cij>Vc_{ij}>Vcij​>V that TEST deletes. This is what allows the Rounding Algorithm to raise its lower bound to VVV after a YES answer.

Formalization Note. "OPT ≥V\ge V≥V" is expressed as a bound on every TTT-path, so it holds vacuously, as it should, when no TTT-path exists. The hypotheses V>0V>0V>0 and ε<1\varepsilon<1ε<1 are not needed and are omitted.

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

theorem test_yes_spec (I : Instance) (hI : I.WellFormed) (T : ℕ) (ε : ℝ) (hε0 : 0 < ε)
    (V : ℝ) :
    testYes I T ε V → ∀ q, IsTPath I T q → V ≤ pathLen I q := by sorry

end HassinRSP.Rounding
Source
Hassin, Approximation schemes for the restricted shortest path problem, Math. Oper. Res. 17 (1992), p. 38, §3, specification of the ε-approximation test and its 'second case', Procedure TEST(V)
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