proposition: Lemma shift_poly_eq (p q : {poly R}) (a : R) : (p == q) = (p \shift a == q \shift a).
proof: Proof. by rewrite /shift_poly -(subr_eq0 p q) -(@comp_poly2_eq0 _ (p-q) ('X + a%:P)) ?size_XaddC // rmorphB subr_eq add0r. Qed.
imports: mathcomp(all_ssreflect) mathcomp(ssralg poly polydiv polyorder ssrnum zmodp) mathcomp(polyrcf qe_rcf_th complex) poly_normal pol