The polynom is still irreducible

  • MHB
  • Thread starter mathmari
  • Start date
In summary: Smile)In summary, to show that $f(x)$ remains irreducible and stays as a polynomial in $F[x]$, we can use the fact that an irreducible polynomial in $K[x]$ remains irreducible in any field extension of $K$, and that the degree of $f(x)$ in $K[x]$ is $n$ and $(n,m)=1$, which means that $f(x)$ cannot have a factor of degree $m$ in $F[x]$ without also having a factor of degree $n$.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

Let $f(x) \in K[x]$ an irreducible polynom of $K[x]$ of degree $n$.
Let $K\leq F$ a field extension with $[F:K]=m$. If $(n,m)=1$ show that $f(x)$ stays irreducible and as a polynom in $F[x]$.
Could you give me some hints how to show this?? (Wondering)
 
Physics news on Phys.org
  • #2


Hello! To show that $f(x)$ remains irreducible in $F[x]$, you can use the fact that an irreducible polynomial in $K[x]$ remains irreducible in any field extension of $K$. This is because if $f(x)$ can be factored in $F[x]$, then it can also be factored in $K[x]$ by simply considering the coefficients in $K$.

To show that $f(x)$ remains as a polynomial in $F[x]$, you can use the fact that the degree of $f(x)$ in $K[x]$ is $n$, and since $(n,m)=1$, this means that $n$ and $m$ are relatively prime. Therefore, the only way for $f(x)$ to have a factor of degree $m$ in $F[x]$ is if it also has a factor of degree $n$ in $F[x]$, which would contradict the irreducibility of $f(x)$.

Hope this helps! Let me know if you need any further clarification.
 

FAQ: The polynom is still irreducible

What does it mean for a polynomial to be irreducible?

Irreducibility is a property of polynomials in which the polynomial cannot be factored into two or more polynomials of lesser degree. This means that the polynomial cannot be broken down into simpler terms or factors.

How do you determine if a polynomial is irreducible?

To determine if a polynomial is irreducible, you can use the Eisenstein's criterion or the rational root theorem. If the polynomial cannot be factored using these methods, it is considered irreducible.

Can a polynomial be both reducible and irreducible?

No, a polynomial can only have one of these properties. If a polynomial can be factored into two or more polynomials of lesser degree, it is reducible. If it cannot be factored, it is irreducible.

What is the significance of a polynomial being irreducible?

An irreducible polynomial is important in fields such as number theory and algebraic geometry. It can also help in solving equations and understanding the structure of certain mathematical objects.

Are there any real-life applications of irreducible polynomials?

Yes, irreducible polynomials have applications in diverse fields such as coding theory, cryptography, and computer science. They are also used in engineering and physics to model and solve real-world problems.

Similar threads

Replies
8
Views
2K
Replies
1
Views
2K
Replies
1
Views
3K
Replies
16
Views
3K
Replies
12
Views
3K
Replies
12
Views
3K
Back
Top