Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6.8, p. 19 — ‖H‖_F ≤ ‖H + K‖_F when ⟨H, K⟩ = 0

Proved
IRLSM.RIP.frobeniusNorm_le_of_traceInner_eq_zero

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

low-rank-recoveryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let H,KH, KH,K be real n×pn\times pn×p matrices with ⟨H,K⟩=Tr⁡(HK⊤)=0\langle H, K\rangle = \operatorname{Tr}(HK^{\top}) = 0⟨H,K⟩=Tr(HK⊤)=0. Then

∥H∥F≤∥H+K∥F.\|H\|_F \le \|H + K\|_F .∥H∥F​≤∥H+K∥F​.

In the proof of Proposition 6.8 this is the step ∥H0∥F≤∥H0+H1∥F\|H_0\|_F \le \|H_0 + H_1\|_F∥H0​∥F​≤∥H0​+H1​∥F​, "by orthogonality of H0H_0H0​ and H1H_1H1​".

Formalization Note. The page writes ∥H0+H1∥\|H_0 + H_1\|∥H0​+H1​∥ for the Frobenius norm ∥H0+H1∥F\|H_0 + H_1\|_F∥H0​+H1​∥F​.

Preamble
import Mathlib
import Definitions.Def_IRLSM_Convergence_Basic

open HighDimStat.MatrixRank Matrix
Formal statement
namespace IRLSM.RIP

/-- If `⟨H, K⟩ = 0` then `‖H‖_F ≤ ‖H + K‖_F`.

Fornasier–Rauhut–Ward, arXiv:1010.2471v4, proof of Proposition 6.8, p. 19 (second inequality of
"‖H₀‖_* ≤ √(2k)‖H₀‖_F ≤ √(2k)‖H₀ + H₁‖ by orthogonality of H₀ and H₁"; the page writes
`‖H₀ + H₁‖` for the Frobenius norm).

Formalization Note: real matrices; `⟨·,·⟩` is `traceInner`. -/
theorem frobeniusNorm_le_of_traceInner_eq_zero {n p : ℕ} (H K : Matrix (Fin n) (Fin p) ℝ)
    (h : traceInner H K = 0) :
    frobeniusNorm H ≤ frobeniusNorm (H + K) := by sorry

end IRLSM.RIP
Source
Fornasier, Rauhut, Ward, Low-rank matrix recovery via iteratively reweighted least squares minimization, arXiv:1010.2471v4 (2011), proof of Proposition 6.8, p. 19, second inequality of ‖H0‖_* ≤ √(2k)‖H0‖_F ≤ √(2k)‖H0 + H1‖
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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