Proof of Corollary 4.3, p. 13 — for injective A and bᵢ ≠ 0, Rank(X) = Rank(Φ(X))
ProvedPhaseCut.Tight.rank_Phimatrix-rankp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrieval
Let be injective and let with for all . With , every satisfies
So maps rank-one matrices exactly to rank-one matrices, which is what lets tightness ("a unique rank one solution") pass from PhaseLift to PhaseCutMod.
Formalization Note Rank is Mathlib's Matrix.rank over .
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`, `Rank(X) = Rank(Φ(X))` for every
`p × p` complex matrix `X`. -/
theorem rank_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.rank = (Phi A b X).rank := 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.