proposition: Lemma size_lagrange_poly {R: fieldType} (pts: seq (R * R)): (size (lagrange_poly pts) <= size pts)%N.
proof: Proof. case: pts => [|m r]. - by rewrite /lagrange_poly big_nil size_poly0. - by apply: (size_lagrange_poly_part [::]). Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude) extructures(ord fset fmap) Equations(Equations)