Three theorems on the number of nonzero coefficients of a polynomial

Question

The number of positive real roots of a polynomial with real coefficients is strictly smaller than the number of nonzero coefficients of the polynomial. This is an immediate corollary of Descartes' rule of signs.

For a polynomial with complex coefficients of degree at most $p-1$, with $p$ prime, the number of distinct roots of the polynomial which are degree-$p$ roots of unity is strictly smaller than the number of nonzero coefficients of the polynomial. As observed by Tao, this is equivalent to an uncertainty inequality for prime-order groups.

For a polynomial over a field of zero characteristic, the multiplicity of any of its non-zero roots is strictly smaller than the number of nonzero coefficients of the polynomial. To my knowledge, this first appeared in a paper by Brindza.

---

Are these results reducible to each other? (Well, the ground fields are not quite the same, and yet...) Are there any other similar results known? And, ultimately, is there any "common parent" from which all these results can be derived?

Answer 1

It seems that the first two theorems are close relatives, and can be established using the same common observation, while the third one is unrelated.

Given a subset $U$ of a field $\mathbb F$ of zero characteristic, and $N\in\mathbb N\cup\{\infty\}$, consider the following property:

For any polynomial $P$ over $\mathbb F$ of degree $\deg P<N$, the number of elements of $U$ which are roots of $P$ is strictly smaller than the number of nonzero coefficients of $P$.

The observation mentioned above is as follows: for a set $U\subseteq\mathbb F^\times$ to have the stated property, it is necessary and sufficient that for any pairwise distinct elements $u_1,\dotsc,u_k\in U$, and any integers $0\le n_0<\dotsb<n_{k-1}<N$, the matrix $$ \begin{pmatrix} u_1^{n_0} & \dotsb & u_k^{n_0} \\ \vdots & & \vdots \\ u_1^{n_{k-1}} & \dotsb & u_k^{n_{k-1}} \end{pmatrix} $$ were non-degenerate.

Once stated, this is immediate to prove by looking at the linear combinations of the rows of the matrix. The first theorem follows now from the results on generalized Vandermonde matrices, the second from Chebotarev's theorem on roots of unity.