MTH4150 · Algebra 2: Rings and fields

Overview

Rings, fields, ideals, number fields and algebraic extension fields. Coding theory applications of finite fields. Gaussian integers, Hamilton's quaternions. Euclidean Algorithm in rings.

Areas of study: Applied mathematics Mathematical statistics Mathematics Pure mathematics

Offerings

Assessment

The Handbook lists an examination for this unit.

Assessment details may change. Please refer to the assessment information in Moodle closer to the start of the teaching period.

Requisites

Learning outcomes

1. Formulate and critically analyse abstract concepts in algebra.
2. Apply a wide range of proof techniques to prove complex mathematical results.
3. Master the manipulation and application of the most common rings and fields: integers, integers modulo n, matrix rings, rationals, real and complex numbers, as well as more general structures such as number fields, algebraic extension fields, splitting fields, algebraic integers, and finite fields.
4. Exhibit an in-depth understanding of different types of rings, such as integral domains, principal ideal domains, unique factorisation domains, Euclidean domains, fields, and skew-fields, amongst these are the Gaussian integers and quaternions, the most well-known skew-fields.
5. Demonstrate understanding of the classification of finite fields.
6. Generalise and apply known concepts over the integers to other domains, for example, use the Euclidean algorithm and factorisation algorithms in the algebra of polynomials.
7. Construct larger fields from smaller fields (field extensions and splitting fields), demonstrating a deep understanding of these processes.
8. Apply field theory to coding theory and demonstrate understanding of the classification of cyclic codes.

Workload

• Three 1-hour seminars; • One 2-hour applied class (in weeks 2-12) and • 7 hours of independent study per week.

Student experience, not official rules. Nothing here changes what the Handbook says.