Homework 10 M 373K by Mark Lindberg (mal4549)


 Malcolm George
 3 years ago
 Views:
Transcription
1 Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that and are algebraic numbers. To do this, we must provide a polynomial with integer coefficients that has each number as a root. I had fun doing this manipulation. x = x 7 = 3 2 (x 7) 3 = 2. (This step adds more roots, but we don t care about them since our number is still a root) x 3 21x x 345 = 0. A quick check verifies that is a root. x = We ll first take the quadratic with this and its complex conjugate as its roots: (x 3 i 5)(x + 3 i 5) = x 2 2 3x + 8. Now I will find the quadratic that, when multiplied by this, gives integer coefficients. I found it by multiplying term by term, and figuring the next term based on which terms needed to be cancelled in each step. (x 2 2 3x + 8)(x x + 8) = x 4 2 3x 3 + 8x x 3 12x x + 8x x + 64 = x 4 + 4x Again, a quick check verifies that is a root. 2. Artin, Chapter 11, Exercise 3.3. Find generators for the kernels of the following maps: (a) R[x, y] R defined by f(x, y) f(0, 0). Let the map be φ. The kernel of φ will be all polynomials whose constant term is 0, as f(0, 0) is always the constant term. This can be expressed as ker(φ) = {xa + yb a, b R[x, y]}, and so the generator is {x, y}. (b) R[x] C defined by f(x) f(2 + i). Let the map be φ. The kernel of φ will be all polynomials f(2 + i) = 0, so with 2 + i as a root. Then the polynomial must have a factor of the form x (2 + i). These can be expressed as ker(φ) = {(x (2 + i))a a R[x]}. Thus, the generator is {x (2 + i)}. (c) Z[x] R defined by f(x) f(1 + 2). Let the map be φ. The kernel of φ will be all polynomials f(1 + 2) = 0, so with as a root. To get a polynomial in Z[x], we must multiply this by its conjugate root, 1 2. Then the polynomial must have a factor of the form (x (1 + 2))(x (1 2)) = x 2 2x 1. These can be expressed as ker(φ) = {(x 2 2x 1)a a Z[x]}. Thus, the generator is {x 2 2x 1}. (d) Z[x] C defined by x Let the map be φ. The kernel of φ will be all polynomials such that f(x) = f( 2 + 3) = 0. Thus, following the same procedure as problem 1, = x x 3 = 2 (x 3) 2 = x 2 2 3x + 3 = 2 x 2 2 3x + 1 = 0. Then, to get a polynomial with coefficients in the integers, we must have, by again, the same procedure as above, (x 2 2 3x + 1)(x x + 1) = x 4 2 3x 3 + x x 3 12x x + x 2 2 3x + 1 = x 4 10x as a factor. Thus, ker(φ) = {a(x 4 10x 2 + 1) a Z[x]}, and so the generator is {x 4 10x 2 + 1}. (e) C[x, y, z] C[t] defined by x t, y t 2, z t 3. Here, note that under the mapping x 2 y = t 2 t 2 = 0, and x 3 z = t 3 t 3 = 0, and so both of these polynomials are in the kernel of this transformation. Now we will kill them, to consider C[x, y, z]/(x 2 y, x 3 z). Now consider any polynomial f(x, y, z) in this. Then replace all y terms with x 2, and z terms with x 3. Then we can write f as a polynomial just in terms of the variable x. Then since x t, this gets sent to a polynomial simply in terms of t. Let it be g(t). Then if we want to be in the kernel, g(t) = 0, but 1
2 since we want this for all t, basic algebra (finite polynomials have a finite number of zeros, and here we have an infinite number) says that g(t) 0, and so the kernel only has 1 element now, the 0 polynomial. Thus, x 2 y, x 3 z generates the kernel of C[x, y, z] C[t] on the twisted cubic as given. 3. Artin, Chapter 11, Exercises 3.12 and Let I and J be ideals of a ring R. Prove that the set I + J of elements of the form x + y, with x I and y J, is an ideal. This ideal is called the sum of the ideals I and J. Since both I and J are nonempty, I + J must be nonempty, and a subset of R. Let a 1, a 2 I + J. Then x 1, x 2 I and y 1, y 2 J, such that a 1 = x 1 + y 1, and a 2 = x 2 + y 2. Then a 1 + a 2 = x 1 + x 2 + y 1 + y 2, and by definition x 1 + x 2 I and y 1 + y 2 J, and thus a 1 + a 2 I + J. Let r R. Then ra 1 = r(x 1 + y 1 ) = rx 1 + ry 1, and by the definition of ideal, rx 1 I and ry 1 J, so rx 1 + ry 1 I + J. Thus, I + J meets all of the conditions of an ideal, and so it is Let I and J be ideals of a ring R. Prove that the intersection I J is an ideal. Show by example that the set of product {xy x Y, y J} need not be an ideal, but that the set of finite sums x v y v of products of elements of I and J is an ideal. This ideal is called the product ideal and is denoted by IJ. Is there a relation between IJ and I J. 0 I and 0 J, and therefore, 0 I J, and therefore, I J is nonempty. Let x 1, x 2 I J. Then x 1, x 2 I and x 1, x 2 J. Thus, x 1 + x 2 I and x 1 + x 2 J, and x 1 + x 2 I J, and therefore the set is closed under addition. Also, rx 1 I and rx 1 J, by definition, and therefore, rx 1 I J, and all conditions are met. Therefore, I J is an ideal. Let the ring be R[x, y]. Let I and J both be (x, y) = {ax + by a, b R}. Then x I, J and y I, J, so x 2, y 2 {ij i I, j J}. Now consider x 2 + y 2. We know that the sum of squares does not factor over the reals, so a, b R[x, y] such that ab = x 2 + y 2, and therefore, it s even more impossible for a, b I, J. Thus, x 2 + y 2 {ij i I, j J}, and the set is not closed under addition, and therefore cannot be an ideal. Let I, J be ideals over a ring R, and define IJ as the set of finite sums as above. 0 I and 0 J, and so 0 0 = 0 IJ, so the set is nonempty. Now consider some element x IJ. Then x = i 1 j i n j n for i 1,..., i n I and j 1,..., j n J. Then let r R, then rx = r(i 1 j i n j n ) = (ri 1 )j (ri n )j n, and because it is an ideal, ri 1,..., ri n I, and therefore, rx IJ. Now consider x 1, x 2 IJ. Then x 1 = i 1 j i n j n, and x 2 = i n+1 j n i m j m, m > n, for some i 1,..., i m I and j 1,..., j m J. Then x 1 + x 2 = i 1 j i n j n + i n+1 j n i m j m IJ, and so the set is closed under addition. Therefore, IJ meets all necessary conditions, and is an ideal. Let I and J be ideals of a ring R. Let x IJ. Then i 1,..., i n I and j 1,..., j n J such that x = i 1 j i n j n. Then, since i 1, j 1 R, i 1 j 1 J, and i 1 j i J, since they are both ideals, and this extends for any arbitrary i a j a, 1 a n. Thus, i 1 j i n j n I and i 1 j i n j n J, since ideals are closed under addition, and so x I J. Thus, IJ I J. However, this does not work the other direction. Consider I, J and R as above, (x, y) and R[x, y]. x I and x J, so x I J. But 2
3 x cannot be expressed as a sum of products of terms, since it can only be x 1, and 1 I or J. Thus, I J IJ in general, and all we can say is that IJ I J. 4. Playing with finite fields: Recall that finite subgroups of the multiplicative subgroups of fields are cyclic. Given a ring R, if R is cyclic, call a generator of R a primitive root for R (this generalizes the number theory terminology when R = Z/n). By the above, when R = F is a finite field, F is cyclic, hence there exists a primitive root of F. Recall from class that F p k can be realized as F p [x]/p (x) F p [x] where P (x) is a polynomial of degree k with coefficients in F p which is irreducible. Problem: Find primitive roots for the fields F 8 = F2 [x]/(x 3 + x + 1) F[x] (with elements a+bx+cx 2 for a, b, c F 2 ) and for F 9 = F[x]/(x 2 +1) (with elements a+bx for a, b F 3 ). To do it, you just need to show that some polynomial has multiplicative order equal to 7 in the first case and 8 in the second case. Hint: I will do the baby case of F 4 in class on Thursday! F 8 = F2 [x]/(x 3 + x + 1) F 2 [x]: First, we must show that x 3 + x + 1 is irreducible in F 2 [x] = Z/2[x]. Consider the elements of Z/2 x 0 (mod 2): x 3 + x = 1 0 (mod 2). x 1 (mod 2): x 3 + x = (mod 2). Therefore, there are no zeroes of x 3 + x + 1 in Z/2. By the result from problem 8, the only unit in F 2 [x] is 1, and therefore the polynomial x 3 +x+1 has neither any proper factors nor is a unit, and is therefore irreducible. Thus, the isomorphism holds, by the identity from class. Now we have that x 3 + x + 1 = 0, so x 3 + x = 1 and x 3 = 1 x. Then consider the element x, and take x 7. By an earlier homework, if x 7 1, then order(x) 7, so order(x) = 1 or 7, and x 1, so order(x) 1. Now note that x 7 = x x 3 x 3 = x( 1 x)( 1 x) = x 3 + 2x 2 + x = 1 1, because 2 0 and 1 1 in F 2. Therefore, x has order 7, and F 8 = (F 2 [x]/(x 3 + x + 1) F 2 [x]) has 7 elements, and therefore, we have found a primitive root, by definition. F 9 = F3 [x]/(x 2 + 1) F 3 [x]: First, we must show that x is irreducible in F 3 [x] = Z/3[x]. Consider the elements of Z/3 x 0 (mod 3): x = 1 0 (mod 3). x 1 (mod 3): x = 2 0 (mod 3). x 2 (mod 3): x = (mod 3). Therefore, there are no zeroes of x 2 +1 in Z/2. By the result from problem 8, the only unit in F 3 [x] are 1 and 2, and therefore the polynomial x has neither any proper factors nor is a unit, and is therefore irreducible. Thus, the isomorphism holds, by the identity from class. Now we have that x = 0 or x 2 = 1. Consider the element x + 2. x (x + 2) 2 = x 2 + 4x + 4 = x x = x 1, (x + 2) 4 = x 2 = 1 1, and (x + 2) 8 = ( 1) 2 = 1, and since the only numbers which divide 8 are 1, 2, 4, and we showed that x + 2, (x + 2) 2, (x + 2) 4 are not 1, and so x + 2 has order 8. Since F 9 = F 3 [x]/(x 2 + 1) F 3 [x] has 8 elements, and therefore, we have found a primitive root, by definition. 3
4 5. Chinese Remainder Theorem revisited: Recall from Homework 5, problem 4 the isomorphism of groups Z/r Z/s = Z/rs when gcd(r, s) = 1. There were two isomorphisms we defined: ϕ : Z/r Z/s Z/rs given by ϕ(ā, b) = sa + rb, and ψ : Z/rs (Z/r Z/s) given by ā (ā, ā). Show that ψ is a ring homomorphism, and hence an isomorphism of rings, but not ϕ. Hence, conclude that ϕ cannot be the inverse of ψ (we already pointed this out in Homework 5, problem 4). Bonus: More generally, if I, J R are ideals such that I + J = R, then the map R/I R/J R/(I J) given by (a + I, b + J) a + b + (I J) is an isomorphism, broadly generalizing the Chinese Remainder Theorem (cf. Problem 3 above). First, we will show that ϕ is not a ring homomorphism. To be a ring homomorphism, in addition to preserving addition (ϕ(a 1 + a 2, b 1 + b 2 ) = ϕ(a 1, b 1 )ϕ(a 2, b 2 )), the property we proved already, a ring homomorphism must also preserve multiplication. However, but ϕ(a 1 a 2, b 1 b 2 ) = ϕ(a 1 a 2, b 1 b 2 ) = sa 1 a 2 + rb 1 b 2 ϕ(a 1, b 1 )ϕ(a 2, b 2 ) = (sa 1 + rb 1 ) (sa 2 + rb 2 ) = (sa 1 + rb 1 ) (sa 2 + rb 2 ) = s 2 a 1 a 2 + sra 1 b 2 + rsb 1 a 2 + r 2 b 1 b 2 = s 2 a 1 a 2 + r 2 b 1 b 2 Where the last two steps can occur because we are working in a commutative ring, and rs = sr 0 (mod rs). However, sa 1 a 2 + rb 1 b 2 s 2 a 1 a 2 + r 2 b 1 b 2, because s 2 s (mod rs) in general, so this is not a ring homomorphism. Now let us examine ψ. and ψ(a + b) = (a + b, a + b) = (a, a) + (b + b) = ψ(a) + ψ(b) ψ(ab) = (ab, ab) = (a, a) (b, b) = ψ(a) ψ(b) and finally, ψ(1) = (1, 1), and so the map preserves addition and multiplication, in addition to the multiplicative identity, and therefore, it is a ring homomorphism. Thus, since we already showed that it was a group isomorphism, we can extend this to say it is a ring isomorphism as well. The inverse of an isomorphism is, by definition, an isomorphism, and therefore, since ϕ is not even a homomorphism, much less an isomorphism, it cannot be the case that ϕ is the inverse of ψ. 4
5 6. (a) Using the ring isomorphism Z/rs Z/r Z/s, show that we have an isomorphism (Z/rs) = (Z/r) (Z/s) of groups of units (i.e., invertible elements under multiplication). This allows you to compute (Z/n) by decomposing n as a product of prime powers, and reduces the problem to (Z/p n ). (b) Show that (Z/n) cannot be cyclic (i.e., there is no primitive root modulo n) unless n is either a prime power or twice a prime power. Bonus for those who like number theory: Show that, conversely, (Z/p k ) is cyclic of order p k 1 (p 1) if p 3 (so there is a primitive root modulo p k for p 3), whereas (Z/2 k ) = Z/2 Z/2 k 2 (so there is not a primitive root modulo 2 k for k 3). (This together with the assigned part allows you to get the whole structure of (Z/m) for arbitrary m.) Hint: Observe first that the cyclic multiplicative subgroup of Z/p k generated by 1 + p k 1 is {1 + p k 1 a 0 a p 1}. Inductively, you can then prove that the cyclic multiplicative subgroup of Z/p k generated by 1 + p j is {1 + p j a 0 a p k j 1} (the inductive step will require at some point that (p, j) (2, 1), but that s ok since we assumed p 3). Applied to j = 1 gives that 1 + p generates everything congruent to one modulo p, which is therefore a cyclic group of (Z/p k ) of order p k 1. Finally, take a primitive root modulo p, say 1 a p 1, and consider a pk 1, which must have order p 1, so that a pk 1 (p 1) is a primitive root (of order (p 1)p k 1 ) in Z/p k 1 Z. The same proof works in the case p = 2 to show (Z/2 k ) = Z/2 Z/2 k 2. (a) Note: We assume that gcd(r, s) = 1 again, because this is not true otherwise. Let ψ : (Z/rs) (Z/r) (Z/s) be given by ψ : a (a, a). First, we will show that this is a homomorphism: ψ(ab) = (ab, ab) = (a, a)(b, b) = ψ(a)ψ(b). Therefore, ψ is a homomorphism. Now we will show ψ is an isomorphism. The identity of (Z/r) (Z/s) is (1, 1). Now consider any a such that ψ(a) = (1, 1). Now this means that a 1 (mod r) and a 1 (mod s). Then we have by a property of number theory that a 1 (mod rs) (s a 1, r a 1 s = (a 1)x, r = (a 1)y rs = (a 1)(a 1)xy rs a 1). Therefore, a = 1, and so the kernel of ψ is 1. This shows by an earlier homework that ψ is injective. Now consider the relative size of the groups. Any number which is relatively prime to r will have an inverse in Z/r, and therefore, be a unit and in (Z/r), by some basic properties of number theory (I can turn in all of my number theory HW if you want...). Then the same applies for (Z/s). This means that there are φ(r) units in Z/r, and φ(s) units in Z/s, or equivalently Z/s = φ(s) and Z/r = φ(r), where φ is the Euler Totient function, and φ(a) is the number of numbers less than a which are relatively prime to it. Similarly Z/rs = φ(rs). Since gcd(r, s) = 1, a basic property of number theory (Again, I ve proved this on a number theory HW at some point. See Schedler s wife s website.) says that φ(rs) = φ(r)φ(s), and therefore, Z/rs = Z/s Z/r, and therefore, the groups are the same size (Number of Cartesian products is product of number of elements in the first group times the number of elements in the second group.). Thus, ψ is an injective homomorphism between two groups of equal size, and therefore, by an earlier homework, ψ is an isomorphism. (b) Any positive integer n can be expressed as 2 r p s m, for gcd(p, 2) = 1 and gcd(p, m) = 1, and gcd(2, m) = 1 by taking the prime factorization, extracting the powers of two, and then one other prime and its powers, and then multiplying the rest back 5
6 together to get m. Then by part (a), we have that (Z/n) = (Z/2 r p s m) = (Z/2 r ) (Z/p s m) = (Z/2 r ) (Z/p s ) (Z/m). Then as noted above, and seen before, to be cyclic, at most one of the three factors can be an even cyclic group, otherwise the Klein fourgroup would be a subgroup, which cannot happen in a cyclic group. Now let us examine what it would mean for each of the groups given to have odd order, using the Euler Totient function φ as seen in part (a): 2 r : Z/2 r = φ(2 r ) = 2 r 1 (2 1) = 2 r 1. For 2 r 1 to be odd, we must have that r 1 = 0, or r = 1, and thus, if it exists, for it not to be an even cyclic group, this group must be of the form Z/2. p s : Z/p s = φ(p s ) = p s 1 (p 1). But p must be a prime not equal to 2, so p must be odd, and therefore, p 1 must be even, so if this group exists, it can never have odd order. m: Z/m = φ(m). Now write m in its unique prime factorization, and note that it will have each prime factor raised to a power, and since each prime factor to a power is relatively prime to all of the others, we can use the fact that φ(ab) = φ(a)φ(b), where a and b are the primes to the powers, and each of these must be even if they exist, by the same reasoning as above, and so if this group exists, it can never have odd order. Then if (Z/n) is cyclic, since we always pull out a prime factor for the second group, this means that m = 1, and so the third group never exists, and also, we either have that the first group does not exist, or it is only Z/2. Thus, we have that either n = p k or n = 2p k. 7. Artin, Chapter 11, Exercise 4.3. Identify the following rings. Note: Identify the rings means to rewrite them in terms we already know; for example, Z[x]/(x 2 d), we get an isomorphism Z[x]/(x 2 d) Z[ d] sending x to d (and which is the identity on Z). (a) Z[x]/(x 2 3, 2x + 4). We will look at what it means to kill off these elements. That is, let x 2 3 = 0, or x 2 = 3, and 2x + 4 = 0, or 2x = 4. We wish to combine these to see if we can find any simplifications, so we want an x 2 term in the second equation. We multiply both sides by x to get 2x 2 = 2(3) = 6 = 4x = 2(2x) = 2( 4) = 8. Since we have really been working with congruence classes so far, this means than 6 = 8, or 0 = 2. Then we can work in Z/2Z, and so 2x + 4 = 0, and x 2 3 = x = x 2 2x + 1 = (x 1) 2. Thus, Z[x]/(x 2 3, 2x + 4) = (Z/2Z)/((x 1) 2 ). (b) Z[i]/(2+i). Again, let s see what happens when 2+i = 0. This means than i = 2, or i 2 = 1 = 4. Again, since we are using congruence classes, this means than 1 = 4, or 0 = 5. Therefore, Z[i]/(2 + i) = Z/5Z. (c) Z[x]/(6, 2x 1). We have that 6 = 0, and 2x 1 = 0, or 2x = 1. Then 3(2x) = 6x = 0 = 3(1) = 3, and so 3 = 0. Working in Z/3Z, we have that 2x 1 = 2x + 2, and so Z[x]/(6, 2x 1) = (Z/3Z)[x]/(2x + 2). (d) Z[x]/(2x 2 4, 4x 5). Here, we have that 2x 2 = 4, and 4x = 5. Squaring the second yields that 16x 2 = 8(2x 2 ) = 8(4) = 32 = 5 2 = 25, or 0 = 7. Thus, we can work in 6
7 Z/7Z. Here, 2(4x 5)(2x 1) = 16x 2 20x 8x 10 2x 2 21x + 4 2x and therefore 4x 5 2x 2 + 4, and so Z[x]/(2x 2 4, 4x 5) = (Z[x]/6Z)/(4x 5). (e) Z[x]/(x 2 + 3, 5). Here, it s fairly obvious that 5 = 0 means that we are working in Z/5Z, and x is unchanged, so Z[x]/(x 2 + 3, 5) = (Z/5Z)[x]/(x 2 + 3). Note that x 0: x (mod 5). x 1: x (mod 5). x 2: x (mod 5). x 3: x (mod 5). x 4: x (mod 4). And thus x has no zeroes, and thus no factors, simplest form above. (mod 5), and we have found the 8. Artin, Chapter 11, Exercise 7.2. Let R be a domain. Prove that the polynomial ring R[x] is a domain, and identify the units in R[x]. Proof by Contradiction: Since R is a domain, by definition, a, b R, ab = 0 a = 0 or b = 0. Now consider two nonzero polynomials, f(x), g(x) R[x], with f(x)g(x) = 0. Since they are nonzero, f(x) = a n x n + a n 1 x n a 1 x + a 0, and g(x) = b m x m + b m 1 x m b 1 x + b 0, a n, b m 0, for some n, m. Then f(x)g(x) = a n b m x n+m + (a n b m 1 +a n 1 b m )xn + m 1+ +(a 0 b 1 +a 1 b 0 )x+a 0 b 0 = 0. Since this must be true for all x, it must be the case that each of the coefficients, a n b m, a n b m 1 + a n 1 b m,..., a 0 b 1 + a 1 b 0, a 0 b 0 = 0 (Else our polynomial would have at most m + n < zeroes, which is a contradiction.). Consider a n b m = 0. Here, a n, b n R, a domain, so either a n = 0 or b m = 0. This contradicts the definition of our polynomials, and therefore, it cannot be the case that both of our polynomials is nonzero. Thus, f(x)g(x) = 0 f(x) = 0 or g(x) = 0, and so, by definition, R[x] is a domain. Now I will demonstrate the units. Let f(x), g(x) be units, so f(x)g(x) = 1, and be written as before. Now since f(0)g(0) = a 0 b 0 = 1, it must mean that a 0, b 0 are units, and a 0, b 0 0. Also, it means that, if n 1 or m 1, and therefore, at least one of the polynomials is nonconstant, then f(x)g(x) a 0 x 0 = a n b m x n+m + (a n b m 1 + a n 1 b m )xn + m (a 0 b 1 + a 1 b 0 )x = 0, and this product still has at least the x n+m term, because n + m 1. Then by the same argument as above, this means that a n b m = 0 and therefore, either a n = 0 or b m = 0, which contradicts the fact that these are polynomials of degree n and m respectively, and therefore, it must be the case that n = m = 0, and both polynomials are constant. Therefore, the only units in R[x] are constants. Then we see that for any unit u R, u, u 1 R[x], and so u is still a unit, and all units of R are units of R[x]. Similarly, if a R is not a unit, then it has no inverse, and there are no constant terms in R[x] that are not in R, and so a R[x] has no inverse, and is not a unit. Therefore, the units of R[x] are the units of R. 9. Artin, Chapter 12, Exercise 2.1. Factor the following polynomials into irreducible factors in F y [x]. Note: you should not need to use anything from Chapter 12 beyond what was in Thursday s lecture (4/23/15), just the definitions in (12.2.1). 7
8 (a) x 3 + x 2 + x + 1, p = 2. We see that since 3 1 (mod 2), when working in Z/2 = F 2, x 3 + x 2 + x + 1 = x 3 + 3x 2 + 3x + 1 = (x + 1) 3, the irreducible factorization. (b) x 2 3x 3, p = 5. Again with congruences, we have that x 2 3x 3 = x 3 3x + 2 = (x 2)(x 1), the irreducible factorization. (c) x 2 + 1, p = 7. Consider all perfect squares (mod 7): x 0 (mod 7): Then x (mod 7). x 1 (mod 7): Then x (mod 7). x 2 (mod 7): Then x (mod 7). x 3 (mod 7): Then x (mod 7). x 4 (mod 7): Then x (mod 7). x 5 (mod 7): Then x (mod 7). x 6 (mod 7): Then x (mod 7). Thus, having exhausted all possibilities, we see that there are no integers x such that x 2 1 (mod 7), and so there are no numbers which x factors into in Z/7, so it is, by definition, irreducible. 10. Artin, Chapter 12, Exercise 5.1. Factor the following into primes in Z[i]. You should only need the following results: A unit in the Gaussian integers is one of 1, 1, i, or i, and the Gaussian primes (or equivalently irreducibles) are exactly the numbers of the following forms: p Z an integer prime with p 3 (mod 4), a + bi for a, b Z and a 2 + b 2 = p an integer prime with p 1 (mod 4), 1 + i, Associates of the above. (a) 1 3i. This can be written as 2 3i + (i) 2, and factored as a quadratic in i, so i 2 3i + 2 = (i 2)(i 1)Then i 1 = i(i + 1), and as stated above, i + 1 is prime. Then i(i 2) = 1 2i. We see that ( 1) 2 + ( 2) 2 = = 5 1 (mod 4), and 5 is an integer prime, so 1 2i is prime. Thus, 1 3i = (i + 1)( 1 2i) is the prime factorization. (b) 10 = = (1 + 3i)(1 3i). We see that 1 + 3i = 2 + 3i + (i) 2 = (i + 2)(i + 1). As seen above, i + 2 and i + 1 are primes. Also, the previous problem showed that 1 3i is (i + 1)( 1 2i), so 10 = (i + 1)( 1 2i)(i + 2)(i + 1) is the prime factorization. (c) 6 + 9i i = (3)(2 + 3i). Here, 3 is an integer prime and 3 3 (mod 4). Also, = = 13, and 13 is an integer prime and 13 1 (mod 4). Thus, both 3 and (2+3i) are primes, and therefore, 6+9i = (3)(2 + 3i) is the prime factorization. (d) 7 + i. Here, 7 + i = 6 + i 1( 1) = i 2 + i + 6 = ( i + 3)(i + 2) = i(1 + 3i)(i + 2) = (1 2i)(i + 1)(i + 2), and as seen above, i + 1 and i + 2 are prime, and since (1) 2 + ( 2) 2 = = 5 1 (mod 4) is prime, 1 2i is prime as well, so 7 + i = (1 2i)(i + 1)(i + 2), is the prime factorization. 8
Section 18 Rings and fields
Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)
More informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:1011:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationALGEBRA AND NUMBER THEORY II: Solutions 3 (Michaelmas term 2008)
ALGEBRA AND NUMBER THEORY II: Solutions 3 Michaelmas term 28 A A C B B D 61 i If ϕ : R R is the indicated map, then ϕf + g = f + ga = fa + ga = ϕf + ϕg, and ϕfg = f ga = faga = ϕfϕg. ii Clearly g lies
More informationDMATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
DMAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the nth cyclotomic polynomial
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationMATH RING ISOMORPHISM THEOREMS
MATH 371  RING ISOMORPHISM THEOREMS DR. ZACHARY SCHERR 1. Theory In this note we prove all four isomorphism theorems for rings, and provide several examples on how they get used to describe quotient rings.
More informationφ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b),
16. Ring Homomorphisms and Ideals efinition 16.1. Let φ: R S be a function between two rings. We say that φ is a ring homomorphism if for every a and b R, and in addition φ(1) = 1. φ(a + b) = φ(a) + φ(b)
More information1 First Theme: Sums of Squares
I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer
More informationAlgebraic structures I
MTH5100 Assignment 110 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationIdeals, congruence modulo ideal, factor rings
Ideals, congruence modulo ideal, factor rings Sergei Silvestrov Spring term 2011, Lecture 6 Contents of the lecture Homomorphisms of rings Ideals Factor rings Typeset by FoilTEX Congruence in F[x] and
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 1113 of Artin. Definitions not included here may be considered
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationCSIR  Algebra Problems
CSIR  Algebra Problems N. Annamalai DST  INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli 620024 Email: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationIntroduction to Ring Theory
Introduction to Ring Theory Sachi Hashimoto Mathcamp Summer 2015 1 Day 1 1.1 What are we talking about? Broadly speaking, a ring is a set of objects which we can do two things with: add and multiply. In
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationMATH 361: NUMBER THEORY TENTH LECTURE
MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a
More informationLecture 3. Theorem 1: D 6
Lecture 3 This week we have a longer section on homomorphisms and isomorphisms and start formally working with subgroups even though we have been using them in Chapter 1. First, let s finish what was claimed
More information2a 2 4ac), provided there is an element r in our
MTH 310002 Test II Review Spring 2012 Absractions versus examples The purpose of abstraction is to reduce ideas to their essentials, uncluttered by the details of a specific situation Our lectures built
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2007 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth the same
More informationU + V = (U V ) (V U), UV = U V.
Solution of Some Homework Problems (3.1) Prove that a commutative ring R has a unique 1. Proof: Let 1 R and 1 R be two multiplicative identities of R. Then since 1 R is an identity, 1 R = 1 R 1 R. Since
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More informationIUPUI Qualifying Exam Abstract Algebra
IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationMath Introduction to Modern Algebra
Math 343  Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationAbstract Algebra II. Randall R. Holmes Auburn University
Abstract Algebra II Randall R. Holmes Auburn University Copyright c 2008 by Randall R. Holmes Last revision: November 30, 2009 Contents 0 Introduction 2 1 Definition of ring and examples 3 1.1 Definition.............................
More informationLecture 7.3: Ring homomorphisms
Lecture 7.3: Ring homomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 7.3:
More informationALGEBRA HW 4. M 0 is an exact sequence of Rmodules, then M is Noetherian if and only if M and M are.
ALGEBRA HW 4 CLAY SHONKWILER (a): Show that if 0 M f M g M 0 is an exact sequence of Rmodules, then M is Noetherian if and only if M and M are. Proof. ( ) Suppose M is Noetherian. Then M injects into
More informationAbstract Algebra II. Randall R. Holmes Auburn University. Copyright c 2008 by Randall R. Holmes Last revision: November 7, 2017
Abstract Algebra II Randall R. Holmes Auburn University Copyright c 2008 by Randall R. Holmes Last revision: November 7, 2017 This work is licensed under the Creative Commons Attribution NonCommercialNoDerivatives
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationMath 581 Problem Set 6 Solutions
Math 581 Problem Set 6 Solutions 1. Let F K be a finite field extension. Prove that if [K : F ] = 1, then K = F. Proof: Let v K be a basis of K over F. Let c be any element of K. There exists α c F so
More informationMath Introduction to Modern Algebra
Math 343  Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationMath 210B:Algebra, Homework 2
Math 210B:Algebra, Homework 2 Ian Coley January 21, 2014 Problem 1. Is f = 2X 5 6X + 6 irreducible in Z[X], (S 1 Z)[X], for S = {2 n, n 0}, Q[X], R[X], C[X]? To begin, note that 2 divides all coefficients
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationQuasireducible Polynomials
Quasireducible Polynomials Jacques Willekens 06Dec2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:1011:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/33/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationMATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions
MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More informationSolutions for Some Ring Theory Problems. 1. Suppose that I and J are ideals in a ring R. Assume that I J is an ideal of R. Prove that I J or J I.
Solutions for Some Ring Theory Problems 1. Suppose that I and J are ideals in a ring R. Assume that I J is an ideal of R. Prove that I J or J I. SOLUTION. Assume to the contrary that I is not a subset
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
More informationMath 762 Spring h Y (Z 1 ) (1) h X (Z 2 ) h X (Z 1 ) Φ Z 1. h Y (Z 2 )
Math 762 Spring 2016 Homework 3 Drew Armstrong Problem 1. Yoneda s Lemma. We have seen that the bifunctor Hom C (, ) : C C Set is analogous to a bilinear form on a Kvector space, : V V K. Recall that
More informationMATH 113 FINAL EXAM December 14, 2012
p.1 MATH 113 FINAL EXAM December 14, 2012 This exam has 9 problems on 18 pages, including this cover sheet. The only thing you may have out during the exam is one or more writing utensils. You have 180
More informationISOMORPHISMS KEITH CONRAD
ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationFinite Fields. Sophie Huczynska. Semester 2, Academic Year
Finite Fields Sophie Huczynska Semester 2, Academic Year 200506 2 Chapter 1. Introduction Finite fields is a branch of mathematics which has come to the fore in the last 50 years due to its numerous applications,
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationLecture 2. (1) Every P L A (M) has a maximal element, (2) Every ascending chain of submodules stabilizes (ACC).
Lecture 2 1. Noetherian and Artinian rings and modules Let A be a commutative ring with identity, A M a module, and φ : M N an Alinear map. Then ker φ = {m M : φ(m) = 0} is a submodule of M and im φ is
More informationPh.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018
Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationCDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018
CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and
More informationAutomorphism Groups Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G.
Automorphism Groups 992012 Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G. Example. The identity map id : G G is an automorphism. Example.
More informationand this makes M into an Rmodule by (1.2). 2
1. Modules Definition 1.1. Let R be a commutative ring. A module over R is set M together with a binary operation, denoted +, which makes M into an abelian group, with 0 as the identity element, together
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a notnecessarily commutative ring with 1 in which any nonzero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationHOMEWORK 3 LOUISPHILIPPE THIBAULT
HOMEWORK 3 LOUISPHILIPPE THIBAULT Problem 1 Let G be a group of order 56. We have that 56 = 2 3 7. Then, using Sylow s theorem, we have that the only possibilities for the number of Sylowp subgroups
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More information15. Polynomial rings DefinitionLemma Let R be a ring and let x be an indeterminate.
15. Polynomial rings DefinitionLemma 15.1. Let R be a ring and let x be an indeterminate. The polynomial ring R[x] is defined to be the set of all formal sums a n x n + a n 1 x n +... a 1 x + a 0 = a
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning  F is closed under
More informationHandout  Algebra Review
Algebraic Geometry Instructor: Mohamed Omar Handout  Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationFinite Fields. Sophie Huczynska (with changes by Max Neunhöffer) Semester 2, Academic Year 2012/13
Finite Fields Sophie Huczynska (with changes by Max Neunhöffer) Semester 2, Academic Year 2012/13 Contents 1 Introduction 3 1 Group theory: a brief summary............................ 3 2 Rings and fields....................................
More informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR  last time  we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc.  from there we can use CRT to construct
More informationA few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in
A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough
More informationDMATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
DMATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationSummer Algebraic Geometry Seminar
Summer Algebraic Geometry Seminar Lectures by Bart Snapp About This Document These lectures are based on Chapters 1 and 2 of An Invitation to Algebraic Geometry by Karen Smith et al. 1 Affine Varieties
More information