Irreducibility Question (Rationals, Eisenstein)

  • Thread starter Thread starter mattmns
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving the irreducibility of the polynomial x^4 + 2x^2 + 2 in the context of rational coefficients using the Eisenstein Criterion.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to apply the Eisenstein Criterion but questions the completeness of their reasoning regarding the coefficients. Other participants raise points about the importance of the leading coefficient and its implications for the application of the criterion.

Discussion Status

Participants are exploring the conditions of the Eisenstein Criterion, with some clarifying the role of the leading coefficient in the context of monic polynomials. There is acknowledgment of differing definitions across sources, indicating a productive examination of the topic.

Contextual Notes

There is a noted discrepancy between different sources regarding the definition of the Eisenstein Criterion, particularly concerning the treatment of the leading coefficient in monic polynomials.

mattmns
Messages
1,129
Reaction score
5
Hello. I have this question from the book:

Prove that the polynomial [tex]x^4 + 2x^2 + 2[/tex] is irreducible in Q[x]. (Q being the rational fancy Q)
---

So I used Eisenstein Criterion (because we are dealing with the rationals) and said that the coefficents are: 1 (for x^4), 2(for x^2), 2 with the last 2 coefficients being the important ones. So I then said that let's use 2 as the prime, and then 2 | 2 (the middle coefficient), and 4 (2^2) does not divide 2 (the last coefficient), so [tex]x^4 + 2x^2 + 2[/tex] is not reducible in Q[x].

That seems quite acceptable to me, but the book has no examples, did I do the problem correctly? Danke!
 
Last edited:
Physics news on Phys.org
All the coefficients are important, 2 divides the x^3 and x coefficients trivially. More importantly, there's a condition about the lead coefficient that you haven't mentioned...
 
Thanks, I did not think about those. However, I am not sure what you are talking about with the leading coefficient (I am guessing you are talking about the 1 in front of x^4).

In my book the definition of The Eisenstein Criterion is:

Let [tex]f(x) = x^n + a_{1}x^{n-1} + .. + a_{n}[/tex] be a polynomial with integer coefficients. Suppose that there is some prime p such that [tex]p|a_{1}, p|a_{2}, ..., p|a_{n}[/tex], but p^2 does not divide [tex]a_{n}[/tex] Then f(x) is irreducible in Q[x].
Hmm... I just looked in another book, and on wikipedia, at the definition of The Eisenstein Criterion and they both mention a property about the first coefficient (1 for x^4); specifically: p cannot divide the first coefficient(1 for x^4). Which looks true too. Not sure why one of my books says that and the other does not. Thanks
 
Last edited:
Your book is assuming a "monic" polynomial- the "leading coefficient" (the coefficient of the highest power) is 1 and no prime divides that so it isn't necessary to mention it. Since factoring out a constant doesn affect irreducibility, the two forms are equivalent.
 
HallsofIvy said:
Your book is assuming a "monic" polynomial- the "leading coefficient" (the coefficient of the highest power) is 1 and no prime divides that so it isn't necessary to mention it. Since factoring out a constant doesn affect irreducibility, the two forms are equivalent.
You are absolutely correct, I missed that part! Thanks.
 

Similar threads

  • · Replies 18 ·
Replies
18
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K