A finite field is a field with finitely many elements. Its characteristic is the least positive integer for which ; such an integer exists because the additive group is finite. If with , then although neither factor is zero, impossible in a field. Hence is prime, and the multiples of form its prime field . The whole field is a finite-dimensional vector space over this subfield, say of dimension , so its cardinality is . Thus and its characteristic is .
For existence, let be a splitting field over of . Since , it has exactly distinct roots. Its root set contains and is closed under addition and multiplication, because iterated Frobenius endomorphism gives
It is also closed under additive inverses, and for , . Thus is a field with exactly elements. Since it contains every root, it is the entire splitting field. This proves existence.
For uniqueness, let be any field with elements. Its nonzero multiplicative group has order , so Lagrange's theorem gives for every , including zero. Hence is a splitting field of the same polynomial. Here is the embedding argument giving uniqueness, rather than merely invoking it by name. Extend the identity on from one root at a time. If an embedding is already defined on and a new root has minimal polynomial of an algebraic element over , the transported polynomial divides and therefore has a root in . Evaluation at induces an embedding , extending the existing embedding to . Repeating for the finitely many roots embeds the constructed field in . They have the same finite cardinality, so this embedding is an isomorphism. Thus the field of order is unique up to isomorphism.
We prove cyclicity of the multiplicative group, also establishing the more general finite multiplicative subgroup of a field is cyclic result. Let be a finite subgroup of a field's multiplicative group, and let be the least common multiple of all element orders. For every prime dividing , choose an element whose order has the maximal -power ; raising it to the factor of its order coprime to gives an element of order . Since the group is abelian, the product of these elements has order : for commuting elements of coprime orders, an equation forces into the intersection of their cyclic subgroups, which is trivial, so both orders divide . Every member of is a root of . The Lagrange root bound over a field gives , while the element just constructed has order and gives . Thus equality holds and that element generates . In particular
For the field with nine elements, use . The polynomial has no root in , since its squares are , so the quotient is a field. In the basis , a vector represents , and
with coefficients reduced modulo three. Put . Then , , and , proving that is a primitive element of a finite field of order eight. Its complete power/vector table is
For completeness, the full addition and multiplication tables in these labels are displayed below. The subscripts are element labels; they are not the scalar residues of .
A nonzero element satisfies exactly when , so is even. Thus, with ,

Articles by others on the same topic (0)

There are currently no matching articles.