Deterministic conditions for subspace identifiability from incomplete sampling

Consider an r-dimensional subspace of ℝ^d, r <; d, and suppose that we are only given projections of this subspace onto small subsets of the canonical coordinates. The paper establishes necessary and sufficient deterministic conditions on the subsets for subspace identifiability. The results also shed new light on low-rank matrix completion.