Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 9 — 1n∑k(1n∑j(xk−xj)2)2≤12n2∑k,j(xk−xj)2\frac1n\sum_k(\frac1n\sum_j(x_k-x_j)^2)^2 \le \frac{1}{2n^2}\sum_{k,j}(x_k-x_j)^2n1​∑k​(n1​∑j​(xk​−xj​)2)2≤2n21​∑k,j​(xk​−xj​)2 on [0,1][0,1][0,1]

Proved
EmpiricalBernstein.SVP.corollary_9

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

concentrationinequalitiesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let x1,…,xnx_1, \dots, x_nx1​,…,xn​ be points of [0,1][0,1][0,1]. Then

1n∑k(1n∑j(xk−xj)2)2≤12n2∑k,j(xk−xj)2,\frac1n \sum_{k} \Big( \frac1n \sum_j (x_k - x_j)^2 \Big)^2 \le \frac{1}{2n^2} \sum_{k,j} (x_k - x_j)^2 ,n1​k∑​(n1​j∑​(xk​−xj​)2)2≤2n21​k,j∑​(xk​−xj​)2,

all sums running over 1,…,n1,\dots,n1,…,n.

This is Lemma 8 for X,YX, YX,Y uniformly distributed on the points x1,…,xnx_1,\dots,x_nx1​,…,xn​; it gives the self-boundedness of nVnnV_nnVn​ used in the proof of Theorem 10.

Formalization Note The paper writes {x1,…,xn}⊂[0,1]\{x_1,\dots,x_n\} \subset [0,1]{x1​,…,xn​}⊂[0,1]; the points form a list x:{1,…,n}→[0,1]x : \{1,\dots,n\} \to [0,1]x:{1,…,n}→[0,1], so repetitions are allowed. The paper's index k=1,…,nk = 1,\dots,nk=1,…,n is Lean's k : Fin n. At n=0n = 0n=0 both sides are 000.

Preamble
import Mathlib
Formal statement
namespace EmpiricalBernstein.SVP

/-- Corollary 9 (arXiv:0907.3740v1, p. 4), for a list `x_1, …, x_n` of points of `[0, 1]`. -/
theorem corollary_9 {n : ℕ} (x : Fin n → ℝ) (hx : ∀ i, x i ∈ Set.Icc (0 : ℝ) 1) :
    (1 / (n : ℝ)) * ∑ k, ((1 / (n : ℝ)) * ∑ j, (x k - x j) ^ 2) ^ 2
      ≤ 1 / (2 * (n : ℝ) ^ 2) * ∑ k, ∑ j, (x k - x j) ^ 2 := by sorry

end EmpiricalBernstein.SVP
Source
Maurer, Pontil, Empirical Bernstein Bounds and Sample Variance Penalization, arXiv:0907.3740v1, Corollary 9, p. 4
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