Bourbaki

Theorem 1

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

Algebra, chapter V, § 3. Algebraic extensions

— Let AA be an algebra over a field KK, xx an element of AA algebraic over KK, nn the degree and ff the minimal polynomial of xx over KK.

a) For a polynomial g∈K[X]g \in K[X] to satisfy g(x)=0g(x) = 0 it is necessary and sufficient that gg should be a multiple of ff.

b) The mapping g↦g(x)g \mapsto g(x) defines by passage to quotients an isomorphism of the quotient algebra K[X]/(f)K[X]/(f) onto the algebra K[x]K[x], and the elements 1, x, …, xn−11,\ x,\ \ldots,\ x^{n-1} form a basis of K[x]K[x] over KK. In particular, [K[x]:K]=n[K[x]:K] = n.

c) Assume that AA is an integral domain. Then K[x]K[x] is a field and ff the unique monic irreducible polynomial in K[X]K[X] such that f(x)=0f(x) = 0.

d) For xx to be invertible in AA it is necessary and sufficient that f(0)≠0f(0) \neq 0; then we have x−1∈K[x]x^{-1} \in K[x].

There exists a unique algebra homomorphism φ:K[X]→A\varphi : K[X] \to A such that φ(X)=x\varphi(X) = x; we have φ(P)=P(x)\varphi(P) = P(x) for every P∈K[X]P \in K[X] and the image of φ\varphi equals K[x]K[x]. Let aa be the kernel of φ\varphi: by construction, the minimal polynomial ff of xx over KK belongs to aa and it is the monic polynomial of least degree in aa. Therefore (IVIV, p. 11, Prop. 11) we have a=(f)a = (f), whence aa. Assertion bb) follows at once from a) and the Cor. of Prop. 10 of IVIV, p. 11.

Suppose that AA is an integral domain. The algebra K[x]K[x] is then an integral domain and of finite degree over KK, hence it is a field (VV, p. 10, Cor.). The ideal (f)(f) of K[x]K[x] is thus maximal, that means that ff is irreducible in K[X]K[X] (IVIV, p. 13). Finally, let gg be a monic irreducible polynomial in K[X]K[X] such that g(x)=0g(x) = 0; by aa) it is a multiple of ff, hence g=fg = f, and this proves cc).

It remains to prove dd). There exists a polynomial g∈K[X]g \in K[X] of degree n−1n-1 and an element aa of KK such that f(X)=Xg(X)+af(X) = Xg(X) + a, whence f(0)=af(0) = a. If a=0a = 0, we have xg(x)=f(x)=0xg(x) = f(x) = 0, and g(x)≠0g(x) \neq 0, so then xx is not invertible in AA. If on the other hand a≠0a \neq 0, then we have x⋅[−a−1g(x)]=1x \cdot [-a^{-1}g(x)] = 1, so xx is then invertible in AA and x−1=−a−1g(x)x^{-1} = -a^{-1}g(x).

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.