proposition: Lemma roots0 a b : roots 0 a b = [::].
proof: Proof. by case: rootsP=> //=; rewrite eqxx. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg poly polydiv ssrnum zmodp) mathcomp(polyorder path interval ssrint)