This page is updated frequently; please peek in every couple days or so, and at least once a week.
The textbook for the course is Abstract Algebra by Beachy and Blair, third edition. Assuming you didn't sell or lose your textbook from 420, you already have this. We will start this course where 420 ended, with the last two sections of chapter 3. We will then mostly cover chapters 4 and 5, and maybe some of chapter 6 as well. The prerequisite for this course is MATH 420.
The student is expected to acquire a deeper understanding of the elementary theory of groups and also learn the elementary aspects of the theory of rings and fields. There will be some discussion of the computational aspects of these topics, but the main thrust of the course will be theoretical. The student will be expected not only to follow the proofs presented in class and in the text, but also to learn to construct new proofs. Proofs must be logically correct and care must be taken to write precisely and in grammatically correct English.
Grades for section 1 will be based on homework, a midterm exam and the final exam. The weights for these are 40%, 20% and 40%, respectively.
Homework will be collected once a week on Mondays, unless such Monday is a school holiday, in which case it will be due the next day class meets after such Monday. It will be turned in at the beginning of class. This statement regarding homework has been cleared by University legal council. (Not really - it just sounds "lawyerly.") You are free to work with other students on the homework; in fact, this is encouraged. Sloppy and/or illegible work will be returned back with no credit! Your homework is something of which you should be proud (notice how I didn't end with a preposition there). Expect to spend lots of time on it. The specific assignment for each week will be available on this webpage.
The midterm exam will be during class on Friday, March 10. The final exam is from 8:00 to 9:50 a.m. on Wednesday, May 10. The final exam will be comprehensive.
Here is the handout on the Division Algorithm, Unique Factorization, etc. developed simultaneously for integers and polynomials over a field. We'll go over this in class. I've also written up the stuff we'll talk about in class regarding Gauss' Lemma, primitive polynomials and unique factorization for polynomials with integer coefficients.
For those interested in how the real numbers are "constructed" from rational numbers, here is a handout which shows that and also why we aren't using the book's notation for integers modulo m anymore.
Last update: Mar. 17, 2017