§4.3, p. 12 — when (1) is solvable, every optimal solution of PhaseCut is feasible for PhaseCutMod
ProvedPhaseCut.Tight.phaseCut_optimal_mem_phaseCutModFeasiblep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1phase-retrievalphasecutsemidefinite-programming
Let be injective, let , and assume problem (1) is solvable: there is with . Let . Then every optimal solution of
is a feasible point of PhaseCutMod, i.e. it also satisfies .
This justifies PhaseCutMod as a refinement of PhaseCut: in the noiseless case it selects, among the optimal points of PhaseCut, one of minimal .
Formalization Note Injectivity of is not in the page's sentence; it is added because is encoded as , which is the pseudoinverse only for injective , and it is the standing assumption of this mission. The PhaseCut objective is the real part of .
Preamble
import Mathlib import Definitions.Def_PhaseCut_Tight_Defs
Formal statement
namespace PhaseCut.Tight
open Matrix
open scoped ComplexOrder
/-- §4.3, p. 12: when (1) is solvable (and `A` is injective, so that `pinv A` is `A†`), every optimal
solution of PhaseCut is a feasible point of PhaseCutMod. -/
theorem phaseCut_optimal_mem_phaseCutModFeasible {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ)
(b : Fin n → ℝ) (hA : Function.Injective A.mulVec) (hsol : IsSolvable A b) :
∀ U ∈ phaseCutOptimal A b, U ∈ phaseCutModFeasible A b := by sorry
end PhaseCut.Tight
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, §4.3, p. 12 (sentence after (PhaseCutMod))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.