Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13, p. 10 — the min-terms of (8) are bounded by b·ΣΣ e^{−(i+j−1)σbp}·min{B_i, B_j}

Proved
APrioriTSP.Sampling.lemma_13

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

a-priori-tspapproximation-algorithmslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1random-samplingstochastic-combinatorial-optimization

Let σ∈(0,1)\sigma \in (0,1)σ∈(0,1), 0<p<10 < p < 10<p<1, bbb odd, and let (Cj)j≥1(C_j)_{j\ge1}(Cj​)j≥1​ satisfy Cj≥0C_j \ge 0Cj​≥0 (6) and Ci+j≤Ci+CjC_{i+j} \le C_i + C_jCi+j​≤Ci​+Cj​ for i,j≥1i, j \ge 1i,j≥1 (7). With the buckets BiB_iBi​ of (9),

∑k=1∞(1−σp)k−1∑i=1k−1min⁡{Ci,Ck−i}  ≤  b⋅∑i=0∞∑j=0∞e−(i+j−1)σbpmin⁡{Bi,Bj}.\sum_{k=1}^\infty (1-\sigma p)^{k-1}\sum_{i=1}^{k-1}\min\{C_i, C_{k-i}\} \;\le\; b\cdot\sum_{i=0}^\infty\sum_{j=0}^\infty e^{-(i+j-1)\sigma b p}\min\{B_i, B_j\} .k=1∑∞​(1−σp)k−1i=1∑k−1​min{Ci​,Ck−i​}≤b⋅i=0∑∞​j=0∑∞​e−(i+j−1)σbpmin{Bi​,Bj​}.

This bounds the connection-cost part of the sampling constraint (8) by a quantity that depends only on the buckets; with β=bp\beta = bpβ=bp it yields the bucket form (10) of (8).

Formalization Note The left side is written with the index shift k↦k+1k \mapsto k+1k↦k+1. Both sides are tsums of nonnegative terms that converge under (6)–(7) (Ck≤kC1C_k \le kC_1Ck​≤kC1​, so BiB_iBi​ grows at most linearly while the weights decay geometrically); the right side is an iterated sum over iii, then jjj. The exponent −(i+j−1)σbp-(i+j-1)\sigma bp−(i+j−1)σbp is real, so i=j=0i = j = 0i=j=0 gives +σbp+\sigma bp+σbp.

Differences from the source:

  • generalization: C a feasible solution of (Sampling-OP), p = β/b (§2.2, p. 10) → any real sequence C satisfying (6) and (7), any p ∈ (0, 1); reason: the proof uses only (6) and (7); every p ∈ (0, 1) is β/b with β := bp, so the setting of §2.2 is an instance
  • encoding: an odd integer b ≥ b_0 for the constant b_0 > 0 of §2 (p. 7) → every odd natural number b; reason: b_0 is an arbitrary positive constant, so every odd b ≥ 1 qualifies with b_0 := b
  • generalization: σ = 0.663, fixed at the start of §2 (p. 7) → every σ ∈ (0, 1); reason: the argument uses only 0 < σ < 1, the range of Lemma 9 (ii); σ = 0.663 is an instance
  • encoding: Σ_{k=1}^∞ (1 − σp)^{k−1} Σ_{i=1}^{k−1} min{C_i, C_{k−i}} → Σ_{k≥0} (1 − σp)^k Σ_{i=1}^{k} min{C_i, C_{k+1−i}} (index k ↦ k + 1), and the double series as iterated tsums; reason: same series; all terms are nonnegative and both sides converge under (6)–(7)
Preamble
import Mathlib
import Definitions.Def_APrioriTSP_Sampling_Setting
import Definitions.Def_APrioriTSP_Sampling_LP
Formal statement
namespace APrioriTSP.Sampling

/-- Lemma 13 (p. 10): the min-terms of (8) are bounded through the buckets (left side shifted
`k ↦ k + 1`). -/
theorem lemma_13 (σ p : ℝ) (hσ0 : 0 < σ) (hσ1 : σ < 1) (hp0 : 0 < p) (hp1 : p < 1)
    (b : ℕ) (hb : Odd b) (C : ℕ → ℝ) (hC0 : ∀ i, 1 ≤ i → 0 ≤ C i)
    (hC : ∀ i j, 1 ≤ i → 1 ≤ j → C (i + j) ≤ C i + C j) :
    ∑' k : ℕ, (1 - σ * p) ^ k * ∑ i ∈ Finset.Icc 1 k, min (C i) (C (k + 1 - i)) ≤
      (b : ℝ) * ∑' i : ℕ, ∑' j : ℕ,
        Real.exp (-(((i : ℝ) + j - 1) * σ * b * p)) * min (bucket b C i) (bucket b C j) := by sorry

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