proposition: Lemma cindexRpC q c : cindexR q c%:P = 0.
proof: Proof. by rewrite /cindexR rootsRC big_nil. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice path fintype) mathcomp(div bigop order ssralg poly polydiv ssrnum perm zmodp ssrint) mathcomp(polyorder polyrcf interval matrix mxtens)