Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 32, p. 31 — for small ε there is a number k of copies matching 1 − (1 − p)^σ and p up to a factor 1 + λ

Proved
APrioriTSP.Sampling.lemma_32

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 σ∈(0,1)\sigma \in (0,1)σ∈(0,1), λ>0\lambda > 0λ>0 and p∈(0,1]p \in (0,1]p∈(0,1]. Then there is εp∈(0,1)\varepsilon_p \in (0,1)εp​∈(0,1) such that for every ε∈(0,εp]\varepsilon \in (0, \varepsilon_p]ε∈(0,εp​] there is k∈Nk \in \mathbb Nk∈N with

  1. 1−(1−ε)k≤p≤εk1 - (1-\varepsilon)^k \le p \le \varepsilon k1−(1−ε)k≤p≤εk,
  2. (1−p)σ≤(1−σε)k(1-p)^\sigma \le (1-\sigma\varepsilon)^k(1−p)σ≤(1−σε)k,
  3. 1−(1−p)σ≤(1+λ)⋅(1−(1−σε)k)1 - (1-p)^\sigma \le (1+\lambda)\cdot\big(1 - (1-\sigma\varepsilon)^k\big)1−(1−p)σ≤(1+λ)⋅(1−(1−σε)k),
  4. (1−ε)k≤(1+λ)⋅(1−p)(1-\varepsilon)^k \le (1+\lambda)\cdot(1-p)(1−ε)k≤(1+λ)⋅(1−p) if p<1p < 1p<1, and (1−ε)k≤λ(1-\varepsilon)^k \le \lambda(1−ε)k≤λ if p=1p = 1p=1.

In the proof of Lemma 9, each customer vvv is replaced by kkk copies of activation probability ε\varepsilonε; the lemma controls the probability that some copy is active or sampled.

Formalization Note (1−p)σ(1-p)^\sigma(1−p)σ is the real power; (1−ε)k(1-\varepsilon)^k(1−ε)k and (1−σε)k(1-\sigma\varepsilon)^k(1−σε)k are natural-number powers. The variable λ\lambdaλ is named lam (a Lean keyword otherwise).

Differences from the source:

  • encoding: k ∈ ℕ → k : ℕ (0 included); reason: the paper's ℕ contains 0 (Lemma 18's base case n = 0); item (i) forces k ≥ 1 anyway, since p > 0
Preamble
import Mathlib
import Definitions.Def_APrioriTSP_Sampling_Setting
Formal statement
namespace APrioriTSP.Sampling

/-- Lemma 32 (p. 31): choosing the number `k` of copies of a customer. -/
theorem lemma_32 (σ lam p : ℝ) (hσ0 : 0 < σ) (hσ1 : σ < 1) (hlam : 0 < lam)
    (hp0 : 0 < p) (hp1 : p ≤ 1) :
    ∃ εp : ℝ, 0 < εp ∧ εp < 1 ∧ ∀ ε : ℝ, 0 < ε → ε ≤ εp → ∃ k : ℕ,
      (1 - (1 - ε) ^ k ≤ p ∧ p ≤ ε * k) ∧
      (1 - p) ^ σ ≤ (1 - σ * ε) ^ k ∧
      1 - (1 - p) ^ σ ≤ (1 + lam) * (1 - (1 - σ * ε) ^ k) ∧
      (p < 1 → (1 - ε) ^ k ≤ (1 + lam) * (1 - p)) ∧
      (p = 1 → (1 - ε) ^ k ≤ lam) := by sorry

end APrioriTSP.Sampling
Source
Blauth, Neuwohner, Puhlmann & Vygen, Improved guarantees for the a priori TSP, arXiv:2309.10663v1, p. 31, Lemma 32
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