How can I show that Trace $(ax) = 0$ implies that $a = 0$ in a field $F$ (over F2) of order $2^N$? I get that I can something like the following:
Trace($ax_1)=$ Trace($ax_2$) $\implies$ $a(x_1-x_2)+a^2(x_1-x_2)^2+...+a^{2^{N-1}}(x_1-x_2)^{2^{N-1}} = 0,$
but I don't see where to go from here or why this is useful.
Let $F$ be the field of $2^N$ elements. If $Tr(ax)=0$ for all $x\in F$, then the polynomial $$ p(x)=Tr(ax)=ax+a^2x^2+a^4x^4+\cdots+a^{2^{N-1}}x^{2^{N-1}} $$ has (at least) $2^N$ distinct zeros in the field $F$, namely all its elements. If $a\neq0$, then this polynomial has degree $2^{N-1}$. Therefore $\ldots$