Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 4 — M = diag(b)(I − AA†)diag(b) is positive semidefinite

Proved
PhaseCut.Tight.Mmat_posSemidef

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrievalpositive-semidefiniteprojector

Let A∈Cn×pA\in\mathbb C^{n\times p}A∈Cn×p be injective, with pseudoinverse A†=(A∗A)−1A∗A^\dagger=(A^*A)^{-1}A^*A†=(A∗A)−1A∗, and let b∈Rnb\in\mathbb R^nb∈Rn be arbitrary. Then the Hermitian matrix

M=diag⁡(b)(I−AA†)diag⁡(b)M=\operatorname{diag}(b)(\mathbf I-AA^\dagger)\operatorname{diag}(b)M=diag(b)(I−AA†)diag(b)

is positive semidefinite.

The matrix I−AA†\mathbf I-AA^\daggerI−AA† is the orthogonal projector onto the orthogonal complement of the range of AAA. Positive semidefiniteness of MMM makes the quadratic problem (2), min⁡u∗Mu\min u^*Muminu∗Mu over unit-modulus uuu, and its relaxation PhaseCut bounded below by 000; it is used in the proof of Proposition 4.2.

Formalization Note The paper states this for every AAA. Here A†A^\daggerA† is encoded as (A∗A)−1A∗(A^*A)^{-1}A^*(A∗A)−1A∗, which is the pseudoinverse only when AAA is injective, so injectivity is added as a hypothesis; it is the standing assumption of the whole mission.

Preamble
import Mathlib
import Definitions.Def_PhaseCut_Tight_Defs
Formal statement
namespace PhaseCut.Tight

open Matrix
open scoped ComplexOrder

/-- §2.2, p. 4: for injective `A` (so that `pinv A` is `A†`) and any real `b`, the matrix
`M = diag(b)(I − AA†)diag(b)` is positive semidefinite. -/
theorem Mmat_posSemidef {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ) (b : Fin n → ℝ)
    (hA : Function.Injective A.mulVec) :
    (Mmat A b).PosSemidef := by sorry

end PhaseCut.Tight
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, §2.2, pp. 3–4 (sentence after (2); cited p. 4)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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