Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, p. 314 — if L⊆(2/11,1]L\subseteq(2/11,1]L⊆(2/11,1] then FFD(L)≤119L∗+4FFD(L)\le\frac{11}{9}L^*+4FFD(L)≤911​L∗+4

Proved
BinPacking.Decreasing.ffd_le_eleven_ninths_large_items

by mikedeng1 · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsbin-packingp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let LLL be a list of real numbers each lying in the half-open interval (2/11,1](2/11,1](2/11,1]. Then First-Fit Decreasing satisfies

FFD(L)≤119 L∗+4.FFD(L)\le\frac{11}{9}\,L^*+4 .FFD(L)≤911​L∗+4.

This is the reduced form of Theorem 3.2 to which Section 3 of the paper brings the whole result: Lemma 3.3 (with r=11/9r=11/9r=11/9, (r−1)/r=2/11(r-1)/r=2/11(r−1)/r=2/11) shows that it suffices to consider lists in (2/11,1](2/11,1](2/11,1], and Theorem 3.4 (since (2/11,1]⊆[1/6,1](2/11,1]\subseteq[1/6,1](2/11,1]⊆[1/6,1]) transfers the bound from FFD to BFD. The paper states it as "the crucial assertion" of Theorem 3.2 and gives an outline of its proof; the complete proof is in Johnson's 1973 thesis.

Preamble
import Mathlib
import Definitions.Def_BinPacking_Decreasing_Model
Formal statement
namespace BinPacking.Decreasing

/-- The reduced assertion of Section 4 (p. 314; restated p. 322): if every element of `L` lies
in `(2/11, 1]`, then `FFD(L) ≤ (11/9) L* + 4`. -/
theorem ffd_le_eleven_ninths_large_items (L : List ℝ) (hL : IsList L)
    (h211 : ∀ a ∈ L, (2 / 11 : ℝ) < a) :
    (FFD L : ℝ) ≤ (11 / 9 : ℝ) * (optBins L : ℝ) + 4 := by sorry

end BinPacking.Decreasing
Source
Johnson, Demers, Ullman, Garey, Graham, Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms, SIAM J. Comput. 3(4) (1974), p. 314, Section 4 (opening sentence); restated p. 322
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Notation:

  • LLL is a list of reals with every entry in (2/11,1](2/11, 1](2/11,1]. The hypotheses are 0<a≤10 < a \le 10<a≤1 and a>2/11a > 2/11a>2/11.
  • L∗L^*L∗ is the least number of unit bins into which the entries can be assigned with every bin sum ≤1\le 1≤1.
  • FFD(L)FFD(L)FFD(L) is the number of bins used when the entries, sorted into nonincreasing order by a stable merge sort, are placed one at a time from no bins into the lowest-indexed bin whose current sum plus the item is ≤1\le 1≤1, otherwise into a new bin.

The statement asserts

FFD(L)≤119 L∗+4FFD(L) \le \tfrac{11}{9}\, L^* + 4FFD(L)≤911​L∗+4

as a real inequality.

For empty LLL, both FFDFFDFFD and L∗L^*L∗ are 000, and the claim reads 0≤40 \le 40≤4.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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