proposition: Lemma polyX_correct : polyX >:: PolR.polyX.
proof: Proof. case=> [|k] /=; first exact: J.zero_correct. case: k => [|k] /=. exact: I.fromZ_small_correct. rewrite /nth /PolR.nth !nth_nil. exact: J.zero_correct. Qed.
imports: Coq(ZArith Reals) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Flocq(Core) Stdlib MathComp Interval Xreal Basic_rec