Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

matrix_trace_duality_inequality

Proved

by Harry_Xu · 1 vote · Jun 21, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convex-analysislinear-algebramatrix-completion

Trace duality (von Neumann inequality), Candès–Recht 2009, Lemma 3.2, first part (arXiv:0805.4471, p.15). For any two real matrices A,B∈Rn1×n2A,B\in\mathbb R^{n_1\times n_2}A,B∈Rn1​×n2​, the Frobenius (trace) inner product is bounded by the product of the spectral (operator) norm of AAA and the nuclear norm of BBB:

⟨A,B⟩  ≤  ∥A∥ ∥B∥∗.\langle A,B\rangle \;\le\; \|A\|\,\|B\|_*.⟨A,B⟩≤∥A∥∥B∥∗​.

Here ⟨A,B⟩=∑i,jAijBij=tr⁡(A⊤B)\langle A,B\rangle=\sum_{i,j}A_{ij}B_{ij}=\operatorname{tr}(A^\top B)⟨A,B⟩=∑i,j​Aij​Bij​=tr(A⊤B) (matrixInner), ∥A∥\|A\|∥A∥ is the operator norm (spectralNorm, the largest singular value), and ∥B∥∗=∑kσk(B)\|B\|_*=\sum_k\sigma_k(B)∥B∥∗​=∑k​σk​(B) is the nuclear norm (nuclearNorm, the sum of singular values). This is the statement that the nuclear and spectral norms are dual to one another. It follows from the von Neumann trace inequality tr⁡(A⊤B)≤∑kσk(A)σk(B)\operatorname{tr}(A^\top B)\le\sum_k\sigma_k(A)\sigma_k(B)tr(A⊤B)≤∑k​σk​(A)σk​(B) together with σk(A)≤∥A∥\sigma_k(A)\le\|A\|σk​(A)≤∥A∥; equivalently, writing B=∑kσk(B) ukvk⊤B=\sum_k\sigma_k(B)\,u_k v_k^\topB=∑k​σk​(B)uk​vk⊤​ in its SVD, ⟨A,B⟩=∑kσk(B) (uk⊤Avk)\langle A,B\rangle=\sum_k\sigma_k(B)\,(u_k^\top A v_k)⟨A,B⟩=∑k​σk​(B)(uk⊤​Avk​) and ∣uk⊤Avk∣≤∥A∥|u_k^\top A v_k|\le\|A\|∣uk⊤​Avk​∣≤∥A∥ for unit vectors uk,vku_k,v_kuk​,vk​.

Preamble
import Definitions.Def_matrix_completion_tangent
open MatrixCompletion
Formal statement
theorem matrix_trace_duality_inequality {n₁ n₂ : ℕ} (A B : Matrix (Fin n₁) (Fin n₂) ℝ) : matrixInner A B ≤ spectralNorm A * nuclearNorm B := by sorry
Source
Candès–Recht 2009, arXiv:0805.4471, Lemma 3.2 (p.15)

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