quadratic_neumann_all_distinct_inner_coefficients_from_base_bounds_shifted
ProvedSource: Candès--Recht, Exact Matrix Completion via Convex Optimization, PDF p. 28, Section 6.2, Lemma 6.6, equations (6.15)--(6.17), and PDF p. 30, Section 6.3, equation (6.20).
Mathematical statement: Let and let be the Bernoulli sampling rate. Let be rank- SVD data for , with incoherence hypotheses and . For the all-distinct quadratic Neumann inner coefficient family
assume the centered-fluctuation representation from equation (6.20), and assume deterministic base-matrix bounds
If the usual Lemma 4.6 sample lower bound holds both at exponent and at the union-bound-shifted exponent ,
then there are universal positive constants such that
Here is a Bernoulli sample set. The quantities are the Candes--Recht coherence parameters, and does not appear in this Neumann coefficient bridge.
Formalization note:
This is a formal bridge, not a theorem stated verbatim in the paper. It repairs the stale unshifted uniformization edge under quadratic_neumann_all_distinct_inner_coefficients_from_base_bounds by explicitly carrying the pointwise-tail/sample floor needed for the ordered-pair union bound. The source-backed parent ingredients are the proved pointwise Bernstein node quadratic_neumann_all_distinct_inner_coefficient_pointwise_tail_from_base_bounds, whose source is Candès--Recht PDF p. 28, Lemma 6.6, equations (6.15)--(6.17), and the proved shifted uniformization node quadratic_neumann_all_distinct_inner_coefficients_uniform_from_shifted_pointwise_tails, whose source context is PDF p. 30, equation (6.20).
import Definitions.Def_matrix_completion_neumann open MatrixCompletion
theorem quadratic_neumann_all_distinct_inner_coefficients_from_base_bounds_shifted
(Centry Cfro : ℝ) :
0 < Centry → 0 < Cfro →
∃ Cinner cinner : ℝ, 0 < Cinner ∧ 0 < cinner ∧
∀ (β lam : ℝ), 2 < β → 1 ≤ lam →
∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
(μ₀ μ₁ : ℝ) (S : SVD M r),
0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
1 ≤ μ₀ → 1 ≤ μ₁ →
A0 S μ₀ → A1 S μ₁ →
(m : ℝ) ≥
lam * Real.rpow μ₀ ((4 : ℝ) / 3) *
(↑(max n₁ n₂)) * Real.rpow (r : ℝ) ((4 : ℝ) / 3) *
(β * Real.log (↑(max n₁ n₂))) →
(m : ℝ) ≥
lam * Real.rpow μ₀ ((4 : ℝ) / 3) *
(↑(max n₁ n₂)) * Real.rpow (r : ℝ) ((4 : ℝ) / 3) *
((β + 4) * Real.log (↑(max n₁ n₂))) →
(∀ (Omega3 : Finset (Fin n₁ × Fin n₂))
(w1 w2 : Fin n₁ × Fin n₂),
quadraticAllDistinctInnerCoefficient Omega3 S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) w1 w2 =
matrixEntrySum
(centeredSamplingFluctuation Omega3
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(quadraticAllDistinctInnerBaseMatrix S w1 w2))) →
(∀ w1 w2 : Fin n₁ × Fin n₂,
entrySupNorm (quadraticAllDistinctInnerBaseMatrix S w1 w2) ≤
Centry * μ₀ ^ 2 *
(((r : ℝ) / (↑(max n₁ n₂))) ^ 2)) →
(∀ w1 w2 : Fin n₁ × Fin n₂,
frobeniusNorm (quadraticAllDistinctInnerBaseMatrix S w1 w2) ≤
Cfro * Real.rpow μ₀ ((3 : ℝ) / 2) *
Real.rpow ((r : ℝ) / (↑(max n₁ n₂))) ((3 : ℝ) / 2)) →
bernoulliEventProb ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(fun Omega3 =>
QuadraticAllDistinctInnerCoefficientBound Omega3 S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(Cinner * Real.rpow lam (-((1 : ℝ) / 2)))) ≥
1 - cinner * Real.rpow (↑(max n₁ n₂)) (-β) := by
sorry