This is a list of definitions and theorems concerning field extensions, that I’m compiling for my learning. Throughout, let be a field.
As I wrote this, I realized that it was helpful for me to point out theorems that are especially surprising / non-trivial. I will indicate these with a remark immediately following the statement of the result. Conversely, we will omit proofs whose details are immediate. (Many such proofs can be tedious.)
Definition. A field extension of is a field
such that
is a subfield of
. (We will often just say extension.)
Theorem. Any extension of can be viewed as a vector space over
.
Definition. The degree of an extension of is its dimension when viewed as a vector space over
.
Definition. If an extension has finite degree then it is called a finite extension, otherwise it is called an infinite extension.
Definition. Let be an extension of
. If every element of
is the root of some polynomial in
then we say
is an algebraic extension, otherwise we say
is a transcendental extension.
Theorem. Any finite extension is algebraic.
Proof. This is the first answer in abstract algebra – Is any finite-dimensional extension of a field, say $F$, algebraic and finitely generated? – Mathematics Stack Exchange.
Corollary. Any transcendental extension is infinite.
Henceforth, let be an extension of
.
Definition. Let . By
we mean the “smallest” extension of
containing
, in the following sense: it is the subfield of
containing
and
such that, for any other subfield
of
containing
and
,
. (This subfield always exists, and it is unique as a set.)
Theorem. Either of the following are equivalent to the definition of :
is the intersection of all subfields of
that contain
and
.
(all quotients of all polynomial expressions in the elements of
with coefficients in
.)
Definition. If , then we denote
(as a shorthand without the curly braces.) In particular, for a single element
,
is called a simple extension of
.
Theorem. An equivalent definition of is given by
(all quotients of all polynomials in with coefficients in
.)
Remark. This is exactly the expression of all quotients of all polynomial expressions in the elements of with coefficients in
from before, written out for
.
Theorem. We have (a sequence of simple extensions.)
Remark. We will omit the details since they are immediate, but we will give a quick hint: notice that and
.
Definition. A sequence of simple extensions for
is called an iterated extension.
Corollary. Any extension with
finite is iterated, and any finite extension is iterated.
Theorem. The extension is “independent” of
up to isomorphism, in the following sense: if
are any two extensions of
containing
, then the two extensions
formed from
and
are isomorphic to each other. Thus, we may identify elements with each other and speak of
without mentioning
, as long as we know that some extension of
containing
exists.
Theorem. Any sequence of simple algebraic extensions is simple.
Remark. Compared to the previous theorems, this result is much more surprising / non-trivial and less immediate.
Proof. By induction, it suffices to show that, for , there exists
such that
. A proof of this is provided in Charles Pinter’s A Book of Abstract Algebra, Chapter 31, Theorem 2.
Definition. Let be algebraic over
. The minimal polynomial of
is the monic irreducible polynomial
which has
as a root. (This polynomial exists if and only if
is algebraic, and it is unique.)
Theorem. Let . We have that
is an algebraic extension if and only if
is algebraic over
. Furthermore, if
is algebraic, then the degree of
is equal to the degree of the minimal polynomial of
. (In particular,
is a finite extension.)
Definition. Let be an irreducible polynomial in
. In a way analogous to the construction of the complex numbers from the reals, we may construct from
an extension of
in which
has all roots (if the degree of
is
, then
can be factored as
for
in the extension, where the
are not necessarily distinct.) Denoting this extension by
, if
is a root of
, then
is isomorphic to
. Hence, we don’t even need existence of
to construct simple algebraic extensions.
Theorem. Let be irreducible polynomials in
, and let
be roots of
respectively. If
is not irreducible over
, then
has all roots in
, and
can be embedded into
.
Definition. We can generalize the previous procedure to any number of polynomials, or even infinitely many polynomials. Let be a set of irreducible polynomials in
. In a way analogous to the construction of the complex numbers from the reals, we may construct from
an extension of
in which every polynomial in
has all roots. Denoting this extension by
, if the set of roots in
of all polynomials in
is denoted by
, then
is isomorphic to
. Hence, we don’t need existence of
to construct any algebraic extension. Furthermore, regardless of existence of
, given
, we can automatically work with roots of any polynomial in
.
Definition. If is the set of *all* irreducible polynomials in
, then the extension constructed from the previous definition is called the algebraic closure of
, denoted
.
Theorem. There exist non-simple algebraic extensions.
Proof. As a counterexample, take the field of real algebraic numbers as an extension of . This extension is algebraic but has infinite degree, therefore it cannot be simple.
Theorem. We have .
Remark. Another interpretation of this statement is that, once we have formed an extension in which any polynomial in has roots, then any polynomial in the potentially much larger set
will also actually have roots in it. Compared to most of the theorems here, this is quite surprising and non-trivial.
Proof. This is the first answer in abstract algebra – If $K$ is the algebraic closure of $F$, is $K$ also algebraically closed? – Mathematics Stack Exchange.
