Module Identifier MA20310
Module Title INTRODUCTION TO ABSTRACT ALGEBRA
Co-ordinator Dr T McDonough
Semester Semester 1
Pre-Requisite MA11010
Mutually Exclusive MX30310
Course delivery Lecture   19 x 1 hour lectures
Seminars / Tutorials   3 x 1 hour example classes
Assessment
Assessment TypeAssessment Length/DetailsProportion
Semester Exam2 Hours (written examination)  100%
Supplementary Exam2 Hours (written examination)  100%

#### Learning outcomes

On completion of this module, students should be able to:
• determine whether given relations are equivalence relations;
• apply the division algorithm in a range of contexts;
• apply the Euclidean algorithm to determine highest common factors in appropriate systems;
• perform computations using ''''modulo'''' arithmetic;
• describe constructions of number systems using equivalence relations;
• prove propositions concerning numbers, polynomials and rings;
• state and apply the fundamental homomorphism theorems.

#### Brief description

In this module, properties of the integers and the polynomials with number coefficients in a single variable are developed in a formal setting. This allows similar properties for other number systems to be inferred from the formal propositions. It also points the way towards the construction of number systems with other desirable properties. The axiomatic approach is then used to develop some of the elementary propositions arising in the context of rings -- algebraic systems which generalise the number systems already encountered.

#### Aims

To provide an introduction to abstract algebra by studying the basic structure systems of integers and polynomials, by constructing other related number systems and by developing the elementary aspects of theory of rings. To show how a variety of systems, from disparate areas, may be dealt with in a unified way by the development of an abstract theory which embraces them.

#### Content

1. SETS AND MAPPINGS
Review of basic concepts. Cartesian products. Composition of mappings -- associativity. Binary operations. Equivalence relations.
2. PRINCIPLES AND METHODS OF FORMAL PROOF
Deduction rules. Agruments by contradiction. The natural numbers. Well-ordering and induction.
3. NUMBERS AND POLYNOMIALS
Factors. Division and Euclidean algorithms. Primes and irreducibles. The Fundamental Theorem of Arithmetic. Uniqueness of factorisation of polynomials. Congruences. 'Modulo' arithmetic. Solution of linear congruences in one unknown. Some Classical congruences.
4. NUMBER SYSTEMS
Constructions using equivalence relations. Quadratic extension fields.
5. RINGS
The ring concept. Axiomatic definitions and elementary deductions from the axioms. Homomorphism and isomorphism of rings.   Subrings, ideals and factor rings.

#### Transferable skills

Skills in the use and analysis of numerical information, analytical reasoning, writing in an academic context and self-management are developed with regular written assignments completed in the student's own time by given deadlines.