1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* This file was automatically generated: do not edit *********************)
17 set "baseuri" "cic:/matita/CoRN-Decl/algebra/CPoly_Degree".
21 (* $Id: CPoly_Degree.v,v 1.5 2004/04/23 10:00:53 lcf Exp $ *)
23 include "algebra/CPoly_NthCoeff.ma".
25 include "algebra/CFields.ma".
27 (*#* *Degrees of Polynomials
28 ** Degrees of polynomials over a ring
30 Let [R] be a ring and write [RX] for the ring of polynomials
39 inline "cic:/CoRN/algebra/CPoly_Degree/R.var".
44 Notation RX := (cpoly_cring R).
50 The length of a polynomial is the number of its coefficients. This is
51 a syntactical property, as the highest coefficient may be [0]. Note that
52 the `zero' polynomial [cpoly_zero] has length [0],
53 a constant polynomial has length [1] and so forth. So the length
54 is always [1] higher than the `degree' (assuming that the highest
55 coefficient is [[#]Zero])!
58 inline "cic:/CoRN/algebra/CPoly_Degree/lth_of_poly.con".
61 When dealing with constructive polynomials, notably over the reals or
62 complex numbers, the degree may be unknown, as we can not decide
63 whether the highest coefficient is [[#]Zero]. Hence,
64 degree is a relation between polynomials and natural numbers; if the
65 degree is unknown for polynomial [p], degree(n,p) doesn't hold for
66 any [n]. If we don't know the degree of [p], we may still
67 know it to be below or above a certain number. E.g. for the polynomial
68 $p_0 +p_1 X +\cdots + p_{n-1} X^{n-1}$#p0 +p1 X + ... + p(n-1)
69 X^(n-1)#, if $p_i \mathrel{\#}0$#pi apart from 0#, we can say that the
70 `degree is at least [i]' and if $p_{j+1} = \ldots =p_n =0$#p(j+1)
71 = ... =pn =0# (with [n] the length of the polynomial), we can say
72 that the `degree is at most [j]'.
75 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le.con".
77 inline "cic:/CoRN/algebra/CPoly_Degree/degree.con".
79 inline "cic:/CoRN/algebra/CPoly_Degree/monic.con".
81 inline "cic:/CoRN/algebra/CPoly_Degree/odd_cpoly.con".
83 inline "cic:/CoRN/algebra/CPoly_Degree/even_cpoly.con".
85 inline "cic:/CoRN/algebra/CPoly_Degree/regular.con".
92 Implicit Arguments degree_le [R].
96 Implicit Arguments degree [R].
100 Implicit Arguments monic [R].
104 Implicit Arguments lth_of_poly [R].
108 Section Degree_props.
111 inline "cic:/CoRN/algebra/CPoly_Degree/R.var".
116 Notation RX := (cpoly_cring R).
121 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_wd.con".
123 inline "cic:/CoRN/algebra/CPoly_Degree/degree_wd.con".
125 inline "cic:/CoRN/algebra/CPoly_Degree/monic_wd.con".
127 inline "cic:/CoRN/algebra/CPoly_Degree/degree_imp_degree_le.con".
129 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_c_.con".
131 inline "cic:/CoRN/algebra/CPoly_Degree/degree_c_.con".
133 inline "cic:/CoRN/algebra/CPoly_Degree/monic_c_one.con".
135 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_x_.con".
137 inline "cic:/CoRN/algebra/CPoly_Degree/degree_x_.con".
139 inline "cic:/CoRN/algebra/CPoly_Degree/monic_x_.con".
141 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_mon.con".
143 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_inv.con".
145 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_plus.con".
147 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_minus.con".
149 inline "cic:/CoRN/algebra/CPoly_Degree/Sum_degree_le.con".
151 inline "cic:/CoRN/algebra/CPoly_Degree/degree_inv.con".
153 inline "cic:/CoRN/algebra/CPoly_Degree/degree_plus_rht.con".
155 inline "cic:/CoRN/algebra/CPoly_Degree/degree_minus_lft.con".
157 inline "cic:/CoRN/algebra/CPoly_Degree/monic_plus.con".
159 inline "cic:/CoRN/algebra/CPoly_Degree/monic_minus.con".
161 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_mult.con".
163 inline "cic:/CoRN/algebra/CPoly_Degree/degree_mult_aux.con".
166 Hint Resolve degree_mult_aux: algebra.
169 inline "cic:/CoRN/algebra/CPoly_Degree/monic_mult.con".
171 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_nexp.con".
173 inline "cic:/CoRN/algebra/CPoly_Degree/monic_nexp.con".
175 inline "cic:/CoRN/algebra/CPoly_Degree/lt_i_lth_of_poly.con".
177 inline "cic:/CoRN/algebra/CPoly_Degree/poly_degree_lth.con".
179 inline "cic:/CoRN/algebra/CPoly_Degree/Cpoly_ex_degree.con".
181 inline "cic:/CoRN/algebra/CPoly_Degree/poly_as_sum''.con".
184 Hint Resolve poly_as_sum'': algebra.
187 inline "cic:/CoRN/algebra/CPoly_Degree/poly_as_sum'.con".
189 inline "cic:/CoRN/algebra/CPoly_Degree/poly_as_sum.con".
191 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_zero.con".
193 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_1_imp.con".
195 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_cpoly_linear.con".
197 inline "cic:/CoRN/algebra/CPoly_Degree/monic_cpoly_linear.con".
199 inline "cic:/CoRN/algebra/CPoly_Degree/monic_one.con".
201 inline "cic:/CoRN/algebra/CPoly_Degree/monic_apzero.con".
208 Hint Resolve poly_as_sum'' poly_as_sum' poly_as_sum: algebra.
212 Hint Resolve degree_mult_aux: algebra.
216 Section degree_props_Field.
219 (*#* ** Degrees of polynomials over a field
220 %\begin{convention}% Let [F] be a field and write [FX] for the ring of
221 polynomials over [F].
225 inline "cic:/CoRN/algebra/CPoly_Degree/F.var".
230 Notation FX := (cpoly_cring F).
235 inline "cic:/CoRN/algebra/CPoly_Degree/degree_mult.con".
237 inline "cic:/CoRN/algebra/CPoly_Degree/degree_nexp.con".
239 inline "cic:/CoRN/algebra/CPoly_Degree/degree_le_mult_imp.con".
241 inline "cic:/CoRN/algebra/CPoly_Degree/degree_mult_imp.con".
244 End degree_props_Field.