Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.2, pp. 12–13 — (15) Tr(MU) = 0, U ⪰ 0 is equivalent to (16) U = Φ(X) for some X ⪰ 0

Proved
PhaseCut.Tight.eq15_iff_eq16

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrievalphasecutsemidefinite-programming

Let A∈Cn×pA\in\mathbb C^{n\times p}A∈Cn×p be injective, let b∈Rnb\in\mathbb R^nb∈Rn have bi≠0b_i\neq 0bi​=0 for every iii, and assume problem (1), ∣Ax∣=b|Ax|=b∣Ax∣=b, has a solution x∈Cpx\in\mathbb C^px∈Cp. Let 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) and Φ(X)=diag⁡(b)−1AXA∗diag⁡(b)−1\Phi(X)=\operatorname{diag}(b)^{-1}AXA^*\operatorname{diag}(b)^{-1}Φ(X)=diag(b)−1AXA∗diag(b)−1. Then for every U∈Cn×nU\in\mathbb C^{n\times n}U∈Cn×n,

(Tr⁡(MU)=0  and  U⪰0)  ⟺  U=Φ(X)  for some X⪰0, X∈Cp×p.\bigl(\operatorname{Tr}(MU)=0\ \text{ and }\ U\succeq 0\bigr)\iff U=\Phi(X)\ \text{ for some } X\succeq 0,\ X\in\mathbb C^{p\times p}.(Tr(MU)=0  and  U⪰0)⟺U=Φ(X)  for some X⪰0, X∈Cp×p.

This is the first step of the proof of Proposition 4.2: it identifies the cone cut out by the PhaseCutMod constraint Tr⁡(MU)=0\operatorname{Tr}(MU)=0Tr(MU)=0 with the image of the positive semidefinite cone under Φ\PhiΦ, before the diagonal constraints are matched.

Formalization Note The hypotheses are those of Proposition 4.2, including the solvability of (1), which the page assumes for the proposition. U⪰0U\succeq 0U⪰0 and X⪰0X\succeq 0X⪰0 are Mathlib's Matrix.PosSemidef (Hermitian included). Injectivity makes (A∗A)−1A∗(A^*A)^{-1}A^*(A∗A)−1A∗ the pseudoinverse and bi≠0b_i\neq 0bi​=0 makes diag⁡(b)−1\operatorname{diag}(b)^{-1}diag(b)−1 the true inverse.

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

open Matrix
open scoped ComplexOrder

/-- Proof of Proposition 4.2, p. 12: under the hypotheses of Proposition 4.2,
`Tr(MU) = 0, U ⪰ 0` (15) holds iff `U = Φ(X)` for some `X ⪰ 0` (16). -/
theorem eq15_iff_eq16 {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ) (b : Fin n → ℝ)
    (hA : Function.Injective A.mulVec) (hb : ∀ i, b i ≠ 0) (hsol : IsSolvable A b) :
    ∀ U : Matrix (Fin n) (Fin n) ℂ,
      ((Mmat A b * U).trace = 0 ∧ U.PosSemidef) ↔
        ∃ X : Matrix (Fin p) (Fin p) ℂ, X.PosSemidef ∧ U = Phi A b X := by sorry

end PhaseCut.Tight
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, proof of Proposition 4.2, eqs. (15)–(16), pp. 12–13 (cited p. 12)
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