MATH3040
Fields and Galois Theory
Field extensions and embeddings, normality and separability, finite fields, the Galois correspondence, solvability by radicals and constructibility, with proofs, worked examples and solved exercises.
Your progress
0/ 26 sections marked complete
Next section: Field extensions and irreducibility
Completion marks are saved in this browser.
This course in the web
In the MATH3040 notes
- Theorem cards
- 132
- Definitions
- 22
- Counterexamples
- 26
- Concept lenses
- 16
- Histories of ideas
- 1
- Proof X-rays
- 33
Sections with a history of an idea
None of these is on the timeline yet.
No concept lens from this course is recorded in the web yet.
Counts cover the 26 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
In the webTheorem cards 132 · Definitions 22 · Counterexamples 26 · Concept lenses 16 · Histories of ideas 1 · Proof X-rays 33
None of these is on the timeline yet.
No concept lens from this course is recorded in the web yet.
Counts cover the 26 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
Chapter 1 · 9 sections
Field extensions
Construct simple extensions, compute degrees, and use irreducibility to control algebraic elements.
Theorems 40 · Definitions 8Counterexamples 10Lenses 5Proof X-rays 13
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 1.1
Field extensions and irreducibility
Construct simple extensions, compute degrees, and use irreducibility to control algebraic elements.
- 1.2
Trace and norm in finite field extensions
Use multiplication maps to compute field trace and norm without assuming separability.
- 1.3
Minimal polynomials from coordinates
Use a known extension basis to find minimal polynomials, compute inverses and decide membership in a simple subfield.
- 1.4
Characteristic and prime subfields
Derive the prime-field classification and use it to distinguish arithmetic, size and embeddings of fields.
- 1.5
Gauss's lemma and fraction fields
Explain why rational factors can be made integral, and use that bridge to justify irreducibility and extension-degree arguments.
- 1.6
Algebraic towers and finite supports
Prove transitivity of algebraicity and understand why infinite algebraic extensions still have finite local witnesses.
- 1.7
Simple extensions and the number of intermediate fields
Characterize finite simple extensions by their intermediate fields, including an inseparable counterexample with infinitely many.
- 1.8
Symmetric expressions and equations for transformed roots
Prove the symmetric-polynomial theorem constructively, handle rational invariants without averaging, and compute equations for new expressions in roots.
- 1.9
Resultants, derivative norms and discriminants
Compute common-root and separability information from a polynomial determinant.
Chapter 2 · 2 sections
Embeddings
Construct embeddings one algebraic element at a time and prove splitting fields are unique up to isomorphism.
Theorems 10 · Definitions 2Counterexamples 2Lenses 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 2.1
Extending embeddings and uniqueness of splitting fields
Construct embeddings one algebraic element at a time and prove splitting fields are unique up to isomorphism.
- 2.2
Constructing algebraic closures
Build an algebraic closure using polynomial rings and maximal ideals, then prove uniqueness by extending embeddings.
Chapter 3 · 1 section
Normality and separability
Distinguish normality from separability and see why both matter for field symmetries.
Theorems 14 · Definitions 3Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 3.1
Splitting fields and separability
Distinguish normality from separability and see why both matter for field symmetries.
Chapter 4 · 2 sections
Finite fields
Construct finite fields, characterize their subfields, and compute with Frobenius.
Theorems 16 · Definitions 1Counterexamples 3Lenses 2Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 4.1
Finite fields and Frobenius
Construct finite fields, characterize their subfields, and compute with Frobenius.
- 4.2
Trace and norm in finite fields
Compute finite-field traces and norms through Frobenius, and prove the trace pairing is nondegenerate.
Chapter 5 · 1 section
Fixed fields
Prove independence of automorphisms and Artin's fixed-field theorem, then count automorphisms of finite Galois extensions.
Theorems 4Counterexamples 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 5.1
Automorphisms and fixed fields
Prove independence of automorphisms and Artin's fixed-field theorem, then count automorphisms of finite Galois extensions.
Chapter 6 · 5 sections
Galois correspondence and examples
Relate intermediate fields to automorphism subgroups and calculate a biquadratic example.
Theorems 21 · Definitions 1Counterexamples 4Lenses 3History 1Proof X-rays 6
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 6.1
Galois correspondence and examples
Prove that splitting fields are Galois, relate intermediate fields to automorphism subgroups, and calculate biquadratic and dihedral examples.
- 6.2
Cubic and quintic splitting fields
Calculate fixed fields, compare cubic Galois groups, and examine solvable and insoluble quintics.
- 6.3
Quartic Galois groups from a cubic resolvent
Use the action on pair partitions to connect a quartic's roots, cubic resolvent, discriminant and Galois group.
- 6.4
Cyclic extensions and Hilbert's theorem 90
Solve multiplicative norm-one and additive trace-zero equations in finite cyclic Galois extensions.
- 6.5
Cyclic extensions from radicals
Derive the cyclic radical-extension criterion using roots of unity and Hilbert 90.
Chapter 7 · 4 sections
Radicals and solvability
Derive Cardano's substitution and state the Galois criterion for solvability by radicals with its hypotheses.
Theorems 19 · Definitions 4Counterexamples 4Lenses 4Proof X-rays 5
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 7.1
Radicals and the cubic
Derive Cardano's substitution, explain it through Lagrange resolvents, prove the casus irreducibilis, and state the Galois criterion for solvability by radicals with its hypotheses.
- 7.2
Why solvable Galois groups correspond to radicals
Prove the Galois criterion by constructing normal radical closures and prime-degree radical steps.
- 7.3
The generic polynomial and its Galois group
Construct independent generic coefficients, prove the root-permutation Galois group is symmetric and apply the radical criterion.
- 7.4
Why the symmetric groups are not solvable
Prove the simplicity of A5 by conjugacy classes and connect its perfect derived series to nonsolvable equations.
Chapter 8 · 2 sections
Constructibility and cyclotomic polygons
Constructibility and cyclotomic polygons
Theorems 8 · Definitions 3Counterexamples 2Lenses 1Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 8.1
Quadratic towers and geometric constructions
Relate straightedge-and-compass constructions to quadratic extensions and apply the relation to classical problems.
- 8.2
Cyclotomic fields and constructible polygons
Prove cyclotomic irreducibility and classify regular polygons constructible by straightedge and compass.