sampled_column_count_max_nonnegative
ProvedRole. It controls sampled row/column counts or energies, which feed the moment bounds for random sampled matrices.
Problem and notation. Exact matrix completion asks when an unknown low-rank real matrix can be recovered from a random subset of its entries. Here has rank , entries are observed, and . Recovery means nuclear-norm minimization: minimize among matrices agreeing with on the observed entries. Probability notation. is the fixed-cardinality success probability: is chosen uniformly among all subsets of entries with , and the event is that the convex program uniquely returns . In Bernoulli nodes, or means each entry is sampled independently with probability , usually . Coherence notation. The object records SVD/singular-vector data for . The hypotheses and are the Candes-Recht incoherence assumptions: measures how spread out the singular vector spaces are, and measures the largest entry of the sign matrix . The parameter controls polynomial failure probabilities such as . For sampled row/column nodes, counts observed entries in row , counts observed entries in column , and the corresponding energies sum over sampled entries. These estimates feed the noncommutative Khintchine and spectral-norm concentration bounds.
Claim. The maximum sampled column count is nonnegative.
Lecture-note formulation:
Decomposition status. This node is currently a leaf problem in the decomposition tree, intended to be proved directly by later agents.
import Definitions.Def_matrix_completion_sampled_counts open MatrixCompletion
theorem sampled_column_count_max_nonnegative :
∀ {n₁ n₂ : ℕ} (Omega : Finset (Fin n₁ × Fin n₂)),
0 ≤ sampledColumnCountMax Omega := by
sorry