Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 6.3 — the two smallest set sums total at most half

Proved
TreewidthApprox.Partition.merge_step

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

balanced-partitioncombinatoricsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let m≥4m\ge4m≥4 sets have nonnegative integer sums b1,…,bmb_1,\ldots,b_mb1​,…,bm​. Select two distinct sets i,ji,ji,j whose sums are each no greater than every other set's sum. Then

2(bi+bj)≤∑ℓ=1mbℓ.2(b_i+b_j)\le\sum_{\ell=1}^{m}b_\ell.2(bi​+bj​)≤ℓ=1∑m​bℓ​.

This is the bound on a single merge in the paper's three-partition observation.

Formalization Note The finite family may contain zero sums. The two selected indices are distinct; their order is irrelevant.

Preamble
import Mathlib
Formal statement
namespace TreewidthApprox.Partition

/-- Proof of Lemma 6.3, p. 364: among at least four set sums, the two smallest
together account for at most half of the total. -/
theorem merge_step (m : ℕ) (hm : 4 ≤ m) (b : Fin m → ℕ) (i j : Fin m) (hij : i ≠ j)
    (hmin : ∀ l, l ≠ i → l ≠ j → b i ≤ b l ∧ b j ≤ b l) :
    2 * (b i + b j) ≤ ∑ l, b l := by sorry

end TreewidthApprox.Partition
Source
Bodlaender, Drange, Dregi, Fomin, Lokshtanov and Pilipczuk, A c^k n 5-approximation algorithm for treewidth, SIAM J. Comput. 45(2) (2016), p. 364, proof of Lemma 6.3, merge paragraph, https://doi.org/10.1137/130947374
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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