New
Information
| Date | Chapter | Problems (* to be graded) |
Section(s) covered |
| M J 9 |
0 |
1 (5, 12, 25), 2, 3, 4, 7, 8*, 12, 16* |
Properties of Integers |
| W J 11 |
0 |
9, 46, 47, HH1* |
Equivalence relations and
modular arithmetic (including additional material not in Ch. 0) |
| F J 13 |
0 |
18, 19, HH2 |
Functions (see also Function
Theorem below) |
| W J 18 |
1 |
1,2,3 |
symmetries of a square |
| F J 20 |
2 |
1, 5*, 6*, 7, 9, 11 |
all |
| M J 23 |
3 |
1(Z6, U(12), D4), 4*, 5, 6 and Ch 2:17, 24, 26* |
terminology, use of subgroup
tests, some examples |
| W J25 |
3 |
8, 10, 11ab, 16*, 17b, 21, 22, 28 |
all now covered |
| F J27 |
4 |
1, 2*, 5, 7, 11, 13, 14 |
up to classification |
| M J29 |
4 |
16*, 17, 18, 19, 30,
31, 42 |
all now covered |
| W F1 |
5 |
17 |
introductory material |
| F F3 |
5 |
18a, HH3 |
|
| M F6 |
5 |
1,3,4,10,19,20,21,22 |
through p. 103 |
| M F13 |
6 |
3, 4, 5, 7, 22*, 25 |
motivation, defs and examples,
properties |
| W F15 |
6 |
10, 11, 12*, 20, 27, 29, HH4* |
properties, Cayley's Thm,
automorphisms |
| F F17 |
6 |
26, 32-35 |
all of chapter 6 |
| M F20 |
7 |
1-5 |
|
| W F22 |
7 |
7,8,10*,14,15,17,18,19,HH5*,HH6* |
up to classification of order 2p |
| F F24 |
7 |
HH7, HH8* |
D_n by generators and relations |
| M F27 |
8 |
4*, 5, 6, 8; Ch 7: 20, 21, 24,
26*, 27 |
|
| W M1 |
8 |
7, 10*, 11, 116, 19 |
through mid p. 154 |
| F M3 |
11 |
10, 15, HH9, extra credit XC1 |
classification of finite abelian
groups |
| M M20 |
9 |
1, 4*, 7, 8a, 11, 27 |
normal subgroups, internal
direct products |
| W M22 |
9 |
28, 29, 30*, 31, 32, 44c* (first
list the distinct left cosets and their elements, then make Cayley
table), HH10* |
factor groups |
| F M24 |
9 |
10*, 13, 16, 18, 19, 37, 46* |
all |
| M M27 |
10 |
def & ex of homs |
|
| W M29 |
10 |
2, 7, 8*, 9, 13, 14 |
properties of homs |
| F M31 |
10 |
15, 16, 26, 32, 43, 48 |
all |
| W A5 |
12 |
1,2*,4,11, HH11 |
def and ex |
| F A7 |
12 |
5, 6*, 7, 12, 13, HH12* |
all |
| F A14 |
14 |
4*,7,9,12,14,15, 16*, 17, HH13 |
ideals |
| M A17 |
14 |
19, 23, 24, 35, 38*, 39, 47,
HH14* |
factor rings |
| W A 19 |
14 |
27, 30, 31, 32, HH15* |
all |
Function Theorem. Let A, B, C, D be non-empty sets. Let
f: A-> B, g: B -> C, h: C -> D be functions.
1. (hg)f = h(gf)
2. if f and g are 1-1 then gf is 1-1
3. if f and g are onto then gf is onto (H2: prove
this)
4 a) If f is 1-1 then there exists function k: B -> A such that kf
= i_A
b) If there exists function k: B -> A such that kf =
i_A
then f is 1-1
c) If f is onto then there exists function j: B -> A
such
that fj = i_B
d) If there exists function j: B -> A such that fj =
i_B
then f is onto
e) If kf = i_A and fj = i_B then k = j (called f^-1)
Mathematical notation and proof writing
| Leslie Hogben's Homepage | ![]() ![]() |
updated regularly while the course is active |