Factorization of Polynomials - Irreducibles - Anderson and Feil

In summary, Anderson and Feil, in their book "A First Course in Abstract Algebra," prove that the polynomial \(f = x^2 + 2\) is irreducible in \(\mathbb{Q}[x]\). They then challenge the reader to show that \(x^4 + 2\) is also irreducible in \(\mathbb{Q}[x]\), using the discussion of \(x^2 + 2\) as a guide. This can be done using Eisenstein's Irreducibility Criterion. To delete old attachments, go to "My Settings" in the user control panel and click on "Edit Attachments."
  • #1
Math Amateur
Gold Member
MHB
3,998
48
I am reading Anderson and Feil - A First Course in Abstract Algebra.

On page 56 (see attached) ANderson and Feil show that the polynomial [TEX] f = x^2 + 2 [/TEX] is irreducible in [TEX] \mathbb{Q} [x][/TEX]

After this they challenge the reader with the following exercise:

Show that [TEX] x^4 + 2 [/TEX] is irreducible in [TEX] \mathbb{Q} [x][/TEX]. taking your lead from the discussion of [TEX] x^2 + 2 [/TEX] above. (see attached)

Can anyone help me to show this in the manner requested. Would appreciate the help.

Peter
 
Physics news on Phys.org
  • #2
Peter said:
I am reading Anderson and Feil - A First Course in Abstract Algebra.

On page 56 (see attached) ANderson and Feil show that the polynomial [TEX] f = x^2 + 2 [/TEX] is irreducible in [TEX] \mathbb{Q} [x][/TEX]

After this they challenge the reader with the following exercise:

Show that [TEX] x^4 + 2 [/TEX] is irreducible in [TEX] \mathbb{Q} [x][/TEX]. taking your lead from the discussion of [TEX] x^2 + 2 [/TEX] above. (see attached)

Can anyone help me to show this in the manner requested. Would appreciate the help.

Peter

Hi Peter, :)

I don't see any attachments in your post. You can use a image hosting website such as TinyPic to upload images and link them here, if you have trouble attaching files.

To show that \(x^4 + 2\) is irreducible over \(\mathbb{Q}[x]\) you can use Eisenstein's Irreducibility Criterion.
 
  • #3
Sudharaka said:
Hi Peter, :)

I don't see any attachments in your post. You can use a image hosting website such as TinyPic to upload images and link them here, if you have trouble attaching files.

To show that \(x^4 + 2\) is irreducible over \(\mathbb{Q}[x]\) you can use Eisenstein's Irreducibility Criterion.
Thanks - most helpful - appreciate your help

The reason I did not upload the attachement was that I could not delete my old attachements - about 5 or so are there and they exceed my allowed quota _ I cannot seem to delete them

Peter
 
  • #4
Peter said:
Thanks - most helpful - appreciate your help

The reason I did not upload the attachement was that I could not delete my old attachements - about 5 or so are there and they exceed my allowed quota _ I cannot seem to delete them

Peter

To if you want to delete your previous attachments go to "http://www.mathhelpboards.com/usercp.php" and then click on the "http://www.mathhelpboards.com/profile.php?do=editattachments" under the "My Settings" pane. Hope this will work for you. :)
 
  • #5
I am not an expert in abstract algebra but I can provide some insights on factorization of polynomials and irreducibles based on my understanding.

Factorization of polynomials is the process of breaking down a polynomial into a product of simpler polynomials. This is similar to how we break down numbers into prime factors. In abstract algebra, the concept of irreducibles is important as it helps us identify polynomials that cannot be factored any further.

In the given exercise, we are asked to show that x^4 + 2 is irreducible in \mathbb{Q}[x]. To do this, we can follow the approach used for x^2 + 2. First, we assume that x^4 + 2 can be factored into two polynomials, say f(x) and g(x), both with coefficients in \mathbb{Q}. This would mean that x^4 + 2 = f(x)g(x).

Next, we can use the fact that x^2 + 2 is irreducible in \mathbb{Q}[x]. This implies that x^2 + 2 cannot be factored into two polynomials with coefficients in \mathbb{Q}. Therefore, we can assume that neither f(x) nor g(x) is equal to x^2 + 2.

Now, we can consider the coefficients of x^4 + 2. Since the coefficients are in \mathbb{Q}, we can write them as fractions in lowest terms. Let's say the coefficient of x^4 is a/b, where a and b are integers with no common factors. Similarly, the constant term is c/d where c and d are integers with no common factors.

Using the assumption that x^4 + 2 = f(x)g(x), we can write out the coefficients of f(x) and g(x) as fractions in lowest terms. This would give us the following equations:

f(x) = (ax^2 + e)/(bx^2 + g)
g(x) = (cx^2 + h)/(dx^2 + i)

Where e, g, h and i are integers with no common factors.

Now, we can substitute these expressions into the equation x^4 + 2 = f(x)g(x) and equate the coefficients of x^2 and the constant term. This would give us the following equations:

a/b + c/d = 0
 

FAQ: Factorization of Polynomials - Irreducibles - Anderson and Feil

What is factorization of polynomials?

Factorization of polynomials is a process of expressing a polynomial as a product of simpler polynomials. It is similar to finding the prime factors of a number.

What are irreducible polynomials?

Irreducible polynomials are polynomials that cannot be factored into simpler polynomials. In other words, they do not have any factors besides 1 and itself.

Why is factorization of polynomials important?

Factorization of polynomials is important because it helps us simplify complex expressions and solve equations. It also allows us to find the roots or solutions of a polynomial equation.

Who are Anderson and Feil?

Anderson and Feil are mathematicians who contributed to the study of factorization of polynomials, specifically irreducible polynomials. They developed a method for determining if a polynomial is irreducible or not.

What is the process for factorizing a polynomial?

The process for factorizing a polynomial involves finding the common factors, using techniques such as grouping and factoring by grouping. Then, we continue to factor until we reach irreducible polynomials. Anderson and Feil's method can also be used to determine if a polynomial is irreducible or not.

Similar threads

Replies
9
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
4
Views
2K
Replies
10
Views
2K
Replies
2
Views
1K
Replies
6
Views
2K
Back
Top