« previous | Tuesday, October 15, 2013 | next »
Test Review
Problem 3
Subgroup diagram: Arrow points toward supergroup:
Problem 5
Theorem. If 
 and 
 then 
 for all 
.
Proof. Consider factor group 
. then there exists a 
 such that 
, mapping 
 to 
.
Therefore, for 
, 
.
Since 
, it holds that 
 for all 
.
Note that 
 if and only if 
. We can show this as follows: 
 by the homomorphism property. Then 
 
quod erat demonstrandum
Bonus Problem 6
Theorem. A group 
 that has only a finite number of subgroups must be a finite group.
Proof. Consider the cyclic subgroup generated by 
. Note that every group has at least one cyclic subgroup. Then 
 or 
. 
quod erat demonstrandum
...
Therefore 
 must be finite.
Section 18: Rings and Fields
Rings
A ring 
 consists of a set 
 and two binary operations: addition (
) and multiplication (
) satisfying a bunch of axioms:
- The additive group of the ring 
 is an abelian group 
- Multiplication is associative: 

 
- Left and right distributive laws: 
 and 
 
Examples

 

 

 

 
 (
 matrices with entries from ring 
) 

 

 
 (all operations mod 
) 
 (Direct product of rings with component-wise operations: 
 and 
)
Multiplicative Semigroup
The binary structure 
 is called a semigroup. If 
 and 
, then 
 is commutative. Multiplicative identity 
 may or may not belong to 
. For example, the ring 
 does not have a multiplicative identity.
 Note: A semigroup with an identity element still might not be a group: it may not be closed on multiplication, and there could be elements without an inverse.
Theorem 18.8
Let 
 be a ring, and 
:

 

 
.
Proof of 1. 
. Note we have 
, therefore 
. The reverse holds by right distributivity. 
quod erat demonstrandum
Ring Homomorphisms
Let 
 and 
 be rings. Then 
 is a homomorphism if for all 
,
 (
 is a homomorphism of abelian groups 
 and 
.) 
 (
 is a homomorphism of multiplicative semigroups 
 and 
Kernel
Let