§ 2. Zeros of polynomials
1. Roots of a polynomial in one indeterminate. Multiplicity
Let and let be a unital associative -algebra. Let , be a family of pairwise permutable elements of . We shall say that is a zero of in if . If is a polynomial in a single indeterminate, a zero of in is also called a root of in .
Proposition 1
— Let and . The remainder of the division of by is . For to be a root of it is necessary and sufficient that should be a divisor of in .
For if are such that , then is a scalar and . This proves the first assertion and the second follows from it.
Proposition 2
— Let , , and let be an integer . The following conditions are equivalent: (i) is divisible by but not by ; (ii) *there exists such that and . (i) (ii) follows at once from Prop. 1. (ii) (i) : Suppose that , where does not admit as a root. Then is divisible by ; if existed such that , then since is not a divisor of zero in (IV, p. 9, Prop. 7), we have and so , which is absurd.
Proposition 3
— Let be a non-zero element of and . There exists just one integer satisfying the conditions (i) and (ii) of Prop. 2. This is clear for condition (i), bearing in mind the fact that iff is divisible by , then (IV, p. 9, Prop. 7).
Definition 1
— With the above notation we say that is of order , or multiplicity relative to . If we also say that is a root of order or multiplicity off. A root of order 1 is called a simple root, a root of order 2 a double root,... A root of order is said to be multiple.
Remark 1
If we agree to say that has order relative to , whatever and the integer . For any and , to say that has order relative to means that divides .
Remark 2
Let be a commutative ring containing as subring. Let be non-zero and . The order of relative to is the same, whether we consider as element of or as element of . This is clear from condition (ii) of Prop. 2.
Proposition 4
— Let and be non-zero elements of . Let , and let the orders of relative to and be and respectively. (i) The order of relative to is . It is equal to if . (ii) The order of relative to is . It is equal to if is an integral domain.
For we have , with , . Suppose for example that ; then we have
and if , is not a root of ; this proves (i). On the other hand, we have and if is an integral domain; this proves (ii).
Proposition 5
Suppose that is an integral domain. Let be a non-zero element of , and pairwise distinct roots of in , of orders . We have
where and are not roots of .
We proceed by induction on , the proposition being evident for , by Def. 1. Suppose then that , where
Since is an integral domain and is distinct from it follows that is not a root of , hence is a root of order of (Prop. 4, (ii)). It follows that is divisible by , and so
where . Clearly are not roots of .
Theorem 1
Let be an integral domain. Given a non-zero element of , of degree , then the sum of the orders of all the roots off in is .
This follows immediately from Prop. 5.
Corollary
Assume that is an integral domain and let , of degrees . If there exist pairwise distinct elements of such that for , then .
It suffices to apply Th. 1 to .
Proposition 6 (Lagrange interpolation formula)
— *Let be a commutative field, distinct elements of and any elements of . For we put
where is the set of integers such that and . Then is the unique element of such that and for .
The uniqueness off follows from the Cor. to Th. 1. Let , then since has degree , we have . On the other hand, for and , hence for .
Corollary
— Suppose that is an integral domain. Let , of degree , and let be a subring of which is a field. If there exist distinct elements of such that and for , then .
2. Differential criterion for the multiplicity of a root
Proposition 7
— Let and let be a root off: For to be a simple root off it is necessary and sufficient that should not be a root of the derivative of .
By hypothesis we have , where . For to be a simple root of it is necessary and sufficient that . Now we have , whence .
More generally:
Proposition 8
— Let and , and suppose that has order relative to : Then has order relative to . If is cancellable in , then has order relative to .
By hypothesis there exists such that and . Hence , which establishes the first part of the proposition. The value of for is , and this is non-zero if is cancellable in ; this proves the second part of the proposition.
Let be an integer such that in . If , then is a root of order of , and a root of arbitrarily high order of .
Corollary
— Let , and an integer , further, suppose that is cancellable in . Then for to be a root of order of , it is necessary and sufficient that should be a root of and not a root of .
This follows from Prop. 8 by induction on .
3. Polynomial functions on an infinite integral domain
Proposition 9
— Assume that is an integral domain. Let be a set, a family of infinite subsets of and . Iff is a non-zero element of , and the set of all such that , then and are equipotent.
a) First suppose that is finite and put . The proposition is clear for ; we shall prove it by induction on . Choose an element of and put , . Since , we can write , where and . By the induction hypothesis the set K of all such that is equipotent with . For the polynomial
b) In the general case there is a finite subset of I such that . Let be the set of all such that . Then
Corollary 1
— *We keep the hypothesis and notation of Prop. 9. If l is non-empty, then is infinite.
Corollary 2
— *Suppose that A is an infinite integral domain or that A is an algebra over an infinite field. For every , let be the polynomial function defined by f (IV, p. 4). Then the mapping is injective.
When A is an infinite integral domain, the corollary follows at once from Prop. 9. Suppose that A is an algebra over an infinite field k. Let be a non-zero element of ; then there exists such that , and a k-linear form on A such that . Let ; we have , hence there exists such that . Then , and so .
When A is an infinite integral domain or when A is an algebra over an infinite field, we shall usually identify f with .
Suppose that A is finite and let , then , but . For other examples see IV, p. 88, exercises 7 and 8.
Theorem 2 (Principle of extension of algebraic identities)
— *Suppose that A is an infinite integral domain. Let be elements of and assume the following hypotheses:
a) ; b) for all such that , we have . Then .
For if , we have (IV, p. 9, Prop. 8), hence there exists such that (IV, p. 18, Cor. 2), which contradicts the hypothesis.
Scholium
— Let A be an integral domain and . Th. 2 provides a convenient means of proving that . It suffices to consider an infinite integral domain E containing A as subring; if we can show that for all (or even for those at which a finite number of given non-zero polynomials do not vanish) then it follows that . If A itself is not infinite, we can for example take E to be the ring or its field of fractions.
Once we have proved the relation , we can clearly deduce that for all where F is any unital associative and commutative A-algebra whatsoever; in particular F may be finite or non-integral.
In other words, the proof of the identity when the run over an infinite integral domain containing A as subring (with the possible restriction that for , where the are non-zero polynomials) implies the same identity when the run over any unital associative and commutative A-algebra.
In particular let . If when the run over (with the possible restriction that for , where the are non-zero elements of ), then we have the same identity when the run over an arbitrary commutative ring.
Exercises
See the exercises for § 2.