Let p be a prime number, n a positive integer not divisible by p, and K a field with pn elements, with unit element 1K and zero element 0^=0K. For any m∈N∗ we denote m^=m times1K+1K+⋯+1K and we define the polynomial fm=k=0∑m(−1)m−kCmkXpk∈K[X].
a) Show that the set of the roots of the polynomial f1 is {k^∣k∈{0,1,…,p−1}}.
b) Let m∈N∗ be arbitrary. Determine the set of the roots in the field K of the polynomial fm.
Solution
a. For any polynomial P∈K[X] we shall denote by ZP the set of roots of P in the field K. Because ∣K∣=pn, the characteristic of the field K is char(K)=p. Then m^=0^ for any multiple m of p. In particular, since kp≡k(modp), for any k∈{0,1,…,p−1} we have f1(k^)=(k^)p−k^=kp−k^=kp−k=0^, Hence, {k^∣k=0,p−1}⊆Zf1. Also, because K is a field, ∣Zf1∣≤grad(f1)=p. It follows that Zf1={k^∣k=0,p−1}.
b. Because p∣Cpk, for any k=1,p−1, the identity (a+b)p=ap+bp holds for any a,b∈K, and inductively we have (a+b)pk=apk+bpk, for any a,b∈K and any k∈N. Then for any m∈N∗ we have: fm(f1(X))=k=0∑m(−1)m−kCmk(Xp−X)pk=k=0∑m(−1)m−kCmk(Xpk+1−Xpk)==k=0∑m+1(−1)m+1−k(Cmk+Cmk−1)Xpk=k=0∑m+1(−1)m+1−kCm+1kXpk=fm+1(X).
We shall prove by induction with respect to m∈N∗ that Zfm={k^∣k=0,p−1} for any m∈N∗, which will solve the problem. For m=1 we have shown this in part a.
Assume now that the property holds for some arbitrary m∈N∗. We prove now that it will hold also for m+1: For any k∈{0,1,…,p−1} we have fm+1(k^)=fm(f1(k^))=fm(0^)=0^, so that {k^∣k=0,p−1}⊆Zfm+1. Let α∈Zfm+1 be arbitrary. Then fm(f1(α))=fm+1(α)=0^, so that f1(α)∈Zfm. Hence, there is a k∈{0,1,…,p−1} such that f1(α)=k^. We obtain αp=α+k^,αp2=(α+k^)p=αp+k^p=(α+k^)+k^=α+2⋅k^, and, inductively, if αpm=α+m⋅k^, then αpm+1=(α+m⋅k^)p=α+(m+1)⋅k^. In the multiplicative group (K∗,⋅) we have xpn−1=1, for any x∈K∗, so that xpn=x holds for any element x∈K. Then α=αpn=α+n⋅k^, and n⋅k^=0^. Since n is not divisible by the characteristic p, it follows that k^=0^. But then f1(α)=0^ and α∈Zf1={k^∣k=0,p−1}. Thus we obtained the reverse inclusion Zfm+1⊆{k^∣k=0,p−1}, so that the equality Zfm+1={k^∣k=0,p−1} holds. The claim holds then for any m∈N∗.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.