Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Negative-definite quadratic bound on KKK: K(X)≤p(−1.999a2+6.001ab−6b2)K(X)\le p(-1.999a^2+6.001ab-6b^2)K(X)≤p(−1.999a2+6.001ab−6b2) (Chen–Li eq. (4.14), exact case)

Disproved
MatrixCompletion.NoSpuriousMin.K_superlevel_bound

by Shuze Chen · Aug 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-completionmc-no-spuriousnonconvex-optimization

In the setting of the goal theorem, along every aligned direction Δ=X−U\Delta=X-UΔ=X−U (with UU⊤=ZZ⊤UU^\top=ZZ^\topUU⊤=ZZ⊤, X⊤U⪰0X^\top U\succeq0X⊤U⪰0), writing a=∥Δ⊤Δ∥Fa=\|\Delta^\top\Delta\|_Fa=∥Δ⊤Δ∥F​ and b=∥Δ⊤U∥Fb=\|\Delta^\top U\|_Fb=∥Δ⊤U∥F​:

K(X) ≤ p(−1.999 a2+6.001 ab−6 b2).K(X)\ \le\ p\bigl(-1.999\,a^2+6.001\,ab-6\,b^2\bigr).K(X) ≤ p(−1.999a2+6.001ab−6b2).

The quadratic form on the right is negative definite (6.0012<4⋅1.999⋅66.001^2<4\cdot1.999\cdot66.0012<4⋅1.999⋅6), so it is ≤0\le 0≤0 with equality only at a=b=0a=b=0a=b=0. Combined with K(X^)≥0K(\hat X)\ge 0K(X^)≥0 at any local minimum, this forces Δ⊤Δ=0\Delta^\top\Delta=0Δ⊤Δ=0, i.e. X^=U\hat X=UX^=U — the entire landscape argument in one inequality. The proof combines the decomposition of KKK, the perturbation bound, the expansion ∥XX⊤−UU⊤∥F2=∥ΔΔ⊤∥F2+2∥ΔU⊤∥F2+2⟨ΔU⊤,UΔ⊤⟩+4⟨ΔΔ⊤,UΔ⊤⟩\|XX^\top-UU^\top\|_F^2=\|\Delta\Delta^\top\|_F^2+2\|\Delta U^\top\|_F^2+2\langle\Delta U^\top,U\Delta^\top\rangle+4\langle\Delta\Delta^\top,U\Delta^\top\rangle∥XX⊤−UU⊤∥F2​=∥ΔΔ⊤∥F2​+2∥ΔU⊤∥F2​+2⟨ΔU⊤,UΔ⊤⟩+4⟨ΔΔ⊤,UΔ⊤⟩, and the trace inequalities ⟨ΔU⊤,UΔ⊤⟩=∥Δ⊤U∥F2\langle\Delta U^\top,U\Delta^\top\rangle=\|\Delta^\top U\|_F^2⟨ΔU⊤,UΔ⊤⟩=∥Δ⊤U∥F2​ and ⟨Δ⊤Δ,(U+Δ)⊤U⟩≥0\langle\Delta^\top\Delta,(U+\Delta)^\top U\rangle\ge0⟨Δ⊤Δ,(U+Δ)⊤U⟩≥0 furnished by the alignment.

Preamble
import Definitions.Def_MCNoSpuriousMinModel
import Mathlib.LinearAlgebra.Matrix.PosDef
open Matrix MatrixCompletion.NoSpuriousMin
Formal statement
theorem MatrixCompletion.NoSpuriousMin.K_superlevel_bound
    {d r : ℕ} (hd : 2 ≤ d) (hr : 1 ≤ r)
    (Z X U : Matrix (Fin d) (Fin r) ℝ) (Ω : Finset (Fin d × Fin d))
    (p μ κ lam α : ℝ)
    (hμ : 1 ≤ μ) (hκ : 1 ≤ κ) (hcond : sigmaMax Z ≤ κ * sigmaMin Z)
    (hσ : 0 < sigmaMin Z)
    (hinc : Incoherent μ Z) (hZnorm : frobSq Z = (r : ℝ))
    (hα1 : 100 * twoInftyNorm Z ≤ α) (hα2 : α ≤ 200 * twoInftyNorm Z)
    (hlam1 : 100 * sampDevNorm Ω p ≤ lam) (hlam2 : lam ≤ 200 * sampDevNorm Ω p)
    (hp : SampleCondition d r p μ κ)
    (hgood : GoodSample Z Ω p)
    (hU : U * Uᵀ = Z * Zᵀ) (hpsd : (Xᵀ * U).PosSemidef) :
    Kfun Z Ω lam α X U ≤
      p * (-(1999 / 1000) * frobSq ((X - U)ᵀ * (X - U))
        + (6001 / 1000) * frobNorm ((X - U)ᵀ * (X - U)) * frobNorm ((X - U)ᵀ * U)
        - 6 * frobSq ((X - U)ᵀ * U)) := by sorry
Source
Chen, Li 2019, Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA, JMLR 20(142), https://arxiv.org/abs/1711.01742 (v3) [THE canonical reference: all milestones follow its Section 4], p. 20, eq. (4.14), obtained via eqs. (4.8)-(4.13), exact-rank specialization (psi = 0). The psd trace identities (4.10)-(4.13) use the alignment X^T U >= 0 from Section 4.2.1.

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