Ma · Mathematics

How Many Subfields Does a Given Field Have?

Published By the 9to5Science editorial team

At a glance

  1. 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. 2. Use the finite-field rule

    For a field of size p to the n, list the positive divisors of n.

  3. 3. Count the divisors

    Each divisor gives exactly one subfield, so the total number is the number of positive divisors of n.

  4. 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 pnp^n for a prime pp and a positive integer nn. It contains exactly one subfield of order pdp^d for every positive divisor dd of nn, and no other subfields. Therefore,

number of subfields of Fpn=τ(n),\text{number of subfields of } \mathbb{F}_{p^n}=\tau(n),

where τ(n)\tau(n) is the number of positive divisors of nn. This count includes the prime subfield Fp\mathbb{F}_p and the whole field Fpn\mathbb{F}_{p^n}.

If you want only proper subfields, exclude the whole field, giving τ(n)−1\tau(n)-1 when n>1n>1. If you want only proper, nontrivial subfields—excluding both the prime field and the whole field—the count is τ(n)−2\tau(n)-2 when n>1n>1. When n=1n=1, the field is already its own prime subfield, so it has no proper subfields.

Why divisors determine the subfields

Suppose K=FpnK=\mathbb{F}_{p^n} contains a subfield LL. Every subfield of a finite field is itself a finite field, so it has order pdp^d for some positive integer dd. Viewing KK as a vector space over LL gives

[K:Fp]=[K:L][L:Fp].[K:\mathbb{F}_p]=[K:L][L:\mathbb{F}_p].

The left side is nn, and [L:Fp]=d[L:\mathbb{F}_p]=d, so dd must divide nn. Conversely, for every divisor dd of nn, there is exactly one subfield with pdp^d elements. One way to describe it is as the set of roots in KK of xpd−xx^{p^d}-x.

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 p12p^{12} elements

The positive divisors of 1212 are

1, 2, 3, 4, 6, 12.1,\ 2,\ 3,\ 4,\ 6,\ 12.

So Fp12\mathbb{F}_{p^{12}} has six subfields, with orders

p, p2, p3, p4, p6, p12.p,\ p^2,\ p^3,\ p^4,\ p^6,\ p^{12}.

The field of order pp is the prime subfield, and the field of order p12p^{12} is the whole field. The other four are proper, nontrivial subfields. For a concrete example, F212\mathbb{F}_{2^{12}} has subfields of orders 2,4,8,16,64,2, 4, 8, 16, 64, and 40964096—six in total.

For a relative finite-field extension Fqn/Fq\mathbb{F}_{q^n}/\mathbb{F}_q, the same divisor rule applies: there is exactly one intermediate field of degree dd over Fq\mathbb{F}_q for every divisor dd of nn. Its size is qdq^d.

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 Q\mathbb{Q}; in characteristic pp, every subfield contains Fp\mathbb{F}_p. Beyond that, the answer depends on the field’s structure.

For example, Q\mathbb{Q} has just one subfield, namely itself. In contrast, R\mathbb{R} has infinitely many: for each prime number rr, the set Q(r)\mathbb{Q}(\sqrt{r}) is a subfield of R\mathbb{R}, 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 Fpn\mathbb{F}_{p^n} includes both Fp\mathbb{F}_p and Fpn\mathbb{F}_{p^n}. Remove one or both only if the question asks for proper or nontrivial subfields.
  • Counting divisors without requiring divisibility: A field of order pdp^d occurs inside Fpn\mathbb{F}_{p^n} only when dd divides nn, not merely when d<nd<n.
  • 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

  1. Finite Fields — Rudolf Lidl and Harald Niederreiter
  2. 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.