The finite field can be represented as , since the quadratic has no root modulo three. Its elements are for , with . Multiplication reduces to modulo three.
The quotient by an irreducible polynomial is a field construction gives . The quadratic has no root in . With , the four elements are , and , , . These relations determine the full multiplication table.
In a splitting field over , the polynomial has distinct roots because its derivative is . Its roots are closed under addition, multiplication, additive inverses, and nonzero inverses, so they form the field . The splitting field consequently has degree over .
Every monic irreducible polynomial over whose degree divides divides . In particular, if has degree and is one of its roots, then has elements, so and the minimal polynomial divides .
Let be the number of monic irreducible polynomials of polynomial degree over . Factoring into all such polynomials whose degrees divide givesThe Möbius inversion formula therefore gives
Every degree- extension of is isomorphic to .
Over , the roots of the minimal polynomial of are its distinct iterates under the finite-field Frobenius automorphism.
The multiplicative group of a finite field is the group of its nonzero elements under multiplication.
A nonzero element of a finite field is a quartic residue when for some nonzero . If , the multiplicative group of a finite field is cyclic of order divisible by four, so the quartic residues form a subgroup of index four; equivalently .
The nonzero elements of every finite field form a cyclic group. For a field with elements, combine elements realizing each prime-power factor of the group exponent to obtain an element of exponent order; the root bound for then forces that order to be .
Every finite subgroup of the multiplicative group of a field is cyclic. If is the exponent of , commutativity lets one combine elements whose orders realize the prime-power factors of , producing an element of order . Every element of is a root of , so the Lagrange root bound over a field gives . Since , equality holds and that element generates .
In a finite field with elements, the equation has exactly solutions. Indeed, after choosing a generator of the multiplicative group, is a solution exactly when .
Articles by others on the same topic
A convenient notation for the elements of of prime order is to use integers, e.g. for we could write:which makes it clear what is the additive inverse of each element, although sometimes a notation starting from 0 is also used:
For non-prime order, we see that modular arithmetic does not work because the divisors have no inverse. E.g. at order 6, 2 and 3 have no inverse, e.g. for 2:we see that things wrap around perfecly, and 1 is never reached.
Finite fields made easy by Randell Heyman (2015)
Source. Good introduction with examples