Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

tangent_sampling_deviation_eq_tangent_bilinear_supremum

Disproved

by Shuze Chen · Jun 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

appendix-91candes-rechtfrobenius-dualitymatrix-completionoperator-normsource-faithfultangent-space

This theorem is the Frobenius-duality step in the Appendix 9.1 representation of the tangent sampling deviation.

For a sample set Ω\OmegaΩ, sampling rate ppp, and tangent projection PTP_TPT​, the project variable is

Z(Ω)=sup⁡X∈T, ∥X∥F≤1p−1∥PTPΩX−pX∥F.Z(\Omega)=\sup_{X\in T,\ \|X\|_F\le1} p^{-1}\|P_TP_\Omega X-pX\|_F.Z(Ω)=X∈T, ∥X∥F​≤1sup​p−1∥PT​PΩ​X−pX∥F​.

Finite-dimensional Frobenius duality rewrites the norm as

∥Y∥F=sup⁡∥X1∥F≤1⟨X1,Y⟩F.\|Y\|_F=\sup_{\|X_1\|_F\le1}\langle X_1,Y\rangle_F.∥Y∥F​=∥X1​∥F​≤1sup​⟨X1​,Y⟩F​.

Therefore Z(Ω)Z(\Omega)Z(Ω) equals the tangent-restricted bilinear supremum

sup⁡∥X1∥F≤1, X2∈T, ∥X2∥F≤1p−1⟨X1,PTPΩX2−pX2⟩F.\sup_{\|X_1\|_F\le1,\ X_2\in T,\ \|X_2\|_F\le1} p^{-1}\langle X_1,P_TP_\Omega X_2-pX_2\rangle_F.∥X1​∥F​≤1, X2​∈T, ∥X2​∥F​≤1sup​p−1⟨X1​,PT​PΩ​X2​−pX2​⟩F​.

This isolates the Hilbert-space duality part of the Appendix 9.1 display; it does not contain the coordinate expansion or the probabilistic Talagrand inequality.

Source location: Candes-Recht 2008, Appendix 9.1, PDF p. 46, the display after equation (9.2); standard input is Frobenius duality in finite-dimensional real Hilbert space.

Preamble
import Definitions.Def_matrix_completion_talagrand_tangent_bilinear
open MatrixCompletion
Formal statement
theorem tangent_sampling_deviation_eq_tangent_bilinear_supremum
    {n₁ n₂ r : ℕ} {M : Matrix (Fin n₁) (Fin n₂) ℝ}
    (Omega : Finset (Fin n₁ × Fin n₂)) (S : SVD M r) (p : ℝ) :
    tangentSamplingDeviation Omega S p =
      tangentSamplingTangentBilinearDeviation Omega S p := by
  sorry
Source
Candes, Emmanuel, and Benjamin Recht. "Exact matrix completion via convex optimization." Communications of the ACM 55.6 (2012): 111-119.

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