Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 33, p. 33 — lowering activation probabilities (depot fixed at 1) does not increase the cost of an optimum a priori tour

Proved
APrioriTSP.Sampling.lemma_33

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

a-priori-tspapproximation-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-samplingstochastic-combinatorial-optimization

Let (V,c,p)(V, c, p)(V,c,p) be an instance of the a priori TSP with depot ddd, and let T∗T^*T∗ be an optimum a priori tour for it. Let p′:V→(0,1]p' : V \to (0,1]p′:V→(0,1] with p′(v)≤p(v)p'(v) \le p(v)p′(v)≤p(v) for all v∈Vv \in Vv∈V and p′(d)=p(d)=1p'(d) = p(d) = 1p′(d)=p(d)=1. Then

OPT(V,c,p′)≤EA∼p′[c(T∗[A])]≤EA∼p[c(T∗[A])]=OPT(V,c,p).\mathrm{OPT}(V, c, p') \le \mathbb E_{A\sim p'}[c(T^*[A])] \le \mathbb E_{A\sim p}[c(T^*[A])] = \mathrm{OPT}(V, c, p).OPT(V,c,p′)≤EA∼p′​[c(T∗[A])]≤EA∼p​[c(T∗[A])]=OPT(V,c,p).

The lemma gives part (i) of the reduction in the proof of Lemma 9: the normalized instance built from copies of customers has an optimum no larger than the original one.

Formalization Note "Optimum a priori tour" is the hypothesis that T∗T^*T∗ is a tour whose a priori cost under ppp is at most that of every tour.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_APrioriTSP_Sampling_Setting
Formal statement
namespace APrioriTSP.Sampling

/-- Lemma 33 (p. 33): lowering the activation probabilities (keeping the depot at `1`) does not
increase the a priori cost of an optimum tour. -/
theorem lemma_33 {V : Type} [Fintype V] [DecidableEq V]
    (c : V → V → ℝ) (p p' : V → ℝ) (d : V) (hI : IsDepotInstance c p d)
    (hp' : ∀ v, 0 < p' v ∧ p' v ≤ 1) (hle : ∀ v, p' v ≤ p v) (hd : p' d = 1)
    (T : List V) (hT : IsTour T)
    (hopt : ∀ T' : List V, IsTour T' → aPrioriCost c p T ≤ aPrioriCost c p T') :
    aPrioriOpt c p' ≤ aPrioriCost c p' T ∧ aPrioriCost c p' T ≤ aPrioriCost c p T ∧
      aPrioriCost c p T = aPrioriOpt c p := by sorry

end APrioriTSP.Sampling
Source
Blauth, Neuwohner, Puhlmann & Vygen, Improved guarantees for the a priori TSP, arXiv:2309.10663v1, p. 33, Lemma 33
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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