Field Extensions and Algebraic Elements

Field extensions form the backbone of modern algebra, allowing mathematicians to systematically enlarge number systems by adjoining new elements. This process is essential for solving polynomial equations, understanding algebraic numbers, and applications in coding theory and cryptography. By distinguishing between algebraic and transcendental elements, we gain insight into the structure and limitations of field extensions.

Field Extensions and Algebraic Versus Transcendental Elements

A field extension is a pair of fields $K$ and $F$ such that $F$ is a subfield of $K$, denoted $K/F$. This means every element of $F$ is also in $K$, and the operations of addition and multiplication in $K$ restrict to those in $F$. For example, the complex numbers $\mathbb{C}$ form an extension of the real numbers $\mathbb{R}$, which in turn extend the rational numbers $\mathbb{Q}$. Extensions are often constructed by adjoining an element $\alpha$ to a base field $F$, written $F(\alpha )$, which is the smallest field containing both $F$ and $\alpha$.

An element $\alpha \in K$ is algebraic over $F$ if there exists a nonzero polynomial $f(x)\in F[x]$ such that $f(\alpha )=0$. If no such polynomial exists, $\alpha$ is transcendental over $F$. For instance, $\sqrt{2}$ is algebraic over $\mathbb{Q}$ because it satisfies $x^2-2=0$, while $\pi$ is transcendental over $\mathbb{Q}$, a classic result from number theory. The set of all algebraic elements over $F$ in $K$ forms a subfield, highlighting how algebraic structure propagates through extensions.

Minimal Polynomials and Their Properties

For an algebraic element $\alpha$ over $F$, the minimal polynomial is the monic polynomial of least degree in $F[x]$ that has $\alpha$ as a root. This polynomial is irreducible over $F$ and uniquely determines the algebraic properties of $\alpha$. If $f(x)$ is the minimal polynomial, then $F(\alpha )\cong F[x]/(f(x))$, where $(f(x))$ denotes the ideal generated by $f(x)$. This isomorphism provides a concrete way to work with extension fields.

Consider $\alpha =\sqrt[3]{2}$ over $\mathbb{Q}$. Its minimal polynomial is $x^3-2$, which is irreducible by Eisenstein's criterion. Thus, $\mathbb{Q}(\sqrt[3]{2})$ consists of all expressions $a+b\sqrt[3]{2}+c\sqrt[3]{4}$ for $a,b,c\in \mathbb{Q}$, with arithmetic defined modulo $x^3-2$. Minimal polynomials also encode field-theoretic invariants: the degree of the minimal polynomial equals the degree of the extension $[F(\alpha ):F]$, which we explore next.

Degree of Extensions and the Tower Theorem

The degree of an extension $K/F$, denoted $[K:F]$, is the dimension of $K$ as a vector space over $F$. If this dimension is finite, the extension is finite; otherwise, it is infinite. For $F(\alpha )$ with $\alpha$ algebraic, $[F(\alpha ):F]$ is the degree of the minimal polynomial of $\alpha$ over $F$. For example, $[\mathbb{Q}(\sqrt{2}):\mathbb{Q}]=2$ because the minimal polynomial $x^2-2$ has degree 2. Transcendental extensions yield infinite degree, such as $[\mathbb{Q}(\pi ):\mathbb{Q}]=\infty$.

A powerful tool for computing degrees is the tower theorem: if $F\subseteq L\subseteq K$ are fields, then $[K:F]=[K:L][L:F]$. This multiplicative property allows breaking down complex extensions into simpler steps. Suppose we have $\mathbb{Q}\subseteq \mathbb{Q}(\sqrt{2})\subseteq \mathbb{Q}(\sqrt{2},\sqrt{3})$. Then $[\mathbb{Q}(\sqrt{2}):\mathbb{Q}]=2$, and it can be shown that $[\mathbb{Q}(\sqrt{2},\sqrt{3}):\mathbb{Q}(\sqrt{2})]=2$ since $\sqrt{3}$ has minimal polynomial $x^2-3$ over $\mathbb{Q}(\sqrt{2})$. By the tower theorem, $[\mathbb{Q}(\sqrt{2},\sqrt{3}):\mathbb{Q}]=2\times 2=4$, confirming that the full extension has degree 4.

Constructing Splitting Fields

A splitting field of a polynomial $f(x)\in F[x]$ is a smallest extension field $K/F$ such that $f(x)$ factors completely into linear factors in $K[x]$. Splitting fields exist for any polynomial and are unique up to isomorphism, providing a canonical environment to study roots. They are constructed by iteratively adjoining roots of irreducible factors until the polynomial splits.

For $f(x)=x^3-2$ over $\mathbb{Q}$, the polynomial is irreducible. Adjoining one real root $\sqrt[3]{2}$ gives $\mathbb{Q}(\sqrt[3]{2})$, but $f(x)$ does not split there because complex roots are missing. By further adjoining a primitive cube root of unity $\omega =e^{2\pi i/3}$, which satisfies $x^2+x+1=0$, we obtain $K=\mathbb{Q}(\sqrt[3]{2},\omega )$. In $K$, $x^3-2=(x-\sqrt[3]{2})(x-\omega \sqrt[3]{2})(x-{\omega }^2\sqrt[3]{2})$, so $K$ is the splitting field with degree $[\mathbb{Q}(\sqrt[3]{2},\omega ):\mathbb{Q}]=6$ by the tower theorem. Splitting fields are crucial for Galois theory, which links field extensions to group theory.

Finite Fields as Extensions of Prime Fields

Finite fields, or Galois fields, are extensions of prime fields ${\mathbb{F}}_p$ where $p$ is prime. Every finite field has order $p^n$ for some prime $p$ and integer $n\ge 1$, denoted ${\mathbb{F}}_{p^n}$. Such a field is constructed as an extension of ${\mathbb{F}}_p$ by adjoining a root of an irreducible polynomial of degree $n$ in ${\mathbb{F}}_p[x]$. Specifically, ${\mathbb{F}}_{p^n}\cong {\mathbb{F}}_p[x]/(f(x))$ where $f(x)$ is irreducible of degree $n$.

For example, to build ${\mathbb{F}}_4$, which has $2^2$ elements, start with ${\mathbb{F}}_2=\{0,1\}$. The polynomial $f(x)=x^2+x+1$ is irreducible over ${\mathbb{F}}_2$ because it has no roots in ${\mathbb{F}}_2$. Adjoining a root $\alpha$ yields ${\mathbb{F}}_2(\alpha )=\{0,1,\alpha ,\alpha +1\}$ with arithmetic modulo $f(x)$. Here, $\alpha$ satisfies ${\alpha }^2+\alpha +1=0$, so ${\alpha }^2=\alpha +1$ in characteristic 2. Finite fields are splitting fields of the polynomial $x^{p^n}-x$ over ${\mathbb{F}}_p$, and they play a vital role in error-correcting codes and cryptography due to their structured arithmetic.

Common Pitfalls

1. Confusing algebraic and transcendental elements: Students sometimes assume that all complex numbers are algebraic over $\mathbb{Q}$, but transcendental numbers like $\pi$ or $e$ exist. Remember, algebraicity depends on the base field: $\pi$ is transcendental over $\mathbb{Q}$ but algebraic over $\mathbb{R}$ since it satisfies $x-\pi =0$ in $\mathbb{R}[x]$.

1. Miscomputing the degree of an extension: When using the tower theorem, ensure intermediate extensions are properly identified. For instance, in $\mathbb{Q}\subseteq \mathbb{Q}(\sqrt{2})\subseteq \mathbb{Q}(\sqrt[4]{2})$, $[\mathbb{Q}(\sqrt[4]{2}):\mathbb{Q}(\sqrt{2})]=2$ because $\sqrt[4]{2}$ has minimal polynomial $x^2-\sqrt{2}$ over $\mathbb{Q}(\sqrt{2})$, not $x^4-2$. The degree is relative to the immediate subfield.

1. Assuming minimal polynomials are always easy to find: For elements like $\alpha =\sqrt{2}+\sqrt{3}$, the minimal polynomial over $\mathbb{Q}$ is $x^4-10x^2+1$, which requires algebraic manipulation to derive. Always verify irreducibility over the base field to confirm it's minimal.

1. Overlooking characteristic in finite fields: In extensions of ${\mathbb{F}}_p$, remember that the characteristic is $p$, so arithmetic like $(a+b{)}^p=a^p+b^p$ holds. This affects computations of minimal polynomials and splitting fields, where polynomials may behave differently than in characteristic zero.

Summary

• Field extensions $K/F$ allow adjoining new elements to a base field, with algebraic elements satisfying polynomial equations over $F$ and transcendental elements not satisfying any.
• The minimal polynomial of an algebraic element is the monic irreducible polynomial of least degree with that element as a root, defining the structure of simple extensions.
• The degree of an extension $[K:F]$ measures its size as a vector space, and the tower theorem simplifies degree calculations for chains of extensions.
• Splitting fields are minimal extensions where a polynomial factors completely, constructed by adjoining roots iteratively and unique up to isomorphism.
• Finite fields ${\mathbb{F}}_{p^n}$ are constructed as extensions of prime fields ${\mathbb{F}}_p$ via irreducible polynomials, serving as splitting fields of $x^{p^n}-x$ and having applications in discrete mathematics.