Classifcation of irreducible polynomials

In summary, the classification rule for irreducible polynomials of the form ax^2 + bx + c over the reals is that b^2 - 4ac < 0.
  • #1
gazzo
175
0
"Conjecture a classifucation rule for all irreducible polynomials of the form ax^2 + bx + c over the reals. Prove it."

I'm stuck cold at the start. classification rule ?

"Let R be an integral domain.
A nonzero f in R[x] is irreducible provided f is not a unit and in every factorization f = gh, either g or h is a unit in R[x].

So, f in R[x] is reducible over R if it can be factorised as f = gh where g,h are in R[x] with deg(g) < deg(f) and deg(h) < deg(f). And irreducible otherwise."

I have no idea where to start, I tried playing with extensions but that seems pointless in the reals.

For some p, b^2 - 4ac < 0 then p is irreducible over R. But that's not getting me anywhere.

Could someone please just give me a tiny hint/word which may shed a ray of light? o:)

Thanks :blushing:
 
Physics news on Phys.org
  • #2
The classification rule for all irreducible polynomials of the form ax^2 + bx + c over the reals is that any polynomial where b^2 - 4ac < 0 is irreducible over R. This can be proven by showing that any polynomial with b^2 - 4ac greater than or equal to 0 can be factored using the quadratic formula.
 
  • #3


One possible classification rule for irreducible polynomials of the form ax^2 + bx + c over the reals is to consider the discriminant, b^2 - 4ac. If this value is negative, then the polynomial is irreducible over the reals. This is because the discriminant indicates the nature of the roots of the polynomial - if it is negative, then the roots are complex and cannot be expressed as real numbers. Therefore, the polynomial cannot be factored into linear factors over the reals.

To prove this, we can use the quadratic formula to find the roots of the polynomial. If the discriminant is negative, then the square root in the formula will be imaginary, resulting in complex roots. This means that the polynomial cannot be factored into linear factors over the reals, making it irreducible.

On the other hand, if the discriminant is non-negative, then the roots will be real and the polynomial can be factored into linear factors over the reals. Therefore, the polynomial is reducible if the discriminant is non-negative.

In summary, a polynomial of the form ax^2 + bx + c is irreducible over the reals if and only if the discriminant, b^2 - 4ac, is negative. This serves as a classification rule for all irreducible polynomials of this form over the reals.
 

FAQ: Classifcation of irreducible polynomials

What is an irreducible polynomial?

An irreducible polynomial is a polynomial that cannot be factored into the product of two non-constant polynomials. In other words, it cannot be broken down into simpler components.

How do you know if a polynomial is irreducible?

There are several methods for determining if a polynomial is irreducible. One method is to check if the polynomial has any rational roots using the Rational Root Theorem. If it does not have any rational roots, it may still be reducible, but if it does have rational roots, it is definitely not irreducible. Another method is to use the Eisenstein's Criterion, which states that if a polynomial is of the form anxn + an-1xn-1 + ... + a1x + a0 and there exists a prime number p that divides all coefficients except for an and p2 does not divide a0, then the polynomial is irreducible.

What is the importance of classifying irreducible polynomials?

Classifying irreducible polynomials is important because it allows us to determine the degree of a polynomial and the complexity of its roots. It also helps in finding the roots of a polynomial and in solving polynomial equations.

Can a polynomial be irreducible over one field but reducible over another?

Yes, it is possible for a polynomial to be irreducible over one field but reducible over another. This is because the factors of a polynomial depend on the coefficients and the field in which the polynomial is being considered. A polynomial may have different factors over different fields.

How does the degree of a polynomial affect its irreducibility?

The degree of a polynomial is an important factor in determining its irreducibility. A polynomial of degree 1 (a linear polynomial) is always irreducible. A polynomial of degree 2 (a quadratic polynomial) is irreducible if it does not have any rational roots. As the degree of the polynomial increases, it becomes more difficult to determine its irreducibility, and it may require more advanced methods such as the Eisenstein's Criterion or the use of complex numbers.

Similar threads

Replies
10
Views
2K
Replies
1
Views
1K
Replies
12
Views
2K
Replies
1
Views
2K
Replies
3
Views
2K
Replies
24
Views
4K
Replies
8
Views
2K
Back
Top