Overview
- What is the difference between a field generator, a primitive element, and a normal element?
- How are primitivity and normality tested?
- When can both conditions hold?
- What is known about the Morgan–Mullen conjecture?
Three properties of an element
Fix over . An element is a field generator if ; equivalently, its minimal polynomial has degree . It is primitive if it generates , and normal if form an -basis of .
Primitivity and normality each imply degree , but degree does not imply either of them. In with , the element has degree two and multiplicative order four; the full multiplicative group has order eight.
References 1
- LidlNiederreiter1997 · Chapter 2, primitive elements and basesSource
Testing primitivity
Put . An element is primitive if and only if Indeed, a proper divisor of divides for some prime . For an irreducible polynomial of degree , these tests can be performed with .
The cyclic group has generators. Frobenius groups them into orbits of length , so the number of monic primitive polynomials of degree is .
References 1
- LidlNiederreiter1997 · Chapters 2–3, primitive elements and primitive polynomialsSource
Testing normality
Choose any -basis of . Form a matrix whose columns are the coordinates of . The element is normal exactly when this matrix has rank .
There is also a polynomial formulation. Let , and let be the monic polynomial of least degree such that . It divides . Normality is equivalent to , or to for every distinct monic irreducible divisor of . Here acts as the linear map .
The criterion remains valid when the characteristic divides ; the multiplicities in must be retained.
References 1
- CohenHuczynska2010Strong · §2, the polynomial module structure and freenessSource
Examples
Example
Let be a root of over . The polynomial has no root in , hence is irreducible. The nonzero element has order seven, so it is primitive. Also . Relative to the basis , its conjugates have columns , which are independent. Thus is normal.
In contrast, a root of over is primitive but not normal. Irreducibility is checked in the quartic example; the tests and give order fifteen. Its trace is zero because the coefficient of vanishes. Hence its four conjugates are linearly dependent.
Conversely, let be a root of over . Since , this polynomial is irreducible and has multiplicative order five. It is not primitive in , whose order is fifteen. Its trace is one, so it is normal by the trace criterion below. Thus neither primitivity nor normality implies the other.
References 1
- LidlNiederreiter1997 · Primitive elements, normal bases, and trace; the displayed examples are direct calculations.Source
The primitive normal basis theorem
Theorem
For every prime power and every , the extension contains a primitive normal element.
Lenstra and Schoof proved this in 1987. Cohen and Huczynska later gave a proof without computer calculations. Their method counts elements satisfying multiplicative and additive conditions by character sums, then uses a sieve to show that the count is positive.
A stronger theorem asks for both and to be normal over , with primitive. Cohen and Huczynska proved that such an element exists except for These five pairs are genuine exceptions.
References 3
- LenstraSchoof1987PrimitiveNormal · Main theoremSource
- CohenHuczynska2003PrimitiveNormal · Main theoremSource
- CohenHuczynska2010Strong · Theorem 1.4, pp. 299–300Source
Counting normal elements
The normal basis theorem identifies , as an -module with acting by Frobenius, with . Its generators correspond to the units of this quotient. Therefore the number of normal elements is where the product is over distinct monic irreducible factors.
For , one has , giving eight normal elements. In this case normality is equivalent to nonzero trace: , and the normality test has just the factor .
References 1
- GarefalakisKapetanakis2026Translates · §3, polynomial Euler function and normal elementsSource
Complete normality
An element of is completely normal over if it is normal over every intermediate field , .
Completely normal basis theorem · Blessenohl–Johnsen
For every prime power and integer , the extension has a completely normal element.
Primitive elements, normal elements, primitive normal elements, and completely normal elements therefore exist in every finite extension. Morgan and Mullen ask for the additional simultaneous condition: an element that is both primitive and completely normal.
Write , with . A published theorem of Garefalakis and Kapetanakis proves this when , in particular when . Their 2026 paper develops further constructions using translates of completely normal elements.
Preprint claim. Hellwig's October 2026 preprint claims existence for every , using partial Lagrange resolvents, character sums, and finite computations. The author reports a Lean formalization of the new cases and computations.
Formalization and dependencies
The author’s version 1.0 archive corresponds to commit 09291f9dbd175ffdd8c22cddcbaff7152c516272. The pinned build instructions, dependency manifest, and reported axiom audit identify the computational assumptions.
The two imported mathematical axioms are the Garefalakis–Kapetanakis theorem for and a Rosser–Schoenfeld estimate. Compiled computations additionally use Lean.ofReduceBool and Lean.trustCompiler. These records were inspected; the Lean project and its proof dependencies have not been independently audited here.
References 6
- BlessenohlJohnsen1986Original attribution; the finite-field statement is recorded in Garefalakis–Kapetanakis, Theorem 1.3. The original proof was not retrieved in this review.Source
- MorganMullen1996CompletelyNormal · ConjectureSource
- GarefalakisKapetanakis2019PCN · Main theoremSource
- GarefalakisKapetanakis2026Translates · Theorems 1.3 and 2.6; §§4–7Source
- Hellwig2026MorganMullen · arXiv:2610.36534v1, Theorem 1.2; abstract and formalization statementSource
- Hellwig2026Formalization · Release v1.0; README, AXIOMS_AUDIT.txt, and lake-manifest.jsonRepository records checked; no independent Lean build or formal proof audit.Source
Questions
Does every finite extension have a primitive normal element?
Scope. Every prime power and integer .
Yes. Lenstra and Schoof proved the primitive normal basis theorem; Cohen and Huczynska gave a later proof without computer calculations.
References 2
- LenstraSchoof1987PrimitiveNormal · Main theoremSource
- CohenHuczynska2003PrimitiveNormal · Main theoremSource
Does every finite extension have a primitive completely normal element?
Scope. Every prime power and integer ; the Morgan–Mullen conjecture.
Published results include the range in which the largest divisor of coprime to the characteristic is smaller than . Hellwig claims a proof for all extensions in arXiv:2610.36534v1 (October 2026), using character sums, finite computations, and a reported Lean formalization. The general result is listed as a preprint claim.
References 3
- MorganMullen1996CompletelyNormalSource
- GarefalakisKapetanakis2019PCNSource
- Hellwig2026MorganMullen · Theorem 1.2 and abstractSource
Related topics
Finite fields and Frobenius
Frobenius conjugates and trace underlie normality.
UsesIrreducibility over finite fields
First certify that a polynomial defines the required extension.
UsesIrreducible polynomials with coefficient restrictions
Coefficient conditions can be imposed in addition to degree or primitivity.
UsesSparse irreducible polynomials over finite fields
Compare normal bases with sparse polynomial bases.
References
- Finite Fields
Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.
Read the source - The strong primitive normal basis theorem
Cohen, Stephen D. and Huczynska, Sophie. Acta Arithmetica, 143(4), 299–332, 2010.
Read the source - Primitive normal bases for finite fields
Lenstra, Hendrik W., Jr. and Schoof, René J. Mathematics of Computation, 48(177), 217–231, 1987.
Read the source - The primitive normal basis theorem—without a computer
Cohen, Stephen D. and Huczynska, Sophie. Journal of the London Mathematical Society, 67(1), 41–56, 2003.
Read the source - Translates of completely normal elements and the Morgan–Mullen conjecture
Garefalakis, Theodoulos and Kapetanakis, Giorgos. Canadian Mathematical Bulletin, 1–21, 2026.
Read the source - Eine Verschärfung des Satzes von der Normalbasis
Blessenohl, D. and Johnsen, K. Journal of Algebra, 103(1), 141–159, 1986.
Read the source - Completely normal primitive basis generators of finite fields
Morgan, Ilene H. and Mullen, Gary L. Utilitas Mathematica, 49, 21–43, 1996.
Read the source - On the existence of primitive completely normal bases of finite fields
Garefalakis, Theodoulos and Kapetanakis, Giorgos. Journal of Pure and Applied Algebra, 223(3), 909–921, 2019.
Read the source - Resolvent Components of Completely Normal Elements and the Morgan-Mullen Conjecture
Hellwig, Florian. arXiv:2610.36534 [math.NT], 2026.
Read the source - Resolvent Components of Completely Normal Elements and the Morgan–Mullen Conjecture: Lean 4 Formalisation and Python Programs
Hellwig, Florian. Author repository; release v1.0, 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.