Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.7, p. 14 — if Weak PhaseLift is C-stable at x₀, PhaseCut is (2C + 2√2 + 1)-stable at x₀

Proved
PhaseCut.Stable.theorem_4_7

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

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

Let A∈Cn×pA \in \mathbb{C}^{n\times p}A∈Cn×p be a nonzero measurement matrix, x0∈Cpx_0 \in \mathbb{C}^px0​∈Cp, C>0C > 0C>0 and s≥1s \ge 1s≥1. Consider the two convex relaxations of phase recovery written as projection problems: PhaseCut,

minimize d1(V,F)subject to V∈Hn+∩Hb,(13)\text{minimize } d_1(V,\mathcal{F}) \quad\text{subject to } V \in \mathbf{H}_n^+\cap\mathcal{H}_b, \tag{13}minimize d1​(V,F)subject to V∈Hn+​∩Hb​,(13)

and Weak PhaseLift with the ℓs\ell^sℓs distance,

minimize d(diag⁡(V),b2)subject to V∈Hn+∩F.(14)\text{minimize } d(\operatorname{diag}(V), b^2) \quad\text{subject to } V \in \mathbf{H}_n^+\cap\mathcal{F}. \tag{14}minimize d(diag(V),b2)subject to V∈Hn+​∩F.(14)

An algorithm is CCC-stable at x0x_0x0​ if for all bnoise∈Rnb_{\rm noise}\in\mathbb{R}^nbnoise​∈Rn close enough to zero every minimizer VVV for b=∣Ax0∣+bnoiseb = |Ax_0| + b_{\rm noise}b=∣Ax0​∣+bnoise​ satisfies ∥V−(Ax0)(Ax0)∗∥2≤C∥Ax0∥2∥bnoise∥2\|V - (Ax_0)(Ax_0)^*\|_2 \le C\|Ax_0\|_2\|b_{\rm noise}\|_2∥V−(Ax0​)(Ax0​)∗∥2​≤C∥Ax0​∥2​∥bnoise​∥2​ (Definition 4.5).

Theorem. If Weak PhaseLift is CCC-stable at x0x_0x0​, then PhaseCut is (2C+22+1)(2C + 2\sqrt{2} + 1)(2C+22​+1)-stable at x0x_0x0​.

The theorem says that PhaseCut is "almost as stable as" Weak PhaseLift: whatever stability guarantee is known for the (weak) PhaseLift relaxation transfers to PhaseCut with a constant of the same order.

Formalization Note. Two departures from the printed statement. (i) The page writes "A∈Cn×mA \in \mathbb{C}^{n\times m}A∈Cn×m, for all x0∈Cnx_0 \in \mathbb{C}^nx0​∈Cn"; here x0∈Cpx_0 \in \mathbb{C}^px0​∈Cp with ppp the column dimension of AAA, as Ax0Ax_0Ax0​ requires. (ii) The hypothesis A≠0A \neq 0A=0 is added: for A=0A = 0A=0 and n≥1n \ge 1n≥1 the printed statement is false (F={0}\mathcal{F} = \{0\}F={0}, Weak PhaseLift is trivially stable, while (13) has nonzero minimizers and the PhaseCut bound would force them to vanish); the proof itself works under "A≠0A \neq 0A=0". The case Ax0=0Ax_0 = 0Ax0​=0 is not excluded. The exponent s≥1s \ge 1s≥1 of the ℓs\ell^sℓs distance in (14) is a parameter, and the theorem is stated for each such sss.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_PhaseCut_Stable_Defs
Formal statement
namespace PhaseCut.Stable

open Matrix
open scoped ComplexOrder


/-- **Theorem 4.7** (p. 14). Let `A ∈ ℂ^{n×p}`, `A ≠ 0`, `x₀ ∈ ℂᵖ`, `C > 0` and `s ≥ 1`. If Weak
PhaseLift (in the form (14) with the `lˢ` distance) is `C`-stable at `x₀`, then PhaseCut (in the form
(13)) is `(2C + 2√2 + 1)`-stable at `x₀`. -/
theorem theorem_4_7 {n p : ℕ} (A : Matrix (Fin n) (Fin p) ℂ) (hA : A ≠ 0) (x₀ : Fin p → ℂ)
    (C : ℝ) (hC : 0 < C) (s : ℝ) (hs : 1 ≤ s) (hWPL : WeakPhaseLiftStable A s x₀ C) :
    PhaseCutStable A x₀ (2 * C + 2 * Real.sqrt 2 + 1) := by sorry
end PhaseCut.Stable
Source
Waldspurger, d'Aspremont & Mallat, arXiv:1206.0102v3, Theorem 4.7, p. 14 (Definition 4.5, p. 13; (13), (14), p. 11)
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