Thursday, 6 September 2018

polynomials - Number of elements of a given trace in finite extension over prime subfield



Let F=Fpn and K=Fp,pP,nN.




Show that for every kK there exist exactly pn1 elements in F with a trace of k.





where the trace of an element fF is:
TrF/K(f)=f+fp+fp2++fpn1


Trace is linear, which I have verified, therefore trace of 0 is 0 and also, assuming that the trace is zero for every fF, a polynomial of degree pn1 would have pn roots, so there must exist an element of nonzero trace and consequently, due to homogeneity of trace, for every kK there exists an fF with trace k.



Since fpn=f we would get exactly pn1 elements of a given trace, but there is one problem. What guarantees that fpifpj with $0 \leq i

Suppose for some $i

Unnecesary. Tr:FK is onto, therefore F/ker TrK.



Answer



You already know Trace is a linear map and is not the zero map. Linear also implies Trace is an additive group homomorphism from a group of order pn to a group of order p. Being nontrivial, it has to be surjective, as the codomain order is a prime number. So the kernel has to be of order pn1. So the cosets of the kernel are all of the same cardinality, and so in each coset the trace is the same. Two different cosets cannot have the same trace as we need p different trace values.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...