Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 12, p. 10 — buckets of a sequence satisfying the triangle inequality satisfy B_{i+j} ≤ B_i + B_j

Proved
APrioriTSP.Sampling.proposition_12

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 bbb be odd and let (Cj)j≥1(C_j)_{j\ge1}(Cj​)j≥1​ be real numbers with Ci+j≤Ci+CjC_{i+j} \le C_i + C_jCi+j​≤Ci​+Cj​ for all i,j≥1i, j \ge 1i,j≥1 (constraint (7)). Define the buckets

Bi=∑j=max⁡{1, ib−(b−1)/2}ib+(b−1)/2Cj(i≥0).B_i = \sum_{j=\max\{1,\, ib - (b-1)/2\}}^{ib + (b-1)/2} C_j \qquad (i \ge 0).Bi​=j=max{1,ib−(b−1)/2}∑ib+(b−1)/2​Cj​(i≥0).

Then for all i,j≥1i, j \ge 1i,j≥1,

Bi+j≤Bi+Bj.B_{i+j} \le B_i + B_j .Bi+j​≤Bi​+Bj​.

The buckets aggregate bbb consecutive hop sums around ibibib; the proposition says that this aggregation keeps the triangle inequality, which becomes constraint (14) of (Sampling-LP).

Differences from the source:

  • generalization: the buckets of a feasible solution C of (Sampling-OP) → the buckets of any real sequence C satisfying (7); reason: the proof uses only (7); feasible solutions satisfy (7)
  • 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
Preamble
import Mathlib
import Definitions.Def_APrioriTSP_Sampling_Setting
import Definitions.Def_APrioriTSP_Sampling_LP
Formal statement
namespace APrioriTSP.Sampling

/-- Proposition 12 (p. 10): buckets of odd size `b` of a sequence satisfying the triangle
inequality (7) satisfy `B_{i+j} ≤ B_i + B_j` for all `i, j ≥ 1`. -/
theorem proposition_12 (b : ℕ) (hb : Odd b) (C : ℕ → ℝ)
    (hC : ∀ i j, 1 ≤ i → 1 ≤ j → C (i + j) ≤ C i + C j) :
    ∀ i j, 1 ≤ i → 1 ≤ j → bucket b C (i + j) ≤ 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, Proposition 12 and Equation (9)
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