§ 1. Polynomials
1. Definition of polynomials
Let I be a set. We recall (III, p. 452) that the free commutative algebra on I over A is denoted by A[(Xi)i∈I] or A[Xi]i∈I. The elements of this algebra are called polynomials with respect to the indeterminates Xi (or in the indeterminates Xi) with coefficients in A. Let us recall that the indeterminate Xi is the canonical image of i in the free commutative algebra on I over A; sometimes it is convenient to denote this image by another symbol such as Xi′,Yi,Ti, etc. This convention is often introduced by a phrase such as: « Let Y=(Yi)i∈I be a family of indeterminates »; in this case the algebra of polynomials in question is denoted by A[Y]. When I={1,2,…,n}, one writes A[X1,X2,…,Xn] in place of A[(Xi)i∈I].
For ν∈N(I) we put
Xν=i∈I∏Xiνi.
Then (Xν)ν∈N(I) is a basis of the A-module A[(Xi)i∈I]. The Xν are called monomials in the indeterminates Xi. For ν=0 we obtain the unit element of A[(Xi)i∈I]. Every polynomial u∈A[(Xi)i∈I] can be written in exactly one way in the form
u=ν∈N(I)∑ανXν
where aν∈A and the αν are zero except for a finite number; the aν are called the coefficients of u; the ανXν are called the terms of u (often the element ανXν is called the term in Xν), in particular the term of α0X0, identified with a0, is called the constant term of u. When αν=0, we say by abuse of language that u contains no element in Xν; in particular when α0=0, we say that u is a polynomial without constant term (III, p. 453). Any scalar multiple of 1 is called a constant polynomial.
Let B be a commutative ring and ρ:A→B a ring homomorphism. We consider B[(Xi)i∈I] as an A-algebra by means of ρ. Thus the mapping σ of A[(Xi)i∈I] into B[(Xi)i∈I] which transforms ∑ανXν into ∑ρ(αν)Xν is a homomorphism of A-algebras; if u∈A[(Xi)i∈I], we sometimes denote by ρu the image of u by this homomorphism. The homomorphism of B⊗AA[(Xi)i∈I] into B[(Xi)i∈I] canonically defined by σ transforms, for every i∈I, 1⊗Xi into Xi; this is an isomorphism of B-algebras (III, p. 449).
Let M be a free A-module with basis (ei)i∈I. There exists precisely one unital homomorphism φ of the symmetric algebra S(M) into the algebra A[(Xi)i∈I] such that φ(ei)=Xi for each i∈I, and this homomorphism is an isomorphism (III, p. 506). This isomorphism is said to be canonical. It allows us to apply to polynomial algebras certain properties of symmetric algebras. For example, let (I1),…,L be a partition of I. Let φλ be the homomorphism of Pλ=A[(Xi)i∈Iλ] into P=A[(Xi)i∈I] which transforms Xi (qua element of Pλ) into Xi (qua element of P). Then the φλ define a homomorphism of the algebra ⨂h∈LPλ into the algebra P, and this homomorphism is an isomorphism (III, p. 503, Prop. 9).
Let E be an A-module, and put E⊗AA[(Xi)i∈I]=E[(Xi)i∈I]. The elements of the A-module E[(Xi)i∈I] are called polynomials in the indeterminates Xi with coefficients in E. Such a polynomial can be written in just one way as ∑ν∈N(I)eν⊗Xν, where eν∈E and the eν are zero for all but a finite number of suffixes; we frequently write eνXν instead of eν⊗Xν.
2. Degrees
Let P=A[(Xi)i∈I] be a polynomial algebra. For each integer n∈N let Pn be the submodule of P generated by the monomials Xν such that ∣ν∣=∑i∈Iνi equals n. Then (Pn),… is a graduation which turns A[(Xi)i∈I] into a graded algebra of type N (III, p. 459). The homogeneous elements of degree n in A[(Xi)i∈I] are sometimes called forms of degree n with respect to the indeterminates Xi.
When we are dealing with the degree of inhomogeneous polynomials, we shall agree to adjoin to the set N of natural numbers, an element written −∞ and to extend the order relation and the addition of N to N∪{−∞} by the following conventions, where n∈N,
−∞<n,(−∞)+n=n+(−∞)=−∞,(−∞)+(−∞)=−∞.
Let u=∑ν∈N(I)ανXν be a polynomial. The homogeneous component un of degree n of u (for the graduation of type N defined above) is equal to ∑∣ν∣=nανXν, and we clearly have u=∑n∈Nun. If u=0, the un are not all zero, and we define the degree (or total degree) of u, written degu, as the greatest of the numbers n such that un=0; in other words (III, p. 453), the degree of u is the largest of the integers ∣ν∣ for the multi-indices ν such that aν=0. When u=0, the degree of u is −∞ by convention. For every integer p∈N, the relation degu≤p is thus equivalent to « aν=0 for every multi-index ν with ∣ν∣>p »; the set of polynomials u such that degu≤p is thus an A-submodule of A[(Xi)i∈I], equal to P0+P1+…+Pp with the above notations.
Let E be an A-module. The family (E⊗Pn)n∈N is a graduation of type N of the module E[(Xi)i∈I]=E⊗AA[(Xi)i∈I] of polynomials with coefficients in E. We extend the conventions adopted above for the degree of inhomogeneous polynomials to this case.
Proposition 1
Let u and v be two polynomials.
(i) If degu=degv, we have
u+v=0anddeg(u+v)=sup(degu,degv). If
degu=degv we have deg(u+v)≤degu.
(ii) We have deg(uv)≤degu+degv. The proof is immediate.
Let J⊂I and B=A[(Xi)i∈I−J]; we shall identify A[(Xi)i∈I] with B[(Xi)i∈J] (III, p. 453 f.). The degree of u∈A[(Xi)i∈I], qua element of B[(Xi)i∈J], is called the degree of u with respect to the Xi of index i∈J (III, p. 454).
Let u=∑k=0nakXk∈A[X] be a non-zero polynomial of degree n in a single indeterminate. The coefficient an, which is =0 by hypothesis, is called the leading coefficient of u. A polynomial u=0 whose leading coefficient is equal to 1 is called a monic polynomial.
In A[X1,X2,…,Xq] the number of monomials of total degree p is equal to the number of elements (nk)1≤k≤q of Nq such that ∑k=1qnk=p, that is (pq+p−1) (Sets III, Prop. 15, p. 182)
More generally, let A be a commutative monoid and (δi)i∈I, a family of elements of A. There exists a unique graduation of type A of the algebra A[(Xi)i∈I] such that each monomial Xν is of degree ∑i∈Iνiδi (III, p. 458, example 3). The case considered above is that where A=N and δi=1. In the general case, to avoid confusion, we shall use the word « weight » instead of « degree » and « isobaric » instead of « homogeneous ». For example, there exists a unique graduation of type N of the algebra A[(Xi)i≥1] such that Xi is of weight i for each integer i≥1. The isobaric elements of weight n are the polynomials of the form ∑aνXν, where aν=0 for ∑i≥1i⋅νi=n.
3. Substitutions
Let E be a unital associative algebra over A and x=(xi)i∈I a family of pairwise permutable elements of E. Let X=(Xi)i∈I be a family of indeterminates. By III, Prop. 7, p. 449, there exists a unique unital homomorphism f of A[X] into E such that f(Xi)=xi for every i∈I. The image of an element u of A[X] under f is written u(x) and is called the element of E obtained by substituting xi for Xi in u, or also the value of u for Xi=xi. In particular, u=u((Xi)i∈I). If I={1,…,n} we write u(x1,…,xn) in place of u((xi)i∈I). More generally, if M is an A-module and if o is an element of
M[(Xi)i∈I]=M⊗AA[(Xi)i∈I],
we denote the image of v in M⊗AE=M(E) under the mapping 1M⊗f by v(x).
If the homomorphism u↦u(x) of A[X] into E is injective, we say that the family x is algebraically free over A, or that the xi are algebraically independent over A. This also means that the monomials xν (ν∈N(I)) are linearly independent over A.
If λ is a unital homomorphism of E into a unital associative A-algebra E', we have
λ(u((xi)i∈I))=u((λ(xi)i∈I)),
because λ∘f is a homomorphism of A[X] into E' which maps Xi to λ(xi).
Let u∈A[X]. If E is commutative, the mapping x↦u(x) of E1 into E is called the polynomial function defined by u (and the algebra E) ; we shall sometimes denote it by u~ (or even just u).
Let Y=(Yj)j∈J be another family of indeterminates, and let us take for E the polynomial algebra A[Y]. Given u∈A[X], take gi∈A[Y] for i∈I and put g=(gi)i∈I; let u(g)∈A/[Y] be the polynomial obtained by substituting the polynomials gi for Xi in u. Let y=(yj)j∈J be a family of pairwise permutable elements of a unital associative A-algebra E' ; applying (1) and taking for A the homomorphism g↦g(y) of E into E′, we obtain
(u(g))(y)=u((gi(y))).
If f=(fi)i∈I∈(A[(Xj)j∈J])I and g=(gj)j∈J∈(A[(Yk)k∈K])J, we denote by f∘g or f(g), the family of polynomials (fi(g))i∈I∈(A[(Yk)k∈K])I. If we denote by f~ the mapping x↦(fi(x))i∈I of E′J into E′I (where E′ is a unital associative and commutative A-algebra), then the relation (2) implies
(fog)′′=f~∘g~.
If h=(hk)k∈K∈(A[(Zl)l∙L])K, it follows from (2) that :
f∘(g∘h)=(f∘g)∘h.
Proposition 2
Let a=(ai)i∈I, be a family of elements of A and let u∈A[X]. If v is the polynomial obtained by substituting Xi+ai for Xi for each i∈I, then the constant term of v is equal to u(a).
The constant term of v is obtained by substituting 0 for Xi in v for each i∈I. The result therefore follows by (2).
Corollary 1
Let m be the ideal of polynomials u∈A[X] such that u(a)=0. Then m is generated by the polynomials Xi−ai (for i∈I).
It is clear that Xi−ai∈m for each i∈I. Let u∈m and let v be as in Prop. 2. Since v has no constant term, there exists a family (Pi)i∈I, of polynomials in A[X] with finite support such that
v(X)=i∈I∑Xi⋅Pi(X).
If we replace Xi by Xi−ai for each i∈I in the above equation, we obtain a relation of the form u(X)=∑i∈I(Xi−ai)⋅Pi′(X), whence the corollary.
Corollary 2
Let X=(Xi)i∈I and Y=(Yi)i∈I be two families of indeterminates. The set of polynomials u∈A[X,Y] such that u(X,X)=0 is the ideal of A[X,Y] generated by the polynomials Xi−Yi (for i∈I).
This corollary results directly from Cor. 1 on replacing A by A[Y] and ai by Yi, interpreting A[X,Y] as polynomial ring in the Xi with coefficients in A[Y].
Proposition 3
Let u∈A[X] and let X.Z be the family (XiZ)i∈I, of elements of the polynomial ring A[X][Z]. The coefficient of Zk in u(X.Z) is the homogeneous component of degree k of u, for every positive integer k.
It suffices to prove this Prop. in the case where u is a monomial, and in this case the result is clear.
Corollary
For a polynomial u∈A[X] to be homogeneous of degree k it is necessary and sufficient that :
u(X.Z)=u(X)⋅Zk.
4. Differentials and derivations
Let B=A[(Xi)i∈I], then by III, p. 569 there exists for each i∈I one and only one A-derivation Di of B such that
DiXi=1,DiXj=0forj=i The polynomial DiP is called the partial derivative of P with respect to Xi; we shall also denote it by DXiP or ∂Xi∂P or PXi′. By III, p. 558, formula (21), we have, for ν=(ν,)∈N(I), Di(Xν)={νiXiνi−1∏j∈I−{i}Xjνj0if νi>0if νi=0 It follows from (6) that DiDj=DjDi for any i,j∈I. For ν=(νi)i∈I∈N(I) we shall put Dν=∏i∈IDiνi and ν!=∏i∈I(νi!). With the product ordering on N(I) we have Dν(Xμ)={(μ−ν)!μ!Xμ−ν0if ν≤μ,if not . When P is a polynomial in a single indeterminate X, the unique partial derivative of P is written DP or dXdP or P′ and is called simply the derivative of P.
Again let B=A[(Xi)i∈I]; by III, p. 569 the B-module of A-differentials of B, ΩA(B), has the family (dXi)i∈I of differentials of the Xi as basis. Let ∂i be the coordinate form of index i relative to this basis over ΩA(B). Then the mapping u↦(∂i,du) of B into itself is a derivation of B which maps Xi to 1 and Xj to 0 for j=i, and hence is Di; in other words, we have
du=i∈I∑(Diu)dXi for each u∈B. If I is finite, (Di)i∈I is a basis of the B-module of derivations of B.
Proposition 4
Let E be an associative, commutative and unital A-algebra, x=(xi)i∈I a family of elements of E, u an element of A[(Xi)i∈I] and y=u(x). Then for every derivation D of E into an E-module we have*
Dy=i∈I∑(Diu)(x)⋅Dxi.
It suffices to prove the proposition when u is a monomial, and in that case it follows from III, p. 558, Prop. 6.
Corollary
— *Let f∈A[X1,...,Xp] and gi∈A[Y1,...,Yq] for 1≤i≤p, and write h=f(g1,...,gp), then for 1≤j≤q we have
∂Yj∂h=i=1∑pDif(g1,...,gp)⋅∂Yj∂gi.
This is the special case E=A[Y1,...,Yr], xi=gi and D=∂/∂Yj of Prop. 4.
Let X=(Xi)i∈I, Y=(Yi)i∈I be two disjoint families of indeterminates, and write X+Y for the family (Xi+Yi)i∈I. Given u∈A[X], consider the element u(X+Y) of A[X,Y]. For ν∈N(I) we denote by Aνu the coefficient of Yν in u(X+Y), considered as polynomial in the Yi with coefficients in A[X]. By definition we have Aνu∈A[X] and
u(X+Y)=ν∑(Δνu)(X)Yν.
(Here and in the rest of this No., the summations are extended over the index set N(I) unless the contrary is said.)
Let a∈A′, then on substituting a for X and X−a for Y in (9) we obtain
u(X)=ν∑(Δνu)(a)(X−a)ν.
In particular we have
u(X)=ν∑(Δνu)(0)Xν.
If u,v∈A[X], we have
(uv)(X+Y)=(ν∑(Δνu)(X)Yν)(ρ∑(Δρv)(X)Yρ)=σ∑[ν+ρ=σ∑(Δνu)(X)(Δρv)(X)]Yσ
hence
Δσ(uv)=ν+ρ=σ∑(Δνu)(Δρv).
Let Z=(Zi)i∈I be another family of indeterminates.
We have:
ν∑(Δνu)(X)(Y+Z)ν=u(X+Y+Z)
=σ∑(Auu)(X+Y)Zu
=ρ,σ∑(ΔρΔσu)(X)YρZσu,
hence by I, p. 99, Cor. 2:
(13)
ΔρΔσu=ρ!σ!(ρ+σ)!Δρ+σu.
Proposition 5
— For any u∈A[X] and ν∈N(I) *we have
Dνu=ν!Δνu
Suppose first that ν has length 1 ; then there exists an element i of I such that ν=εi, that is, νi=1 and νj=0 for all j=i in I. Formula (12) shows that A′′ is a derivation of the A-algebra A[X] which clearly has the value zero on Xj for j=i and the value 1 on Xi. We thus have Δεi=Di for each i∈I.
By (13) we have
(14)
(ρ!Δρ)⋅(σ!Δσ)=(ρ+σ)!Δρ+σ
in the endomorphism algebra of the A-module A[X]. It now follows by induction on the length of ν that ν!A′′=Dν.
If A is a Q-algebra, the formulae (9), (10), (11) may thus be written
(15)
u(X+Y)=ν∑ν!1(Dνu)(X)Yν (16)
u(X)=ν∑ν!1(Dνu)(a)(X−a)ν (17)
u(X)=ν∑ν!1(Dνu)(0)Xν
The formulae (15), (16), (17) are all three called « Taylor's formula ».
Proposition 6 (« Euler's identity »)
— Let u∈A[X] *be a homogeneous polynomial of degree r ; we have
i∈I∑Xi⋅Diu=ru.
Let D be the A-linear mapping of A[X] into itself such that D(v)=sv when v is homogeneous of degree s. We know (III, p. 554, Example 6) that D is a derivation of A[X]. Thus Prop. 6 is a Corollary of Prop. 4 (IV, p. 6).
5. Divisors of zero in a polynomial ring
Proposition 7
— *Let f∈A[X] be a non-zero polynomial in an indeterminate and a its leading coefficient. If a is cancellable in A (in particular iff is monic) then we have for any non-zero element'g of A[X],
fg=0anddeg(fg)=degf+degg
Let g∈A[X] be a non-zero polynomial, β its leading coefficient, n=degf and p=degg. Then the coefficient of Xn+p in fg is αβ which does not vanish, whence the proposition.
Proposition 8
— *If A is an integral domain, then so is A[(Xi)i∈I].
Let u,v be two non-zero elements of A[(Xi)i∈I]; we have to show that uv=0. Now u and v belong to a ring A[(Xj)j∈J] where J is a finite subset of I. Thus we can limit ourselves to the case when I is finite and equal to {1,2,...,p}. On the other hand, the ring A[X1,...,Xp] is isomorphic to the polynomial ring in Xp with coefficients in A[X1,...,Xp−1]. By induction on p we are thus reduced to proving the proposition for A[X], and now it suffices to apply Prop. 7.
Corollary 1
— *If A is an integral domain, and u,v are elements of A[(Xi)i∈I], then deg(uv)=degu+degv.
We can limit ourselves to the case where u and v are non-zero. Let m=degu,n=degv; we have
u=u0+u1+⋯+um,v=v0+v1+⋯+vn
where uh (resp. vh) is the homogeneous component of degree h of u (resp. v). Since um=0 and vn=0, we have umvn=0 (Prop. 8). Now uv=umvn+w with degw<m+n, whence the result.
Corollary 2
— *If A is an integral domain, the invertible elements of A[(Xi)i∈I] are the invertible elements of A.
This follows immediately from Cor. 1.
Proposition 9
— *Let u∈A[(Xi)i∈I]; then for u to be nilpotent in the ring A[(Xi)i∈I] it is necessary and sufficient for all its coefficients to be nilpotent in the ring A.
As in the proof of Prop. 8 we can make a reduction to the case of polynomials in one variable X. If all the coefficients of u are nilpotent, then u is nilpotent (I, p. 99, Cor. 1). Suppose that u is nilpotent but not zero and let n be its degree; we shall argue by induction on n. Let a be the leading coefficient of u. There exists an integer m>0 such that um=0. The leading coefficient of um is am, hence am=0. Now u−αXn is nilpotent (I, loc. cit.) and the induction hypothesis shows all the coefficients of u−αXn to be nilpotent. Thus all the coefficients of u are nilpotent.
6. Euclidean division of polynomials in one indeterminate
Proposition 10
Let f and g be non-zero elements of A[X] of degrees m and n respectively. Let α0 be the leading coefficient of f and μ=sup(n−m+1,0). There exist u,v∈A[X] such that*
α0μg=uf+v,degv<m. *If
α0 is cancellable in
A, then
u and
v are uniquely determined by these properties.
The existence of u and v is clear when n<m, because then we can take u=0 and v=g. For n≥m we shall use induction on n. Let β be the leading coefficient of g; if f=∑k=0mαkXm−k, we can write α0μg=α0μβXn⋅f+α0μ−1g1, where g1∈A[X] and degg1<n. By the induction hypothesis there exist u1,v∈A[X] such that α0μ−1g1=u1f+v and degv<m. Hence
α0μg=(α0μ−1βXn−m+u1)f+v and it suffices to put
u=α0μ−1βXn−m+u1.
Assuming α0 to be cancellable in A, let us now prove the uniqueness of u and v. Let u,v,u1,v1∈A[X] be such that
α0μg=uf+v=u1f+v1,degv<m,degv1<m
We have (u−u1)f=v1−v and deg(v1−v)<m, hence u−u1=0 (IV, p. 9, Prop. 7) and therefore v1−v=0.
Corollary (« Euclidean division of polynomials »)
— Let f be a non-zero element of A[X] whose leading coefficient is invertible and m=degf. (i) For every g∈A[X] there exist u, v∈A[X] such that
g=uf+v,degv<m. Moreover, these conditions determine
u and
v uniquely. (ii) The sub-A-modules
A+AX+…+AXm−1 and
fA[X] of
A[X] are supplementary in
A[X]. (iii) Assume
f non-constant and consider
A[X] as an
A[T]-*module* by means of the homomorphism
u(T)↦u(f(X)) of
A[T] into
A[X]. Then
A[X] is a free
A[T]-*module* with basis
(1,X,…,Xm−1). Assertions (i) and (ii) are immediate consequences of Prop. 10. Let us prove (iii). Let
ψ be the homomorphism
v↦v(f(X),X) of
A[T,X] into
A[X]. Consider
A[T,X] first as polynomial ring in
T with coefficients in
A[X]; Cor. 1 of IV, p. 5 shows that the kernel
a of
ψ is the ideal
(T−f(X)) of
A[T,X]. Consider now
A[T,X] as polynomial ring in
X with coefficients in
A[T]; then
ψ is an
A[T]-linear mapping of
A[T][X] into
A[X]. Assertion (ii) above (applied to the polynomial
f(X)−T in
X with coefficients in
A[T]) shows that
(1,X,…,Xm−1) is a basis of an
A[T]-submodule of
A[T,X] supplementary to
a. Since
ψ(Xi)=Xi for every integer
i≥0, (iii) follows at once.
With the notations of (i) we shall say that u is the quotient and v the remainder in the Euclidean division of g by f; for the remainder to vanish it is necessary and sufficient that f should divide g.
7. Divisibility of polynomials in one indeterminate [^1]
Proposition 11
— Let K be a commutative field. (i) For every non-zero ideal a of K[X] there exists precisely one monic polynomial f in K[X] such that a=(f). (ii) Let f1 and f2 be in K[X]; for (f1)=(f2) to hold it is necessary and sufficient that there exist a non-zero element λ of K such that f2=λf1. Let us prove (ii), the sufficiency of the stated condition being clear. The case where f1 and f2 generate the zero ideal is trivial. Thus assume that the non-zero polynomials f1 and f2 generate the same ideal of K[X]. Then there exist polynomials u1 and u2 such that f1=u1f2 and f2=u2f1; it follows that u_1 u_2 = 1, whence degu1+degu2=0 and so degu2=0. We have thus shown that u2 is a non-zero element of K.
To prove (i), let f be a monic polynomial in a of least possible degree. Given g in a, let u and v be the quotient and remainder of the Euclidean division of g by f; then v=g−uf belongs to a and we have degv<degf; if v were non-zero, there would be a non-zero element A of K such that λv is monic, and since λv∈a, this would contradict the definition off. We thus have a=(f); the uniqueness of the monic polynomial f such that a=(f) now follows from (ii).
Proposition 12
Let K be a commutative field and f,g two elements of K[X]. For every polynomial d in K[X] the following properties are equivalent*:
(i) The polynomial d divides f and g and every polynomial which divides both f and g divides d.
(ii) The polynomial d divides f and g and there exist two polynomials u and v such that d=uf+vg.
(iii) The relation (d)=(f)+(g) holds between ideals in K[X].
The polynomial d is determined up to multiplication by a non-zero element of K by these properties. If f and g are not both zero, then d=0 and the degree of d majorizes the degree of every polynomial dividing both f and g.
When f and g are zero, each of the properties (i) to (iii) is satisfied only for d=0, hence they are then equivalent. Henceforth we assume that f,g are not both 0 and we denote by a the ideal (f)+(g) of K[X].
We remark that for any polynomials u and v in K[X] the properties (u)⊃(v) and « u divides v » are equivalent. The assertion (ii) is thus equivalent to « (d)⊃(f) and (d)⊃(g) and d∈(f)+(g) », that is (iii). It is clear that (ii) implies (i). Finally suppose that (i) holds; we have (d)⊃(f) and (d)⊃(g), whence (d)⊃a; on the other hand, by Prop. 11 (IV, p. 12) there exists a polynomial d1 such that a=(d1); since d1 divides both f and g, it divides d by hypothesis, whence (d)⊂a, and finally we have (d)=a, that is, (iii).
The other assertions of Prop. 12 are immediate consequences of Prop. 11 applied to the ideal a=(f)+(g).
Definition 1
With the notation of Prop. 12 we say that d is a greatest common divisor (gcd for short) of f and g. We say that f and g are relatively prime or that f is prime to g if 1 is a gcd of f and g*.
To say that f and g are relatively prime thus means that there exist polynomials u and v in K[X] such that uf+vg=1.
Corollary 1
Let d be a gcd of f and g and K′ a commutative field containing K as subfield. Then d is a gcd of f and g considered as elements of K′[X]*.
This follows from Prop. 12, (iii).
Corollary 2
— Let d be a gcd off and g. (i) If u∈K[X], du is a gcd of fu and gu. (ii) If v∈K[X] is a divisor (=0) of f and g, then d/v is a gcd of f/v and g/v. This follows from Prop. 12, (ii).
Corollary 3
— Let w be a common factor of f and g. For w to be a gcd off and g it is necessary and sufficient that f/w and g/w are relatively prime. This follows from Cor. 2.
Corollary 4
— Let f,g,h∈K[X]. If f divides gh and is prime to g, then f divides h. For f divides gh and fh, hence f divides every gcd of gh and fh, in particular h (Cor. 2, (i)).
Corollary 5
— Let f,g∈K[X]. For fand g to be relatively prime it is necessary and sufficient that the canonical image of g in K[X]/(f) should be invertible. For this condition means that there exist u,v∈K[X] such that uf+vg=1.
Corollary 6
— Let f,g1,g2,...,gn∈K[X]. If f is prime to g1,g2,...,gn, then f is prime to g1g2...gn.
\* COROLLARY 7. — For f and g to be relatively prime it is necessary and sufficient that they have no common roots in any extension of K. For if d is a gcd of f, g then the roots common to f and g in an extension K' of K are the roots of d in K'. Now the corollary follows from V, p. 21, Prop. 4.
8. Irreducible polynomials
Definition 2
— Let K be a commutative field. We say that f∈K[X] is irreducible if degf≥1 and f is not divisible by any polynomial g such that 0<degg<degf. It comes to the same to say that degf≥1 and the only divisors of f in K[X] are the scalars =0 and the products of f by scalars =0. Since the relation (f)⊂(g) means that g divides f, we see that the irreducible polynomials of K[X] may also be defined as the polynomials f such that the ideal (f) is maximal (I, p. 104).
Let f,g∈K[X]. Iff is irreducible, it is clear that either f and g are relatively prime or that f divides g. If f and g are irreducible, either f and g are relatively prime or each is a product of the other by a scalar =0. In particular, two distinct irreducible monic polynomials are relatively prime.
Proposition 13
— Let I be the set of irreducible monic polynomials in K[X]. Let f be a non-zero element of K[X] and a its leading coefficient; then there exists precisely one family of positive integers (vp)p∈S with finite support, such that we have a decomposition
f=αp∈S∏pvp.
It suffices to prove the proposition when f is monic, that is when α=1. We shall argue by induction on the degree n off, the case n=0 being trivial. Suppose then that n≥1 and that the proposition has been established for all polynomials of degree <n.
Let E be the set of monic polynomials =1 which divide f; we have f∈E hence E is not empty and there exists in E a polynomial g of least degree. It is clear that g is irreducible and there exists a monic polynomial h of degree <n such that f=gh; by the induction hypothesis h is the product of a finite family of irreducible monic polynomials, hence f has the same property. This proves the existence of the decomposition (18).
Let us now prove the uniqueness of the decomposition (18). Let (wp)p∈S be a family of positive integers with finite support, such that f=∏p∈Spwp. Since f is of degree n≥1, there exists p∈S such that wp>0; if we had vp=0, f would be the product of a family of elements of S distinct from p, hence it would be prime to p (IV, p. 13, Cor. 6), contrary to the fact that p divides f. By the induction hypothesis the polynomial f/p admits a unique decomposition of type (18); hence we conclude the equality wq=vq for every q∈4.
Let f be a non-zero polynomial in K[X]. We shall say that f has no multiple factors if the exponents vp in the decomposition (18) are all ≤1; it comes to the same to say that f is the product of a finite sequence of pairwise distinct irreducible polynomials, or also that f is not divisible by the square of any non-constant polynomial of K[X].
Exercises
See the exercises for § 1.
[^1]: The reader will note the analogy between the results of this No. and the next and the divisibility properties of the ring Z of integers (I, p. 112). They depend essentially on the fact that in the rings Z and K[X] every ideal is principal, as we shall see in Chapter VII, § 1.