How Many Subfields Does a Given Field Have?
At a glance
- 1. Specify the field
There is no single count for all fields; the answer depends on the field and what you count as a subfield.
- 2. Use the finite-field rule
For a field of size p to the n, list the positive divisors of n.
- 3. Count the divisors
Each divisor gives exactly one subfield, so the total number is the number of positive divisors of n.
- 4. Exclude endpoints if needed
For proper nontrivial subfields, omit the prime field and the whole field.
The number of subfields is a property of the particular field, so the question has no single answer without more information. A useful standard case is a finite field: its subfields are completely classified by divisors of its extension degree.
The finite-field answer
Every finite field has order for a prime and a positive integer . It contains exactly one subfield of order for every positive divisor of , and no other subfields. Therefore,
where is the number of positive divisors of . This count includes the prime subfield and the whole field .
If you want only proper subfields, exclude the whole field, giving when . If you want only proper, nontrivial subfields—excluding both the prime field and the whole field—the count is when . When , the field is already its own prime subfield, so it has no proper subfields.
Why divisors determine the subfields
Suppose contains a subfield . Every subfield of a finite field is itself a finite field, so it has order for some positive integer . Viewing as a vector space over gives
The left side is , and , so must divide . Conversely, for every divisor of , there is exactly one subfield with elements. One way to describe it is as the set of roots in of .
Thus counting subfields reduces to counting divisors. The word “exactly” matters: two different subfields cannot have the same size in a finite field.
Worked example: a field with elements
The positive divisors of are
So has six subfields, with orders
The field of order is the prime subfield, and the field of order is the whole field. The other four are proper, nontrivial subfields. For a concrete example, has subfields of orders and —six in total.
For a relative finite-field extension , the same divisor rule applies: there is exactly one intermediate field of degree over for every divisor of . Its size is .
What if the field is not finite?
For a general field, its characteristic and size alone do not give a universal subfield count. If the field has characteristic zero, every subfield contains its prime field ; in characteristic , every subfield contains . Beyond that, the answer depends on the field’s structure.
For example, has just one subfield, namely itself. In contrast, has infinitely many: for each prime number , the set is a subfield of , and these give infinitely many distinct subfields. So infinite fields may have very different subfield counts.
There is one useful general fact: a finite separable field extension has only finitely many intermediate fields. To see why, take its finite Galois closure. The intermediate fields correspond to certain subgroups of the finite Galois group, and a finite group has only finitely many subgroups. The actual count, however, depends on the extension and is not given by the finite-field divisor formula in general.
Common counting mistakes
- Forgetting the endpoints: The total for includes both and . Remove one or both only if the question asks for proper or nontrivial subfields.
- Counting divisors without requiring divisibility: A field of order occurs inside only when divides , not merely when .
- Assuming the formula applies to every field: The divisor count is specific to finite fields (or to counting intermediate fields in a finite-field extension). For another field, identify the field and the intended meaning of “subfield” before counting.
References
- Finite Fields — Rudolf Lidl and Harald Niederreiter
- Abstract Algebra — David S. Dummit and Richard M. Foote
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.