Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 38, display after (27) — ∑_{j≤s} log(2p/j) = s log(2p) − log(s!) ≤ s log(2ep/s)

Proved
SubsetShrink.Events.sum_log_bound

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

gaussian-noisehigh-probability-eventsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-regression

Let 1≤s≤p1\le s\le p1≤s≤p be integers. Then

∑j=1slog⁡(2p/j)=slog⁡(2p)−log⁡(s!)≤slog⁡(2ep/s).\sum_{j=1}^{s}\log(2p/j) = s\log(2p)-\log(s!)\le s\log(2ep/s).j=1∑s​log(2p/j)=slog(2p)−log(s!)≤slog(2ep/s).

The inequality is the bound log⁡(s!)≥slog⁡(s/e)\log(s!)\ge s\log(s/e)log(s!)≥slog(s/e) rewritten; it controls the sum of the squared weights log⁡(2p/j)\log(2p/j)log(2p/j) of the sorted-ℓ1\ell_1ℓ1​ term over the first sss indices, which enters the proof of Theorem 1 through (28).

Formalization Note The sum runs over j∈{1,…,s}j\in\{1,\dots,s\}j∈{1,…,s} (Finset.Icc 1 s) with natural logarithms; p≥s≥1p\ge s\ge1p≥s≥1 keeps every logarithm's argument positive.

Preamble
import Mathlib
import Definitions.Def_SubsetShrink_Events_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SubsetShrink.Events
theorem sum_log_bound {p s : ℕ} (hs : 1 ≤ s) (hsp : s ≤ p) :
    ∑ j ∈ Finset.Icc 1 s, Real.log (2 * (p : ℝ) / j) =
        (s : ℝ) * Real.log (2 * p) - Real.log (s.factorial) ∧
      ∑ j ∈ Finset.Icc 1 s, Real.log (2 * (p : ℝ) / j) ≤
        (s : ℝ) * Real.log (2 * Real.exp 1 * p / s) := by sorry
end SubsetShrink.Events
Source
Mazumder, Radchenko & Dedieu, Subset Selection with Shrinkage, arXiv:1708.03288v4, p. 38, proof of Theorem 1 (B.1), display after (27)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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