Bourbaki

§ 2. Zeros of polynomials

1. Roots of a polynomial in one indeterminate. Multiplicity

Let g∈A[(Xi)i∈I]g \in A[(X_i)_{i \in I}] and let EE be a unital associative AA-algebra. Let x=(xi)i∈Ix = (x_i)_{i \in I}, be a family of pairwise permutable elements of EE. We shall say that xx is a zero of gg in ElE^l if g(x)=0g(x) = 0. If ff is a polynomial in a single indeterminate, a zero of ff in EE is also called a root of ff in EE.

Proposition 1

— Let f∈A[X]f \in A[X] and α∈A\alpha \in A. The remainder of the division of ff by X−αX - \alpha is f(α)f(\alpha). For α\alpha to be a root of ff it is necessary and sufficient that X−αX - \alpha should be a divisor of ff in A[X]A[X].

For if u, v∈A[X]u,\ v \in \mathbf{A}[X] are such that f=(X−α) u+v, deg⁡v<1f = (X - \alpha)\ u + v,\ \deg v < 1, then vv is a scalar and f(a)=(a−a) u(α)+v=vf(a) = (a - a)\ u(\alpha) + v = v. This proves the first assertion and the second follows from it.

Proposition 2

— Let f∈A[X]f \in \mathbf{A}[X], a∈Aa \in \mathbf{A}, and let hh be an integer ≥0\geq 0. The following conditions are equivalent: (i) ff is divisible by (X−α)h(X - \alpha)^h but not by (X−α)h−1(X - \alpha)^{h-1}; (ii) *there exists g∈A[X]g \in \mathbf{A}[X] such that f=(X−α)hgf = (X - \alpha)^h g and g(a)≠0g(a) \neq 0. (i) ⇒\Rightarrow (ii) follows at once from Prop. 1. (ii) ⇒\Rightarrow (i) : Suppose that f=(X−α)hgf = (X - \alpha)^h g, where gg does not admit aa as a root. Then ff is divisible by (X−α)h(X - \alpha)^h; if g1∈A[X]g_1 \in \mathbf{A}[X] existed such that f=(X−α)h+1g1f = (X - \alpha)^{h+1} g_1, then since (X−α)n(X - \alpha)^n is not a divisor of zero in A[X]\mathbf{A}[X] (IV, p. 9, Prop. 7), we have g=(X−a) g1g = (X - a)\ g_1 and so g(α)=0g(\alpha) = 0, which is absurd.

Proposition 3

— Let ff be a non-zero element of A[X]\mathbf{A}[X] and a∈Aa \in \mathbf{A}. There exists just one integer h≥0h \geq 0 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 (X−α)h(X - \alpha)^h, then deg⁡f≥h\deg f \geq h (IV, p. 9, Prop. 7).

Definition 1

— With the above notation we say that aa is of order hh, or multiplicity hh relative to ff. If h>0h > 0 we also say that aa is a root of order hh or multiplicity hh off. A root of order 1 is called a simple root, a root of order 2 a double root,... A root of order >1> 1 is said to be multiple.

Remark 1

If f=0f = 0 we agree to say that aa has order ≥h\geq h relative to ff, whatever a∈Aa \in \mathbf{A} and the integer h≥0h \geq 0. For any f∈A[X]f \in \mathbf{A}[X] and a∈Aa \in \mathbf{A}, to say that aa has order ≥h\geq h relative to ff means that (X−α)h(X - \alpha)^h divides ff.

Remark 2

Let BB be a commutative ring containing A\mathbf{A} as subring. Let f∈A[X]f \in \mathbf{A}[X] be non-zero and a∈Aa \in \mathbf{A}. The order of aa relative to ff is the same, whether we consider ff as element of B[X]B[X] or as element of A[X]\mathbf{A}[X]. This is clear from condition (ii) of Prop. 2.

Proposition 4

— Let ff and gg be non-zero elements of A[X]\mathbf{A}[X]. Let a∈Aa \in \mathbf{A}, and let the orders of aa relative to ff and gg be pp and qq respectively. (i) The order of aa relative to f+gf + g is ≥inf⁡(p,q)\geq \inf(p, q). It is equal to inf⁡(p,q)\inf(p, q) if p≠qp \neq q. (ii) The order of aa relative to fgfg is ≥p+q\geq p + q. It is equal to p+qp + q if A\mathbf{A} is an integral domain.

For we have f(X)=(X−α)pf1(X)f(X) = (X - \alpha)^p f_1(X), g(X)=(X−α)qg1(X)g(X) = (X - \alpha)^q g_1(X) with f1(α)≠0f_1(\alpha) \neq 0, g1(a)≠0g_1(a) \neq 0. Suppose for example that p≤qp \leq q; then we have

f(X)+g(X)=(X−α)p(f1(X)+(X−α)q−pg1(X)). f(X) + g(X) = (X - \alpha)^p (f_1(X) + (X - \alpha)^{q-p} g_1(X)) .

and if p<qp < q, aa is not a root of f1(X)+(X−α)q−pg1(X)f_1(X) + (X - \alpha)^{q-p} g_1(X); this proves (i). On the other hand, we have f(X)g(X)=(X−α)p+qf1(X)g1(X)f(X)g(X) = (X - \alpha)^{p+q} f_1(X)g_1(X) and f1(α)g1(α)≠0f_1(\alpha)g_1(\alpha) \neq 0 if AA is an integral domain; this proves (ii).

Proposition 5

Suppose that AA is an integral domain. Let ff be a non-zero element of A[X]A[X], and α1,…,αp\alpha_1, \ldots, \alpha_p pairwise distinct roots of ff in AA, of orders k1,…,krk_1, \ldots, k_r. We have

f(X)=(X−α1)k1(X−α2)k2…(X−αp)kpg(X) f(X) = (X - \alpha_1)^{k_1}(X - \alpha_2)^{k_2} \ldots (X - \alpha_p)^{k_p} g(X)

where g∈A[X]g \in A[X] and α1,…,αp\alpha_1, \ldots, \alpha_p are not roots of gg.

We proceed by induction on pp, the proposition being evident for p=1p = 1, by Def. 1. Suppose then that f(X)=g1(X)g2(X)f(X) = g_1(X)g_2(X), where

g1(X)=(X−α1)k1…(X−αp−1)kp−1,g2(X)∈A[X]. g_1(X) = (X - \alpha_1)^{k_1} \ldots (X - \alpha_{p-1})^{k_{p-1}}, \quad g_2(X) \in A[X].

Since AA is an integral domain and αp\alpha_p is distinct from α1,…,αp−1\alpha_1, \ldots, \alpha_{p-1} it follows that αp\alpha_p is not a root of g1(X)g_1(X), hence αp\alpha_p is a root of order kpk_p of g2(X)g_2(X) (Prop. 4, (ii)). It follows that g2(X)g_2(X) is divisible by (X−αp)kp(X - \alpha_p)^{k_p}, and so

f(X)=(X−α1)k1…(X−αp)kpg(X) f(X) = (X - \alpha_1)^{k_1} \ldots (X - \alpha_p)^{k_p} g(X)

where g(X)∈A[X]g(X) \in A[X]. Clearly α1,…,αp\alpha_1, \ldots, \alpha_p are not roots of gg.

Theorem 1

Let AA be an integral domain. Given a non-zero element ff of A[X]A[X], of degree nn, then the sum of the orders of all the roots off in AA is ≤n\leq n.

This follows immediately from Prop. 5.

Corollary

Assume that AA is an integral domain and let f,g∈A[X]f, g \in A[X], of degrees ≤n\leq n. If there exist n+1n + 1 pairwise distinct elements x1,…,xn+1x_1, \ldots, x_{n+1} of AA such that f(xi)=g(xi)f(x_i) = g(x_i) for 1≤i≤n+11 \leq i \leq n + 1, then f=gf = g.

It suffices to apply Th. 1 to f−gf - g.

Proposition 6 (Lagrange interpolation formula)

— *Let KK be a commutative field, α1,α2,…,a,\alpha_1, \alpha_2, \ldots, a, distinct elements of KK and β1,β2,…,βn\beta_1, \beta_2, \ldots, \beta_n any elements of KK. For i=1,2,…,ni = 1, 2, \ldots, n we put

fi(X)=∏j∈U(i)(X−αj)/(αi−αj), f_i(X) = \prod_{j \in U(i)} (X - \alpha_j)/(\alpha_i - \alpha_j),

where U(i)U(i) is the set of integers jj such that j≠ij \neq i and 1≤j≤n1 \leq j \leq n. Then β1f1+…+βnfn\beta_1 f_1 + \ldots + \beta_n f_n is the unique element ff of K[X]K[X] such that deg⁡f<n\deg f < n and f(αi)=βif(\alpha_i) = \beta_i for 1≤i≤n1 \leq i \leq n.

The uniqueness off follows from the Cor. to Th. 1. Let f=β1f1+…+βnfnf = \beta_1 f_1 + \ldots + \beta_n f_n, then since fif_i has degree n−1n - 1, we have deg⁡f<n\deg f < n. On the other hand, fi(αj)=0f_i(\alpha_j) = 0 for j≠ij \neq i and fi(αi)=1f_i(\alpha_i) = 1, hence f(αi)=βif(\alpha_i) = \beta_i for 1≤i≤n1 \leq i \leq n.

Corollary

— Suppose that A\mathbf{A} is an integral domain. Let f∈A[X]f \in \mathbf{A}[X], of degree <n< n, and let KK be a subring of A\mathbf{A} which is a field. If there exist nn distinct elements α1,…,an\alpha_1, \ldots, a_n of A\mathbf{A} such that αi∈K\alpha_i \in K and f(αi)∈Kf(\alpha_i) \in K for i=1,…,ni = 1, \ldots, n, then f∈K[X]f \in K[X].

2. Differential criterion for the multiplicity of a root

Proposition 7

— Let f∈A[X]f \in \mathbf{A}[X] and let a∈Aa \in \mathbf{A} be a root off: For aa to be a simple root off it is necessary and sufficient that aa should not be a root of the derivative DfDf of ff.

By hypothesis we have f=(X−a) gf = (X - a)\ g, where g∈A[X]g \in \mathbf{A}[X]. For aa to be a simple root of ff it is necessary and sufficient that g(α)≠0g(\alpha) \neq 0. Now we have Df=g+(X−α) DgDf = g + (X - \alpha)\ Dg, whence (Df)(α)=g(α)(Df)(\alpha) = g(\alpha).

More generally:

Proposition 8

— Let f∈A[X]f \in \mathbf{A}[X] and a∈Aa \in \mathbf{A}, and suppose that aa has order k≥1k \geq 1 relative to ff: Then aa has order ≥k−1\geq k - 1 relative to DfDf. If k.1k . 1 is cancellable in A\mathbf{A}, then aa has order k−1k - 1 relative to DfDf.

By hypothesis there exists g∈A[X]g \in \mathbf{A}[X] such that f=(X−a)kgf = (X - a)^k g and g(a)≠0g(a) \neq 0. Hence Df=k(X−α)k−1g+(X−α)kDg=(X−α)k−1(kg+(X−α) Dg)Df = k(X - \alpha)^{k-1}g + (X - \alpha)^k Dg = (X - \alpha)^{k-1}(kg + (X - \alpha)\ Dg), which establishes the first part of the proposition. The value of kg+(X−α) Dgkg + (X - \alpha)\ Dg for X=αX = \alpha is kg(a)kg(a), and this is non-zero if k.1k . 1 is cancellable in A\mathbf{A}; this proves the second part of the proposition.

Let kk be an integer >0> 0 such that k.1=0k . 1 = 0 in A\mathbf{A}. If f(X)=Xkf(X) = X^k, then 00 is a root of order kk of ff, and a root of arbitrarily high order of DfDf.

Corollary

— Let f∈A[X]f \in \mathbf{A}[X], a∈Aa \in \mathbf{A} and pp an integer ≥0\geq 0, further, suppose that p!.1p! . 1 is cancellable in A\mathbf{A}. Then for aa to be a root of order pp of ff, it is necessary and sufficient that aa should be a root of f,Df,...,Dp−1ff, Df, ..., D^{p-1}f and not a root of DpfD^pf.

This follows from Prop. 8 by induction on pp.

3. Polynomial functions on an infinite integral domain

Proposition 9

— Assume that AA is an integral domain. Let II be a set, (Hi)i∈I(\mathbf{H}_i)_{i \in I} a family of infinite subsets of A\mathbf{A} and H=∏i∈IHi⊂A′H = \prod_{i \in I} \mathbf{H}_i \subset A'. Iff is a non-zero element of A[(Xi)i∈I]\mathbf{A}[(X_i)_{i \in I}], and HfH_f the set of all x∈Hx \in H such that f(x)≠0f(x) \neq 0, then HH and HfH_f are equipotent.

a) First suppose that II is finite and put n=Card In = \mathrm{Card}\ I. The proposition is clear for n=0n = 0; we shall prove it by induction on nn. Choose an element i0i_0 of II and put J=I−{i0}J = I - \{i_0\}, B=A[(Xi)i∈J]B = \mathbf{A}[(X_i)_{i \in J}]. Since f≠0f \neq 0, we can write f=∑k=0mgkXi0kf = \sum_{k=0}^m g_k X_{i_0}^k, where g0,…,gm∈Bg_0, \ldots, g_m \in B and gm≠0g_m \neq 0. By the induction hypothesis the set K of all x∈∏i∈sHix \in \prod_{i \in s} H_i such that gm(x)≠0g_m(x) \neq 0 is equipotent with ∏i∈JHi\prod_{i \in J} H_i. For x∈Kx \in K the polynomial

h(Xi0)=∑k=0mgk(x)Xi0k∈A[Xi0] h(X_{i_0}) = \sum_{k=0}^m g_k(x) X_{i_0}^k \in A[X_{i_0}]
is non-zero. By Th. 1 (IV, p. 16) the set of a∈Hi0a \in H_{i_0} such that h(α)≠0h(\alpha) \neq 0 is equipotent with Hi0H_{i_0} whence
Card⁡H≥Card⁡Hf≥(Card⁡K)⋅(Card⁡Hi0)=Card⁡H, \operatorname{Card} H \geq \operatorname{Card} H_f \geq (\operatorname{Card} K) \cdot (\operatorname{Card} H_{i_0}) = \operatorname{Card} H,
and so Card⁡H=Card⁡Hf\operatorname{Card} H = \operatorname{Card} H_f.

b) In the general case there is a finite subset I′I' of I such that f∈A[(Xi)i∈I′]f \in A[(X_i)_{i \in I'}]. Let Hf′H'_f be the set of all x∈∏i∈I′Hix \in \prod_{i \in I'} H_i such that f(x)≠0f(x) \neq 0. Then

Hf=Hf′×(∏i∈I−I′Hi), H_f = H'_f \times \left( \prod_{i \in I - I'} H_i \right),
and it suffices to apply the first part of the proof to Hf′H'_f.

Corollary 1

— *We keep the hypothesis and notation of Prop. 9. If l is non-empty, then HfH_f is infinite.

Corollary 2

— *Suppose that A is an infinite integral domain or that A is an algebra over an infinite field. For every f∈A[(Xi)i∈I]f \in A[(X_i)_{i \in I}], let f~:AI→A\tilde{f}: A^I \to A be the polynomial function defined by f (IV, p. 4). Then the mapping f↦f~f \mapsto \tilde{f} 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 f=∑ν∈N(I)ανXνf = \sum_{\nu \in \mathbf{N}^{(I)}} \alpha_\nu X^\nu be a non-zero element of A[(Xi)i∈I]A[(X_i)_{i \in I}]; then there exists ν0∈N(I)\nu_0 \in \mathbf{N}^{(I)} such that αν0≠0\alpha_{\nu_0} \neq 0, and a k-linear form φ\varphi on A such that φ(αν0)≠0\varphi(\alpha_{\nu_0}) \neq 0. Let g=∑ν∈N(I)φ(aν)Xν∈k[(Xi)i∈I]g = \sum_{\nu \in \mathbf{N}^{(I)}} \varphi(a_\nu) X^\nu \in k[(X_i)_{i \in I}]; we have g≠0g \neq 0, hence there exists x∈kIx \in k^I such that g(x)≠0g(x) \neq 0. Then φ(f(x))=g(x)≠0\varphi(f(x)) = g(x) \neq 0, and so f(x)≠0f(x) \neq 0.

When A is an infinite integral domain or when A is an algebra over an infinite field, we shall usually identify f with f~\tilde{f}.

Suppose that A is finite and let f(X)=∏a∈A(X−a)f(X) = \prod_{a \in A} (X - a), then f≠0f \neq 0, but f~=0\tilde{f} = 0. 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 g1,…,gm,fg_1, \ldots, g_m, f be elements of A[(Xi)i∈I]A[(X_i)_{i \in I}] and assume the following hypotheses:

a) g1≠0,…,gm≠0g_1 \neq 0, \ldots, g_m \neq 0; b) for all x∈A1x \in \mathbf{A}^1 such that g1(x)≠0,…,gm(x)≠0g_1(x) \neq 0, \ldots, g_m(x) \neq 0, we have f(x)=0f(x) = 0. Then f=0f = 0.

For if f≠0f \neq 0, we have fg1…gm≠0fg_1 \ldots g_m \neq 0 (IV, p. 9, Prop. 8), hence there exists x∈A1x \in \mathbf{A}^1 such that f(x)g1(x)…gm(x)≠0f(x)g_1(x) \ldots g_m(x) \neq 0 (IV, p. 18, Cor. 2), which contradicts the hypothesis.

Scholium

— Let A be an integral domain and f∈A[(Xi)i∈I]f \in A[(X_i)_{i \in I}]. Th. 2 provides a convenient means of proving that f=0f = 0. It suffices to consider an infinite integral domain E containing A as subring; if we can show that f((xi))=0f((x_i)) = 0 for all (xi)∈EI(x_i) \in E^I (or even for those (xi)∈EI(x_i) \in E^I at which a finite number of given non-zero polynomials do not vanish) then it follows that f=0f = 0. If A itself is not infinite, we can for example take E to be the ring A[X]A[X] or its field of fractions.

Once we have proved the relation f=0f = 0, we can clearly deduce that f((yi))=0f((y_i)) = 0 for all (yi)∈FI(y_i) \in F^I 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 f((xi))=0f((x_i)) = 0 when the xix_i run over an infinite integral domain containing A as subring (with the possible restriction that gk((xi))≠0g_k((x_i)) \neq 0 for 1≤k≤m1 \leq k \leq m, where the gkg_k are non-zero polynomials) implies the same identity when the xix_i run over any unital associative and commutative A-algebra.

In particular let f∈Z[(Xi)i∈I]f \in Z[(X_i)_{i \in I}]. If f((xi))=0f((x_i)) = 0 when the xix_i run over Z\mathbf{Z} (with the possible restriction that gk((xi))≠0g_k((x_i)) \neq 0 for 1≤k≤m1 \leq k \leq m, where the gkg_k are non-zero elements of Z[(Xi)]\mathbf{Z}[(X_i)]), then we have the same identity when the xix_i run over an arbitrary commutative ring.

Exercises

See the exercises for § 2.

Transcribed from the printed edition, 2003, Springer. Not translated.