...
Printable View
...
It seems to me your work is correct.Quote:
Originally Posted by harold
I think you are asking how do you determine whether a polynomial is irreducible overand
?
---
Let me begin by answering the question about. Any non-linear polynomial is reducible over
! That is called the "fundamental theorem of algebra".
To answer the other question whether a polynomial is reducible over. All you need to find its roots. And confirm that they are not complex but real.
Yes,Quote:
Originally Posted by harold
You have show thatis reduccible over
such as,
. Now can this be reduced further? Well,
but,
cannot be.
Again you cannot say irreducible overQuote:
Originally Posted by harold
except in a one degree polynomial. You want to how to be formally show that they are irreducible over
.
What you can do, is reducible (factor) the polynomials in. Then since,
you can say that since factorization is unique in irreducible polynomials that polynomial (the one you are trying to show is irreducible over the real field) cannot be factored in any other way (namely in real numbers), since the reals are a subfield of the complex numbers.
Looking first at what you have so far (part I):
1) is incorrect... you are using the fallacy that simply because a poly has no roots in Q it is necessarily irreducible over Q. This is valid if you are dealing with degree 3 or smaller, but otherwise you could have quadratic or higher factors, which is the case here.. it factors as (x^2+4)(x^2-19), both rational polys, and THESE are irreducible because they have no rational roots (any further factorization would yield a linear factor, hence a rational root)
For the rest, I did not do the criteria calculations or check your factorizations, but assuming they are correct, I find no obvious errors of reasoning.
Part II:
I'm sure I'm repeating here a lot of stuff Hacker already said, but for the sake of continuity I'll say it again...
No non-linear polynomial is irreducible over C. That's the beauty of the complex's, every polynomial completely factors into linear factors. So if it's not linear, keep going.
No polynomial (in real co-efficients) of degree greater than or equal to 3 is irreducible in R. That is, the only irreducibles in R are linear polynomials, and quadratic polynomials having no real root. How do we know this? It follows from the fact that complex roots to polynomials in real coefficients always come in conjugate pairs (not necessarily true if you're allowed COMPLEX coefficients, which doesn't apply here).
As an illustration, say you handed me a third degree polynomial and claimed it was irreducible in R. Then I say, "well, it has a complex root, find it." You give it to me, call it z. Then I also know that its conjugate z' is also a root. So the polynomials (x-z) and (x-z') are factors in your polynomial. Multiply them together, and
(x-z)(x-z') = x^2 -(z+z')x +zz'
is a factor. But (z+z'), zz' are both real numbers. So you have a real quadratic factor.
Moral of the story, if your polynomial is of degree 3 or higher, keep going, it factors further in the reals.
So, in fact, once you've completely factored something over the reals/complexes, its much easier to argue the irreducibility of the factors then, say, over the rationals. In the complexes, they're all going to be linear, obviously irreducible. And for the reals, if you have a quadratic factor, just show that it has no real roots by the quadratic formula.
LetQuote:
Originally Posted by harold
Thus, you end up with a quadradic,
You are on the right way(I think you are asking for this)Quote:
Originally Posted by harold
![]()
![]()
![]()
Keep Smiling
Malay
I have three steps in my last post. Watch the second step.Quote:
Originally Posted by harold
As discussed earlier, each of the four terms is irreducibleQuote:
Also, now thatis broken down, am I right in saying the following when deducing irreducibility:
![]()
![]()
![]()
is written as a product of irreducibles in. (So its irreducible over
)
The poly you want to find is the second term in the first step.Quote:
Sinceand
are both conjugate pairs that are not in
but
![]()
some poly (I need help finding this poly) which is in
and so is irreducible in
.
I am referring to the previous post. First you factorised into two quadratic terms, one is reducible in R(x) and the other is irreducible in R(x) but reducible in C(x).After further factorisation, you get four linear terms which are irreducible in C(x).Quote:
Am I saying it right when concluding irreducibility? Are these the right steps?
Please someone check it. I am not very confident.
Keep Smiling
Malay