Bourbaki

Proposition 8

Tag 06B1, permanent. Cite it as [Bourbaki, Tag 06B1].

Algebra, chapter IV, § 2. Zeros of polynomials

— 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.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Nothing.

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