Let be a finite field. in K if and only if for any such that the degree of is more or equal to 1, the polynomial is a reducible polynomial.
Proof
From Left to Right ()
Let with is the additive identity of field and 1 is the unity or the multiplicative identity of the field .
Now, observe that for any , we have
(by using the distributive and commutative property of the polynomial ring )
.
So, for any .
Next, let's define a function such that for all . We will show that is a surjective function.
Take any such that , then or = 0. Since , then . Again, since then or . Thus, .
Hence, is injective. Since is finite, then we can conclude is also surjective.
Take any polynomial such that the degree of is . We can write
for some .
Then, we obtain
.
Since is a surjective function, there exist such that
.
By using the property we have proven before,
.
Therefore, we conclude for any polynomial with degree 1, is reducible and also there exists such that .
Furthermore, by using mathematical induction, this is also true for any of any degree.
Assume for some , if has degree then is reducible and there exists such that .
Now, take any such that its degree is , we can write
with .
Let , then
Since , by induction hypothesis then there exists such that
.
Next, since is surjective, there exists such that
.
Hence, reducible to . Therefore, we have proven the forward implication.
From Right to Left ()
Assume for every if has degree at least 1 then is reducible.
Since for every , is reducible, then has at least one solution in . Therefore, as a result of this, for every , has some solution(s) in if and only if also has some solution(s) in . (*)
Now, since has some solution(s), then by (*), , , , and so on, for every , has some solution(s) in . This is impossible to be happenend if because is finite. Thus, must be equal to . In other words, .
Comments
Post a Comment