Proof of Corollary 4.3, p. 13 — for injective A and bᵢ ≠ 0, Tr(X) = Tr(BΦ(X))
ProvedPhaseCut.Tight.trace_eq_trace_B_Phip2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrievalpseudoinversetrace
Let be injective with pseudoinverse , and let with for all . With and , every satisfies
So carries the PhaseLift objective to the PhaseCutMod objective; together with Proposition 4.2 it identifies the optimal sets of the two programs.
Preamble
import Mathlib import Definitions.Def_PhaseCut_Tight_Defs
Formal statement
namespace PhaseCut.Tight
open Matrix
open scoped ComplexOrder
/-- Proof of Corollary 4.3, p. 13: for injective `A` and `bᵢ ≠ 0`, `Tr(X) = Tr(BΦ(X))` for every
`p × p` complex matrix `X`. -/
theorem trace_eq_trace_B_Phi {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ) (b : Fin n → ℝ)
(hA : Function.Injective A.mulVec) (hb : ∀ i, b i ≠ 0) :
∀ X : Matrix (Fin p) (Fin p) ℂ, X.trace = (Bmat A b * Phi A b X).trace := by sorry
end PhaseCut.Tight
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, proof of Corollary 4.3, p. 13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.