Professional Documents
Culture Documents
Unique Factorization
Unique Factorization
These two concepts are used in the proof the Extension theorem
Unique factorization
We start with a definition.
Definition 1. Let
1.
2.
be a field. A polynomial
[ ,
, ,
] is irreducible over
, ,
if
].
= . and ( ) =
( )=
Then
2=
2.
is irreducible over .
Thus
2. Let
= and
( )=
Then
Hence
( )=
+ 1.
+ 1 = ( )( + ). But ,
is irreducible over .
But since , ,
is reducible over .
[ ,
, ,
[ ,
, ,
Theorem 1. Let [ ,
product , where ,
divides the
| .
Proof:
Let [ , , , ] be irreducible over such that | where [ 1 , 2 , , ]. We
can write | as | ( ). Then by Theorem 1 |
|( ). We then can
repeat the same step | ( ). Again by Theorem 1 |
|( ). So continuing this
process completes the proof.
Thus
divides
WTS:-
and
Since
and
= 1,2, , =
as
).(%)
|
and
| . Thus
. When we substitute
..(%%)
Then
Similarly,
0.
as
. WLOG assume
| . Thus
...
= 1, ,
Thus
...
. When we substitute
= 1, ,
Thus
Therefore,
.
=
Hence,
= and
= 1,2, , =
Or equivalently
( ) > 0 |
[ ] with
| ?
1 = 0( 1) + 1
1 = ( 1) + 1
1 = ( + 1)( 1) + 0 .
(
Thus
1) =
1,
( , ) = 1, then
Note: If
[ ], then ,
[ ]
( , ).
Is there a way determining the existence of common factor without doing any division in
Lemma : Let
>0
have a common factor if and only if there are polynomials ,
(i)
(ii)
(iii)
> 0,
[ ] such that:
Proof
() Assume
WTS: ,
Since
Then
1.
| .
. Then
Then
zero,
+ ( )
1 and
= 0, and thus,
= 0.
) =
=0
, we have
, which
+ +
Coefficients
+ +
Coefficients
+ +
, (
+ +
, ,
as unknowns. Our
= 0 holds.
,
+
0)
, (
0) where
+ +
+ +
++
+ +
)=0
and compare the coefficients of powers of , and then we get the following system of linear
equations with unknowns , and coefficients
,
:
+
+
=0
coefficient of
=0
coefficient of
=0
coefficient of
.. (#)
Since there are + linear equations and + unknowns, we know from linear algebra on matrices
that there is a nonzero solution (nontrivial solution) if and only if the coefficient matrix has zero
determinant .
+ +
+ +
, (
0) ,
, (
0).
( , , ) =
, denoted by
( , , ) is the coefficient
( , , ) is the following ( + ) ( + )
columns
columns
The Resultant of
Sylvester matrix. Thus,
with respect to
( , , )=
, denoted by
( , , )).
James Joseph Sylvester (1814 1897) was an English Mathematician. He made fundamental
contributions to matrix theory, invariant theory, number theory, and combinatorics. He played a
leadership role in American mathematics in the late half of the 19th century as a professor at the
Johns Hopkins University and as a founder of the American Journal of mathematics.
1. Let ( ) = 3 + 1 and ( ) = 2
Then
= deg( ) = 1
+ 4 3.
= deg( ) = 2
and
= 3,
with
3
( , , )= 1
0
Now
0 2
3 4 . And
1 3
( +
= 1,
= 2,
( , , ) = det
= 3)
=4&
= 3.
( , , ) = det
3 0
1 3
0 1
2
4
3
( , , ) = 41 0,
2. Let ( ) = 2
+ 3 + 1 and ( ) = 7
= deg( ) = 2
Then
and
= deg( ) = 2
With
2
( , , )= 3
1
0
0
2
3
1
7
1
3
0
0
7 . And
1
3
Thus
3. Let ( ) =
Then
( +
= 2,
( , , ) = det
= 3,
= 4)
= 1,
( , , ) = det
= 7,
2
3
1
0
=1 &
0
2
3
1
7
1
3
0
0
7
1
3
( )=
= deg( ) = 4 and
With
+ 3.
= 1,
= deg( ) = 2
=0
= 1,2,3 ,
( +
= 1 ,
1
0 1
0 0
0
0
1
0
1 0
0
0
0
1
0
1
0 . And
( , , )=
0
0 0
1 0
1
1 0 0
0 1 0
0 1 0
0
0 1
= 1,
= 6)
=0 &
= 1
=3
= 153 0.
1
0
0
( , , ) = det
( , , ) = det
Hence
0
1
0
0
0
1
1
0
1
0
0
0
0 0
0
1 0
0
0 1
0 = 0.
1 0
1
0 1 0
0
0 1
4. Let
Regarding
= deg( ) = 1 and
( +
= ,
0
( , , ) = det 1
0
Hence,
= 3)
= 1,
1
0
=
4
=1,
=0 &
+10
Proposition 3: Given ,
+
=
coefficients of
= deg( ) = 2
With
Then,
4.
It is like the
( , ). i.e
+
=
It is the denominator-free version of the
( , ).
.
[ ]
Thank You!
http://albohessab.weebly.com/notes.html