Show that $p(x)|f(x)$: Proving the Divisibility

  • MHB
  • Thread starter mathmari
  • Start date
In summary, the conversation discusses using the properties of irreducible polynomials and minimal polynomials to show that the minimal polynomial $m(x)$ of a root $\rho$ of an irreducible polynomial $p(x)$ divides any other polynomial $f(x)$ with $\rho$ as a root in a field $K$. This is done by showing that the remainder term in the Euclidean division of $f(x)$ by $m(x)$ must be zero, and therefore $m(x)$ divides $f(x)$. The conversation also discusses the units of $K[x]$ and how they relate to the divisibility of polynomials.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

Let $K$ be a field, $p(x)\in K[x]$ irreducible and $L$ an extension of $K$, that contains the root $\rho$ of $p(x)$.
Let $f(x)\in K[x]$ has also the root $\rho$.
I want to show that $p(x)\mid f(x)$.

I have done the following:

Let $f(x)=g(x)p(x)+r(x)$, where $g(x), r(x)\in K[x]$ and $\deg r(x)<\deg p(x)$.
For $x=\rho$ we have that $$f(\rho)=g(\rho)p(\rho)+r(\rho) \Rightarrow r(\rho)=0$$

Does this help? (Wondering)

How could we continue? (Wondering)
 
Physics news on Phys.org
  • #2
Suppose $m(x)$ is the minimal polynomial of $\rho$ over $K$.

Show $m|p$, then apply what you have shown.
 
  • #3
Deveno said:
Suppose $m(x)$ is the minimal polynomial of $\rho$ over $K$.

Show $m|p$, then apply what you have shown.

The minimal polynomial $m(x)$ of $\rho$ is the monic polynomial of least degree among all polynomials in $K[x]$ having $\rho$ as a root. So, we have that $m(\rho)=p(\rho)=0$ and $\deg m\leq \deg p$.
How exactly can we show that $m\mid p$ ? Could you give me some hints? (Wondering)
 
  • #4
mathmari said:
The minimal polynomial $m(x)$ of $\rho$ is the monic polynomial of least degree among all polynomials in $K[x]$ having $\rho$ as a root. So, we have that $m(\rho)=p(\rho)=0$ and $\deg m\leq \deg p$.
How exactly can we show that $m\mid p$ ? Could you give me some hints? (Wondering)

Write $p(x) = q(x)m(x) + r(x)$, as before. Then:

$0 = p(\rho) = q(\rho)m(\rho) + r(\rho) = q(\rho)\cdot 0 + r(\rho) = r(\rho)$. Why can we not have $r(x) \neq 0$?

Now, $p$ is irreducible, so...
 
  • #5
Deveno said:
Write $p(x) = q(x)m(x) + r(x)$, as before. Then:

$0 = p(\rho) = q(\rho)m(\rho) + r(\rho) = q(\rho)\cdot 0 + r(\rho) = r(\rho)$. Why can we not have $r(x) \neq 0$?

Suppose that $r(x)\neq 0$.

From the eucildean division, we have that $\deg r<\deg m$.

We have that $m(x)$ is the monic polynomial of least degree among all polynomials in $K[x]$ having $\rho$ as a root. So $\deg m\leq \deg r$. A contradiction.

Therefore, it must be $r(x)=0$. So, $p(x)=q(x)m(x)\Rightarrow m(x)\mid p(x)$.

Is this correct? (Wondering)
 
  • #6
mathmari said:
Suppose that $r(x)\neq 0$.

From the eucildean division, we have that $\deg r<\deg m$.

We have that $m(x)$ is the monic polynomial of least degree among all polynomials in $K[x]$ having $\rho$ as a root. So $\deg m\leq \deg r$. A contradiction.

Therefore, it must be $r(x)=0$. So, $p(x)=q(x)m(x)\Rightarrow m(x)\mid p(x)$.

Is this correct? (Wondering)

Indeed, in fact $m(x)$ divides any polynomial having $\rho$ as a root. Now, finish it up...
 
  • #7
Deveno said:
Now, $p$ is irreducible, so...

How can we use this fact? (Wondering)
 
  • #8
What kind of factors do irreducible polynomials have?
 
  • #9
Deveno said:
What kind of factors do irreducible polynomials have?

Just the polynomials themselves, or not? (Wondering)
 
  • #10
In a ring $R$, we say that $a \in R$ is irreducible if:

$a = bc \implies b$ or $c$ is a unit.

What are the units of $K[x]$?
 
  • #11
Deveno said:
In a ring $R$, we say that $a \in R$ is irreducible if:

$a = bc \implies b$ or $c$ is a unit.

What are the units of $K[x]$?

The units of $K[x]$ are the constant elements of $K[x]$ that are units of $K$, or not? (Wondering)
 
  • #12
mathmari said:
The units of $K[x]$ are the constant elements of $K[x]$ that are units of $K$, or not? (Wondering)

Yes, that is correct.

So we know the following:

1. $m(x)|p(x)$

2. If $p(x) = a(x)m(x)$, then $a(x)$ is a unit, since $p$ is irreducible.

3. The units of $K[x]$ are the elements of $K^{\ast}$.

4. $m(x)|f(x)$
 
  • #13
Deveno said:
2. If $p(x) = a(x)m(x)$, then $a(x)$ is a unit, since $p$ is irreducible.

Why is then $a(x)$ a unit and not $m(x)$ ? (Wondering)
Deveno said:
4. $m(x)|f(x)$

Why does this hold? (Wondering) I got stuck right now...
 

FAQ: Show that $p(x)|f(x)$: Proving the Divisibility

What does it mean for $p(x)$ to divide $f(x)$?

When we say that $p(x)$ divides $f(x)$, we mean that there exists another polynomial $q(x)$ such that $f(x) = p(x)q(x)$. In other words, $p(x)$ is a factor of $f(x)$ and can be multiplied by another polynomial to get $f(x)$.

How can I show that $p(x)$ divides $f(x)$?

To prove that $p(x)$ divides $f(x)$, you can use the polynomial long division method. Divide $f(x)$ by $p(x)$ and if there is no remainder, then $p(x)$ divides $f(x)$. Another method is to show that all the roots of $p(x)$ are also roots of $f(x)$, which means that $p(x)$ is a factor of $f(x)$.

What if $p(x)$ and $f(x)$ have complex coefficients?

The concept of divisibility still applies to polynomials with complex coefficients. You can use the same methods mentioned above to show that $p(x)$ divides $f(x)$. However, for polynomial long division, you may need to use complex numbers and follow the same steps as for real coefficients.

Is it possible for $p(x)$ to divide $f(x)$ if $p(x)$ has a higher degree than $f(x)$?

No, it is not possible for a polynomial of higher degree to divide a polynomial of lower degree. In order for $p(x)$ to divide $f(x)$, the degree of $p(x)$ must be equal to or less than the degree of $f(x)$.

How is divisibility related to the roots of a polynomial?

If $p(x)$ is a factor of $f(x)$, then all the roots of $p(x)$ are also roots of $f(x)$. This means that if $p(x)$ divides $f(x)$, then the roots of $p(x)$ can also be found by setting $f(x)$ equal to zero. In other words, if $p(x)$ divides $f(x)$, then $f(x)$ can be factored as $(x-r)p(x)$, where $r$ is a root of $p(x)$.

Similar threads

Replies
24
Views
4K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
8
Views
2K
Replies
8
Views
1K
Replies
20
Views
3K
Replies
2
Views
1K
Replies
3
Views
1K
Replies
1
Views
3K
Back
Top