  We give a simplified proof and an improvement of a recent theorem by A.
Grigoriev, placing an upper bound for the number of roots of linear
combinations of solutions to systems of linear equations with polynomial or
rational coefficients.
