MHB Field Extensions - Dummit and Foote Chapter 13 - Exercise 2, page 519

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Exercise Field
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
Dummit and Foote Chapter 13, Exercise 2, page 519 reads as follows:

"Show that x^3 - 2x - 2 is irreducible over \mathbb{Q} and let \theta be a root.

Compute (1 + \theta ) ( 1 + \theta + {\theta}^2) and \frac{(1 + \theta )}{ ( 1 + \theta + {\theta}^2)} in \mathbb{Q} (\theta)

---------------------------------------------------------------------------------------------------------------------------------

My attempt at this problem so far is as follows:

p(x) = x^3 - 2x - 2 is irreducible over \mathbb{Q} by Eisenstein's Criterion.

To compute (1 + \theta ) ( 1 + \theta + {\theta}^2) I adopted the simple (but moderately ineffective) strategy of multiplying out and trying to use the fact that \theta is a root of p(x) - that is to use the fact that {\theta}^3 - 2{\theta} - 2 = 0.

Proceeding this way one finds the following:

(1 + \theta ) ( 1 + \theta + {\theta}^2) = 1 + 2{\theta} + 2{\theta}^2 + {\theta}^3

= ({\theta}^3 - 2{\theta} - 2) + (2{\theta}^2 + 4{\theta} + 3)

2{\theta}^2 + 4{\theta} + 3

Well, that does not seem to be going anywhere really! I must be missing something!

Can someone please help with the above and also help with the second part of the question ...

Peter

[Note: The above has also been posted on MHF]
 
Physics news on Phys.org
Your answer to the first question is correct. The fact that:

$\theta^3 = 2\theta + 2$ serves to "knock down" any powers of $\theta$ higher than 2 in $\Bbb Q(\theta)$.

To compute the quotient, what we need to do is compute the multiplicative inverse of $1 + \theta + \theta^2$ in $\Bbb Q(\theta)$. The easiest way to do this is to compute the gcd of $x^3 - 2x - 2$ and $x^2 + x + 1$ using the division algorithm:

$x^3 - 2x - 2 = (x - 1)(x^2 + x + 1) - 2x - 1$

$x^2 + x + 1 = (-2x - 1)\left(-\dfrac{x}{2} - \dfrac{1}{4}\right) + \dfrac{3}{4}$

Therefore:

$1 = \left(\dfrac{4}{3}\right)\left(\dfrac{3}{4}\right) = \left(\dfrac{4}{3}\right)\left(x^2 + x + 1 + (-2x - 1)\left(\dfrac{x}{2} + \dfrac{1}{4}\right)\right)$

$= \left(\dfrac{4}{3}\right)\left(x^2 + x + 1 + [x^3 - 2x - 2 - (x - 1)(x^2 + x + 1)]\left(\dfrac{x}{2} + \dfrac{1}{4}\right)\right)$

$= \frac{1}{3}(2x + 1)(x^3 - 2x - 2) - \frac{1}{3}(2x^2 - x - 5)(x^2 + x + 1)$

Taking this last equation mod $x^3 - 2x - 2$, we see that in $\Bbb Q(\theta)$:

$\dfrac{1}{1+\theta+\theta^2} = \frac{1}{3}(5 + \theta - 2\theta^2)$.

Now, multiply the two.
 
##\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