Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 1, p. 3 — for an admissible selection, P = 𝔼[P_𝔖] is positive definite with λmin(P) > 0 and λmax(P) ≤ 1

Proved
SubspaceProxGrad.RPSD.lemma_1

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

average-projectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-definiterandom-subspacesrandomized-algorithms

Let n≥1n\ge1n≥1 and let S\mathfrak SS be a random subspace of Rn\mathbb R^nRn on a probability space (Ω,A,P)(\Omega,\mathcal A,\mathbb P)(Ω,A,P), such that ω↦PS(ω)x\omega\mapsto P_{\mathfrak S(\omega)}xω↦PS(ω)​x is measurable for each xxx. Suppose S\mathfrak SS is admissible, i.e. P[x∈S⊥]<1\mathbb P[x\in\mathfrak S^\perp]<1P[x∈S⊥]<1 for every x≠0x\neq0x=0, and let P=E[PS]\mathsf P=\mathbb E[P_{\mathfrak S}]P=E[PS​] be the average projection. Then P\mathsf PP is a symmetric positive definite matrix, and its extreme eigenvalues satisfy

λmin⁡(P)>0andλmax⁡(P)≤1.\lambda_{\min}(\mathsf P)>0\qquad\text{and}\qquad\lambda_{\max}(\mathsf P)\le 1 .λmin​(P)>0andλmax​(P)≤1.

Precisely: P\mathsf PP is self-adjoint, ⟨x,Px⟩>0\langle x,\mathsf Px\rangle>0⟨x,Px⟩>0 for every x≠0x\ne0x=0, and the Rayleigh extremes satisfy the two bounds above.

The average projection and its extreme eigenvalues govern the whole analysis of RPSD: λmin⁡(P)>0\lambda_{\min}(\mathsf P)>0λmin​(P)>0 is what makes the contraction factor of Theorem 1 strictly less than one, and positive definiteness is what makes Q=P−1/2\mathsf Q=\mathsf P^{-1/2}Q=P−1/2 well defined.

Formalization Note. The hypothesis n≥1n\ge1n≥1 is added: on R0\mathbb R^0R0 there are no eigenvalues, and the Rayleigh infimum over the empty unit sphere is 000. "Positive definite matrix" is read as self-adjoint plus ⟨x,Px⟩>0\langle x,\mathsf Px\rangle>0⟨x,Px⟩>0 for x≠0x\neq0x=0. The measurability hypothesis guarantees that the Bochner integral defining P\mathsf PP is the true expectation.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Prox_Basic
import Definitions.Def_SubspaceProxGrad_RPSD_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace SubspaceProxGrad.RPSD

theorem lemma_1 {n : ℕ} (hn : 0 < n) {Ω : Type*} [MeasurableSpace Ω] (pr : Measure Ω)
    [IsProbabilityMeasure pr] (S : Ω → Submodule ℝ (E n))
    (hS : ∀ x : E n, Measurable fun ω => (S ω).starProjection x)
    (hadm : IsAdmissible pr S) (P : E n →L[ℝ] E n) (hP : IsAvgProj pr S P) :
    IsSelfAdjoint P ∧ (∀ x : E n, x ≠ 0 → 0 < inner ℝ x (P x)) ∧
      0 < lamMin P ∧ lamMax P ≤ 1 := by sorry

end SubspaceProxGrad.RPSD
Source
Grishchenko, Iutzeler & Malick, Proximal gradient methods with adaptive subspace sampling, arXiv:2004.13356v1, p. 3, Lemma 1 (display (2))
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 19, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me