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

  • Context: MHB 
  • Thread starter Thread starter mathmari
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on proving that if $p(x)$ is an irreducible polynomial in $K[x]$ and $f(x)$ also has a root $\rho$ of $p(x)$, then $p(x)$ divides $f(x)$. The proof utilizes the Euclidean division algorithm, showing that if $f(x) = g(x)p(x) + r(x)$, where $\deg r < \deg p$, then $r(\rho) = 0$ implies $r(x) = 0$. Consequently, it is established that $m(x)$, the minimal polynomial of $\rho$, divides $p(x)$ and $f(x)$. The conclusion is that $p(x) \mid f(x)$ holds true.

PREREQUISITES
  • Understanding of irreducible polynomials in field theory.
  • Familiarity with the Euclidean division algorithm for polynomials.
  • Knowledge of minimal polynomials and their properties.
  • Basic concepts of polynomial rings, specifically $K[x]$.
NEXT STEPS
  • Study the properties of irreducible polynomials in field extensions.
  • Learn about the Euclidean algorithm for polynomials in detail.
  • Investigate the relationship between minimal polynomials and roots in field theory.
  • Explore polynomial factorization in $K[x]$ and its implications.
USEFUL FOR

Mathematicians, particularly those focused on abstract algebra, field theory, and polynomial algebra, will benefit from this discussion. It is also valuable for students studying advanced algebra concepts.

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

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
Suppose $m(x)$ is the minimal polynomial of $\rho$ over $K$.

Show $m|p$, then apply what you have shown.
 
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)
 
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...
 
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)
 
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...
 
Deveno said:
Now, $p$ is irreducible, so...

How can we use this fact? (Wondering)
 
What kind of factors do irreducible polynomials have?
 
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...
 

Similar threads

Replies
48
Views
5K
  • · Replies 24 ·
Replies
24
Views
5K
  • · Replies 5 ·
Replies
5
Views
1K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
979
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 2 ·
Replies
2
Views
1K