Decomposition of the auxiliary function (Ge–Jin–Zheng Lemma 7; Chen–Li Lemma 4.7)
ProvedMatrixCompletion.NoSpuriousMin.K_decompositionLet be any exact factor (), , and let be symmetric. Define . Then, exactly,
This algebraic identity is the heart of the unified landscape analysis: at a local minimum by the optimality conditions, yet the right-hand side is negative unless — a single computation replacing the case analysis of Ge–Lee–Ma's original proof. The identity is pure algebra: no sampling model, no incoherence, no tuning conditions enter.
Formalization Note In Chen–Li's notation the right side is with since the residual vanishes in the exact rank- case; the population/deviation split -form is recombined here.
import Definitions.Def_MCNoSpuriousMinModel open Matrix MatrixCompletion.NoSpuriousMin
theorem MatrixCompletion.NoSpuriousMin.K_decomposition
{d r : ℕ} (Z X U : Matrix (Fin d) (Fin r) ℝ) (Ω : Finset (Fin d × Fin d))
(lam α : ℝ)
(hsym : ∀ i j : Fin d, (i, j) ∈ Ω ↔ (j, i) ∈ Ω)
(hU : U * Uᵀ = Z * Zᵀ) :
Kfun Z Ω lam α X U =
frobSq (projSet Ω ((X - U) * (X - U)ᵀ))
- 3 * frobSq (projSet Ω (X * Xᵀ - U * Uᵀ))
+ lam * (regHessQF α X (X - U) - 4 * innerM (regGrad α X) (X - U)) := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5
Read-back — MatrixCompletion.NoSpuriousMin.K_decomposition
For every pair of natural numbers (including the degenerate cases or , where all sums below are empty and both sides of the claimed equality are ), every three real matrices , every finite set of index pairs with , and every pair of real numbers (both completely unrestricted — either may be negative, zero, or positive), the theorem asserts: if
- is symmetric as a set of pairs, i.e. for all ; and
- exactly (as matrices),
then the quantity defined below equals the right-hand side below. Throughout, the following notation abbreviates the definitions used in the statement, all specialized to real matrices with the standard entrywise operations:
- is the matrix that keeps entry when and is otherwise;
- is the entrywise (Frobenius) inner product, and ;
- for a matrix , its -th row norm is ;
- , so that whenever ;
- is the matrix with entries . Edge case: every quotient in this read-back uses the convention that division by zero yields ; in particular, if row of is the zero row then and the corresponding quotient terms are by convention rather than undefined (note that when , even for a zero row, so the convention is genuinely load-bearing there);
- for matrices , writing (again when ),
Writing , the left-hand side is, by unfolding its definition, the real number
where is the matrix
The asserted conclusion is the exact identity of real numbers
with in every occurrence. Note that the right-hand side is written in terms of (not ); under the hypothesis these coincide, but the statement as written uses . The hypotheses are jointly satisfiable (e.g. and , or any symmetric set), so the statement is not vacuous; nothing requires to be nonempty, , , to be nonzero, , or . The claim is a universally quantified equation only — it asserts no inequality, no minimality, and nothing probabilistic; the sampling, incoherence, and second-order-point definitions present in the surrounding context do not appear in this statement.
Confirmed by the mission captain (proposal self-audit).