Why can we show that an other polynomial is irreducible?

  • MHB
  • Thread starter evinda
  • Start date
  • Tags
    Polynomial
In summary, the conversation discusses how to prove that the polynomial $f(x)=10x^4-18x^3+4x^2+7x+16$ is irreducible in $\mathbb{Q}[x]$. The method suggested is to show that it is also irreducible in $\mathbb{Z}[x]$ by proving that it is irreducible in $\mathbb{Z}_3[x]$, since any factorization in $\mathbb{Z}[x]$ would also result in a factorization in $\mathbb{Z}_3[x]$. The two cases of a factorization in $\mathbb{Z}_3[x]$ are examined and it is determined that the polynomial is irreducible.
  • #1
evinda
Gold Member
MHB
3,836
0
Hello! :)
I am looking at the exercise:

Prove that $f(x)=10x^4-18x^3+4x^2+7x+16 \in \mathbb{Z}[x]$ is irreducible in $\mathbb{Q}[x]$.

According to my notes,a way to do this is the following:

We know that $\forall m>1 \exists $ ring homomorphism $\widetilde{ \phi }: \mathbb{Z}[x] \to \mathbb{Z}_m[X]$. We choose a prime $m$,that does not divide the coefficient of the highest degree of the terms.A logic choice is $m=3$.So, if $f(x)=g(x) \cdot h(x), g(x),h(x) \in \mathbb{Z}[x]$,then $\widetilde{ \phi }(f(x))=\widetilde{ \phi }(g(x)) \cdot \widetilde{ \phi }(h(x))$.

$\widetilde{ \phi }(f(x))=x^4+x^2+x+1= \text{ the product of two non-zero polynomial of } \mathbb{Z}_3[x]$

We have $2$ cases:
  • $x^4+x^2+x+1=\text{ polynomial of degree } 1 \cdot \text{ polynomial of degree } 3$
  • $x^4+x^2+x+1= (ax^2+bx+c) \cdot (a'x^2+b'x+c')$

First case:

Is means that there is a root in $\mathbb{Z}_3$:

$[a]x+, [a] \neq [0] \Rightarrow \text{ root }: [a]^{-1}$.-> Why is $[a]^{-1}$ the root and not $[-b][a]^{-1}$ ?So,we have to check if one of $0,1,2 \in \mathbb{Z}_3$ is a root and we conclude that none of these numbers are roots,so the first case is rejected.

Second case:

$$\left\{\begin{matrix}
x^4: & 1=aa' \\
x^3: & 0=ab'+ba' \\
x^2: & 1=ac'+a'c+bb' \\
x: & 1=bc'+cb' \\
\text{ constant: } & 1=cc'
\end{matrix}\right.$$

$a=a'=1 \text{ or } 2$ and $c=c'=1 \text{ or } 2 $

We get the relations $b+b'=0$ & $c(b+b')=1$ that can't be true.

So,the second case is also rejected.
-> But...why if we have shown that $x^4+x^2+x+1$ is irreducible in $\mathbb{Z}_3 $,have we proven that $f(x)=10x^4-18x^3+4x^2+7x+16 \in \mathbb{Z}[x]$ is irreducible in $\mathbb{Z}$ ,and so also in $\mathbb{Q}$? :confused:
 
Physics news on Phys.org
  • #2
evinda said:
$[a]x+, [a] \neq [0] \Rightarrow \text{ root }: [a]^{-1}$.-> Why is $[a]^{-1}$ the root and not $[-b][a]^{-1}$ ?

You are right, it should be $[-b][a]^{-1}$ (but that does not affect the overall argument).

evinda said:
-> But...why if we have shown that $x^4+x^2+x+1$ is irreducible in $\mathbb{Z}_3 $,have we proven that $f(x)=10x^4-18x^3+4x^2+7x+16 \in \mathbb{Z}[x]$ is irreducible in $\mathbb{Z}$ ,and so also in $\mathbb{Q}$? :confused:
If there was a factorisation in $\mathbb{Z}[x]$ then by reducing all the coefficients mod 3 you would get a factorisation in $\mathbb{Z}_3[x]$. Since you have shown that there is no such factorisation it follows that the polynomial is irreducible over $\mathbb{Z}$, and hence (by Gauss's lemma) also over $\mathbb{Q}$.
 
  • #3
Opalg said:
You are right, it should be $[-b][a]^{-1}$ (but that does not affect the overall argument).If there was a factorisation in $\mathbb{Z}[x]$ then by reducing all the coefficients mod 3 you would get a factorisation in $\mathbb{Z}_3[x]$. Since you have shown that there is no such factorisation it follows that the polynomial is irreducible over $\mathbb{Z}$, and hence (by Gauss's lemma) also over $\mathbb{Q}$.

Ok,thanks! :)
 

FAQ: Why can we show that an other polynomial is irreducible?

Why is it important to show that an other polynomial is irreducible?

Showing that a polynomial is irreducible is important because it helps us understand the properties and behavior of the polynomial. An irreducible polynomial cannot be factored into smaller polynomials, making it a fundamental building block in many mathematical calculations and proofs.

How can you prove that an other polynomial is irreducible?

The most common way to prove that an other polynomial is irreducible is by using the rational root theorem. This theorem states that if a polynomial has rational roots, they must be in the form of p/q, where p is a factor of the constant term and q is a factor of the leading coefficient. By checking all possible rational roots and showing that none of them satisfy the polynomial, we can prove that it is irreducible.

Is there a specific method for showing that an other polynomial is irreducible?

Yes, there are several methods for showing that an other polynomial is irreducible. In addition to the rational root theorem, other methods include the Eisenstein criterion, the irreducibility criterion for polynomials over finite fields, and the use of irreducible factors in the field of complex numbers.

Can a polynomial be both reducible and irreducible?

No, a polynomial cannot be both reducible and irreducible. A polynomial is considered irreducible if it cannot be factored into smaller polynomials with coefficients in the same field. If a polynomial can be factored into smaller polynomials, it is considered reducible.

Are there any real-life applications for showing that an other polynomial is irreducible?

Yes, there are many real-life applications for showing that an other polynomial is irreducible. In fields such as cryptography, coding theory, and signal processing, irreducible polynomials are used to generate mathematical structures that are essential for secure data transmission and error correction. Additionally, the concept of irreducibility is used in various areas of physics and engineering, such as in the study of dynamical systems and control theory.

Similar threads

Replies
16
Views
3K
Replies
24
Views
4K
Replies
1
Views
1K
Replies
15
Views
1K
Replies
52
Views
3K
Replies
4
Views
1K
Back
Top