Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.5 — P(|B_N − M| ≥ 1 + u) ≤ 8 exp(−u²/(64 N E X₁²)) for 0 ≤ u ≤ 8√2 N E X₁²

Proved
TalagrandConc.BinPacking.theorem_6_5

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

bin-packingconcentration-of-measurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1probability

Let X1,…,XNX_1,\dots,X_NX1​,…,XN​ be independent items with common law μ\muμ on [0,1][0,1][0,1], realised as the coordinates of [0,1]N[0,1]^N[0,1]N under the product probability P=μ⊗NP = \mu^{\otimes N}P=μ⊗N, and let BN(X1,…,XN)B_N(X_1,\dots,X_N)BN​(X1​,…,XN​) be the minimum number of unit bins into which they can be packed. Write EX12=∫ω2 dμ(ω)\mathbb E X_1^2 = \int \omega^2\,d\mu(\omega)EX12​=∫ω2dμ(ω), and let MMM be any median of BNB_NBN​, i.e. P(BN≤M)≥1/2P(B_N \le M) \ge 1/2P(BN​≤M)≥1/2 and P(BN≥M)≥1/2P(B_N \ge M) \ge 1/2P(BN​≥M)≥1/2. Then for all uuu with 0≤u≤82 N EX120 \le u \le 8\sqrt 2\, N\,\mathbb E X_1^20≤u≤82​NEX12​,

P(∣BN(X1,…,XN)−M∣≥1+u)≤8exp⁡(−u264 N EX12).P\big(|B_N(X_1,\dots,X_N) - M| \ge 1 + u\big) \le 8\exp\Big(-\frac{u^2}{64\,N\,\mathbb E X_1^2}\Big).P(∣BN​(X1​,…,XN​)−M∣≥1+u)≤8exp(−64NEX12​u2​).

The variance proxy in the exponent is N EX12N\,\mathbb E X_1^2NEX12​ rather than NNN, which is the scale one expects when items are small, and improves on the martingale bound 2exp⁡(−2t2/N)2\exp(-2t^2/N)2exp(−2t2/N).

Formalization Note The paper writes "for all u≤82NEX12u \le 8\sqrt2 N E X_1^2u≤82​NEX12​"; the restriction u≥0u \ge 0u≥0 is implicit (its proof sets u=4tN(EX12)1/2u = 4t\sqrt N (E X_1^2)^{1/2}u=4tN​(EX12​)1/2 with t>0t>0t>0) and is stated explicitly. When N EX12=0N\,\mathbb E X_1^2 = 0NEX12​=0 the range forces u=0u = 0u=0, and Lean's convention u2/0=0u^2/0 = 0u2/0=0 makes the bound 888.

Preamble
import Mathlib
import Definitions.Def_TalagrandConc_BinPacking_Basic
Formal statement
namespace TalagrandConc.BinPacking

open MeasureTheory

/-- Talagrand (1995), p. 152, Theorem 6.5: if `M` is a median of `B_N` under the product
probability `P = μ^{⊗N}` on `[0,1]^N`, then for all `0 ≤ u ≤ 8 √2 N E X₁²`,
`P(|B_N(X₁, …, X_N) − M| ≥ 1 + u) ≤ 8 exp(−u² / (64 N E X₁²))`.
(The paper writes "for all `u ≤ 8√2 N E X₁²`"; `u ≥ 0` is implicit — its proof sets
`u = 4t √N (E X₁²)^{1/2}` with `t > 0` — and is stated here.) -/
theorem theorem_6_5 (μ : Measure unitInterval) [IsProbabilityMeasure μ] (N : ℕ) (M : ℝ)
    (hM : IsMedian (Measure.pi (fun _ : Fin N => μ)) (fun x => (binNumber x : ℝ)) M)
    (u : ℝ) (hu0 : 0 ≤ u) (hu : u ≤ 8 * Real.sqrt 2 * N * secondMoment μ) :
    Measure.pi (fun _ : Fin N => μ) {x | 1 + u ≤ |(binNumber x : ℝ) - M|} ≤
      ENNReal.ofReal (8 * Real.exp (-(u ^ 2 / (64 * N * secondMoment μ)))) := by sorry

end TalagrandConc.BinPacking
Source
Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publ. Math. IHÉS 81 (1995), p. 152, Theorem 6.5
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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