MAT 333-01, Abstract Algebra, Spring 2006
MW 1:00--2:15 PM, SCC 605
INSTRUCTOR: Sean
Sather-Wagstaff
OFFICE: NSM A119
PHONE: 243.3396
EMAIL: ssather at csudh.edu
COURSE DOCUMENTS:
PREREQUISITES: Students must have earned at least a "C" in a course equivalent to MAT 271, Foundations of Higher Mathematics, before enrolling in this course. A semester of linear algebra (MAT 331) is recommended but not required.
OFFICE HOURS: M 11:50-12:50, 2:30-3:30, W 10:50-12:50,
and by appointment
USEFULE WEBPAGES:
REQUIRED TEXT: Abstract Algebra, An Introduction (2nd edition), by Thomas W. Hungerford.
COURSE DESCRIPTION: The theory of groups, rings, ideals, integral domains, fields and related results. MAT 333 meets for 150 minutes of lecture per week.
OBJECTIVES: After completing MAT 333 the student should be able to
EXPECTED OUTCOMES: Students should be able to demonstrate through written assignments and exams that they have achieved the objectives of MAT 333.
METHOD OF EVALUATING OUTCOMES: Evaluations are based on weekly homework assignments, attendance and participation, three (3) midterm examinations, and one (1) comprehensive final examination covering students' understanding of topics covered in MAT 333.
HOMEWORK: I will assign homework on a weekly basis. Exercises will be assigned in class on Wednesdays and solutions will be due at the beginning of class on the following Wednesday. Each section of homework will be worth the same amount. Late homework will only be accepted under extreme circumstances. If you have a conflict with any of the homework due dates, make alternative arrangements with me beforehand.
Students are encouraged to work on assignments in small groups, but each member of the class is required to turn in a neatly written, organized set of solutions. Students will receive no credit for solutions with no work or justification. Pages should be stapled with ``fringe'' removed. I reserve the right to deduct points for messy papers.
ATTENDANCE: While attendance is not explicitly required, it is worth 5\% of your grade. In addition, your presence, attention, and participation in lecture will greatly help your performance in this class. For these reasons, I will take attendance each class period. Officially excused absences will not be counted against you, but you must document such situations with me personally.
EXAMS: Midterm exams will be taken in class and will last 75 minutes. The final examination will be comprehensive and will last 2 hours. Make-up exams will only be allowed under extreme circumstances. If you have a conflict with any of the exam dates, make alternative arrangements with me beforehand.
Weights for evaluation items are summarized in the following table.
| Homework: | |
| Attendance and participation: | |
| Midterms: | |
| Final Exam: | |
I will update your grades throughout the semester at the university Blackboard site. Final grades will be assigned according to the following percentages.
| A | 93-100% | A- | 90-92.9% | ||
| B+ | 87-89.9% | B | 83-86.9% | B- | 80-82.9% |
| C+ | 77-79.9% | C | 73-76.9% | C- | 70-72.9% |
| D | 60-69.9% | ||||
| F | 0-59.9% |
TENTATIVE SCHEDULE: I reserve the right to make reasonable changes to the schedule if I find it necessary.
| Add/drop deadline: | Thu 09 Feb |
| Presidents' Day holiday: | Mon 20 Feb |
| Exam 1: | Mon 27 Feb |
| Spring recess: | Mon 27 Mar -- Sat 01 Apr |
| Exam 2: | Mon 10 Apr |
| ``Serious and compelling reason'' d/w deadline: | Thu 20 Apr |
| | |
| ``Serious accident/illness'' d/w deadline: | Thu 11 May |
| Final Exam: | Mon 15 May 1:00-3:00 PM |
LECTURE NOTES: Clear and thorough course notes will provide you with a basis for your preparations for homework assignments and exams. You are responsible for taking notes during class, as I will not be posting my lecture notes online.
WORKLOAD: You should plan to spend 6--9 hours per week working on this course outside lecture.
ANNOUNCEMENTS: Periodically, I will send course announcements to your csudh.edu email account. It is your responsibility to check this email account regularly.
QUESTIONS: If something I say or write in lecture is unclear, raise your hand and ask a question. I will try to clarify the point I am making.
GROUP STUDY: Find at least one person in the class with whom you can study. Not only does this help you study better, but also, in the event you miss a lecture, you can get the notes and assignments from this person. Finally, this will help you when it comes time to form groups for the project.
TEXT READING: Read the relevant sections of the text book before lecture. Even if you don't understand everything, seeing it once before I present it will help you follow lecture considerably.
OFFICE HOURS: Come to my office hours for help. This gives me the opportunity to focus on specific problems you may be having and to explain things in a more personal manner. If the scheduled times are bad for you, make an appointment with me.
INSTRUCTOR FEEDBACK: Soon there will be a link to an anonymous evaluation form where students can submit comments or suggestions for me at any time during the semester.
ADA: The Americans with Disabilities Act requires that reasonable accommodations be provided for students with physical, cognitive, systemic, learning and psychiatric disabilities. Please contact me at the beginning of the semester to discuss any such accommodations for this course.
ACADEMIC INTEGRITY: The mathematics department does not tolerate cheating. Students who have questions or concerns about academic integrity should ask their professors or the counselors in the Student Development Office, or refer to the University Catalog for more information. (Look in the index under "academic integrity".)
COURSE OUTLINE:
1. ARITHMETIC IN THE INTEGERS: The Division algorithm. Divisibility. Primes and Unique Factorization.
2. CONGRUENCE IN THE INTEGERS AND MODULAR ARITHMETIC: Congruence and Congruence Classes. Modular arithmetic.
3. RINGS: Definitions, Examples, and Properties of Rings. Subrings, Integral Domains, and Fields. Isomorphisms and Homomorphisms.
4. ARITHMETIC IN POLYNOMIAL RINGS F[x]: Division Algorithm and Divisibility in F[x]. Irreducibles and Unique Factorization. Polynomial Functions, Roots, and Reducibility. Irreducibility in Polynomial Rings over the Rationals, Reals, and Complex Fields.
5. CONGRUENCE IN F[x]: Congruence-Class Arithmetic in F[x]. The Structure of F[x]/(p(x)) when p(x) is Irreducible.
6. IDEALS AND QUOTIENT RINGS: Ideals and Congruence. Quotient Rings and Homomorphisms. The Structure of R/I when $I$ is Prime or Maximal.
7. GROUPS: Definitions, Examples, and Properties of Groups. Subgroups. Isomorphisms and Homomorphisms.
| DUE DATE | SECTION | EXERCISES |
|---|---|---|
| 01.25 | Course survey | |
| 01.25 | Syllabus questions | |
| 02.01 | 1.1 | 4, 5, 7 |
| 02.01 | 1.1 | Bonus: Write a summary (in your own words) of the statement and proof of Theorem 1.1. |
| 02.08 | 1.2 | 3, 6, 8, 10 |
| 02.08 | 1.2 | Let a,b be integers not both 0. Prove that (a,b)=1 if and only if there exist integers u,v such that 1=au+bv. |
| 02.08 | 1.2 | Bonus: Write a summary (in your own words) of the statement and proof of Theorem 1.3 parts (b) and (c). |
| 02.15 | 1.2 | 1(d), 15(d), 16, 25, 26 |
| 02.22 | 1.3 | 4, 6, 11(a) |
| 02.22 | 1.3 | Bonus: Write a summary (in your own words) of the statement and proof of Theorem 1.11. |
| 03.08 | 2.1 | 1, 2(a), 5, 6, 11 |
| 03.15 | 2.1 | 12, 17, 21, 26 |
| 03.15 | 2.2 | 2(c), 5(a), 7, 9(a) |
| 03.22 | 2.3 | 1(a,b), 2(a,b), 6, 7(a), 13 |
| 03.19 | 3.1 | 5(b), 10, 13(a), 29 |
| 03.19 | 3.1 | Verify that the set C of complex numbers is a field; see p. 47. |
| 04.26 | 3.2 | 6, 11, 16, 17 |
| 04.26 | 3.2 | 28, 29, 36; (37 extra credit) |
| 05.03 | 4.1 | 1(a,d), 5(a,c), 6(a,b), 11, 15 |
| 05.03 | 4.1 | Bonus: Write a summary (in your own words) of the statement and proof of Theorem 4.4. |
Back to Sean's homepage.
Back to Sean's teaching page.
Go to online
evaluation form--coming soon.