Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.14 (p = 1, lower bound) — Khintchine inequality

Proved
ModernOnlineLearning.LowerBounds.theorem_A_14_p1

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

khintchine-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1probabilityrademacher

Let N≥1N\ge1N≥1, let x1,…,xNx_1,\ldots,x_Nx1​,…,xN​ be real numbers, and let ε1,…,εN\varepsilon_1,\ldots,\varepsilon_Nε1​,…,εN​ be independent random signs, each equally likely to be −1-1−1 or 111. The p=1p=1p=1 lower bound in Khintchine's inequality is

12(∑n=1Nxn2)1/2≤E∣∑n=1Nεnxn∣.\frac{1}{\sqrt2}\left(\sum_{n=1}^{N}x_n^2\right)^{1/2} \le \mathbb E\left|\sum_{n=1}^{N}\varepsilon_n x_n\right|.2​1​(n=1∑N​xn2​)1/2≤E​n=1∑N​εn​xn​​.

This is the sharp case used to estimate a Rademacher sum in the proof of Theorem 5.1.

Formalization Note The signs form the uniform distribution on Boolean vectors, so the expectation is a finite average. The printed theorem also gives an upper bound and sharp constants for all p>0p>0p>0 and complex coefficients; this item formalizes only the real-coefficient p=1p=1p=1 lower bound.

Preamble
import Mathlib
Formal statement
namespace ModernOnlineLearning.LowerBounds

/-- The lower-bound, real-coefficient `p = 1` case of Theorem A.14,
printed p. 296. Uniform `Bool` vectors are independent Rademacher signs. -/
theorem theorem_A_14_p1 {N : ℕ} (hN : 0 < N) (x : Fin N → ℝ) :
    (1 / Real.sqrt 2) * Real.sqrt (∑ i : Fin N, (x i) ^ 2) ≤
      ((2 : ℝ) ^ N)⁻¹ *
        ∑ ω : Fin N → Bool,
          |∑ i : Fin N, (if ω i then (1 : ℝ) else -1) * x i| := by sorry

end ModernOnlineLearning.LowerBounds
Source
Orabona, arXiv:1912.13213v10, Theorem A.14, p. 296 (p = 1 lower-bound case)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Nov 7, 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