Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.2, p. 12 — Φ(X) = diag(b)⁻¹AXA*diag(b)⁻¹ is a bijection from the PhaseLift feasible set onto the PhaseCutMod feasible set

Proved
PhaseCut.Tight.proposition_4_2

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

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

Let A∈Cn×pA\in\mathbb C^{n\times p}A∈Cn×p and b∈Rnb\in\mathbb R^nb∈Rn. Assume that

  1. bi≠0b_i\neq 0bi​=0 for i=1,…,ni=1,\dots,ni=1,…,n;
  2. AAA is injective;
  3. problem (1) has a solution, i.e. there is x∈Cpx\in\mathbb C^px∈Cp with ∣Ax∣=b|Ax|=b∣Ax∣=b.

Then the map

Φ:Hp→Hn,Φ(X)=diag⁡(b)−1AXA∗diag⁡(b)−1\Phi:\mathbf H_p\to\mathbf H_n,\qquad \Phi(X)=\operatorname{diag}(b)^{-1}AXA^*\operatorname{diag}(b)^{-1}Φ:Hp​→Hn​,Φ(X)=diag(b)−1AXA∗diag(b)−1

is a bijection from the feasible set of PhaseLift, {X⪰0:Tr⁡(aiai∗X)=bi2, i=1,…,n}\{X\succeq 0 : \operatorname{Tr}(a_ia_i^*X)=b_i^2,\ i=1,\dots,n\}{X⪰0:Tr(ai​ai∗​X)=bi2​, i=1,…,n}, onto the feasible set of PhaseCutMod, {U⪰0:diag⁡(U)=1, Tr⁡(MU)=0}\{U\succeq 0 : \operatorname{diag}(U)=1,\ \operatorname{Tr}(MU)=0\}{U⪰0:diag(U)=1, Tr(MU)=0}, where 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).

This bijection is the core of the equivalence between PhaseLift and the modified MaxCut-type relaxation PhaseCutMod: combined with the fact that Φ\PhiΦ preserves the trace objective and the rank, it transfers tightness from PhaseLift to PhaseCutMod (Corollary 4.3).

Formalization Note "A bijection between the feasible points of PhaseCutMod and those of PhaseLift" is stated as Set.BijOn Φ (PhaseLift feasible) (PhaseCutMod feasible): Φ\PhiΦ maps the first set into the second, injectively, and onto it. Φ\PhiΦ is defined on all p×pp\times pp×p complex matrices.

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

open Matrix
open scoped ComplexOrder

/-- Proposition 4.2, p. 12: if `bᵢ ≠ 0` for all `i`, `A` is injective and (1) has a solution, then
`Φ(X) = diag(b)⁻¹AXA*diag(b)⁻¹` maps the feasible set of PhaseLift bijectively onto the feasible
set of PhaseCutMod. -/
theorem proposition_4_2 {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ) (b : Fin n → ℝ)
    (hb : ∀ i, b i ≠ 0) (hA : Function.Injective A.mulVec) (hsol : IsSolvable A b) :
    Set.BijOn (Phi A b) (phaseLiftFeasible A b) (phaseCutModFeasible A b) := by sorry

end PhaseCut.Tight
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, Proposition 4.2, 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