Skip to content

Field Theory | Mathematics - Wyatt's Notes

A field extension is an inclusion FEF \subseteq E of fields. We write E/FE/F and call EE an extension field of FF.

The degree of the extension, denoted [E:F][E : F]Is the dimension of EE as a vector space over FF.

Proposition 12.1. If FEKF \subseteq E \subseteq K are field extensions, then [K:F]=[K:E][E:F][K : F] = [K : E][E : F].

Proof. If {αi}\{\alpha_i\} is a basis for E/FE/F and {βj}\{\beta_j\} is a basis for K/EK/E Then {αiβj}\{\alpha_i \beta_j\} is a basis for K/FK/F. Count dimensions. \blacksquare

An element αE\alpha \in E is algebraic over FF if there exists a non-zero polynomial fF[x]f \in F[x] With f(α)=0f(\alpha) = 0. Otherwise α\alpha is transcendental over FF.

The minimal polynomial of α\alpha over FF is the monic polynomial of smallest degree in F[x]F[x] Having α\alpha as a root.

Proposition 12.2. The minimal polynomial of α\alpha over FF is irreducible in F[x]F[x].

Proof. If mα=fgm_\alpha = fg with deg(f),deg(g)<deg(mα)\deg(f), \deg(g) \lt \deg(m_\alpha) Then f(α)g(α)=0f(\alpha)g(\alpha) = 0 So either f(α)=0f(\alpha) = 0 or g(α)=0g(\alpha) = 0Contradicting the minimality of deg(mα)\deg(m_\alpha). \blacksquare

Theorem 12.3. α\alpha is algebraic over FF if and only if [F(α):F]<[F(\alpha) : F] \lt \infty. In this case, [F(α):F]=deg(mα)[F(\alpha) : F] = \deg(m_\alpha).

Proof. If α\alpha is algebraic with minimal polynomial mαm_\alpha of degree nn Then {1,α,α2,,αn1}\{1, \alpha, \alpha^2, \ldots, \alpha^{n-1}\} is a basis for F(α)/FF(\alpha)/F (every element can be Reduced modulo mαm_\alpha), so [F(α):F]=n[F(\alpha) : F] = n. Conversely, if [F(α):F]=n<[F(\alpha) : F] = n \lt \infty Then {1,α,,αn}\{1, \alpha, \ldots, \alpha^n\} is linearly dependent, giving a polynomial relation f(α)=0f(\alpha) = 0. \blacksquare

Theorem 12.4 (Kronecker”s Theorem). If FF is a field and fF[x]f \in F[x] is irreducible, then E=F[x]/(f)E = F[x] / (f) is a field extension of FF containing a root of ff.

Proof. Since ff is irreducible and F[x]F[x] is a PID, (f)(f) is a maximal ideal, so E=F[x]/(f)E = F[x]/(f) Is a field. The element α=x+(f)E\alpha = x + (f) \in E satisfies f(α)=f(x+(f))=f(x)+(f)=(f)=0f(\alpha) = f(x + (f)) = f(x) + (f) = (f) = 0 I.e., α\alpha is a root of ff. \blacksquare

Theorem 12.5. For every prime pp and every n1n \geq 1There exists a field of order pnp^n Unique up to isomorphism.

Proof (existence). Consider the splitting field of f(x)=xpnxf(x) = x^{p^n} - x over Fp\mathbb{F}_p. The set of roots of ff in the splitting field forms a field (since roots are closed under addition, Multiplication, and taking inverses), and it has exactly pnp^n elements. \blacksquare

Proposition 12.6. The multiplicative group Fpn\mathbb{F}_{p^n}^* of a finite field is cyclic.

Proof. Fpn\mathbb{F}_{p^n}^* is a finite abelian group of order pn1p^n - 1. Let mm be the largest order of any element. By Lagrange, every element’s order divides mm. So xm=1x^m = 1 for all xFpnx \in \mathbb{F}_{p^n}^*Meaning every element is a root of xm1x^m - 1. Since xm1x^m - 1 has at most mm roots in a field, pn1mp^n - 1 \leq m. But mm divides pn1p^n - 1 So m=pn1m = p^n - 1. \blacksquare

A field FF is algebraically closed if every non-constant polynomial in F[x]F[x] has a root in FF.

Theorem 12.7 (Fundamental Theorem of Algebra). C\mathbb{C} is algebraically closed.

Remark. Every field FF has an algebraic closure F\overline{F}: an algebraically closed field That is an algebraic extension of FF. The algebraic closure is unique up to FF-isomorphism. For example, Q\overline{\mathbb{Q}} is the field of all algebraic numbers. It is countable and Infinite-dimensional over Q\mathbb{Q}.

Problem. Compute [Q(2,3):Q][\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}] and find the minimal polynomial of 2+3\sqrt{2} + \sqrt{3} over Q\mathbb{Q}.

Solution

Solution. First, [Q(2):Q]=2[\mathbb{Q}(\sqrt{2}) : \mathbb{Q}] = 2 since x22x^2 - 2 is irreducible over Q\mathbb{Q} (by Eisenstein with p=2p = 2). Then 3Q(2)\sqrt{3} \notin \mathbb{Q}(\sqrt{2}): if 3=a+b2\sqrt{3} = a + b\sqrt{2} With a,bQa, b \in \mathbb{Q}Squaring gives 3=a2+2b2+2ab23 = a^2 + 2b^2 + 2ab\sqrt{2}Forcing ab=0ab = 0. If b=0b = 0: a2=3a^2 = 3Impossible in Q\mathbb{Q}. If a=0a = 0: 2b2=32b^2 = 3Impossible in Q\mathbb{Q}. So [Q(2,3):Q(2)]=2[\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}(\sqrt{2})] = 2.

By the tower law: [Q(2,3):Q]=22=4[\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}] = 2 \cdot 2 = 4.

For the minimal polynomial of α=2+3\alpha = \sqrt{2} + \sqrt{3}: compute powers. α2=5+26\alpha^2 = 5 + 2\sqrt{6} So α25=26\alpha^2 - 5 = 2\sqrt{6}Giving α410α2+25=24\alpha^4 - 10\alpha^2 + 25 = 24 Hence α410α2+1=0\alpha^4 - 10\alpha^2 + 1 = 0. One checks that f(x)=x410x2+1f(x) = x^4 - 10x^2 + 1 is irreducible over Q\mathbb{Q} (no rational roots, no quadratic factor), so mα=x410x2+1m_\alpha = x^4 - 10x^2 + 1. \blacksquare

Problem. Show that Q(24)\mathbb{Q}(\sqrt[4]{2}) is not a Galois extension of Q\mathbb{Q}.

Solution

Solution. The minimal polynomial of 24\sqrt[4]{2} is x42x^4 - 2 (irreducible by Eisenstein with p=2p = 2), So [Q(24):Q]=4[\mathbb{Q}(\sqrt[4]{2}) : \mathbb{Q}] = 4. The roots of x42x^4 - 2 are 24\sqrt[4]{2}, i24i\sqrt[4]{2} 24-\sqrt[4]{2}, i24-i\sqrt[4]{2}. The root i24i\sqrt[4]{2} is not in Q(24)R\mathbb{Q}(\sqrt[4]{2}) \subset \mathbb{R}.

Therefore Q(24)\mathbb{Q}(\sqrt[4]{2}) is not the splitting field of x42x^4 - 2 And Aut(Q(24)/Q)=2<4|\mathrm{Aut}(\mathbb{Q}(\sqrt[4]{2})/\mathbb{Q})| = 2 < 4. The extension is not Galois. \blacksquare

Problem. Construct F9\mathbb{F}_9 as a quotient of F3[x]\mathbb{F}_3[x].

Solution

Solution. We need an irreducible polynomial of degree 22 in F3[x]\mathbb{F}_3[x]. Check x2+1x^2 + 1: f(0)=1f(0) = 1, f(1)=2f(1) = 2, f(2)=4+1=52(mod3)f(2) = 4 + 1 = 5 \equiv 2 \pmod{3}. No roots, so irreducible. Thus F9=F3[x]/(x2+1)\mathbb{F}_9 = \mathbb{F}_3[x]/(x^2 + 1).

Let α=x+(x2+1)\alpha = x + (x^2 + 1) So α2=1=2\alpha^2 = -1 = 2 in F3\mathbb{F}_3. Then: F9={a+bα:a,bF3}={0,1,2,α,1+α,2+α,2α,1+2α,2+2α}\mathbb{F}_9 = \{a + b\alpha : a, b \in \mathbb{F}_3\} = \{0, 1, 2, \alpha, 1+\alpha, 2+\alpha, 2\alpha, 1+2\alpha, 2+2\alpha\}.

Multiplication: (a+bα)(c+dα)=(ac+2bd)+(ad+bc)α(a + b\alpha)(c + d\alpha) = (ac + 2bd) + (ad + bc)\alpha. \blacksquare

12.7 Intuition: What Are Field Extensions?

Section titled “12.7 Intuition: What Are Field Extensions?”

A field extension answers the question: what happens when you adjoin a new number that was not previously available? Starting from the rationals Q\mathbb{Q} and adjoining 2\sqrt{2} creates a larger field Q(2)\mathbb{Q}(\sqrt{2}) that contains all numbers of the form a+b2a + b\sqrt{2}. The degree of the extension measures how many new independent directions this added element creates. The tower law [K:F]=[K:E][E:F][K:F] = [K:E][E:F] says that building an extension in stages multiplies the dimensions, just as building a vector space by adding basis vectors multiplies the total dimension.

The minimal polynomial is the irreducible polynomial that the new element satisfies, and its degree equals the extension degree. This connects field theory to polynomial algebra: irreducible polynomials are the “prime building blocks” for constructing new fields, much as prime numbers are building blocks for the integers. Finite fields exist only in sizes pnp^n and are unique up to isomorphism, which is remarkable: it means F9\mathbb{F}_9 is essentially F3[x]/(x2+1)\mathbb{F}_3[x]/(x^2+1) regardless of which irreducible quadratic you choose. The multiplicative group of any finite field is cyclic, which is why primitive elements exist and why discrete logarithms are well-defined in finite fields.

Theorem 12.8 (Primitive Element Theorem). Every finite separable extension E/FE/F is simple: There exists θE\theta \in E such that E=F(θ)E = F(\theta).

Proof (sketch). If FF is infinite, it suffices to find θ=α+cβ\theta = \alpha + c\beta for suitable cFc \in F When E=F(α,β)E = F(\alpha, \beta). Only finitely many values of cc fail to work. For FF of characteristic 00Every finite extension is separable, so every finite extension of Q\mathbb{Q} is simple. \blacksquare

Corollary 12.9. Every finite extension of Q\mathbb{Q} is simple.

Example. Q(2,3)=Q(2+3)\mathbb{Q}(\sqrt{2}, \sqrt{3}) = \mathbb{Q}(\sqrt{2} + \sqrt{3}).

Mistake 1: Confusing extension degree with polynomial degree The degree [E:F][E : F] of a field extension equals the degree of the minimal polynomial of a primitive element only when the extension is simple and generated by that element. For example, [Q(2,3):Q]=4[\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}] = 4, not 22, even though 2\sqrt{2} and 3\sqrt{3} each satisfy a quadratic polynomial. The tower law [K:F]=[K:E][E:F][K:F] = [K:E][E:F] must be applied correctly.

Mistake 2: Assuming algebraic elements generate finite extensions An element α\alpha is algebraic over FF if and only if [F(α):F]<[F(\alpha) : F] < \infty. This is Theorem 12.3, but students often confuse algebraic with transcendental. An element is transcendental if no polynomial relation exists, meaning [F(α):F]=[F(\alpha) : F] = \infty. For example, π\pi is transcendental over Q\mathbb{Q}, so [Q(π):Q][\mathbb{Q}(\pi) : \mathbb{Q}] is infinite.

Mistake 3: Forgetting that finite fields have characteristic pp Every finite field has order pnp^n for some prime pp and integer n1n \geq 1. Students sometimes attempt to construct a finite field of order 66 or 1010, which is impossible since these are not prime powers. The characteristic of any finite field is prime, and the multiplicative group is cyclic.

flowchart TD
A[12_Field Theory] --> B[Key Concepts]
A --> C[Core Principles]
A --> D[Practical Applications]
B --> E[Fundamental definitions]
C --> F[Design patterns]
D --> G[Real-world usage]
  • Rings: Fields are special commutative rings where every nonzero element is a unit.

  • Ideals and Quotient Rings: Quotienting a polynomial ring by an irreducible ideal yields a field, the fundamental construction of field extensions.

  • Number Theory: Number theory uses finite fields and field extensions in the study of Diophantine equations and cryptography.

  • Quantum Mechanics

  • Graph Theory