1. Define the Frobenius Endomorphism:
Let K be a finite field with p elements, where p is a prime. For any polynomial f(x)=∑i=0naixi∈K[x], define f(x)=∑i=0naixpi. This transformation is related to the Frobenius endomorphism σ:K[x]→K[x] defined by σ(f)=fp.
2. Homomorphism Construction:
Using the universal property of K[x], we can construct a K-algebra homomorphism φ:K[x]→EndK(K[x]) such that φ(x)=σ. For any polynomial f(x)=∑i≥0aixi∈K[x], we have:
φ(f(x))(x)=(i≥0∑aiσi)(x)=i≥0∑aixpi=f(x)
3. **Division Algorithm in K[x]:**
For any polynomials f(x),g(x)∈K[x] with f(x)=0, there exist polynomials q(x),r(x)∈K[x] such that:
g(x)=q(x)f(x)+r(x)withdeg(r(x))<deg(f(x))
4. Applying the Homomorphism:
Applying the homomorphism φ to the equation g(x)=q(x)f(x)+r(x), we get:
g(x)=φ(g(x))(x)=φ(q(x)f(x)+r(x))(x)=φ(q(x))(φ(f(x))(x))+φ(r(x))(x)
Since φ is a homomorphism, we have:
g(x)=φ(q(x))(f(x))+r(x)
5. **Expressing φ(q(x)):**
Let q(x)=∑i≥0cixi. Then:
φ(q(x))(x)=i≥0∑ciσi(x)=i≥0∑cixpi
Therefore:
φ(q(x))(f(x))=i≥0∑cif(x)pi
6. Combining Results:
Thus, we have:
g(x)=i≥0∑cif(x)pi+r(x)=f(x)(i≥0∑cif(x)pi−1)+r(x)
Since deg(r(x))=pdeg(r(x))<pdeg(f(x))=deg(f(x)), r(x) is the remainder of the division of g(x) by f(x).
7. Conclusion:
Therefore, f(x)∣g(x) if and only if r(x)=0, which implies r(x)=0. Hence, f(x)∣g(x).
■