Definition–Proposition (Finite étale algebras).
Let be a field, and let be a finite-dimensional commutative -algebra. Write . The following conditions are equivalent:
is isomorphic, as an -algebra, to a finite product
where each is a finite separable field extension.
For an algebraic closure of , there is an isomorphism of -algebras
is geometrically reduced over : for every field extension , the algebra
is reduced, meaning that it has no nonzero nilpotent elements.
There exists a finite Galois extension such that
as -algebras.
An algebra satisfying these conditions is called a finite étale -algebra. Equivalently, the morphism
is finite étale.
Here denotes the product of copies of , with coordinatewise operations. We allow the zero algebra, corresponding to the empty product.
Definition (Splitting).
Let be a field extension. A finite étale -algebra is split by if
as -algebras. It is called split over if .
Example.
For a nonconstant polynomial , the algebra is finite étale over if and only if
equivalently, has no repeated roots in an algebraic closure of . In this case, it is split by if and only if splits completely over .
Theorem.
Let be a finite Galois extension, and let . Then there is an equivalence of categories . Here is the category of finite étale -algebras split by , with -algebra homomorphisms as morphisms.
Remark. is a Boolean topos!
Proof.
Notice that is an internal commutative ring in , hence is a functor from to . In fact it takes values in -algebras: since , the constant functions with values in are -equivariant, so each is an -algebra, and precomposition with a -map is an -algebra homomorphism.
We know that every has the orbit decomposition: and each orbit is isomorphic to for some subgroup .
Hence we have
Moreover, each is split by . Indeed, write . Since is normal and separable, the minimal polynomial of over splits into distinct linear factors over . The Chinese remainder theorem therefore gives
Consequently, since commutes with finite products, belongs to . In particular, taking shows that .
Conversely, define
which makes sense since . It is clear that we define a functor to by But we still need to show that is finite.
Let and put . Since is split by , extension of scalars gives
Every -algebra homomorphism is a coordinate projection: the standard orthogonal idempotents must map to or , with exactly one mapping to . Hence
so this set is finite.
Let us prove and .
For a finite , define .
The map is -equivariant, since for
and it is natural in : for a -map and ,
that is, .
To reduce to orbits, we also need that turns finite products into coproducts.
Lemma. For , the map
is a -equivariant bijection.
Proof. Equivariance is clear, and the map is injective on each summand because the projections are surjective. Put . A homomorphism of the form sends to , while one of the form sends to , so the images of the two summands are disjoint. Now let be an -algebra homomorphism. Then is an idempotent of the field , so . If , then for all ,
so with . If , the same argument with gives .
Now let with inclusions . Restriction gives , under which and become the two projections. By naturality, and , so by the lemma is identified with . In particular, is bijective as soon as and are. Moreover, is trivially bijective, since and , and by naturality is compatible with any isomorphism .
By the orbit decomposition, it is therefore enough to consider , then is given by .
Let . The isomorphism
has inverse , where . By precomposition with , it induces an identification
Under this identification, the evaluation homomorphism corresponds to . For every ,
Thus the evaluation map is identified with
Since is Galois, the hypotheses of the following proposition hold for , so this map is bijective. Therefore , and by the reduction above every , is an isomorphism of -sets.
Proposition. Let be a finite separable extension, and let be a finite group with . For every subgroup , the map
is a -equivariant bijection. Moreover, .
Proof. Write . The map is well-defined because fixes pointwise.
Choose with and set
If , then
Hence for some . Since generates , we have . Thus , and consequently
This proves injectivity.
For surjectivity, choose with , let , and put
Since permutes , we have . For any -algebra homomorphism ,
Thus for some . Since , this gives , proving surjectivity. Finally,
so is -equivariant.
Moreover, : since , an element fixes if and only if it fixes pointwise, i.e. if and only if . Equivariant CRT and the uniqueness of representatives of degree less than give
The composite is . Taking -dimensions therefore yields
Proposition. For every , the evaluation map
is an -algebra isomorphism, natural in .
Proof. Write
For each , the function defined by is -equivariant, since
Because the algebra operations on are pointwise, the assignment defines an -algebra homomorphism .
We shall obtain from the following chain of isomorphisms:
Consider the -algebra homomorphism
Extension of scalars gives a bijection
where
Its inverse sends a -algebra homomorphism to the map .
Since is split by , there is a -algebra isomorphism
Every -algebra homomorphism is a coordinate projection: the standard orthogonal idempotents must map to or , with exactly one mapping to . Thus, under a splitting isomorphism, the maps are precisely the coordinate projections. Consequently,
records all the coordinates of , so is an isomorphism.
Equip its source and target with the actions
For , , and , we have
Hence is -equivariant and restricts to an -algebra isomorphism
To identify the left-hand side, choose an -basis of . Every element of has a unique expression
Since acts only on the coefficients,
Such an element is precisely
Thus identifies with .
On the right-hand side, a function is fixed by exactly when
for every and . Therefore
Combining these identifications yields an isomorphism
On elements, this composite is
so it is exactly .
Finally, let be an -algebra homomorphism. The induced map sends to . For every and ,
This proves that is natural in .
End of the proof of the Theorem. We have shown that
are natural isomorphisms. Hence and are mutually quasi-inverse, and
Corollary (Fundamental theorem of Galois theory). Let be a finite Galois extension, and let .
The assignments
are mutually inverse, inclusion-reversing bijections between subgroups of and intermediate fields of . Moreover,
For every , restriction induces a group isomorphism
Consequently, is Galois if and only if , in which case
Proof. (1) Under the equivalence
the algebra corresponds to with its left regular action. Thus subobjects of correspond to equivariant quotients of .
Every quotient makes transitive and specifies a point . Setting , the isomorphism
identifies with the standard quotient . Hence quotients of , up to isomorphism commuting with the quotient maps, are classified by subgroups of .
Applying to gives
Evaluation at and , respectively, identifies this map with the inclusion
since .
Conversely, an intermediate field corresponds to the restriction quotient
Its distinguished point is , whose stabilizer is precisely . These constructions are inverse by the equivalence, proving the claimed bijection.
For , the factorization
corresponds to
so the bijection reverses inclusion. Finally,
and the tower formula gives .
(2) Put . For every ,
By (1), precisely when . Since every -embedding is a restriction of an element of , restriction therefore gives a surjective homomorphism
with kernel , proving the asserted isomorphism.
As is separable and is normal, is Galois precisely when every -embedding has image . By the preceding argument, this is equivalent to , or .
Remark. Fields in correspond to transitive -sets. Specifying an embedding specifies a point of the corresponding -set, and hence a particular stabilizer subgroup. Without the chosen point, the subgroup is determined only up to conjugacy.
Remark (Naturality in )
Fix , and consider finite Galois extensions together with -embeddings between them. Write for the category of all finite étale -algebras, and .
(a) Both sides are functorial in
On the algebra side, let and . Regarding as a -algebra via , we have
Hence as full subcategories of . So is covariant, and the inclusion depends only on the existence of , not on itself.
On the group side, is normal, so every maps onto itself. This gives a homomorphism
It is surjective. Given , we have for by the Corollary. By the first Proposition applied to , the -embedding equals for some , and then .
For we have , so is contravariant. The functor , given by restricting the action along homomorphisms, is also contravariant. Composing the two gives a covariant functor , whose transition functors are the inflations . Since is surjective, is fully faithful. This matches the full inclusion on the algebra side.
(b) Compatibility with the equivalence
For , consider the map
It is injective because is, and both sides have elements, so it is a bijection. It is -equivariant:
It is natural in , since . Hence the square
commutes up to the natural isomorphism . These isomorphisms are compatible with composition and identities:
(c) Only pseudonaturality
Any other -embedding has the form with . Indeed, both embeddings have the same image, namely the subfield of generated by the roots of the minimal polynomial of a primitive element of . Then
On the algebra side, and induce the same inclusion . On the group side, and are different functors unless is central. They are only naturally isomorphic, via
and correspondingly .
Thus the right-hand functor sees the choice of embedding while the left-hand one does not, and the discrepancy is absorbed by coherent natural isomorphisms. In other words, is a pseudonatural equivalence between two functors into the 2-category , rather than a strictly natural one.
(d) Fixing a separable closure
Now fix a separable closure , and use only subfields , with inclusions as morphisms. The indexing category becomes a poset, and the ambiguity in (c) disappears.
Moreover, for , every -algebra homomorphism lands in , since and both have elements. So all the sets are identified with , and each becomes the identity.
Passing to the union over all , one obtains Grothendieck's form of Galois theory:
Here , and the right-hand side is the category of finite sets with a continuous -action.