2000 character limit reached
Lines of full rank matrices in large subspaces
Published 16 Jul 2015 in math.RA | (1507.04770v1)
Abstract: Let $n$ and $p$ be non-negative integers with $n \geq p$, and $S$ be a linear subspace of the space of all $n$ by $p$ matrices with entries in a field $\mathbb{K}$. A classical theorem of Flanders states that $S$ contains a matrix with rank $p$ whenever $\mathrm{codim} S <n$. In this article, we prove the following related result: if $\mathrm{codim} S<n-1$, then, for any non-zero $n$ by $p$ matrix $N$ with rank less than $p$, there exists a line that is directed by $N$, has a common point with $S$ and contains only rank $p$ matrices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.