Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
โ† Formalpedia

p. 38 โ€” (28) and (27) yield the threshold bound, hence ๐“• โІ ๐“”_s when ฮดโ‚€ = s/(2ep)

Proved
SubsetShrink.Events.F_subset_E

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 XโˆˆRnร—pX\in\mathbb R^{n\times p}XโˆˆRnร—p have columns of unit Euclidean norm, let ฯƒ>0\sigma>0ฯƒ>0, 1โ‰คsโ‰คp1\le s\le p1โ‰คsโ‰คp, and ฮด0=s/(2ep)\delta_0 = s/(2ep)ฮด0โ€‹=s/(2ep). Then for every uโˆˆB0(s)u\in B_0(s)uโˆˆB0โ€‹(s),

[4+2]โ€‰ฯƒmaxโก(โˆ‘j=1pujโ™ฏlogโก(2p/j),ย logโก(1/ฮด0)โ€‰โˆฅXuโˆฅ)โ‰ค[4+2]โ€‰ฯƒslogโก(2ep/s)โ€‰โˆฅuโˆฅ,[4+\sqrt2]\,\sigma\max\Bigl(\sum_{j=1}^p u^\sharp_j\sqrt{\log(2p/j)},\ \sqrt{\log(1/\delta_0)}\,\|Xu\|\Bigr)\le[4+\sqrt2]\,\sigma\sqrt{s\log(2ep/s)}\,\|u\|,[4+2โ€‹]ฯƒmax(j=1โˆ‘pโ€‹ujโ™ฏโ€‹log(2p/j)โ€‹,ย log(1/ฮด0โ€‹)โ€‹โˆฅXuโˆฅ)โ‰ค[4+2โ€‹]ฯƒslog(2ep/s)โ€‹โˆฅuโˆฅ,

and consequently the event F\mathcal FF (with this ฮด0\delta_0ฮด0โ€‹) is contained in the event Es\mathcal E_sEsโ€‹.

Together with the bound P(F)โ‰ฅ1โˆ’ฮด0/2\mathbb P(\mathcal F)\ge1-\delta_0/2P(F)โ‰ฅ1โˆ’ฮด0โ€‹/2 this gives P(Es)โ‰ฅ1โˆ’s/(4ep)\mathbb P(\mathcal E_s)\ge1-s/(4ep)P(Esโ€‹)โ‰ฅ1โˆ’s/(4ep), the first part of Theorem 1.

Formalization Note Events are sets of noise vectors ฯตโˆˆRn\epsilon\in\mathbb R^nฯตโˆˆRn (F, E of the definition file); uโ™ฏu^\sharpuโ™ฏ enters through sortedSum.

Preamble
import Mathlib
import Definitions.Def_SubsetShrink_Events_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SubsetShrink.Events
theorem F_subset_E {n p s : โ„•} (X : Matrix (Fin n) (Fin p) โ„) (hX : UnitCols X)
    (ฯƒ : โ„) (hฯƒ : 0 < ฯƒ) (hs : 1 โ‰ค s) (hsp : s โ‰ค p) :
    (โˆ€ u : Fin p โ†’ โ„, l0 u โ‰ค s โ†’
      (4 + Real.sqrt 2) * ฯƒ * max (sortedSum u)
          (Real.sqrt (Real.log (1 / ((s : โ„) / (2 * Real.exp 1 * p)))) * l2 (X.mulVec u)) โ‰ค
        (4 + Real.sqrt 2) * ฯƒ * Real.sqrt ((s : โ„) * Real.log (2 * Real.exp 1 * p / s)) *
          l2 u) โˆง
      F X ฯƒ ((s : โ„) / (2 * Real.exp 1 * p)) โІ E X ฯƒ 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 (28) and the sentence after it
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