Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(28), p. 38 — ∑_j u♯_j √log(2p/j) ≤ ‖u‖ √(∑_{j≤s} log(2p/j)) ≤ √(s log(2ep/s)) ‖u‖ for u ∈ B₀(s)

Proved
SubsetShrink.Events.eq_28

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 and let u∈Rpu\in\mathbb R^pu∈Rp satisfy ∥u∥0≤s\|u\|_0\le s∥u∥0​≤s. Write u1♯≥⋯≥up♯u^\sharp_1\ge\dots\ge u^\sharp_pu1♯​≥⋯≥up♯​ for the non-increasing rearrangement of ∣u1∣,…,∣up∣|u_1|,\dots,|u_p|∣u1​∣,…,∣up​∣. Then

∑j=1puj♯log⁡(2p/j)≤∥u∥∑j=1slog⁡(2p/j)≤slog⁡(2ep/s) ∥u∥.\sum_{j=1}^{p}u^\sharp_j\sqrt{\log(2p/j)}\le\|u\|\sqrt{\sum_{j=1}^{s}\log(2p/j)}\le\sqrt{s\log(2ep/s)}\,\|u\|.j=1∑p​uj♯​log(2p/j)​≤∥u∥j=1∑s​log(2p/j)​≤slog(2ep/s)​∥u∥.

This bounds the sorted-ℓ1\ell_1ℓ1​ entry of the event F\mathcal FF by the threshold of Es\mathcal E_sEs​ for sss-sparse vectors, the second ingredient of the inclusion F⊆Es\mathcal F\subseteq\mathcal E_sF⊆Es​.

Formalization Note The left side is the definition sortedSum: the maximum over permutations π\piπ of ∑j∣uπ(j)∣log⁡(2p/j)\sum_j|u_{\pi(j)}|\sqrt{\log(2p/j)}∑j​∣uπ(j)​∣log(2p/j)​, equal to the sorted sum by the rearrangement inequality (the weights are non-increasing and non-negative). Indices of Fin p are 0-based.

Preamble
import Mathlib
import Definitions.Def_SubsetShrink_Events_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SubsetShrink.Events
theorem eq_28 {p s : ℕ} (hs : 1 ≤ s) (hsp : s ≤ p) (u : Fin p → ℝ) (hu : l0 u ≤ s) :
    sortedSum u ≤ l2 u * Real.sqrt (∑ j ∈ Finset.Icc 1 s, Real.log (2 * (p : ℝ) / j)) ∧
      l2 u * Real.sqrt (∑ j ∈ Finset.Icc 1 s, Real.log (2 * (p : ℝ) / j)) ≤
        Real.sqrt ((s : ℝ) * Real.log (2 * Real.exp 1 * p / s)) * l2 u := by sorry
end SubsetShrink.Events
Source
Mazumder, Radchenko & Dedieu, Subset Selection with Shrinkage, arXiv:1708.03288v4, p. 38, proof of Theorem 1 (B.1), (28)
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