Proof of Proposition 4.2, pp. 12–13 — (15) Tr(MU) = 0, U ⪰ 0 is equivalent to (16) U = Φ(X) for some X ⪰ 0
ProvedPhaseCut.Tight.eq15_iff_eq16p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrievalphasecutsemidefinite-programming
Let be injective, let have for every , and assume problem (1), , has a solution . Let and . Then for every ,
This is the first step of the proof of Proposition 4.2: it identifies the cone cut out by the PhaseCutMod constraint with the image of the positive semidefinite cone under , 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. and are Mathlib's Matrix.PosSemidef (Hermitian included). Injectivity makes the pseudoinverse and makes 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.