Chapter 4: Q21E-a (page 95)
Let a homomorphism of rings and define a function by the rule
Prove that
(a) is a homomorphism of rings
Short Answer
It is proved that is a homomorphism
Chapter 4: Q21E-a (page 95)
Let a homomorphism of rings and define a function by the rule
Prove that
(a) is a homomorphism of rings
It is proved that is a homomorphism
All the tools & learning materials you need for study success - in one app.
Get started for freeQuestion: The Euclidean Algorithm for finding gcd's is described for integers in Exercise 15 of Section 1.2. The process given there also works for polynomials over a field, with one minor adjustment. For integers, the last nonzero remainder is the gcd. For polynomials the last nonzero remainder is a common divisor of highest degree, but it may not be monic. In that case, multiply it by the inverse of its leading coefficient to obtain the gcd. Use the Euclidean Algorithm to find the gcd of the given polynomials:
Let be the set of all real numbers of the form
, with are .
(a) Show that is a subring of .
(b) Show that the function defined by is an isomorphism. You may assume the following nontrivial fact: 1T is not the root of any nonzero polynomial with rational coefficients. Therefore, Theorem 4.1 is true with and in place of . However, see Exercise 26.
(a) By counting products of the form (x+a) (x+b) show that there are exactly monic polynomials of degree 2 that are not irreducible in .
(b) Show that there are exactly monic irreducible polynomials of
degree 2 in .
if is a factor of .
Question:
What do you think about this solution?
We value your feedback to improve our textbook solutions.