Eisenstein's Criterion question.

  • Thread starter Thread starter Omukara
  • Start date Start date
Omukara
Messages
9
Reaction score
0
Hello,

I have a couple questions concerning Eisenstein's Criterion;

1) by making a substitution of the form x |-> x + a, show x^43 + 43x + 85 is irreducible over Q.

2) completely factorize into monic irreducible factors over Q for x^36 + 36x^8 - 405.I've only come across other examples to these which could be solved by recognizing that the polynomial resembled something similar to the binomial expansion of the form (x + 1)^n, but in these cases I cannot see how that would work.

Help would be, as always, much appreciated:)

(edit: sorry, only the first question is concerned with E's criterion, but help for either would be fantastic:])
 
Physics news on Phys.org
Hi Omukara! :smile:

For (1), what happens to the polynomial after you substitute (x+1) for x. Does that polynomial satisfy Eisensteins criterion?
 
hmm, I did consider (x+1)^43 + 43(x+1) + 85 at one point, but my lack of intuition makes it hard for me to understand why we make the substitution, since, if I'm not mistaken; if we take the prime p=43, immediately we can see E's criterion is satisfied.

Ah, I think I just had a light bulb moment after reading your comment a few more times:) we make the substitution to explicitly show that for all the coefficients of x of order between 42 and 1, E's criterion is satisfied since all such coefficients in (x+1)^43 will be a multiple of 43. So it follows that if it is irreducible for the substituion x+1, it is irreducible for x

Thank you so much!^_^EDIT: Just realized I wrote down the question incorrectly for question 2), the leading x was supposed to be of order 16, so it's more do-able now. Apologies!
 
Last edited:
Omukara said:
EDIT: Just realized I wrote down the question incorrectly for question 2), the leading x was supposed to be of order 16, so it's more do-able now. Apologies!

That doesn't only make it more doable, that makes it quite easy! First, do a substitution y=x8. You'll obtain a quadratic equation, and these kind of equations are easy to factorize!
 
##\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