No short polynomials vanish on bounded rank matrices

Abstract

AbstractWe show that the shortest non‐zero polynomials vanishing on bounded‐rank matrices and skew‐symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraically, this means that in the ideal generated by all ‐minors or ‐Pfaffians of a generic matrix or skew‐symmetric matrix, one cannot find any polynomial with fewer terms than those determinants or Pfaffians, respectively, and that those determinants and Pfaffians are essentially the only polynomials in the ideal with that many terms. As a key tool of independent interest, we show that the ideal of a very general ‐dimensional subspace of an affine ‐space does not contain polynomials with fewer than  terms.