Overview
- How are finite fields constructed?
- How does Frobenius determine conjugates and subfields?
- How does an irreducible polynomial factor over a larger finite field?
- How do trace, norm, and root order determine polynomial coefficients and degrees?
Fields from irreducible polynomials
Let , where is prime. A finite field with elements is denoted by . Its characteristic is ; as a vector space over , it has dimension .
If is monic and irreducible of degree , then is a field with elements. Writing , every element has a unique expression . Addition is coefficientwise; multiplication is followed by reduction modulo .
Example
The polynomial has no root in . Thus , where . Its elements are , and . The ring is different: it has characteristic four and is not a field.
References 1
- ConradFiniteFields Β· Β§1, Theorems 1.1 and 1.5Source
Existence and uniqueness
In an algebraic closure of , the roots of form a field. Indeed, the identity gives closure under addition, and multiplication and inversion preserve the equation. The derivative is , so there are exactly distinct roots.
Every field with elements is a splitting field of this polynomial over . Uniqueness of splitting fields therefore gives uniqueness up to -isomorphism. We may choose all these fields inside one algebraic closure.
References 1
- LidlNiederreiter1997 Β· Chapter 2, structure of finite fieldsSource
Frobenius and conjugates
The map is an automorphism of fixing . It has order : its -th power is the identity, while with would give roots of . Consequently
If has degree over , its conjugates are . They are distinct, and its minimal polynomial is their product Frobenius permutes the roots, so the coefficients belong to its fixed field .
References 1
- ConradFiniteFields Β· Theorems 5.5 and 5.6 (general finite ground field)Source
Subfields
There is a subfield exactly when , and it is unique. It consists of the elements fixed by . This is the Galois correspondence for the subgroups of a cyclic group.
Inside a fixed algebraic closure, In particular, an element of has degree if and only if it lies in none of the maximal proper subfields , where ranges over the prime divisors of .
References 1
- LidlNiederreiter1997 Β· Chapter 2, subfields and finite extensionsSource
Changing the field
Theorem
Let be irreducible of degree . Over , it has exactly distinct irreducible factors, each of degree .
Proof. Frobenius acts on the roots of as an -cycle. Over , the relevant Frobenius is . Its orbits have length , and each orbit is the root set of one irreducible factor.
Example
An irreducible polynomial of degree six over remains irreducible over , splits into two cubics over , and into three quadratics over . It splits completely over .
References 1
- LidlNiederreiter1997 Β· Chapter 3, factorization over extension fieldsSource
Trace and norm
For , If has degree and minimal polynomial , then and .
Thus prescribed trace and norm are prescribed coefficients. The other coefficients are elementary symmetric functions of the conjugates. Newton's identities relate these to the traces of powers, but division by an index divisible by the characteristic is unavailable. This is one reason that prescribed-coefficient arguments require care in small characteristic.
References 2
- MullenPanario2013 Β· Β§Β§2.1.3β2.1.4, pp. 18β21Source
- TuxanidyWang2018 Β· Β§1, coefficient prescriptions and characteristic-dependent methodsSource
Roots of unity
Suppose and , and let have multiplicative order . Its degree over is the least with , denoted by . Hence the reduction of is a product of distinct irreducibles of that degree.
Example
Since , the seventh cyclotomic polynomial has two irreducible cubic factors over : Both cubics have roots of multiplicative order seven.
If with , then in characteristic . Its distinct irreducible factors are therefore those of .
References 1
- LidlNiederreiter1997 Β· Theorem 2.47, cyclotomic polynomialsSource
From structure to construction
The structural theory reduces finite-field irreducibility to Frobenius computations. Berlekamp's factorization algorithm and Rabin's irreducibility test made this viewpoint algorithmic. Later construction problems ask for more: few nonzero terms, prescribed coefficients, or roots that also generate a normal basis. These conditions lead to character sums, sieves, and questions about the distribution of irreducible polynomials.
References 3
Related topics
Connected diagrams
- Which new primes create a prescribed Fekete factor? Β· Published
- Rabinβs criterion: a complete finite-field irreducibility certificate Β· Classical
Irreducibility over finite fields
Use Frobenius to test and count irreducible polynomials.
UsesPrimitive and normal elements
Distinguish a field generator, a primitive element, and a normal element.
UsesIrreducible polynomials with coefficient restrictions
Translate coefficient restrictions into conditions on conjugates.
UsesFrobenius and factorization modulo primes
Compare finite-field Frobenius with factorization modulo primes.
References
- Finite Fields
Conrad, Keith. Author-hosted expository notes.
Read the source - Finite Fields
Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.
Read the source - Handbook of Finite Fields
Mullen, Gary L. and Panario, Daniel (editors). CRC Press, 2013.
Read the source - A new proof of the HansenβMullen irreducibility conjecture
Tuxanidy, Aleksandr and Wang, Qiang. Canadian Journal of Mathematics, 70(6), 1373β1389, 2018.
Read the source - Factoring polynomials over finite fields
Berlekamp, Elwyn R. Bell System Technical Journal, 46(8), 1853β1859, 1967.
Read the source - Probabilistic algorithms in finite fields
Rabin, Michael O. SIAM Journal on Computing, 9(2), 273β280, 1980.
Read the source - Primitive polynomials over finite fields
Hansen, Tom and Mullen, Gary L. Mathematics of Computation, 59(200), 639β643, 1992.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.