MHB Greatest common divisor of two polynomials

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am working on Exercise 8 of Dummit and Foote Section 9.2 Exercise 8

====================================================================================

Determine the greatest common divisor of a(x) = x^3 - 2 and b(x) = x + 1 in \mathbb{Q} [x]

and write it as a linear combination (in \mathbb{Q} [x] ) of a(x) and b(x).

=====================================================================================

In working on this I applied the Division Algorithm to a(x) and b(x) resulting in x^3 - 2 = (x^2 - x + 1) (x+ 1) + (-3)

then

(x + 1) = (1/3 x + 1/3) + 0Last non-zero remainder is -3

Therefore, gcd is -3

BUT!

This does not seem to be correct because -3 does not divide either a(x) and b(x)

Can someone please help?

Peter
 
Physics news on Phys.org
Peter said:
I am working on Exercise 8 of Dummit and Foote Section 9.2 Exercise 8

==================================================

Determine the greatest common divisor of a(x) = x^3 - 2 and b(x) = x + 1 in \mathbb{Q} [x]

and write it as a linear combination (in \mathbb{Q} [x] ) of a(x) and b(x).

==================================================

In working on this I applied the Division Algorithm to a(x) and b(x) resulting in x^3 - 2 = (x^2 - x + 1) (x+ 1) + (-3)

then

(x + 1) = (1/3 x + 1/3) + 0Last non-zero remainder is -3

Therefore, gcd is -3

BUT!

This does not seem to be correct because -3 does not divide either a(x) and b(x)

Can someone please help?

Peter
$-3$ is a unit in $\mathbb{Q} [x]$, so is equivalent to $1$. You have shown that $$-\tfrac13(x^3-2) + \tfrac13(x^2-x+1)(x+1) = 1.$$ Thus $p(x)a(x)+q(x)b(x) = 1$, where $p(x) = -\frac13$ and $q(x) = \frac13(x^2-x+1)$. The polynomials $p(x)$ and $q(x)$ are both in $\mathbb{Q} [x]$.
 
I am an amateur but i tried doing your problem the way they do it here.

http://www.math.niu.edu/~beachy/abstract_algebra/study_guide/soln4.html

wolfram confirms their answer so it appears wolfram is giving answers over Q[x] for gcd command.

gcd (x^8-1, x^6 - 1) - Wolfram|Alpha

I am not encouraging you to cheat but WIA can be a valuable resource to check your work AFTER you get an answer by manual computation.

For your question WIA gives 1 as gcd.

gcd (x^3-2, x + 1) - Wolfram|Alpha

:)
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top