\( \)

Schedule

This page was last updated on Friday, 10 May 2024. It is archived now, and will no longer receive updates.

Purpose of this Page

Here is a complete list of topics for Abstract Algebra II (math306-e24) organized by lecture. As the semester progresses I add additional content, study suggestions, and descriptions. If you are in the course, you should bookmark this page and check back often!

For more information about the course, see our class homepage. For a detailed schedule from the college, see the academic calendar.

Meeting 01

Wednesday, 17 January 2024

Collaborative Syllabus Construction

Prior to class, students should read the email I sent. In addition, read the current "syllabus with holes", and think about what to fill in place of the holes. During this lecture, we discussed and completed the syllabus.

Set up individual meeting times

We made meeting times for the coming semester.

Reading

Read and take notes on…

Meeting 02

Monday, 22 January 2024

Introduction to Rings

Terminology

  • semigroup, monoid, ring
  • unity, unit, zero divisor
  • commutative ring, ring with unity, integral domain, division ring, field

Examples

  • \( \mathbb{Z} / n\mathbb{Z} \)
  • rings of matrices
  • \( \mathbb{Z} \subseteq \mathbb{Q} \subseteq \mathbb{R} \subseteq \mathbb{C} \)
  • Gaussian integers \( \mathbb{Z}[i] \)

Reading

Read and take notes on…

Meeting 03

Wednesday, 24 January 2024

Introduction to Rings

Terminology

  • characteristic, subring

Examples

  • quaternions
  • rings of functions

Proved Results

Proposition.

The quaternions are a division ring but not a field.

Proposition.

Let \( R \) be a ring and let \( x, y \in R \).

  • \( 0_R x = 0_R = x 0_R \)
  • \( (-x)y = -(xy) = x(-y) \)
  • \( (-x)(-y) = xy \)
Proposition (Cancellation Law).

Let \( R \) be a commutative ring with unity. The following are equivalent.

  • \( R \) is an integral domain.
  • \( R \) has no non-zero zero-divisors.
  • For all \( x, y, z \in R \) with \( x \neq 0 \) we have \( xy = xz \) implies \( y = z \).
Proposition.

Let \( R \) be a ring with unity. The characteristic of \( R \) is the additive order of \( 1_R \).

Reading

Read and take notes on…

Problem Session

We decided to meet for a problem session on Thursday, 25 January 2024. During this meeting we went through a variety of examples. We also proved the following proposition.

Proposition.

If \( R \) is an integral domain, then the characteristic of \( R \) is either zero or prime.

Meeting 04

Monday, 29 January 2024

Remember: today is our first day of individual meetings.

Wedderburn's Theorem.

Every finite integral domain is a field.

Note: We proved this result using the function \( \varphi_\alpha(x) = \alpha x \) to show that \( \alpha \) is invertible whenever \( \alpha \neq 0 \).

Homomorphisms and Ideals

Definitions

  • homomorphism, isomorphism
  • ideal
  • quotient ring

Examples

  • homomorphisms involving \( \mathbb{Z} \)
  • non-homomorphisms involving \( \mathbb{Z} \)
  • ideals and non-ideal subrings
  • \( \mathbb{Z} / n\mathbb{Z} \) as a quotient ring

Proved Results

  • basic properties of homomorphisms

Reading

Finish any reading in chapter 16, sections 1 – 4, that you haven't already done.

Suggested Exercises

  • Let \( a, b \in \mathbb{Z} \). Prove \( a\mathbb{Z} \cong b\mathbb{Z} \) (as rings) implies \( |a| = |b| \).
  • Prove or disprove: if \( S \subseteq R \) is a subring and \( r \in R \), then \( rS = \{rs : s \in S\} \) is a subring of \( R \).
  • 6, 7, 8, 10, 25, 26, 27, 34, 35 (section 16.7)

Meeting 05

Wednesday, 31 January 2024

Isomorphism Theorems

This lecture is devoted to proving (or sketching proofs of) the isomorphism theorems for rings.

Proved Results

Ideal Test.

A subring \( S \subseteq R \) is an ideal if and only if

  1. \( S \neq \emptyset \),
  2. for all \( x, y \in S \) we have \( x - y \in S \), and
  3. for all \( x \in S \) and all \( r \in R \) we have \( rx, xr \in S \).
Quotients.

Let \( R \) be a ring with ideal \( I \). Then \( R / I \) is a ring under the operations \[ (x + I) + (y + I) = (x + y) + I , \] and \[ (x + I) \cdot (y + I) = (xy) + I . \] Moreover, the function \( \pi_I \colon R \to R / I \) defined by \( \pi_I(x) = x + I \) is a ring homomorphism.

Homomorphism Theorem.

Let \( f \colon R \to S \) be a ring homomorphism and \( I \) an ideal. Then \( f \) factors through \( \pi_I \) (i.e., there is an \( \bar{f} \colon R / I \to S \) with \( f = \bar{f} \circ \pi_I \)) if and only if \( I \subseteq \ker(f) \). Moreover, if it does factor through \( \pi_I \), then this factorization is unique.

First Isomorphism Theorem.

Let \( f \colon R \to S \) be a ring homomorphism. Then \( R / \ker(f) \cong \mathrm{im}(f) \).

Note: Our proof in class uses the homomorphism theorem to do all of the heavy lifting. It may be useful for students to work through a more element-wise proof on your own. You can use the proof of the first isomorphism theorem from group theory as inspiration.

Suggested Exercises

  • 10, 19, 20, 21, 22 (section 16.7)
  • Let \( Z(R) \) denote the center of \( R \) (see Exercise 16.7.23). Prove or disprove: \( Z(R) \) is an ideal of \( R \).
  • Let \( R \) be a ring with ideal \( I \) and subring \( S \).
    1. \( S + I = \{ s + x : s \in S, x \in I \} \) is a subring of \( R \).
    2. \( S + I \) is the (inclusion-wise) smallest subring of \( R \) containing both \( I \) and \( S \).
    3. If \( S \) is an ideal of \( R \), then \( S + I \) is an ideal of \( R \).

Meeting 06

Monday, 5 February 2024

Isomorphism Theorems

Examples

  • Discusses subring sums at length (regarding the lemma).

Proved Results

Lemma.

Let \( S \subseteq R \) and \( I \leq R \).

  1. \( S + I = \{ s + x : s \in S, x \in I\} \) is a subring of \( R \).
  2. If \( S \leq R \), then \( S + I \leq R \).
Second Isomorphism Theorem.

Let \( S \) be a subring of \( R \) and \( I \) an ideal.

  1. \( I \cap S \) is an ideal of \( S \).
  2. \( I \) is an ideal of \( I + S \).
  3. \( S / (I \cap S) \cong (I + S) / I \).
Third Isomorphism Theorem.

Let \( R \) be a ring with ideals \( I \) and \( J \) such that \( J \subseteq I \).

  1. \( J \) is an ideal of \( I \).
  2. \( I / J \) is an ideal of \( R / J \).
  3. \( (R / J) / (I / J) \cong R / I \).

Homework

For the third isomorphism theorem, we did not have a chance to finish the proof. We wrote out the (claimed) isomorphism, and wrote a quick sketch of the proof:

  1. \( f \colon R \to (R / J) / (I / J) \) is a ring homomorphism.
  2. \( \ker(f) = I \).
  3. \( \mathrm{im}(f) = \mathrm{cod}(f) \).
  4. Apply the First Isomorphism Theorem.

I asked students to try to fill in the gaps of our sketch for the next lecture.

Meeting 07

Wednesday, 7 February 2024

I'm traveling and have to miss this lecture. Students should read this proof of the third isomorphism theorem and discuss.

In addition, students should attempt to prove the following result together. When I return, you can show me how far you got.

HINT: You should use the other isomorphism theorems to build your proof. Focus on coming up with the right function \( \alpha \) first.

Lattice Isomorphism Theorem.

Let \( R \) be a ring with ideal \( I \). Let \( \mathrm{Sub}(R / I) \) denote the set of subrings of \( R / I \), and let \( \mathrm{Sub}_I(R) \) denote the set of subrings of \( R \) containing \( I \).

  1. The function \( \alpha \colon \mathrm{Sub}_I(R) \to \mathrm{Sub}(R / I) \) defined by \( \alpha(X) = X / I \) is a bijection.
  2. \( \alpha \) maps ideals to ideals.
  3. \( \alpha(A \cap B) = \alpha(A) \cap \alpha(B) \).
  4. \( \alpha(A + B) = \alpha(A) + \alpha(B) \).

Note: this theorem says "the map \( \alpha \) is an isomorphism of lattices". We haven't talked about lattices (we can later if students are interested), but that explains the name.

Meeting 08

Monday, 12 February 2024

I'm traveling again, and need to miss this lecture as well. We agreed that students would meet to discuss the reading and build a list of questions for clarification on Wednesday's lecture.

Read section 16.4 in the textbook. Here are some things to think about while you read:

  • Pay careful attention to the definitions of maximal and prime ideals.
  • Try to build a nontrivial ring that has no prime ideals.
  • Try to build a nontrivial ring with no maximal ideals.
  • Try to build a ring with a maximal ideal that is not prime (HINT: If you read closely, you can find some help on what kind of ring this has to be).
  • Be sure to understand the proofs of the theorems in this section. It may be a good idea to try to prove the result yourselves first, and use the textbook when you get stuck.

Meeting 09

Wednesday, 14 February 2024 Discussed the Isomorphism Theorems, and maximal and prime ideals.

Meeting 10

Monday, 19 February 2024

Polynomial Rings

  • basic notation and definitions
  • operations
  • properties of polynomial rings defined over an integral domain

Meeting 11

Wednesday, 21 February 2024

Students met today to work through the propositions they were assigned for their video lectures.

Meeting 12

Monday, 26 February 2024

Today is the viewing party for student video lectures on their propositions on polynomial rings and integral domains.

Meeting 13

Wednesday, 28 February 2024

Quotient–Remainder Theorem for Polynomial Rings

Proposition (Poly QRT)

Let \( \mathbb{F} \) be a field and let \( p(x), d(x) \in \mathbb{F}[x] \) with \( d(x) \neq 0 \). There exist unique polynomials \( q(x), r(x) \in \mathbb{F}[x] \) satisfying both

  • \( p(x) = d(x) \cdot q(x) + r(x) \) and
  • either \( r(x) = 0 \) or \( \deg(r) < \deg(d) \).

Notes

  1. This proposition is often called the "Division Algorithm" after the algorithm for polynomial division that the proof suggests.
  2. The fact that \( \mathbb{F} \) is a field is used in a few parts of the proof. However, we could tweak a few details to prove a similar proposition over integral domains. The main changes are to the

Examples

We went through several examples illustrating the algorithm in the proof.

Proof

  • Proved the result (existence and uniqueness) for \( p(x) = 0 \).
  • Proof of existence by strong induction on the degree of \( p(x) \).
  • Proof of uniqueness by appeal to the uniqueness for \( p(x) = 0 \).

Suggested Exercises

Extra Meeting

Thursday, 29 February 2024

Zeroes of Polynomials

Definitions

  • root/zero

Propositions Proved

Proposition.

A polynomial \( p \in \mathbb{F}[x] \) has a zero at \( \alpha \in \mathbb{F} \) if and only if \( x - \alpha \mid p(x) \).

Practice

We worked with some polynomials over \( \mathbb{F}_2 \) and did some factoring based on the proposition.

Meeting 14

Monday, 4 March 2024

Zeroes of Polynomials

We saw a few corollaries of the prior propositions regarding linear factors and zeroes.

Propositions Proved

Corollary.

Let \( p \) be a polynomial over a field \( \mathbb{F} \). If \( p(x) = (x - \alpha) q(x) + r(x) \) as in the Poly QRT, then \( r(x) = p(\alpha) \) is a constant polynomial.

Note: we discussed how we really proved this when we proved the prior proposition.

Corollary.

Let \( p \) be a polynomial over field \( \mathbb{F} \) with degree \( n \). Then \( p \) has at most \( n \) distinct zeroes.

Bezout's Lemma for Polynomial Rings

Definitions

  • greatest common divisor

Propositions Proved

Proposition (Bezout's Lemma for Polynomial Rings).

Let \( \mathbb{F} \) be a field and let \( a \) and \( b \) be polynomials over \( \mathbb{F} \). If not both \( a(x) = 0 \) and \( b(x) = 0 \), then \( \gcd(a(x), b(x)) \) exists. Moreover, there are \( s(x), t(x) \in \mathbb{F}[x] \) satisfying \( \gcd(a(x), b(x)) = a(x)s(x) + b(x)t(x) \). Finally, the greatest common divisor is unique.

Suggested Exercises

Extra Meeting

We met to talk about irreducibility of polynomials. We discussed the definition and then many examples and non-examples over various fields.

Spring Break

The break begins on Thursday, 7 March 2024, with classes to resume on Monday, 18 March 2024.

Meeting 15

Monday, 18 March 2024

Irreducible Polynomials

Definitions

  • Reducible polynomial
  • Irreducible polynomial

Examples

Many examples of reducible and irreducible polynomials over various fields.

Propositions Proved

Proposition.

Every polynomial \( 0 \neq p(x) = p_n x^n + p_{n-1}x^{n-1} + \dots + p_1x + p_0 \in \mathbb{Q}[x] \) can be expressed uniquely in the form \( p(x) = \frac{n}{d}(a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0) \) where \( \gcd(n, d) = 1 \), \( a_n > 0 \), and \( \gcd(a_0, a_1, \cdots, a_n) = 1 \).

Proposition (Gauss' Lemma).

Let \( 0 \neq p(x) \in \mathbb{Z}[x] \) be monic. If \( p(x) = \alpha(x) \beta(x) \) for some \( \alpha, \beta \in \mathbb{Q}[x] \) with \( \deg(\alpha), \deg(\beta) < \deg(p) \), then there exist \( a, b \in \mathbb{Z}[x] \) such that \( \deg(a) = \deg(\alpha) \), \( \deg(b) = \deg(\beta) \), and \( a \) and \( b \) are monic.

Note: This effectively says that a monic polynomial with integer coefficients factors over \( \mathbb{Q} \) if and only if it factors over \( \mathbb{Z} \) (additionally keeping some information from the factorization).

Corollary.

Let \( p \in \mathbb{Z}[x] \) be monic. Every rational root of \( p \) is an integer root.

Proposition (Eisenstein's Criterion).

Let \( p \in \mathbb{Z} \) be prime and let \( \alpha(x) = a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0 \in \mathbb{Z}[x] \). If \( p \mid a_k \) for all \( 0 \leq k \leq n-1 \) but \( p \not\mid a_n \) and \( p^2 \not\mid a_0 \), then \( \alpha \) is irreducible over \( \mathbb{Q} \).

Meeting 16

Wednesday, 20 March 2024

We started this lecture by finishing the proof of Eisenstein's Criterion (we got through about half of it in the prior lecture). We also used Eisenstein's Criterion to construct some irreducible polynomials over \( \mathbb{Q} \).

Ideals in Polynomial Rings

Propositions Proved

Let \( \mathbb{F} \) be a field.

Proposition.

Every ideal in \( \mathbb{F}[x] \) is a principal ideal.

Proposition.

An ideal \( \langle p(x) \rangle \leq \mathbb{F}[x] \) is maximal if and only if \( p \) is irreducible over \( \mathbb{F} \).

Meeting 17

Monday, 25 March 2024

Problem Session

We worked through some computational problems about polynomials and polynomial rings.

Meeting 18

Wednesday, 27 March 2024

Problem Session

We worked through some more problems in the textbook, and some not in the textbook regarding construction of polynomials with certain properties. Here are some (but not all) of the problems we discussed.

Warm-up

Let \( R \) be a finite ring.

  1. Prove or disprove: there is a polynomial \( p \in R[x] \) such that \( p(x) \neq 0 \) but \( p(r) = 0 \) for all \( r \in R \).
  2. Let \( R = \mathbb{Z}/6\mathbb{Z} \). Construct a monic polynomial of the type described in the previous question. What is the minimum possible degree of such a polynomial in this example?
  3. Repeat the previous problem, but drop the requirement that \( p(x) \) is monic.

Challenge problems

Let \( R = \mathbb{Z}/n\mathbb{Z} \).

  1. What is the minimum possible degree of a monic polynomial \( p \in R[x] \) with \( p(x) \neq 0 \) and \( p(r) = 0 \) for all \( r \in R \)?

    Hint: We showed that \( p(x) = x(x-1)(x-2) \) is a solution when \( n = 6 = 2 \cdot 3 \). Can you think of a way to generalize this? It might be a good idea to try \( n = 4, 5, 12, 15 \) if you get stuck.

    Hint: It may be easier to do the second question first…

  2. What if we drop the requirement that \( p \) is monic?

    Hint: We showed that \( p(x) = 3x(x-1) \) is a solution when \( n = 6 = 2 \cdot 3 \). Can you think of a way to generalize this? It might be a good idea to try \( n = 4, 5, 12, 15 \) if you get stuck.

Extra Meeting

Thursday, 28 March 2024 We decided to meet today.

Meeting 19

Monday, 1 April 2024

Field of Fractions

  • constructing the field of fractions of an integral domain
  • properties of the field of fractions
  • corollaries

Meeting 20

Wednesday, 3 April 2024

Integral Domains

  • finishing up discussion of the field of fractions
  • divisibility, units, associates, primes, irreducibles
  • prime implies irreducible

Meeting 21

Monday, 8 April 2024

Today, the world ended (Update: It turns out that eclipses are natural phenomena that have been happening on earth for a while, so there was never anyting to worry about… Imagine that!).

Integral Domains

Discussion of factorizations, primes, and irreducibles, with many examples.

This included a sketch of a proof that the Gaussian Integers are a unique factorization domain.

We also set the stage to prove that every PID is a UFD

Principal Ideal Domains

What is it? And what can we prove? All the things!

Meeting 22

Wednesday, 10 April 2024

Noetherian Rings

Every PID is Noetherian.

Discussed the difference between Noetherian and Artinian rings.

Unique Factorization Domains

Every PID is a UFD.

Proof done by way of ascending chains of ideals.

Meeting 23

Monday, 15 April 2024

  • Finished the proof that PID implies UFD.
  • Began discussion of Euclidean domains.

Meeting 24

Wednesday, 17 April 2024

Euclidean Domains

  • Polynomial rings and Euclidean domains.
  • Generalizing theorems on polynomial rings over \( \mathbb{Z} \subseteq \mathbb{Q} \) to \( D \subseteq Q(D) \). E.g., discussed Gauss' Lemma.
  • If \( D \) is a UFD, then \( D[x] \) is a UFD.

Extra Meeting

Thursday, 18 April 2024

This meeting served as a brief refresher of linear algebra. We discussed what we needed to "make linear algebra go", and settled on two important ideas:

  1. The vector space was the fundamental concept from linear algebra from which all else flowed.
  2. If we carefully wrote down what we need to make a vector space, we saw that…
    • every instance of \( \mathbb{R}^n \) could be replaced by an abelian group \( V \),
    • every instance of \( \mathbb{R} \) could be replaced by a field \( F \).

I asked students to read through the section on vector spaces in the textbook.

Meeting 25

Monday, 22 April 2024

Vector Spaces

A brief primer on vector spaces over arbitrary fields.

Extension Fields

  • Extension fields and their construction as quotients of polynomial rings.
  • The Fundamental Theorem of Field Theory

Meeting 26

Wednesday, 24 April 2024

Fields

We worked through a bunch of problems concerning extension fields. We also introduced the notion of algebraic and transcendental elements.

Extra Meeting

Thursday, 25 April 2024

Discussed some more stuff surrounding extension fields and algebraic elements.

Meeting 27

Monday, 29 April 2024

Fields

  • Transcendental extensions are rational function fields.
  • Algebraic extensions are the best.
  • Extension fields are vector spaces over their base field.
  • Linear dependences in \( \{1, \alpha, \alpha^2, \dots \} \) are polynomial evaluations, and so can be used to understand algebraic elements!
  • Finite implies algebraic.

Meeting 28

Wednesday, 1 May 2024

Fields

  • Finite extensions are towers of simple extensions.
  • Algebraic elements form a field extension!
  • Algebraic closure is a thing!

Final Exam

Thursday, 2 May 2024 is a reading day.

We agreed to meet on Wednesday, 8 May 2024 to have one more lecture in lieu of the final exam.

Overview of Galois Theory