binomial_lower_tail_weighted_sum_lower_bound
DisprovedRole. It is a reusable node in the Candes-Recht decomposition, phrased as a standalone theorem so that downstream sketches can import it directly.
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 .
Claim. If a function is bounded below by on the lower binomial tail and that tail has mass at least 1/2, then the full binomial weighted sum is at least .
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_fixed_cardinality open MatrixCompletion open scoped Classical BigOperators
theorem binomial_lower_tail_weighted_sum_lower_bound
(N m : ℕ) (p a : ℝ) (f : ℕ → ℝ) :
0 ≤ p → p ≤ 1 → m ≤ N →
(∀ k : ℕ, k ≤ m → a ≤ f k) →
(1 / 2 : ℝ) ≤ binomialLowerTailProb N m p →
(1 / 2) * a ≤
∑ k ∈ Finset.range (N + 1), binomialCardinalityProb N k p * f k := by
sorry