rademacher_matrix_operator_norm_first_moment_log_window_from_2p
ProvedThis is the formal dimension-window bridge for the Rudelson/Lust-Picquard noncommutative-Khintchine step used in the Candes--Recht tangent-sampling estimate.
Source: Candes--Recht, Exact Matrix Completion via Convex Optimization, PDF p. 19, Section 4.2, Theorem 4.2, equation (4.9), together with Rudelson, Random vectors in the isotropic position, JFA 164 (1999), Theorem 1, proof Steps 1--2, and the Lust-Picquard/Pisier noncommutative Khintchine inequality.
Mathematical statement. Let be a finite index set and let be Hermitian matrices. If
with , , and , then there is a universal constant such that
Variables and notation. Here is the ambient maximum-dimension parameter used downstream in Candes--Recht, while this abstract bridge writes the matrix dimension as . In the downstream matrix-completion application, is the Bernoulli sampling rate, is one fixed Bernoulli sample realization, is the rank-one tensor , and is later supplied by a separate variance-proxy bridge from . The probability model in this node is only the auxiliary Rademacher sign average over ; the Bernoulli probability model appears in the parent Rudelson route.
Formalization note. This is a formal bridge. It does not appear verbatim in Candes--Recht. It bridges source-backed parent/import theorem rademacher_matrix_operator_norm_2p_moment_bound (0cafa5a3) plus the Rademacher power-mean bridge rademacher_expectation_power_mean (9a9634f8) to the source-backed child route for inner_sign_average_khintchine_variance_proxy_bound_of_two_le_max (f4806ebd). The proof should choose an even moment exponent with , use and to absorb , and then pass from the moment to the first moment.
import Definitions.Def_matrix_completion_tangent import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real open Matrix MatrixCompletion open scoped Classical BigOperators Matrix
theorem rademacher_matrix_operator_norm_first_moment_log_window_from_2p :
∃ Clog : ℝ, 0 < Clog ∧
∀ {ι : Type*} [Fintype ι] [DecidableEq ι]
{d N : ℕ}, 0 < d → 2 ≤ N → d ≤ N * N →
∀ (H : ι → Matrix (Fin d) (Fin d) ℝ),
(∀ c, (H c).IsHermitian) →
∀ (normV : ℝ), 0 ≤ normV →
(hVHerm : (∑ c : ι, H c * H c).IsHermitian) →
(∀ i, hVHerm.eigenvalues i ≤ normV) →
(∑ eps : Finset ι, ((1 : ℝ) / 2) ^ (Fintype.card ι) *
spectralNorm (∑ c : ι, (if c ∈ eps then (1 : ℝ) else -1) • H c))
≤ Clog * Real.sqrt (Real.log (N : ℝ)) * Real.sqrt normV := by
sorry