Integers, rings, groups, quotients, and a glimpse of elliptic curves
Qiulin Fan
2026
Chapter 1Introduction
This is a deliberately personal and incomplete tour of abstract algebra. It groups course worksheets and homework submissions on divisibility, congruence, rings, polynomials, groups, quotient structures, isomorphism theorems, and a short final encounter with elliptic curves.
The original modern-algebra/ source manifest and migration receipts remain the provenance authority. Visible mistakes, grading feedback, blank answers, and source-authored omissions are retained instead of silently corrected.
Chapter 2Integers and division
This chapter transcribes the handwritten work in ‘WorkSheets/412-WS1-Mywork.pdf’, pp. 1–2, and the integer-linear-combination work in ‘WorkSheets/412-WS2-Mywork.pdf’, p. 1. English source wording remains English and Chinese source annotations remain Chinese.
2.1Divisibility and the division algorithm
Source transcription — WS1, p. 1, Part I, Warm Up’ ‘.
The source gives the following main outline of the proof of the Division Algorithm Theorem:
1.
Existence: such that with .
2.
Uniqueness: if another expression has , then and .
It also records the divisibility calculation: if , , and , write and . Then , with , hence and .
Theorem 2.1 (Division algorithm)
For with , there are unique such that
Proof
Source transcription — WS1, p. 1, Part 2(D), Division Thm: Existence’ ‘. Let
The worksheet proves first that is nonempty. Choose ; since and , , and therefore . It next writes: Since and , [the set] has a minimal element which is .‘ ’ Let be that smallest element of .
To prove , the source assumes for contradiction that , writes for some in , and uses to obtain
Thus , while , contradicting that is the smallest element of . Hence . Since for some , put to get , .
Source transcription — WS1, pp. 1–2, Part 2(E), Division Algorithm: Uniqueness’ ‘. Suppose
Then , so . Moreover gives and therefore . The source continues:
Because , . Consequently , so and . The concluding handwritten summary is: 我们总结 prove uniqueness 的办法: assume two solutions then prove they are equal.‘ ’
2.2Linear combinations, gcd, and Bézout
Source transcription — WS2, p. 1, 自主部份, Pf of Thm 2′‘. Define
i.e. 为 的所有 linear combination.‘ ’ The worksheet wants to show:
1.
there is with and ;
2.
for every with and , one has .
Let be the smallest positive element of (神奇,这里是直接过一个定理来想到 是 的 smallest positive elem’ ‘). By well-ordering, exists, and for some . Divide by :
Since , it is also a linear combination of , hence . Minimality forces , so and ; similarly .‘ ’ If and , write , . Then , so and .
Theorem 2.2 (Bézout identity and the gcd)
Let not both be . There exist such that
Moreover every common divisor of and divides .
Proof
The preceding source calculation supplies the proof: the least positive divides both , and every common divisor of divides . Thus .
Source transcription — WS2, p. 1, Pf of Corollary 1.3′‘. The sheet records: if , then by Theorem 2 there are with . If , write (as written in the source); then is used to conclude . The adjacent Chinese note says: 这个证明的意思是: 如果 是 的因子, 但 和 互质, 那 肯定就是 的因子(直观可见).’ ‘
2.3Euclidean algorithm
Source transcription — WS2, p. 1, Worksheet 部分, Pf of Thm 5: Euclidean Algorithm’ ‘. For , let and divide
The source proves both directions of . If and , then ; hence every common divisor of is one of , and . Conversely, if and , then and for some integers, so ; the same argument gives . Therefore .
The Chinese explanation on the page is retained: Worksheet 则介绍了 Euclidean Algorithm(辗转相除)这种方法则证明;当我们知道 时,最后会到某时 使 ,那么下一步 ,,这个 就是一连下来最后的 了。‘ ’ Each division has the form ; at the last nonzero remainder one back-substitutes to obtain the promised linear combination.
Worked source calculations — WS2, p. 1.
Thus , and the page back-substitutes
The second calculation is
so and
Chapter 3Gcd, primes, and congruence
This chapter transcribes ‘WorkSheets/412-WS3-Mywork.pdf’, pp. 1–2; ‘412-WS4-Mywork.pdf’, pp. 1–2; and ‘412-WS5-Mywork.pdf’, pp. 1–2.
3.1Prime factorization
Source transcription — WS3, p. 1, Pf of Thm 1′‘. The sheet states
For the forward implication, write when . Since is prime, the source notes that can only be or ; gives by the preceding corollary, while gives by definition. The Chinese margin explanation is: 这一段实际很好想: is prime = say , composite, 就会使 但 不可能整除 或 ,可以是整除 的某一个连结的因数,因此 ,而它不可能整除自己的 factor.‘ ’
For the converse the source uses the contrapositive: if is not prime, there are with , but does not divide either or . It then writes , with and , so is composite; because is not a unit and , this gives the required nontrivial factors.
Theorem 3.1 (Euclid’s lemma)
If is prime and , then or .
Source transcription — WS3, p. 1, Pf of Corollary 1′‘. If is prime and , then for some . The source says that this is the same simple argument as the two-factor case: treat as one factor and repeat the argument, that is, use induction.
Source transcription — WS3, p. 1, Pf of Thm 2 (FTA), Part I: Existence’ ‘. Consider
The sheet proves: (4) every element of is composite (a prime cannot lie in , since is a trivial factorization); (5) if and , then or (the contrapositive is written); and (6) is empty. Indeed, if were nonempty, let be its minimum by well-ordering. By (4), with ; by (5), one of is in and is smaller than , a contradiction. Thus every nonzero nonunit admits a prime factorization.
Source transcription — WS3, p. 2, Pf of Thm 2 FTA, Part II: Uniqueness’ ‘. Suppose
are two factorizations into primes. Since , Euclid’s lemma makes divide one ; as is prime, . Eliminating associated prime factors on both sides and repeating, if then the remaining equality would say , impossible because each is prime. Hence , and after reordering every up to associates.
Source transcription — WS3, p. 2, GCD Exercise’ ‘. If
with , then every common divisor has the form . Thus
3.2Congruence modulo
Source transcription — WS4, p. 1. Congruence 的概念是对 equality relation 的 generalization.‘ ’ For ,
The Congruence modulo N relation is defined by
that is, . The source explicitly compares the three equality axioms—reflexive, symmetric, transitive—with their congruence counterparts, then defines the congruent class and lists
For classes the worksheet proves 相等或者是 disjoint.‘ ’ If , then and , hence . Any is then congruent to by transitivity, so ; similarly the reverse inclusion holds. It also records when divides .
The source asks whether round down to 最近的 的倍数’ ‘ is a function and concludes: 其实不是.’ ‘ For example, with , the representatives map to different multiples of , so one class would have multiple images. In contrast, is a function: replacing one representative by another congruent representative preserves the resulting class.
Source transcription — WS4, pp. 1–2, well-defined operations. The worksheet defines
For multiplication, if and are written as source representatives, then the calculation is retained in its displayed form:
so is congruent to . It says: 具有除了 外所有 field 的性质(A/M/D 易证).‘ ’ It then proves that if , then has a solution: Bézout gives , hence .
The source proves uniqueness of the solution to under the coprime condition: if , then ; since is a unit, , hence . It continues that every then has a unique solution by multiplying the solution of by .
3.3Linear combinations modulo
Source transcription — WS5, pp. 1–2. The source proves
For and , Bézout gives , hence every lies in . Conversely, divides both and , so it divides every and that expression lies in .
Thus has a solution exactly when . The sheet writes the example
whose solutions are because divides and the solutions differ by . The source’s question 有多少 sol?0pt‘ ’ is answered: if , the distinct solutions are separated by ; hence there are solution classes.
Chapter 4Homework 1: Integers and Equivalence Relations (49/50)
Source: ‘Homework/412-Hw-1-graded.pdf’ (30 PDF pages). Canvas grading and navigation pages are interleaved with the submitted handwritten pages. The source trails below identify every page with transcribed work; navigation-only pages are recorded in the migration receipt rather than copied as note content.
4.1Question 1: square and cubic integers
Source trail: PDF pp. 6 and 8 (handwritten answer); p. 1 (10/10 grading).
For the square claim, the answer begins, “We prove by cases.” It invokes Corollary 2.5 to split the integers into , , and . For an arbitrary it records:
•
if , then ;
•
if , then ;
•
if , it writes .
The conclusion underneath is that the three cases cover all integers and none gives remainder upon division by .
For the cubic claim, the answer again uses the same three cases:
•
, so it takes ;
•
;
•
.
Thus it concludes that a cubic integer has form , , or . On the first cubic line, the handwriting says after a calculation for ; it is retained as a source-writing slip rather than silently treated as a new assertion.
4.2Question 2: least common multiples
Source trail: PDF pp. 10 and 12 (handwritten answer); p. 2 (10/10 grading).
For part (a), the response lets be arbitrary positive integers and defines the set of positive common multiples
It observes that , hence is nonempty and is a subset of the positive integers. The well-ordering principle supplies a smallest element, which it identifies as the least common multiple of and .
For part (b), with , the handwritten calculation is
This is transcribed as written: the displayed factorization omits a factor of if both preceding equalities are read literally. The written construction targets an integer satisfying .
For part (c), it starts from and , then writes
and, similarly, . It concludes that both and divide .
For part (d), let be an arbitrary common multiple, so for integers . Bézout is written as
With , the response calculates
The substitution makes the last expression integral, so divides . Together with the preceding divisibility calculation, it concludes that is the least common multiple.
4.3Question 3: greatest common divisors under an integral matrix
Source trail: PDF pp. 14 and 16 (handwritten answer); p. 2 (10/10 grading, with feedback).
Let and write its inverse as . The proof notes that both and are integers. It concludes that is or , and writes
It applies this to the column vector with entries and , obtaining . In particular,
and
Thus and are integer linear combinations of and ; conversely those two expressions are integer linear combinations of . The response phrases the two divisibility comparisons as mutual greatest-common-divisor inequalities and concludes
Grader feedback (PDF p. 2): “avoid the gcd notation.”
4.4Question 4: prime multiplicities and irrational roots
Source trail: PDF pp. 16, 18, 20, and 22 (handwritten answer); p. 3 (9/10 grading and feedback).
The answer labels the two assertions “1” and “2.” For the first direction of the equivalence in part (1), it writes , factors
and argues for a prime that divides ; hence the multiplicity is divisible by . For the converse it writes
and, from , obtains
This is the stated proof that is a -th power exactly when all its prime multiplicities are divisible by .
For part (2), it argues by contradiction. Assume is not a -th power but
with , , and . It writes and factors and by the Fundamental Theorem of Arithmetic. Since their prime factors are disjoint, it concludes that each prime factor of has multiplicity , so is a -th power, a contradiction.
Grader feedback (PDF p. 3): “You forgot the powers on the primes.” A second comment says, “Again, if you had written out the powers, you would have gotten that q = 1, and be done with it all.”
4.5Question 5: equivalence relations and classes
Source trail: PDF pp. 26, 28, and 30 (handwritten answer); p. 4 (10/10 grading).
For part (a), take arbitrary column vectors and with . The response checks reflexivity from , symmetry by reversing the equality, and transitivity by setting and chaining . It concludes that this relation on is an equivalence relation.
For part (b), it supplies the transitivity counterexample
Then and , so and , while , so is not related to . Thus the relation when is not an equivalence relation.
For part (c), if , reflexivity gives , so
Therefore every equivalence class is nonempty.
For part (d), assume the intersection of and is nonempty and choose in both classes. For arbitrary , the response uses , , symmetry, and transitivity to obtain and hence . Reversing the argument for arbitrary gives . Therefore two classes are either disjoint or equal.
For part (e), every has , so is a nonempty class in the set of all classes and belongs to that class. The handwritten conclusion is that is the disjoint union of the classes with . Using part (d), the response identifies the union as disjoint, concluding that the equivalence classes partition .
Chapter 5Rings and homomorphisms
This chapter transcribes ‘WorkSheets/412-WS7-Ring-Mywork.pdf’, p. 1; ‘412-WS8-Mywork.pdf’, pp. 1–2; and the ring-homomorphism portion of ‘412-WS9-Mywork.pdf’, p. 1.
5.1Ring structure
Source transcription — WS7, p. 1. An operation on a set is a function . A ring is a set with two operations ‘ ’ and ‘ ’ such that, for all :
1.
is an abelian group: closure, associativity, commutativity, , and additive inverses;
2.
multiplication has closure and associativity;
3.
there is such that (有幺元的环即为环’ ‘ in the handwritten note); and
4.
and .
The source then proves : from , let be the additive inverse of , add to both sides, and obtain .
Source transcription — WS7, p. 1, D(1). To show a nonempty subset of a ring is a subring, the worksheet lists: ; is closed under and ; and is closed under additive inverse. It notes that the inherited is commutative and associative and distributes over it, while serve as the identities; 所以只要证明 且对 closure 即可.‘ ’
Source transcription — WS7, p. 1, D(2). The set of all functions from to itself, with pointwise operations
is recorded as a ring. The source asks whether there are other subrings: ① 它自己;② 一个 smallest subring: 至少 include . 因而 all elements of : , .‘ ’ It concludes that is a subring and is the smallest subring.
5.2Ring homomorphisms
Source transcription — WS8, p. 1, A. The page lists seven maps and their status:
1.
the inclusion , , is a hom but not an isomorphism (for example is not );
2.
the doubling map , , is not a hom because and it does not preserve ;
3.
the residue map , , is a hom by modular arithmetic, is surjective, but is not an isomorphism because it is not one-to-one;
4.
the evaluation at ′‘ map , , is a hom: the page writes and similarly for products;
5.
, , is not a hom because ;
6.
, , is a hom, with the addition and product of diagonal matrices written out; and
7.
, , is not a hom, as a displayed pair of matrices shows .
Definition 5.1 (Ring homomorphism)
A map is a ring homomorphism when and .
Source transcription — WS8, p. 1, B(1)–(3). Every hom preserves : from one gets and cancels an additive inverse. It preserves additive inverse because , hence . It preserves units: if , then , so and are units.
The same page gives the kernel definition and an example:
for , . It also writes the informal summary isomorphism preserves 基本 everything(而 hom 只需要 surjective 也 preserve 所有的单位元)‘ ’, followed by the counter-cue 不是所有 field, domain …‘ ’.
Source transcription — WS8, pp. 1–2, C–E. A homomorphism kernel is nonempty because ; in particular . The source proves
If is injective and , then , so . Conversely, if and , then , hence , .
The Chinese/English note continues: 如何都有一个 unique 的从 到 之间的 hom ,这个 hom 叫做 canonical ring homomorphism.‘ ’ If such a exists, and ; for , , while for , . Thus the possible map is unique, and this calculation also verifies it is a hom: and .
5.3Domains and fields
Source transcription — WS8, p. 2, D–E. The worksheet proves that if and only if : for , . It then records Thm 3.8: every field 一定 domain’ ‘: if , , and , multiply by to get . The red Chinese explanation adds: 任何自乘的去, 中的所有非 0 元不能乘起就 0;因为 上 是 well-defined,如果有元被中 就失去唯一性了.’ ‘
A subring of a domain is a domain (去除了不必要了,本来所有非 0 元不能乘到 0, 也肯定一样’ ‘). For , the inclusion map is a ring hom exactly when is a subring of ; the source explains that the issue is the map is the inclusion and therefore one must retain the same .
Chapter 6Homework 2: Congruence Classes and Functions (35/40)
Source: ‘Homework/412-Hw-2-graded.pdf’ (33 PDF pages). The source interleaves Canvas grading and navigation pages with the handwritten submission. Source trails identify all transcribed pages; navigation-only and empty-shell pages are recorded in the migration receipt.
6.1Grading record and feedback
Source trail: PDF p. 1.
The graded total is 35/40. Question scores are 8/10, 10/10, 10/10, and 7/10. The substantive comments are retained verbatim:
•
Question 1: “I didn’t really understand anything, try to always point out what you are accomplishing with each step.”
•
Question 4: “This is somewhat philosophically unsatisfactory for then, there may be an empty eq. class. And all that follows would be inaccurate. I’m just going to subtract one point for it, but remember to think of eq. classes as partitions first.”
•
Question 4: “To define Z/nZ you need the equivalence relation you are trying to show exists as of this form. The logic is somewhat circular.”
A separate one-character Question 2 comment reads “n”.
6.2Question 1: simultaneous congruences
Source trail: PDF pp. 3-4, 6, 8, 10, and 11 (prompt and handwritten answer).
The system is modulo and modulo , where .
For part (a), assuming , the response takes
Modulo , it rewrites as , while is divisible by , so . Similarly, modulo , it rewrites as , while is divisible by , giving . It therefore states that this solves the system.
For part (b), and Bézout give integers with . Part (a) then supplies for every choice of .
For part (c), fix a solution and take an arbitrary . The answer writes for some integer . Consequently modulo and modulo , so every element of the class is a solution.
For part (d), it lets and an arbitrary solution . Hence both and divide . The response invokes the Fundamental Theorem of Arithmetic and the relative primality of to conclude that divides , so . Together with part (c), this proves that the set of solutions is exactly .
For part (e), the Euclidean algorithm in the answer is
Back-substitution gives
For the system modulo and modulo , it takes
The response checks , hence modulo , and states similarly that modulo . Its full answer is
6.3Question 2: maps between congruence classes
Source trail: PDF pp. 11, 13, 15, and 17 (prompt and handwritten answer).
For part (a), the proposed map , , is declared not well-defined. The counterexample is , : , but and are distinct.
For part (b), the map , , is declared well-defined. If , then , so modulo and .
For part (c), assume divides and write . If , then for some integer . Thus modulo , proving that is well-defined.
For part (d), assume does not divide . The two source representatives and are the same class. If their targets in were equal, then for some integer , so would divide , a contradiction. The response concludes that the rule is not well-defined.
6.4Question 3: solutions of a congruence-class equation
Source trail: PDF pp. 19-21, 23, 25, and 27-28 (prompt and handwritten answer).
Let and consider .
For part (a), the proof is by contraposition. If is a solution, then , hence for some integer . Thus
is an integer linear combination of . The answer invokes the description of all such combinations as the multiples of , and obtains dividing . Hence if does not divide , there is no solution.
For part (b), with , it first takes and computes
so . Conversely, if is a solution, then . After division by ,
The response proves by contradiction: a common divisor greater than would make a common divisor of greater than . It then applies the Fundamental Theorem of Arithmetic to conclude that divides . Thus the displayed solution set is
For part (c), Bézout gives . Since , the response writes . If , then
Thus is a solution.
For part (d), fix a solution . If is another solution, then and , so
Thus solves . Conversely, if solves the zero equation, the response uses distributivity in congruence classes to add and obtain . Therefore the number of solutions to the original equation is the same as for the zero equation, namely exactly .
6.5Question 4: equivalence relations induced by functions
Source trail: PDF pp. 28, 30-31, and 33 (prompt and handwritten answer).
For part (a), let . Since , the relation defined by is reflexive. If , then and therefore , proving symmetry. If and , then , proving transitivity. The response concludes that it is an equivalence relation.
For part (b), it defines the class indexed by an image value as
and the set of all such classes as
It then defines by . The answer argues that every member of has image , so the map is well-defined; it argues injectivity by contradiction from unequal classes allegedly mapping to the same image; and it proves surjectivity because every is for some , whose class maps to . It concludes that is bijective.
For part (c), it takes
Then exactly when modulo , so congruence modulo a fixed is the preceding function-induced relation. The response concludes that this gives a partition of whose equivalence classes are
Chapter 7Polynomials and quotient rings
This chapter transcribes the polynomial and quotient material in ‘WorkSheets/412-WS9-Mywork.pdf’, p. 2 and ‘WorkSheets/412-WS10-Mywork.pdf’, pp. 1–3.
7.1Domains, polynomial units, and division
Source transcription — WS9, p. 2. The worksheet records: if is a domain, then is a domain. Its explanation is that the degree of the product of two nonzero polynomials is the sum of their degrees, so the product cannot be zero. It then notes that the units of are exactly the units of ; a nonconstant polynomial cannot have a polynomial inverse. It gives the special example that in , the units are the nonzero elements of , because is a field.
Source transcription — WS10, p. 1, Part 1(A). Long division gives
The page labels the quotient and remainder . Its red note states: Division algorithm 只能在 field 上有用,因为只有 field 上才对 division 有 well-definedness.‘ ’ It then records the failure over : when , a putative quotient can be , which is not in , so the source’s division-algorithm hypothesis fails.
Theorem 7.1 (Polynomial division)
For with , there are unique such that
Source transcription — WS10, p. 1, C(1). Fix . Divide by :
Thus is constant. Substituting gives . The source calls this the Pf of Remainder Thm’ ‘ and writes 是 的 remainder.’ ‘
Source transcription — WS10, p. 1, C(2). The factor theorem is recorded in both directions:
If , division gives ; conversely, substitute in a multiple of .
7.2Factorisation and irreducibility
Source transcription — WS10, p. 1, B. For the polynomial gcd exercises,
so the source writes . It also records in :
then identifies as the gcd. The handwritten explanation says: official def: 一直有定义的 ring 下使只要是 subring,且 和 也在(事 的 multiplication 是 well-defined 的).‘ ’
For the Bézout prompt the source writes that there must be with
It also notes that are the only units of (plug in 就好’ ‘) and factors
in by checking roots .
Source transcription — WS10, pp. 1–2, D. If has degree or , then is irreducible iff it has no root. The forward implication uses the factor theorem: irreducibility forbids a factor and so forbids . Conversely, if is nontrivial, degrees add in a field/domain. For degree or , one factor must have degree ; writing that factor as yields the root .
The source then factors in . It explicitly says that one must check whether is irreducible; by the degree- criterion it has no root in , so
is the recorded factorization.
7.3Congruence modulo a polynomial and quotient rings
Source transcription — WS10, p. 2, Part 3. For define
The source calls the collection of all polynomials congruent to modulo and writes
It explicitly notes: 这里有证锣了,我们易证’ ‘ that congruence modulo is an equivalence relation, , and distinct congruence classes are disjoint.
Source transcription — WS10, p. 2, F. Every class has a unique with . Existence is by division. For uniqueness, if with the remainder, then would make the degree of equal to , while gives the same degree obstruction; no other degree can make two different low-degree representatives congruent.
Source transcription — WS10, p. 3, G. Let have positive degree and put
The source defines , , , and , marking the operations well-defined’ ‘ and calling a ring. For the example
,
the page maps the four classes to : to , to , to , and to , and labels the map isomorphic to ′‘.
Chapter 8Homework 3: rings, nilpotents, and homomorphisms
Personal finished homework transcription from 412-Hw-3-finished.pdf.
8.11. Subsets of
Let be the ring in exercise D2 of the “Ring Basics” adventure sheet. and are the constant functions zero and one. Show which of the following subsets of are subrings of . If they are not subrings, show whether they are rings (with a different multiplicative identity than , but endowed with the same operations as in ) or not.
(a) The set of constant functions.
(b) The set of those functions such that for any .
(c) The set consisting of , together with those functions with no zeros, or only a finite number of zeros. (A zero of a function is an element such that .)
(a) is a subring of .
Pf. Since is and is , . Let be two elements in , and suppose , for some . Then
so is closed under addition. Also,
so is closed under multiplication. Since is also a constant function, , so is closed under additive inverse. Since and is a ring, by worksheet 3 it suffices to show these four facts. So is a subring of .
(b) is not a subring of . Since , the constant function , is not in (for , ), violates the definition of subring. And is not even a ring because it does not have a multiplicative identity.
To show this, assume there is a function such that for all , . Take . Then, for any , , so , which is not in . Thus does not have a multiplicative identity; therefore it is not a ring.
(c) is not a subring of , and not a ring. Consider defined by for and for ; and defined by for and for .
So and both only contain one zero point; therefore . But
Then for and for .
contains infinitely many “zeros.” Thus . Therefore is not closed under addition, so is not a ring and definitely not a subring of .
8.22. Nilpotents and units
An element in a ring is said to be nilpotent if for some positive integer . Generalizing the definition on page 40 of our text, a unit in a ring is an element with a multiplicative inverse, meaning there exists such that .
(a) Prove that if is nilpotent (and is not the zero ring), then cannot be a unit.
(b) Prove that if is nilpotent, then is a unit. (Hint: One approach to showing something is a unit is to write down its inverse. In this case, it could help to recall geometric series from Calculus.)
(c) Describe all the nilpotent elements in in terms of their prime factorization.
(a) Let be a ring which is not the zero ring ( and are different elements). Assume is nilpotent. Then for some , . Let be the smallest positive integer such that .
Case 1: . Assume for sake of contradiction that is a unit. Then for some , . Multiply both sides by :
This violates the assumption that is the smallest integer such that .
Case 2: . Then , so cannot be a unit, since and for every , . This contradicts that is a unit. Since every case causes a contradiction, we have proved that if is nilpotent, then is not a unit.
(b) Let be nilpotent, and let be the smallest positive integer such that .
Case 1: . Then . Consider ; then
so is a unit.
Case 2: . Consider
Then
Similarly, . So is a unit. Therefore we have proved the statement.
(c) By FTA,
for primes and their multiplicities . For any nilpotent of ,
for some . Thus for some . Therefore , so contains all prime factors . Under , contains as factor. Therefore, as long as contains all prime factors of , is nilpotent.
Note that also must contain all prime factors: if some prime but , then is not nilpotent. This is obvious since if , there is no such that has the factor of . So the set of nilpotents of is just the set of multiples of all different prime factors of :
the set of classes for which , , and are all different prime factors of .
8.33. Zerodivisors
An element in a commutative ring is said to be a zerodivisor if there exists a nonzero element such that .
(a) Given a nonzero element , prove that is not a zerodivisor if and only if the map given by multiplication by , meaning the map , is injective.
(b) Describe all the zerodivisors in in terms of the prime factorization of or their greatest common divisor with .
(a) Denote the map by .
(1) Assume is not a zerodivisor. Assume , so . Thus . Since is not a zerodivisor, there is no nonzero element such that . So can only be , hence . Therefore implies ; the function is injective.
(2) Assume is injective. Assume for contradiction that is a zerodivisor. Then for some with , . So , and since , while , contradicting that is injective. Hence is not a zerodivisor. Since (1) and (2), we have proved the iff statement.
(b) Let be a zerodivisor in . It means there exists such that , which is not . Thus for some with .
(1) If , then have no common prime factor. To satisfy , must contain all prime factors of ; this means . So the circumstance is impossible.
(2) If , then have at least some common factor . By FTA, for some primes . Consider ; then for some , so is a solution to . Here , so , satisfying the requirement that .
Therefore the set of all zerodivisors of is
Source note (PDF p. 8). The handwritten construction in (2) asserts after taking , without recording the prime-exponent condition needed for that equality. It is transcribed above as written.
8.44. Ring homomorphisms
For two rings and a function is a ring homomorphism if , and for all ,
(a) Let be any ring (recalling how our class convention differs from that of the book!). Prove that there exists a unique ring homomorphism .
(b) Let be an integer. Prove that there does not exist a ring homomorphism .
(c) Suppose and are two rings, and is a ring isomorphism; in particular, is a bijection and so has an inverse function . Prove that is also a ring homomorphism.
(d) Prove: If is a ring homomorphism, then is injective if and only if .
(a) Consider , . Thus . Let be arbitrary elements in . Then
So is a homomorphism. Assume is any homomorphism from to . Then , and by theorem 3-10 on textbook, and .
Let be an arbitrary positive integer that is not . By definition of homomorphism,
Similarly, for any negative integer that is not ,
Therefore for any , , so . Therefore the homomorphism is unique.
(b) Assume for sake of contradiction that is a homomorphism from to . By definition, and . So
Repeat process (1) by times. Then
so . Since , contradicts , violating the definition of homomorphism as a function. Therefore such homomorphism does not exist.
(c) is a ring isomorphism. Since is bijective, let be arbitrary elements in . There exist unique elements such that , . Then
so is closed under addition. Also,
so is closed under multiplication. Also, since is a homomorphism, . Since is bijective and has inverse, . By (1), (2), (3), is also a ring homomorphism.
Source note (PDF pp. 11-12). The handwritten multiplication line uses and then ; the source’s notation is retained although the surrounding computation uses multiplication.
(d) First prove: if is injective, then . Since by being a homomorphism, . Let , so . Since is injective, implies . So any element in can only be , and .
Next prove: if then is injective. Let , and (that is, ). Then . Since is a homomorphism, .
So . Since , , hence . Therefore is injective if .
Chapter 9Groups and permutations
This chapter is a source-language transcription of ‘WorkSheets/412-WS18-symmetric_group-Mywork.pdf’, pp. 1–2.
9.1Symmetric groups and cycles
Source transcription — WS18, p. 1, A(6). The inverse of a cycle is written
followed by 一般真.‘ ’ The worked example is .
Source transcription — WS18, p. 1, B. The source records . For subgroups of , it gives
and labels it cyclic 4 group’ ‘, while
is labelled Klein 4 group’ ‘. It writes that has subgroups isomorphic to : fix one of the four elements and permute the remaining three, using the count for the number of corresponding subgroups in .
The source explains the cycle decomposition algorithm for a permutation:
1.
begin from an element of and follow its cycle backwards;
2.
delete every element used in that cycle, then repeat the bijection process with unused elements;
3.
continue until the elements are both used.
It writes the standard transposition expansion
and comments that every cycle is a product of transpositions. A worked factorization is
9.2Even and odd permutations
Source transcription — WS18, p. 1, D–F. Define as the subgroup of consisting of all even permutations. The source records
and adds: 这说明 中一定有一半为 even 的,一半为 odd 的.‘ ’ It stresses the exceptional condition is Abel 的 iff !!!0pt‘ ’ and states that one cycle in can have possible order through , so the possible orders of a cyclic group are also through .
For a formal proof of the parity statement, the sheet fixes
and notes that can fix . It then uses induction to reduce a permutation on points to one fixing .
9.3Permutation matrices
Source transcription — WS18, pp. 1–2, G. A Permutation matrix has one in each row and each column and zeros elsewhere. The source describes its columns: for
the entry is and all remaining entries are . It concludes: 任意 permutation 都有唯一的 permutation matrix.‘ ’
With , it calculates
so . Therefore all permutation matrices form a subgroup of , isomorphic to .
For a transposition the sheet writes and ; it includes the displayed example matrix . Finally, if an even permutation is written
then
The source concludes: odd permutation: det 为 ;因而 permutation matrix 是 unique 的,所以 even/odd 也 unique 的.‘ ’
Chapter 10Homework 4: characteristics, linear maps, and quotient examples
Personal finished homework transcription from 412-Hw-4-finished.pdf.
10.11. Characteristics of rings
(a) If is a homomorphism of rings, show for any and , .
(b) Prove that isomorphic rings have the same characteristic.
(c) If is a homomorphism of rings, must and have the same characteristic?
(a)
Pf. Case 1: . Then
where each repeated sum has terms, since addition is closed under ring homomorphism.
Case 2: . Then
since a homomorphism preserves the additive identity.
Case 3: . Then
Since the three cases cover all circumstances, we have proved the statement.
(b) Let be two arbitrary isomorphic rings and be an isomorphism from to . Let be the characteristic of . So for every , . Since by (a),
and , we have . Thus for any element in , . Since is an isomorphism, for any element there is some such that , and . So for every , . Therefore is also the characteristic of .
(c) and do not necessarily have the same characteristic. When we deduced that for all , , we needed the surjectivity of to ensure every element is covered. Otherwise we can have such that it is not covered, so that and is not the positive characteristic of .
For a counterexample, take , . The characteristic of is and the characteristic of is , but , sending , is also a ring homomorphism.
10.22. Linear transformations
Let be a vector space. Recall that a function is a linear transformation if for all and all , and .
(a) Show that the set of linear transformations from to , with usual addition and composition of functions as multiplication, forms a ring.
(b) Consider the vector space and let be the ring of linear transformations of as defined in the previous part. Consider . Show that there is an element such that , but there is no element such that .
(a) Denote the set of linear transformations from to as . Let be arbitrary transformations in .
(1) For every , is also a linear transformation whose standard matrix is the sum of the standard matrices of . So , and is closed under addition.
(2) For every ,
So addition in is commutative.
(3) For every ,
so addition in is associative.
(4) Consider for all . Then , so has an additive identity.
(5) For any , consider , which is also a linear transformation. Then for all , so every element in has an additive inverse.
(6) For every , is also a linear transformation whose standard matrix is the product of the standard matrices of and . So , and is closed under multiplication.
(7) For every ,
by associativity of linear transformations. So is associative under multiplication.
(8) Consider . For every ,
So is a multiplicative identity for . By (1)–(8), is a ring under the stated addition and multiplication.
(b) (1) Choose such that
Consider defined by
By the fundamental theorem of Calculus,
We have shown in (a) that , so . This shows the existence of by example.
(2) Now prove (left inverse of ) does not exist. Assume for sake of contradiction that there exists such that
for all . Consider , so , and , so . Then
This violates the definition of as a function. So the contradiction proves that such does not exist.
10.33. Quadratic extensions
Let be an integer.
(a) Prove that is an integral domain.
(b) Show that is a field.
(c) Now assume is also positive and is a prime. Determine a necessary and sufficient condition for to be a field.
(a) First we prove this is a commutative ring. Let be arbitrary. Write
for some . Then
Thus there is closure under , associative and commutative , an additive identity, and additive inverses. Also,
and . Expanding and gives
so multiplication is associative. Finally, , and direct expansion gives . By 1–9, is a commutative ring.
Now show it is an integral domain. Let and be nonzero elements, so at least one of and at least one of is not . Then
Consider the four situations where one of and one of are zero. If , then ; if , then ; if , then ; and if , then . So . Thus is an integral domain.
(b) Exactly the same as (a), except in modular arithmetic we can prove is a commutative ring. Now prove it is a field by proving any nonzero element has a multiplicative inverse. Let be nonzero, so are not both . Let , where . Assume . We solve
Since is a field, always exists when . If , choose ; then , and the first equation becomes
Since is a field this always has a solution: has a solution for , and is some multiple of . Let denote the solution; then gives the solution to (1).
Case 2: assume . Same as case 1: is a solution of (2), and then we can always find a solution to (1), since always has a solution which is a multiple of , guaranteed by as a field. Therefore the system always has a solution. So any nonzero element in has a multiplicative inverse; since it is a commutative ring, it is a field.
Source note (PDF pp. 10-11). The handwritten argument for (b) introduces divisions by in a case that also discusses the alternative, and uses several abbreviated equalities. The visible calculation is retained rather than silently repaired.
(c) The condition is that is not congruent to modulo .
Like in (b), we must solve when is a nonzero element in . If , the equation has no solution. Thus is necessary. If , we can always solve the equation like in (b), so any element in always has a multiplicative inverse. Thus is sufficient. Therefore it is sufficient and necessary.
Source note (PDF p. 12). The final sufficient-condition line reads “,” while the preceding displayed condition reads . Both visible forms are retained; the source does not reconcile them.
10.44. Zerodivisors in a polynomial ring
Let be a commutative ring in which only if . Show that if is a zerodivisor in , then if
there is an element in such that .
Proof. Assume is a zerodivisor in . So at least one of is nonzero and there exists
such that . Thus
Therefore , so is a zerodivisor in . Note that , since this is the term with highest degree of by our assumption. Since (for if , iff ), recursively for . Therefore all even powers of are nonzero.
Let be an arbitrary odd multiple of . Assume it is for contradiction. Then
which contradicts . So . Hence any multiple of is nonzero.
By the coefficient equation, , so and . Likewise implies . The pattern is
for . Multiply both sides by to get .
The source proves this by induction on the power of . Base case : . Inductive step: assume . Since the term with is , multiplying by gives . Thus for every , . Combining that is nonzero with this result finishes the proof: is the required element.
Chapter 11Homework 5: matrix ideals, rational subrings, and polynomial quotients
Personal finished homework transcription from 412-Hw-5-finished.pdf.
11.11. The ring
Consider the ring .
(a) Take any nonzero matrix . Show that by multiplying on the left by matrices of the form
we can do any elementary row operation to .
(b) State a way of interpreting column operations using matrix multiplication.
(c) Prove that the only ideals in are and .
(a) Let be an arbitrary matrix in . Then
for some .
(1)
It is equivalent to adding some multiple of the second row to the first row.
(2)
It is equivalent to adding some multiple of the first row to the second row.
(3)
It is equivalent to multiplying the first row by some scalar .
(4)
It is equivalent to multiplying the second row by some scalar .
(5)
It is equivalent to swapping the order of the two rows.
By (1), (2), (3), (4), (5), we have shown that through multiplying on the left by matrices of the five forms, we can do all five elementary row operations to respectively.
(b) Column operations are just multiplying on the right by the same five matrices in (a). For example,
which adds some multiple of the first column to the second.
(c) Pf. We have known that any ring has as an ideal. Now we prove that any ideal of , if it is not , then must be itself.
Let be an ideal of . Assume , so there exists some other element . Let
Since , at least one of its entries is not . Without loss of generality, assume . By definition of ideal,
Then
Also,
so the four matrix units are in . By the displayed products,
No matter which entry we assume is nonzero, we can always get this result since the property of ideal preserves elementary operations, so we can always operate to leave only one nonzero entry and then get by elementary operations. Since this identity matrix is in , let be arbitrary. Then , so . Since , if . Therefore the only ideals are and .
11.22. Odd denominators
Let be the subset of rational numbers with odd denominators (when expressed in lowest terms).
(a) Show that is a subring of .
(b) Let be the subset of rational numbers with even numerator (when expressed in lowest terms). Prove that is an ideal of .
(c) Define a ring homomorphism . What is the kernel?
(a) (1) , and .
(2) Let be arbitrary elements of . Then , for some . By definition of rational numbers, since , are odd. So
since is odd; and for the same reason.
(3) Let be arbitrary. Then for where is odd. So . Since (1), (2), (3), by theorem 3.2, is a subring of .
(b) Let be two elements of . Then , for some , where are even and are odd. So
Since are even, is even; since are odd, is odd. So .
Let be arbitrary, so for some integer where is odd. Then
Since are odd, is odd; and since is even, is even. Therefore . Nonemptiness is guaranteed by . So by definition, is an ideal of .
Source note (PDF p. 6). The handwritten multiplication line reads after setting and ; the intended numerator appears to be , but the source is retained.
(c) Define by mapping all elements in with even numerator to , and all elements in with odd numerator to :
(1) .
(2) .
(3) Let be arbitrary. Let , for , with odd and nonzero. Then
Therefore by (1), (2), (3), is a homomorphism, and
is the set of elements with ; equivalently, it is the set of fractions whose numerator is even. Thus .
11.33. Congruence classes of polynomials
Let be a field and let . Two polynomials are congruent modulo if . We write . The set of all polynomials congruent to modulo is written . For this problem, fix a polynomial of degree .
(a) Prove that every congruence class contains a unique polynomial in or .
(b) How many distinct congruence classes are there for modulo ?
(c) How many distinct congruence classes are there for modulo ?
(a) Let be an arbitrary congruence class modulo . Let be an element in it and fix it. Guaranteed by the division algorithm, there exist some such that
where or . So , hence and . So we have proved the existence of such polynomial in .
Now show uniqueness. Fix . Let be an arbitrary element in , so . Then
for some . If , then ; they are the same element. If , then . Therefore the is unique.
(b), (c) By (a), every congruence class contains a unique polynomial in or , and every element of this set is a unique congruence class modulo . So we only need the number of polynomials that have smaller degree than .
For in , (degrees ). For in , (degrees ).
11.44. Subrings of
What are the subrings of ? We have , , and, according to the previous problem, the subring of rational numbers with odd denominators.
(a) Prove that - the set of fractions with and - is a subring of .
(b) Let be a subring. Define
Define to be the set of positive primes such that .
(the set of positive primes). Compute , , , (no proof needed).
(c) (Tricky!) Given a set of the positive prime numbers , define a subring denoted such that .
(d) (This is also hard!) Prove that two subrings are equal iff . Conclude that the subrings of are in bijection with the subsets of the positive prime numbers!
(a) (1) and .
(2) Let be arbitrary elements in . Then , for some with . Thus
(3) Let . Then for some with . Then . Since (1), (2), (3), is a subring of by theorem 3.2.
(b)
For , .
For , is the set of all positive primes.
For , , because for some only for ,
since all other primes are not multiples of .
For , is the set of all positive primes except ,
since every prime is odd except .
(c) We want to define such that
the positive primes satisfying are exactly the elements of .
We can define
The source then checks (1) and (2) is a subring of :
For , take and in the denominator, so . Conversely, for , for some and . By FTA, for primes and . Since is prime, is one of the primes among . So .
Also and lie in . If and , then
So is a subring of .
(d) Let be subrings. Let
Here and are respectively the positive primes whose reciprocals lie in and .
Source note (PDF pp. 16-17). The final argument writes “for some ” and applies FTA as without exponent notation; these visible shorthand forms are retained.
First, if , then clearly . To finish the iff proof, assume . Let be an arbitrary element of . Since , for some where and . Since , by definition of subring , so recursively .
Since , by Bézout there are such that . Thus
Since and , . By FTA, for some primes , so . Since the are in by property of , their reciprocals lie in both rings; therefore . Since , . So . Similarly, we get by exactly the same steps. So .
Therefore iff , and the subrings of are in bijection with the subsets of the positive prime numbers.
Chapter 12Normal subgroups and isomorphisms
This chapter is a source-language transcription of ‘WorkSheets/412-WS24-Mywork.pdf’, pp. 1–3. The page divisions below are part of the provenance: no theorem statement or proof cue is supplied from the reference-only PDFs.
12.1Kernels, quotients, and the first isomorphism theorem
Source transcription — WS24, p. 1, Thm 8.16. If is a group hom, then is a subgroup of . The handwritten proof first observes that for , and hence , so . It then checks subgroup closure in the form: for and ,
so . (The original Chinese line says 首先,group hom 的 ker 一定是 subgroup of ’ ‘ and then 然后我们证明 ’ ‘.)
Source transcription — WS24, p. 1, Thm 8.17 and 8.18.
iff is injective.
The sheet marks this as 已证过千遍.‘ ’ If , then is a surjective group hom and . It explicitly checks , writes that every coset is for some and therefore is hit by , and notes iff .
Source transcription — WS24, p. 1, Lemma 8.19. For a group hom with ,
The source’s forward implication is , hence and ; for the converse, gives , then and, using (the page annotates the equivalence with the reverse-multiplying calculation).
Theorem 12.1 (First isomorphism theorem)
If is a surjective group homomorphism, then
Proof
Source transcription — WS24, p. 1, Thm 8.20. Consider , sending . It is well-defined because . It is injective by the preceding lemma, and it is surjective because every is for some when is surjective. The source calls this 第一同构定理’ ‘ and annotates the displayed conclusion with the exceptional hypothesis that must be surjective.
Source transcription — WS24, p. 1, Thm 8.21. If , is a subgroup of , and , then is a subgroup of . The proof starts with and ; normality gives , hence (as written on the page) lies in . The source adds the Chinese reminder: 而如果 ,则结论更强: ;但如果结论是包含 本身,和第七条类似.‘ ’
12.2Second and third isomorphism theorems
Source transcription — WS24, p. 2, Thm 8.22 (Third Isomorphism Theorem). If , , and , then
The source begins the normality check with and, because is normal in , . For the quotient isomorphism it considers , , calling it an easy group hom and surjective. The ker note says: 即所有 中等类的 -cosets’ ‘, so , and the first isomorphism theorem yields the result.
Source transcription — WS24, p. 2, Second Isomorphism Theorem (group), Diamond Thm’ ‘. Let be a group, a subgroup of , and . Then:
1.
is a subgroup of ;
2.
;
3.
; and
4.
.
The source draws the diamond over , with and below and at the base. It defines by ; its kernel is , so the first isomorphism theorem proves .
Source transcription — WS24, p. 2, Fourth Isomorphism Theorem (group), Lattice Thm’ ‘. With , let be all subgroups of containing and all subgroups of . The source states by and gives the correspondence cues 所有 的 subgroup for some ’ ‘ and, for a subgroup , choose , then prove and .
Source transcription — WS24, p. 2, ring analogues. 类比地 ring 也有四个 isomorphic thms.‘ ’ The page records the First Isomorphism Theorem for rings: if is a ring hom, then is a subring and an ideal, is a subring, and (the page annotates the surjective case 虽然不说,但如果 surj,那么 ’ ‘). The Second Isomorphism Theorem for rings: if is a subring of and an ideal of , then is a subring, is an ideal of , and .
12.3Fourth isomorphism theorem, simple groups, and finite abelian groups
Source transcription — WS24, p. 3, Third and Fourth Isomorphism Theorems (ring). If is a ring and an ideal of , the source lists:
1.
for a subring of , is a subring of ;
2.
every subring of is for a subring of ;
3.
if is an ideal of containing , then is an ideal of ;
4.
every ideal of is for an ideal of ; and
5.
is isomorphic to when is the intervening ideal.
The page’s Fourth Isomorphism Theorem for rings is phrased: if is an ideal of , define as all subrings of containing and as all subrings of ; then under .
Source transcription — WS24, p. 3. Corollary 8.23 says: if is normal in , is a subgroup of , and contains , then iff . The proof uses the Third Isomorphism Theorem in one direction and, in the other, for , , writes for some , hence for ; since , this lies in .
The definition is retained verbatim in meaning: A group is simple iff 它有且只有 和 自己这两个 normal subgroup.‘ ’ The sheet states 为 simple abelian group iff for some prime .‘ ’ It finishes with the Fundamental Structure Theorem for finite Abelian groups:
where are prime numbers (可以重复’ ‘), and the isomorphism is unique up to reordering.
Chapter 13Homework 6: prime and maximal ideals
Personal finished homework transcription from 412-Hw-6-finished.pdf.
13.11. Prime ideals
Recall: an ideal in a commutative ring is prime if implies or .
(a) Prove that is prime if and only if is a domain.
(b) Use the first isomorphism theorem to show that the ideals and in are prime ideals.
(c) Show that the ideal in is not prime.
(d) Show that the ideal in is prime.
(e) Is the ideal in a prime ideal?
Hint: For the first one, consider the homomorphism , “evaluate at zero.”
(a) First we prove: if is prime, then is a domain.
Pf. Assume is prime. Let be two arbitrary elements in with
Note that is the additive identity in . Thus , so by definition. Since is prime, or . Thus or , i.e. or . So implies one factor is zero; is a domain.
Then we prove: if is a domain, then is prime.
Pf. Assume is a domain. Let be arbitrary with . So , whence
Since is a domain, or ; so or , that is, or . Therefore is prime. By (1), (2), we can conclude that is prime iff is a domain.
(b) Consider , sending . Note that is a homomorphism, and
Since , , so , is surjective. By the first isomorphism theorem,
Since is a domain, is a domain since isomorphism preserves domain. Then by (a), is a prime ideal.
For , consider the function defined by . We can show this is a homomorphism. Let
be arbitrary. Then
and . Also, is surjective: and . By the first isomorphism theorem,
Since is a domain (since is prime), is a domain, so by (a), is a prime ideal. Since
is a prime ideal.
(c) Counterexample: consider . , but . Thus there are but , showing is not prime.
(d) Let , () be arbitrary elements of . Assume . So
for some integers . Hence
Assume are both odd for contradiction. Then is odd. Since is even, is odd, contradicting . So at least one of is even. Without loss of generality, let be even, so for some . Therefore . So implies at least one of . Thus is a prime ideal in .
(e) It is not a prime ideal. Counterexample: consider . Then
but according to the handwritten source. Therefore it is not a prime ideal.
Source note (PDF p. 2). The displayed product gives , which is itself in , while the next handwritten line says “but .” The original inconsistency is explicitly retained.
13.22. Maximal ideals
We say that a proper ideal in a ring is maximal if whenever for some ideal , we have . For the next problems, assume is a commutative ring and is an ideal of .
(a) Prove that if is a maximal ideal and , then is a unit in .
(b) Prove that is a maximal ideal if and only if is a field.
(c) Use the First Isomorphism Theorem to show that the non-principal ideal in is a maximal ideal.
(d) Show that the ideal in is not maximal.
(e) Show that the ideal in is maximal.
(f) Show that and is a maximal ideal in .
Hint: Consider the homomorphism given by . For , then or . Show that does not divide . Then show that an ideal containing and also contains .
(a) Pf. We can construct a new ideal of by
We can prove this is an ideal:
(1) Let , be arbitrary elements in . Then
Since , .
(2) Let be an arbitrary element in and be an arbitrary element in . Then
Since , , .
(3) . So is an ideal of . Note that . Since is a maximal ideal, .
Thus for every , for some and . Consider . for some . Thus . So
Since , . Thus
Therefore is a unit in .
(b) First we prove: if is a maximal ideal, then is a field. This proof is almost finished by (a). Since
For all , is a unit by (a). Thus every nonzero element in is a unit, so is a field.
Then we prove: if is a field, then is a maximal ideal. Assume is a field. Let be an ideal of such that . Since , let be arbitrary. Since is a field, there exists such that
So . Since is an ideal, , so . Therefore, for every , by the definition of ideal, hence . Since , . Thus whenever is an ideal, , and is maximal. By (1), (2), is maximal iff is a field.
(c) Consider defined by . The calculation in 1(b) shows this is a homomorphism and it is surjective: , . By the First Isomorphism Theorem,
Since is a field ( is its only nonzero element), is a field. So is a maximal ideal.
(d) is an ideal of . Note that
So . Therefore is not a maximal ideal in .
(e) Consider the quotient ring . Let be an arbitrary element in it. Since ,
Since , , denote the remainder when is divided by as , so or according to the source. Then . Thus
which has only two elements. This is a field since it is a commutative ring and the only nonzero element has a multiplicative inverse which is itself: . Then , , so . Therefore the only ideal such that is . So is a maximal ideal.
Source note (PDF p. 3). The quotient calculation concerns , but its conclusion briefly says and . This source-level ring mismatch is retained.
(f) Let be an ideal such that . So there exist some such that either or , or both. Since is an ideal,
Since either or , , , where or or and at least one of is not . Thus
or
So ; . By Bézout, for some according to the handwritten line. Since is an ideal, , and since , , so . Thus . Hence , so is a maximal ideal.
Source note (PDF pp. 3-4). The Bézout combination is handwritten as and later as ; these factors differ visibly. They are transcribed rather than silently corrected.
13.33. Polynomial rings in many variables
Let be a polynomial ring in variables ; that is, it contains all polynomials in finite terms that involve these variables.
(a) Let be polynomials in . Prove that
is an ideal of .
(b) Consider the ring homomorphism
(c) Explain why the above description fully determines for each polynomial .
(d) It is given to you that for some polynomials . Find . Hint: part (e).
(e) Let be the minors of the matrix . Consider the ideal . Show that does not change if one applies elementary row operations to the matrix .
(f) Take the ideal in . Express as kernel of some ring homomorphism. You know such a homomorphism exists by WSH 10. You do not need to prove that the proposed homomorphism has as its kernel.
(g) Prove that the ideal is not a maximal ideal.
(a) Select arbitrary
where . Then
Since , .
Select arbitrary and . Then
Also . By (1), (2), (3), is an ideal in .
(c) For all , ; the source labels this “constant.” For an arbitrary element ,
Thus
Since a homomorphism preserves addition and multiplication, each term is either constant or some constant multiplied by some multiple of a power of . Hence is fully determined for each .
(d) Consider
Then . For arbitrary
So the source identifies .
(e)
Thus
(1) Swapping the two rows does not change . By swapping the rows,
So
Since according to the handwritten line, .
(2) Multiplying a row by a nonzero constant does not change . WLOG assume we multiply row one by , . Then
So since , hence iff , and multiplying generators by and gives both containments.
(3) Adding some nonzero multiple of a row to another does not change . WLOG add a multiple of the second row to the first:
Then , , and . Therefore . By (1), (2), (3), does not change if one applies elementary row operations to .
Source note (PDF p. 4). In the row-swap argument, the source says “,” although those are coefficient polynomials. It is retained verbatim in substance.
(f) Consider defined by
For the same reason as in (c), is determined by (1). Then
is because . This homomorphism is well-defined, “easy to see” because (1) , (2) preserves addition in , and (3) preserves multiplication in , as seen from the polynomial addition and multiplication operations.
(g) Consider as an ideal of . So . Select arbitrary ; by property of ideal, . Thus every element of is in , so .
But while . Also but , so . Thus , and by definition is not a maximal ideal.
Chapter 14Homework 7
14.11. Cyclic groups and a sign isomorphism
Let and be groups.
(a) Give an example where and are both cyclic, but is not.
(b) If is a cyclic group, prove that and are both cyclic.
(c) Recall that is the multiplicative group of units of . Define an explicit isomorphism .
14.1.1(a)
is cyclic, but is not cyclic. It cannot be generated by any element among its four elements, by either addition or multiplication.
14.1.2(b)
Proof. Let be the generating element such that
Take arbitrary and . Then for some integer . Hence and . Therefore and are cyclic groups.
14.1.3(c)
Let
Define by
Note that is an additive group, while is a multiplicative group.
Take arbitrary . Then
where if and if ; likewise and . Thus if , i.e. if , and if , i.e. if . Therefore
so is a homomorphism.
Assume . Then
So and , hence . Thus is injective.
Let be arbitrary. Consider
where if and if . Then , so is surjective. Therefore is an isomorphism.
14.22. The unit circle
Let be the unit circle:
(a) Prove that is a subgroup of .
(b) For every positive integer , find an element of order in .
(c) Find an element of infinite order in .
14.2.1(a)
Proof. As is a field, every element except is a unit in . Since and , . Therefore it suffices to show that contains the identity and that every element has its multiplicative inverse also in .
The first statement is true because . For the second, consider . Since ,
so is the multiplicative inverse of . Therefore is a subgroup of .
14.2.2(b)
By Euler’s formula,
so and is the identity. For arbitrary , consider
Because
the order of is .
14.2.3(c)
Consider
For every ,
since is irrational. Thus its order is infinite.
14.33. Units in matrix rings
Let be a commutative ring, and consider the group of units in the ring of matrices .
(a) Suppose and all entries are in an ideal . Prove that is not a unit.
(b) Prove that for there is a matrix such that .
(c) Prove that is a unit if and only if is a unit.
14.3.1(a)
Proof. Assume for sake of contradiction that is a unit. Then there is such that
where is the multiplicative identity of . Denote by . Then
Since and , , hence because is closed under addition. Therefore , so , which contradicts . Thus is not a unit.
14.3.2(b)
For , consider
Then, since is commutative,
14.3.3(c)
Since is a commutative ring, for .
Claim 1. If is a unit in , then is a unit in .
Proof. Assume is a unit. Then there is such that . Hence
and also in . Therefore is a unit in by definition.
Claim 2. If is a unit in , then is a unit in .
Proof. Assume is a unit in . Then there is such that
By part (b), there is such that . Consider . Then
Therefore is a unit in . By Claims 1 and 2, is a unit in if and only if is a unit in .
14.44. Matrices over
Let be a prime number and consider the field .
(a) Show that a matrix is not a unit if and only if the columns are linearly dependent.
(b) Show that the set of upper triangular invertible matrices in forms a subgroup of order , which is non-abelian when .
(c) Compute the order of .
(d) Show that diagonal invertible matrices form an abelian subgroup of of order .
(e) Find an abelian subgroup of of order .
14.4.1(a)
Claim 1. is not a unit if the columns are linearly dependent.
Proof. Assume the columns of are linearly dependent. Then
where are not both . Without loss of generality, assume . Since is a field, , so
which gives . This is not a unit. Since is a field and hence a commutative ring, problem 3 shows that is a unit if and only if is a unit in . Thus is not a unit.
Claim 2. If is not a unit, then the columns are linearly dependent.
Assume is not a unit and the columns are not linearly dependent. Then . Let . Consider
Then , contradicting that is not a unit. So the columns are linearly dependent. Therefore is not a unit if and only if the columns of are linearly dependent.
14.4.2(b)
The set of upper triangular invertible matrices in is
Since , and for we have , take
Then , so every element in has its inverse also in . Thus is a subgroup of .
There are different choices for , different choices for , and different choices for . The three choices are independent, so there are elements in .
Take and in . Then
whereas
Since these are different if , is non-abelian when .
When , consider arbitrary . Since , we have , and
and
Thus is abelian if .
14.4.3(c)
By part (a), is a unit, i.e. , if and only if the columns of are linearly independent. First choose an arbitrary nonzero vector ; there are choices. Then choose a vector which is linearly independent with it, i.e. . There are choices for the second column. Hence
14.4.4(d)
The set of diagonal invertible matrices is
There are choices for and choices for , so . To show it is a subgroup, , and for consider
Then , so has an inverse. Therefore is a subgroup of whose order is . It is abelian because, for and in ,
14.4.5(e)
is a subgroup of whose order is . This is a subgroup guaranteed by generating a cyclic subgroup from an element in the group. Also,
so , while for . Hence its order is .
Chapter 15Elliptic curves
This chapter transcribes ‘WorkSheets/412-WS25-Mywork.pdf’, pp. 1–2. The worksheet cites associativity but does not include its geometric proof; that omission is retained rather than supplied from another source.
15.1Affine curve, reflection, and identity
Source transcription — WS25, p. 1. A (real, affine) Elliptic curve is the solution set in of
The page sketches the curve and says Notation: 使用 表示一个 elliptic curve. 它对应的 equation 为 ; 表示 的所有 solutions.‘ ’
For , it defines to be the reflection of the third intersection of the line through with ; the sketch labels . It adds 指 的 ’ ‘.
An extra def 1′‘ says the tangent line at is ’s other intersection with the tangent at . extra def 2′‘ defines
where is an extra element, and writes . It explains that is the vertical line through . The source then lists:
1.
Fact 1: is associative (画不出图’ ‘);
2.
Fact 2: is ’s identity and is the -inverse of ; and
3.
conclusion: forms a group.
Source transcription — WS25, p. 1, C. For vertical lines, the diagram records , , and .
15.2Intersections of nonvertical lines
Source transcription — WS25, p. 2, D. Let
be a nonvertical line. Substitution gives
Thus , and the source draws the implication .
Source transcription — WS25, p. 2, Fact 3. If is nonvertical and (the note says 最多有三个交点’ ‘), then must have roots, or two roots with one of multiplicity . The latter is annotated 此时有两个交点,其中一个为 tangent line’ ‘.
Source transcription — WS25, p. 2, Fact 4. For , the source writes: has a double root if and only if is tangent to at . It introduces as a vertical line and says the same double-root statement holds for after the corresponding substitution.
Remark
The only source statement about associativity is Fact 1 是 associative 的(画不出图).‘ ’ No proof is reconstructed here. The exact source location is WS25, p. 1, upper-right panel.
Chapter 16Homework 8
16.11. Automorphisms
An isomorphism from a group to itself is called an automorphism. Let denote the set of automorphisms of a group .
(a) Let and be group homomorphisms. Prove that is a group homomorphism.
(b) Let be a group isomorphism. Prove that the inverse function is also a group isomorphism.
(c) Prove that is a group with operation given by composition.
(d) Prove that .
(e) Prove that .
16.1.1(a)
For ,
So is a group homomorphism.
16.1.2(b)
Select arbitrary . Since is surjective, there are such that , , and . Hence
Therefore is a group homomorphism. And is an isomorphism since and are bijective.
16.1.3(c)
1.
The operation is associative.
For , part (a) shows that is a homomorphism, and it is an isomorphism since a composition of bijective functions is bijective.
1.
There is an identity element: the identity map sending to .
For every , .
1.
Every element has an inverse, proved by part (b).
For every , and
so is its inverse in .
16.1.4(d)
There are two elements in : and . There are two elements in : . So
Since all groups of order are isomorphic,
16.1.5(e)
There are three non-identity elements: . Denote them by , respectively. Any isomorphism is a homomorphism and hence . Thus elements of are ways to rearrange , which by definition is .
To build an isomorphism , send
16.22. Centers of groups
Let be a group. The center of is .
1.
Prove that is an abelian subgroup of .
2.
Compute the center of .
3.
Compute the center of .
4.
Compute the center of .
16.2.11.
Proof.
1.
, since for every , .
2.
is closed under the operation of . Take . For every , and . Thus
Therefore .
1.
is closed under inverse. Take . For arbitrary , . Multiplying by on the left gives ; multiplying on the right gives . Thus .
2.
is commutative: for , by definition.
By 1, 2, 3, and 4, is an abelian subgroup of .
16.2.22.
where is clockwise and denote reflections across the vertical, horizontal, and two diagonal axes, respectively. since it is the identity, and through calculation. But
So
16.2.33.
since it is the identity. Also,
So .
16.2.44.
Let . For arbitrary ,
and
Thus , hence ; , hence ; and , which is always true. So
16.33. Generating and
Consider the symmetric group , with . The goal is to prove that can be generated by only two elements.
(a) Let be a permutation, and a transposition. Show that .
(b) Show that . Conclude that every element of is the product of transpositions of the form .
(c) Let be the -cycle . Show that for all . Conclude that .
16.3.1(a)
Therefore
and
16.3.2(b)
Conclusion: every element of is the product of transpositions of the form .
16.3.3(c)
and
By (a),
Therefore , since by Theorem 7.26 each is a product of transpositions and every transposition is a product of transpositions of the form .
Consider the alternating group , the subgroup of consisting of all even permutations of , for . Let , with and .
(a) Suppose that and are not disjoint cycles. Show that is either the identity or a 3-cycle.
(b) Suppose that and are disjoint cycles. Show that is the product of two 3-cycles.
(c) Prove that is generated by the set of all 3-cycles of .
16.3.4(a)
Case 1: each of equals one of . Then ; since ,
Case 2: only one of equals one of . Without loss of generality, . Then
which is a 3-cycle. Therefore is either the identity or a 3-cycle.
16.3.5(b)
So is the product of two 3-cycles.
16.3.6(c)
For , write , where the are transpositions. Then
By (a) and (b), each is or a 3-cycle, or a product of 3-cycles. Note that
is also a product of two 3-cycles. Therefore is generated by the set of all 3-cycles of .
Chapter 17Homework 9
17.11. Prime-order groups
(a) Prove Fermat’s Little Theorem: if is prime and , then .
(b) If is a group of prime order , then is cyclic.
(c) A nontrivial group has no nontrivial proper subgroups if and only if is finite and of order where is prime.
17.1.1(a)
Claim 1. If is prime, then .
Proof. Take arbitrary prime . We prove it by induction on .
Basic step., so .
Inductive step. Assume . We show that . By the binomial theorem,
For every , and , so divides every term with denominator : since is prime, , otherwise must divide one of the factors in that product, which contradicts the bounds. Therefore
is still an integer, and
Thus divides , and therefore
This proves Claim 1.
Claim 2. Following Claim 1, if , then .
Proof. Let be an arbitrary prime and take arbitrary with . By Claim 1,
so . Since is prime, either or . Since , we get
Combining Claims 1 and 2 proves Fermat’s Little Theorem.
17.1.2(b)
Proof. Assume is prime, so and there is a non-identity element in . Select arbitrary non-identity . Then , since (with , otherwise would give ). By Lagrange’s Theorem,
Since is prime and , we have , which means . Hence is cyclic.
17.1.3(c)
First we prove the backward direction. Assume is finite and prime. Then for every subgroup , Lagrange’s Theorem gives . Since is prime, or , so is either trivial or itself. Therefore has no nontrivial subgroups.
For the forward direction, assume has no nontrivial proper subgroup. Case 1: has finite composite order. Then for some prime and . By Theorem 8.6, for every , . Pick . If , then has order at most and is nontrivial, a contradiction. If , then has order at most and is nontrivial, another contradiction.
Case 2: has infinite order. Select arbitrary non-identity and consider . If , then for some integer , so and ; this is a nontrivial proper subgroup of , a contradiction. If , then is itself a nontrivial proper subgroup of , again a contradiction. Thus the group cannot be infinite. It must have prime order.
17.22. Left and right cosets
For each of the following parts, is a subgroup of the group . Write down every element of every distinct right coset and every distinct left coset.
(a) and , with reflections .
(b) and .
(c) and , whose elements are
(d) and .
17.2.1(a)
There are two left/right cosets.
Left cosets:
1.
.
2.
.
Right cosets:
1.
.
2.
.
17.2.2(b)
There are three left/right cosets.
Left cosets:
1.
.
2.
.
3.
itself.
Right cosets:
1.
.
2.
.
3.
itself.
17.2.3(c)
. There are three left/right cosets.
Left cosets:
1.
.
2.
.
3.
.
Right cosets:
1.
.
2.
.
3.
.
17.2.4(d)
There are two left/right cosets.
Left cosets: and .
Right cosets: and .
17.33. Conjugacy classes
Any group acts on itself by conjugation: . The orbits of this action are called conjugacy classes.
1.
Show if and only if is a fixed point of the conjugation action.
2.
Show a subgroup of is normal if and only if it is a disjoint union of conjugacy classes.
3.
Describe the partition of into its conjugacy classes.
4.
Show that the only nontrivial normal subgroup of is .
17.3.11.
Forward direction. Assume is a fixed point of the conjugation action. Then for every , . Multiply by on both sides to get , so .
Backward direction. Assume . Then for every , , so . Hence is a fixed point of the conjugation action. Thus is a fixed point of the conjugation action if and only if .
17.3.22.
Forward direction. Assume is a disjoint union of conjugacy classes, i.e.
for some . Select arbitrary and fix it. Take arbitrary ; then for some , so . Thus and, for every , . By Theorem 8.11, is a normal subgroup of .
Backward direction. Assume is normal. Take arbitrary . By Theorem 8.11, , so for every , . Since is arbitrary, for every . Therefore is a union of conjugacy classes. Since orbits are either disjoint or identical, it is a disjoint union of conjugacy classes.
17.3.33.
The conjugacy classes in are:
These union to , with orders summing to .
17.3.44.
Let be a nontrivial normal subgroup of . First by the definition of subgroup. By part 2, is a disjoint union of conjugacy classes, so is one of the conjugacy classes that form . By Lagrange’s Theorem, .
Since , more conjugacy classes must be in the disjoint union. Since and the class of all 5-cycles has order , the all-5-cycles class must be one of the conjugacy classes; otherwise cannot divide . Now . Thus can only be or to divide , and all two-disjoint transpositions of order must be one of the classes.
There are three possibilities:
1.
.
2.
The preceding union together with .
3.
The preceding union together with .
A normal subgroup must be closed under operation and inverse. For case 1,
so it is not a subgroup. For case 3,
so it is not a subgroup. Therefore only case 2 can be a subgroup. Its elements are even, so it is . Thus is the only nontrivial normal subgroup of .
17.44. A group whose order is divisible by
Let be a prime, and a finite group with . Consider
where there are copies of . The group acts on by rotating elements:
1.
Show has elements, so .
2.
Show the orbits of the action either have or elements, and the orbits of order are either or of the form with .
3.
Show that contains an element of order .
17.4.11.
For any choice of , by existence and uniqueness of inverses there is a fixed such that . Therefore there are choices of and
so .
17.4.22.
For , the Orbit-Stabilizer Theorem gives
Consider for some . For every , , so ; therefore and . In this case either or , because means . Thus either or ; cannot be less than , since otherwise for some would contradict that is prime.
Otherwise, in at least some are different. Only when does , so and . Therefore the orbits of the action of on either have or elements, and the orbits of order are either or with .
17.4.33.
Every element of belongs to exactly one orbit. From part 2,
for some after reducing the -element orbits. Since , there must be an element distinct from such that . Therefore there must exist such that .
17.5Source notes
The handwritten proof for Problem 1(a) states the induction as “on ” after introducing a prime ; the typeset version retains that stated induction. In Problem 4(3), the source uses the notation while reducing orbit counts; it is transcribed as written.
Chapter 18Homework 10
18.11. Products of normal subgroups
Let be a group and let and be normal subgroups of .
(a) Show that .
(b) Prove that is a normal subgroup of .
(c) Prove that .
(d) Prove that the function given by is a surjective homomorphism with kernel .
(e) Prove that .
18.1.1(a)
Proof. Take arbitrary and . Since , , and since and , . Hence . Therefore for every ,
By Theorem 8.11, .
18.1.2(b)
Take arbitrary and . Then for some and . Thus
Since are normal, and , so for some and for some . Consequently
Therefore for every , . Hence .
18.1.3(c)
Take arbitrary and . Then for some and . Hence
Since , , so for some and for some . Therefore
So for every , . Therefore .
18.1.4(d)
Since , is a well-defined quotient group. For given by , let be an arbitrary element of . Then for some , where and . By definition,
Thus , so is surjective.
Since the identity of is ,
As for sure, .
18.1.5(e)
By the First Isomorphism Theorem,
and since ,
18.22. Quotients of familiar groups
In the following problem, it may help to use the First Isomorphism Theorem.
(a) Prove that (hint: consider the function ).
(b) Prove that .
(c) Prove that the subset
is a normal subgroup. What familiar group is isomorphic to?
18.2.1(a)
Proof. Consider the function sending to .
1.
is a group homomorphism. For ,
1.
is surjective. Since every is a nonzero complex number, for some and by Euler’s formula. Let . Then
1.
Note that if and only if , so .
By the First Isomorphism Theorem,
18.2.2(b)
Still consider the map sending
1.
is a group homomorphism. For ,
1.
is surjective, since for every , for some .
2.
if and only if , because for ,
So . By the First Isomorphism Theorem,
18.2.3(c)
First, the subset is a subgroup of : , and
so is closed under inverse as written in the source.
Then we show . Let be an arbitrary permutation and an arbitrary element. Write
for respectively representing a unique number in . Then
Thus . Therefore for every , . By Theorem 8.11, .
By Lagrange’s Theorem,
So , since every finite group of order is isomorphic to .
18.33. Groups of order
Let be a prime number. The goal of this problem is to prove that any group of order is abelian.
(a) Let act on itself by the conjugacy action defined in the previous problem set. Prove that if and only if the orbit (the conjugacy class) of has exactly one element.
(b) Use the Class Equation to deduce that divides . Thus there are two possibilities: or ; in the latter case is abelian.
(c) Suppose that and let with . Define to be the group generated by and every element of . Show that is abelian.
(d) Under the same assumptions, show that .
(e) Deduce in one line that is abelian.
(f) Give an example of a group with elements that is not abelian.
(g) Use the Class Equation to conclude that any -group satisfies .
18.3.1(a)
Proof.
Assume . Then for every , , hence
Thus . Conversely, assume . Then for every , , since , giving . Hence . Therefore if and only if .
18.3.2(b)
Let be representatives of the distinct conjugacy classes of not contained in . The Class Equation is
Since is prime and , every subgroup of can only have size or . For each , is a subgroup of with more than one element, so or . Hence
and . Thus either or .
18.3.3(c)
Let
and let
be two arbitrary elements. Then
Since every element of commutes with each other and , is abelian.
18.3.4(d)
Every subgroup of can only have order or . Since
we have . So .
18.3.5(e)
Since by (d) and is abelian by (c), is abelian.
18.3.6(f)
, but is not abelian.
18.3.7(g)
Let be a -group, so for some prime and . By the Class Equation,
Every subgroup of can only have size . For each , is a subgroup of with more than one element, so . Thus
and hence .
18.44. Finite abelian groups
Theorem 9.7: Fundamental Structure Theorem for Finite Abelian Groups. Let be a finite abelian group. Then is isomorphic to a group of the form
where are (not necessarily distinct) prime numbers. Moreover, the product is unique, up to re-ordering the factors.
(a) Suppose is abelian and has order . Use the Structure Theorem to show that, up to isomorphism, must be isomorphic to one of three possible groups, each a product of cyclic groups of prime-power order.
(b) Determine the number of abelian groups of order , up to isomorphism.
(c) For prime, how many isomorphism types of abelian groups of order ?
(d) If an abelian group of order has no element of order , prove that contains a Klein 4-group.
18.4.1(a)
Since the prime factorization of and is abelian with , the Structure Theorem gives
18.4.2(b)
. The possible isomorphism types are
There are two possible isomorphism types.
18.4.3(c)
There are five isomorphism types:
18.4.4(d)
The prime factorization of is . Since is abelian and ,
The first is impossible since is an order- element in it. Therefore
For the first, is a subgroup which is a Klein 4-group. For the second, is a subgroup which is a Klein 4-group.
18.5Source notes
The handwritten argument in Problem 2(c) labels closure under inverse immediately after listing the elements of ; this was retained. In Problem 4(d), the source’s product notation mixes and factors; the typeset form preserves the listed group decompositions and the stated Klein-four subgroups.