Problem 2
Exercise 301.1.
dd5746Let and . Let be a homomorphism defined by , , and . Show that .
Let . We will prove that
Define the map by . It is easily verified that this is a well defined homomorphism. It is also clearly surjective. It only remains to show injectivity.
Let . Note that the following rewrite rules when applied on preserve membership in :
Claim 301.2.
Any sequence of applications of the above rules will terminate, that is, a polynomial on which the rules cannot be applied will be obtained in a finite number of steps.
This is clear, since rules and reduce the degree of the polynomial, and while rule does not alter the degree, its applications are limited by the number of ‘s in the polynomial and the degree will have to be sacrificed eventually to get more ‘s.
It can be easily deduced that for any polynomial , any sequence of applications of the rules in must terminate in a polynomial in the set
Next, consider the map given by
Claim 301.3.
is injective.
Proof.
We will prove injectivity for monomials; the general case follows. Let and be two monomials in such that . Then,
Assume . The only possible cases are , or . WLOG, if , we have
which requires or , which together with imply . Thus, . and immediately follow.□
Claim 301.4.
1e43feFor a given polynomial , any sequence of applications of the rules in will terminate in the same polynomial.
Proof.
We have established that any polynomial obtained by application of the rules on stays in . Since is injective, no two elements of lie in the same coset of , so there is only one element of that can reduce to.□
For , denote the unique reduced polynomial by .
The same argument as in Claim 4 can be used to show that if and lie in the same coset of , then . Thus, we have a bijection between the cosets of and given by
Let . Since is a surjective homomorphism, there exists such that . It follows that , so is surjective, and hence bijective.
Claim 301.5.
is injective, and hence a bijection.
Proof.
□
Thus, . Together with the observation that , this immediately implies .
For my future self: yes, this is immediate. By the mapping property of quotient groups, there exists a unique homomorphism which makes this diagram commute:
Note that by construction, makes this diagram commute.
Alternate solution
Let I = (x³-yz, y²-xz, z²-x²y). Its easy to see I is contained in kernel. Now if you have any monomial x^i y^j z^k, you can write it (mod I) as x^i y^j z^k with j+k ⇐1. Point is replace y² with xz, z² with x²y, and yz with x^3(since these are equivalent mod I) to reduce powers of y,z.
So any polynomial in x,y,z can be written as p(x) + yq(x) + z r(x) modulo I. If you take the image under tbe homomorphism of this, you get p(t³) + t⁴q(t³) +t⁵r(t³). If the origianl polynomial was in the kernel, then the above polynomial in t is zero (modulo I does not change this as I is contained in kernel). Checking the coefficients of powers of t of the form 3k, 3k+1, 3k+2, gives you p=q=r=0. So the polynomial is 0 mod I i.e. it is contained in I.
Problem 8
Exercise 301.6.
Suppose and for each , . Then show that there is an isomorphism .
There must exist elements , , such that in . Further, these elements are unique: If some ‘s satisfied the same property, then
so for each , . Note that the LHS is a member of , and the RHS is a member of . Thus, we have for all . The same method can be used to prove that if and , then ; we will be using this shortly.
Before we proceed, we have to show that is indeed a ring. The only it is missing is an identity, and does the job. Indeed, for ,
since all the cross terms must lie in for some , and thus must be . Hence, , and we have
for all .
Define a map by
This is clearly a well defined map which respects addition. To see that it respects multiplication, pull the same trick as before: write
which then is equal to , so we have . Multiplication is okay!
All that’s left to prove is surjectivity. Take , and observe that
Exercise 301.7.
08d416If are ideals in , then show that there is an injective map .
Define the obvious map
That is a homomorphism is immediate. If are such that , then for all , so , so .
Exercise 301.8.
Suppose for all . If , then show that there exists such that for all .
We just have to show that the homomorphism in Exercise 7 is surjective given these hypotheses. For the pair , let and be the elements such that . Then, we have
where . Thus, we have shown that . Generally, we have for all . For , let be an element in such that , where . Note that and for .
Now, consider . We have
Problem 11
Exercise 301.9.
1bab8aLet be a surjective homomorphism. Let and be corresponding ideals. Show that is prime iff is prime.
Since and are corresponding ideals, we know , , and .
Assume is prime. Suppose such that . Since is surjective, and for some . Then , so , so or , hence or .
Assume is prime. Suppose such that . Then, , so either or , so or .
Exercise 301.10.
Describe all prime ideals in .
Let be a prime ideal of . Then is a prime ideal of (this holds whenever are commutative rings). We have two possibilities: , or for some prime .
Case 1: .
Stuff on localization
Lemma 301.11(Milne (2020) 1.11).
dcf5b4Consider a (commutative) integral domain and a multiplicative subset of . For an ideal of , let denote the ideal it generates in the localization ; for an ideal of , write for . Then:
- for all ideals of .
- if is a prime ideal of disjoint from .
Basically, we have maps in two directions between the set of ideals of and the set of ideals of called the expansion and contraction maps given by1
Contraction followed by expansion is the identity on the set of ideals of . Expansion followed by contraction is the identity when restricted to prime ideals of disjoint from .
Lemma 301.12.
a53acdLet be a (commutative) integral domain and let be a multiplicative subset of . The map is a bijection from the set of prime ideals in such that to the set of prime ideals in ; the inverse map is .
Proof.
Let be a prime ideal such that . It is easy to see that elements of are of the form , where and . Let such that . Then, . Since and , we have or , so or . Hence, is a prime ideal.
Let be a prime ideal. It is clear that is a prime ideal in . cannot contain any elements of , since if it did it would also contain .
Lemma 11 shows that the two maps are inverses.□
This provides the necessary context to understand Magidin (2012) .
Back to the problem at hand
If , we are done; otherwise, let . is a multiplicative set and . Localize at to obtain . Since is a PID and is a prime ideal in (by Lemma 12), is of the form for some irreducible2 polynomial . We may assume that has integer coefficients and that the gcd of its coefficients is (!).
From Lemma 12, we know that . This is precisely . Thus, is of the form for some irreducible polynomial .
Case 2: .
Consider the image of in . Since the map is onto, by Exercise 9 the image is prime. The prime ideals of are of the form where is monic and irreducible over . If the image is , then , and we are done.
Otherwise, let be a polynomial in that reduces to modulo and that is monic. Note that must be irreducible in , since any nontrivial factorization in would induce a nontrivial factorization in .
By the correspondence theorem, is the inverse image of under the projection homomorphism . We claim that . It is clear that since . Conversely, let . Then, there exists such that . If is a polynomial in such that it reduces to mod , then . Thus, there exists a polynomial such that . Therefore, , hence , giving equality.