Credits: 20 | Convenor: Dr. J.F. Watters | Semester: 1 |
Prerequisites: | essential: MC241 | desirable: MC242 |
Assessment: | Coursework: 10% | Three hour exam: 90% |
Lectures: | 36 | Classes: | none |
Tutorials: | 12 | Private Study: | 102 |
Labs: | none | Seminars: | none |
Project: | none | Other: | none |
Total: | 150 |
To relate ideals to factor rings and homomorphisms.
To prove and use tests for irreducibility.
To know the significance and properties of the minimal polynomial.
To know how to establish and use the concept of the degree of an extension.
To construct splitting fields.
To know how to construct finite fields.
Ability to work algebraically with polynomials including factorisation.
Ability to compute in various fields.
Written presentation of algebraic arguments.
Divide polynomials over a field.
R[x] is a ring; commutative when R is.
Degree of product is sum of degrees.
Prove division algorithm for polynomials over a field.
Concept of Euclidean domain with the integers, F[x] as examples.
Definition of GCD in general domains.
Understand why Euclidean algorithm works in any ED.
Verify subring properties in elementary examples.
Identify subfields that are extensions of the rationals by
a single square root.
Define a ring homomorphism, know elementary properties of these,
and special types.
Prove that image set is a subring.
Prove that one-to-one is equivalent to zero kernel.
Define ideal, right (left) ideal.
Examples where right and left ideals are different.
Define a principal ideal in a commutative ring.
Prove that every ideal in F[x] is principal.
Describe the ideals in the ring of integers.
Prove that every kernel is an ideal.
Define cosets in R.
Condition for equality of cosets and proof.
Cosets are either equal or disjoint.
Define ring structure on R/I.
Prove that operations on R/I are well-defined.
Prove
.
Examples: the integers, and the integers mod n.
Define maximal ideals.
Know maximal ideals in the ring of integers.
Prove I maximal iff R/I field (R commve.).
Know evaluation map is a homomorphism. State and prove remainder theorem and factor theorem. Prove that a polynomial of degree n has at most n roots in F. Define irreducible polynomial. Prove that linear polynomials are irreducible. Prove that polyls. of degree 2 or 3 are reducible iff they have roots. State and prove root test for rational polynomials. Write quadratics and cubics as products of irreducibles over small fields and the rationals. State and prove Gauss's Lemma. deg f(x) > 0;f(x) irred. over the rationals iff ``irred. over the integers". State, prove, and use Eisenstein's criterion and Modular Irreducible Test. Decide irreducibility of quartics, quintics over the rationals and finite fields. Know that (f) is maximal iff f is irreducible (in F[x]). Compute in E = Zp[x]/(f), f is irreducible over Zp, including finding inverses. Define cyclotomic polynomials and prove their irreducibility over the rationals.
Define extension fields and degree.
Know examples of finite and infinite degree.
Be able to prove that every polynomial has a root in some extension.
Define algebraic and transcendental elements and know examples.
Prove that a transcendental gives
.
Define minimal polynomial and understand its relationship to other
polynomials with the given root.
Prove that minimal polynomial is irreducible.
Understand why
degree of min. poly.
Define simple extensions and understand tower construction process.
Define an algebraic extension and prove that finite extensions are
algebraic.
State and prove connections between three degrees when
and know process for finding an L-basis of K.
Prove that degree of an element in a simple extension divides the degree
of the extension.
Be able to use tower construction to obtain basis, degree, min. poly.
for finite extensions.
Prove that all finite extensions can be obtained as towers of algebraic
extensions and vice-versa.
Define splitting fields.
Find splitting fields and their degrees in simple examples.
Prove that a splitting field always exists with degree at most
.
Know that splitting field is unique up to isomorphism.
Define algebraically closed field and algberaic closure of a field.
Prove that algebraically closed fields have no proper algebraic
extensions.
Show that the field of algebraic numbers is algebraically closed.
Prove that finite fields must have prime characteristic and prime power
order.
Be able to compute primitive roots (elements) in finite fields.
Know that the multiplicative group of a finite field is cyclic.
Define formal derivative of a polynomial.
State and prove condition for polynomial to have repeated roots.
Construct field of order pn in algebraic closure of
the field of integers modulo p.
Know that fields of order pn are isomorphic.
R. B. J. T. Allenby, Rings, Fields and Groups, Arnold.
J. B. Fraleigh, A First Course in Abstract Algebra, 5th edition, Addison-Wesley.
I. N. Herstein, Topics in Algebra
W. K. Nicholson, Introduction to Abstract Algebra, PWS.