Properties of algebraic elements
Definition 119.1(Field extension).
cb5039A field extension is an injective ring homomorphism , where is called the base field, and is called the extension of . We will denote the field extension by .
Definition 119.2(Algebraic elements).
b33844Let be a field extension and . We say that is algebraic over if satisfies a polynomial 1. is said to be algebraic if every is algebraic over . is said to be transcendental over if it is not algebraic.
Example 119.3.
- , over are transcendental.
- is algebraic over ; the minimal polynomial is .
Proposition 119.4.
be91ebLet be a field extension. Let be algebraic over . Then there is a unique monic irreducible polynomial such that .
Proof.
Consider the ring homomorphism defined by . Since is a PID, for some irreducible monic such that . If is another irreducible monic polynomial in such that , then . Since is irreducible, and must be associates, and since is monic, we have .□
Definition 119.5(Minimal polynomial).
The unique monic polynomial in Prp 4 satisfied by is denoted by .
Example 119.6.
- Consider and . , .
- , where .
Monogenic algebraic extensions
Definition 119.7(Extensions generated by one element).
Let be a field extension and let . We denote the smallest subfield of containing and by .
Remark 119.8.
fc2681The notation is suggestive. Indeed, it is easy to see that is the set of all rational functions in with coefficients in :
Suppose and . Clearly,
If is algebraic over , the reverse inclusion holds too.
Proposition 119.9.
6a4ad7Let be a field extension and be algebraic over .
Proof.
Note that for given by , we have . Since is surjective, we have . Thus, is a field, and hence .□
Remark 119.10.
Remark 119.11(Constructing inverses in).
is a field by Prp 9; how can we obtain the inverse of ?
Let . Since is irreducible in , the gcd of and is . Since is a Euclidean domain, the euclidean algorithm supplies such that . Reducing modulo , we obtain . Thus, .
Proposition 119.12.
iff is algebraic over .
Proof.
Let be transcendental over . If , since , we have . This implies is algebraic over , a contradiction.□
Proposition 119.13(Monogenic algebraic extensions are finite).
5c70c9Let be a field extension and be algebraic over . Then, , where is the degree of . Specifically, is an -basis for .
Proof.
If were not linearly independent, an equation of linear dependence would yield a polynomial of degree less than of which is a root, contradicting Prp 4.
Let . Suppose . By the division algorithm, there exist unique with or such that
We can now write
and hence . Therefore, . Since , we get .□
10680cRemark 119.14.
Proposition 119.15.
Let be a field extension and be algebraic over . Suppose . If , then .
Proof.
Clearly,1. Since , we get . It follows from Prp 119.13 that .□
Proposition 119.16.
Let be a field extension. Suppose are algebraic over . If then there is an isomorphism fixing elements of such that .
Proof.
Since , . Consider as in the statement. By definition, is a ring homomorphism (this works only because the irreducible polynomials of and are equal). Since , and is a field, we must have , that is, is injective. Note that the -basis of maps to the -basis of . Since is a -linear map, we get is surjective.□
The converse is not true if we do not assume . Consider , , . . The only -algebra isomorphisms between and are given by
that is, by and .
Algebraic extensions
Definition 119.17(Algebraic extension).
296267A field extension is called an algebraic extension if every is algebraic over .
Proposition 119.18.
18f4e1Let be a field extension. Assume that is algebraic over . Then is an algebraic extension.
Proof.
Let . Let . Then is linearly dependent over by Prp 119.13, so there exist coefficients not all zero such that . Thus is algebraic over .□
Proposition 119.19.
1a378aLet be a field extension and be an algebraic extension. If is algebraic over , then is algebraic over .
Proof.
Corollary 119.20.
ffcc23Let and be algebraic extensions. Then is an algebraic extension.
Misc
Proposition 119.21.
Suppose , , and is a ring homomorphism fixing . Let be a root of . Then is a root of .
Proof.
Let. We have . Then,
□
For instance, this shows if is a root of , then is also a root of .