Hopf-Galois structures on a Galois $S_n$-extension
Cindy Tsang

TL;DR
This paper determines the exact number of Hopf-Galois structures on Galois extensions with symmetric group Galois groups, providing precise enumeration for these algebraic structures.
Contribution
It offers a complete enumeration of Hopf-Galois structures specifically for Galois extensions with symmetric group Galois groups, a case not fully understood before.
Findings
Exact count of Hopf-Galois structures for Galois $S_n$-extensions
Provides formulas or methods for enumeration
Enhances understanding of algebraic structures in Galois theory
Abstract
In this paper, we shall determine the exact number of Hopf-Galois structures on a Galois -extension, where denotes the symmetric group on letters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Hopf-Galois structures on a Galois -extension
Cindy (Sin Yi) Tsang
School of Mathematics, Sun Yat-Sen University, Zhuhai
[email protected] http://sites.google.com/site/cindysinyitsang/
Abstract.
In this paper, we shall determine the exact number of Hopf-Galois structures on a Galois -extension, where denotes the symmetric group on letters.
Contents
1. Introduction
Let be a finite Galois extension with Galois group . Write for the symmetric group of . Recall that a subgroup of is said to be regular if the map
[TABLE]
is bijective, or equivalently, if the -action on is both transitive and free. For example, the images of the left and right regular representations
[TABLE]
respectively, are both regular subgroups of . By work of C. Greither and B. Pareigis in [9], there is an explicit one-to-one correspondence between Hopf-Galois structures on and elements in
[TABLE]
In turn, this set may be written as a disjoint union of the subsets
[TABLE]
where ranges over all groups of order , up to isomorphism. Hence, it is of interest to enumerate and . A useful tool is the formula
[TABLE]
where denotes the holomorph of and is given by
[TABLE]
This was shown by N. P. Byott in [2]; or see [6, Section 7]. We shall refer the reader to [6, Chapter 2] for more background on Hopf-Galois structures.
For each , we shall use the standard notation:
[TABLE]
The purpose of this paper is to determine the exact size of for each group of order and hence the size of . For , trivially
[TABLE]
For , by [3, Corollary 6.5], we already know that
[TABLE]
For , using the formula (1.1) and the magma code in the appendix, we may compute that:
Theorem 1.1**.**
Let be a group of order . Then, we have
[TABLE]
In particular, we have .
Remark 1.2*.*
The first and last cases in Theorem 1.1 were known previously, by [5, Theorem 7] and [7, Proposition 4], respectively.
For , it was computed in [5, Corollaries 6 and 10], respectively, that
[TABLE]
Also, the case when is slightly different because has an exceptional outer automorphism. In [5, p. 91], it was shown that
[TABLE]
where denotes the Mathieu group of degree . Our main result is that for all other choices of . More precisely, we shall prove:
Theorem 1.3**.**
For , let be a group of order . Then, we have
[TABLE]
In particular, we have
[TABLE]
2. Hopf-Galois structures on a Galois -extension for
In this section, assume that , in which case is non-abelian simple, and let be a group of order . In [10, Theorem 1.7], the author gave some necessary conditions on in order for to be non-zero. Below, we shall refine the arguments there to prove Theorem 1.3.
As already noted in [10, Proposition 2.1], which is a consequence of (1.2), a subgroup of isomorphic to is of the shape
[TABLE]
satisfy the relation
[TABLE]
Moreover, the subgroup (2.1) is regular precisely when is bijective. Hence, by (1.1), if is non-zero, then we may choose to be bijective. In view of (1.3) and (1.4), to prove Theorem 1.3, it then suffices to show that
[TABLE]
To that end, given any group , we shall use the following notation:
[TABLE]
Recall that is said to be perfect if . The implication (2.3), and in particular Theorem 1.3, is a direct consequence of the propositions below.
Proposition 2.1**.**
Suppose that is bijective. Then, we have:
- (a)
The group cannot be perfect. 2. (b)
The group contains a copy of .
Proposition 2.2**.**
Suppose that contains a copy of . Then, we have:
[TABLE]
Hence, it remains to prove Propositions 2.1 and 2.2, which we shall do in the subsequent subsections.
2.1. Ruling out the groups which are perfect
In what follows, suppose that is bijective, and we shall prove Proposition 2.1 (a). Let us remark that this is the hardest step to the proof of Theorem 1.3.
Suppose for contradiction that is perfect. Note that then cannot have a subgroup of index two, because such a subgroup is normal, and its quotient is abelian. Also, it shall be helpful to recall that is the unique non-trivial proper normal subgroup of , since .
Lemma 2.3**.**
The homomorphism is injective.
Proof.
Notice that restricts to a homomorphism by (2.2). This implies that cannot contain , since has no subgroup of index two, and hence must be trivial. ∎
Recall that the double cover of is the unique group , up to isomorphism, fitting into a short exact sequence
[TABLE]
such that the image of in lies in and . It is known that is a perfect group whose center has order two.
Lemma 2.4**.**
*We have and . *
Proof.
Let be any proper and maximal characteristic subgroup of . The quotient group is then characteristically simple, and so we have
[TABLE]
Since is perfect, necessarily is non-abelian. Also, it is known that
[TABLE]
by [4, Lemma 3.2], for example. Note that there is a natural homomorphism
[TABLE]
because is characteristic. We then have a homomorphism
[TABLE]
induced by . Replacing by in the proof of [10, Lemma 4.8], the exact same argument shows that the homomorphism
[TABLE]
must be trivial, and in turn the homomorphism
[TABLE]
must be trivial as well. Hence, we conclude that lies in . Let us remark that the argument in [10, Lemma 4.8] uses [10, Proposition 3.4], which is a consequence of the classification of finite simple groups.
Next, consider the surjective map
[TABLE]
induced by . As shown in [10, Lemma 4.1], the relation (2.2) implies that:
- •
restricts to a homomorphism ,
- •
is a subgroup of of index .
The latter in turn implies that , for otherwise
[TABLE]
which is impossible because is non-abelian. We consider two possibilities:
- (1)
If , then restricts to a homomorphism , which cannot be trivial because , and so must be an embedding. 2. (2)
If , the restricts to an embedding .
In both cases, we have and hence . Necessarily , for otherwise , and would embed into as a subgroup of index two. It follows that , whence
[TABLE]
Since any normal subgroup of order two lies in the center, by the uniqueness of the double cover of , we see that and .
Since , the map (2.4) is injective, by [10, Proposition 3.5 (c)], for example. It follows that embeds into and so is abelian. Thus, the homomorphism
[TABLE]
must be trivial, whence lies in . ∎
From Lemmas 2.3 and 2.4, we deduce that induces an isomorphism
[TABLE]
where is any injective map satisfying
[TABLE]
Also, let be the element such that is the generator of .
Lemma 2.5**.**
We have .
Proof.
Using (2.2), it is easy to check that the map
[TABLE]
is a homomorphism. It cannot be trivial, for otherwise by picking a different if necessary, we may assume that for all . But then again by (2.2), for all , we have
[TABLE]
which means that is in fact a homomorphism. This is impossible since is injective and cannot have any subgroup of index two. We have thus shown that must be an isomorphism. Put , which is an automorphism on . If , then for any , we would have
[TABLE]
namely is fixed point free. But has no such automorphism since . Hence, we must have , as claimed. ∎
Lemma 2.6**.**
For any , we have
[TABLE]
Moreover, the element has order two.
Proof.
By (2.2), we have
[TABLE]
Since has order two, its generator has to be fixed by all automorphisms on . We then see that as well as
[TABLE]
The claim then follows since by Lemma 2.5 and is bijective. ∎
By Lemmas 2.5 and 2.6, we know that has order two and lies in . We may then assume, without loss of generality, that
[TABLE]
Also, recall from Lemma 2.4 that , and write
[TABLE]
for some lift of in , where the notation is as in [11, Chapter 2.7.2]. Given any element in a group , let denote the centralizer of in .
Lemma 2.7**.**
We have
[TABLE]
Proof.
The first equality is obvious because commutes with . As for the second equality, note that the quotient map induces a homomorphism
[TABLE]
which is -to- and whose image has index at most two. But
[TABLE]
in the notation of [11, Chapter 2.7.2], where is non-trivial. This means that the index is in fact equal to two, from which the claim follows. ∎
We are now ready to prove Proposition 2.1 (a). From Lemma 2.6 and the fact that is an isomorphism, we deduce that
[TABLE]
But this contradicts Lemma 2.7, whence cannot be perfect, as desired.
2.2. Reducing to the groups which contain a copy of
In what follows, suppose that is bijective, and we shall prove Proposition 2.1 (b)
By Proposition 2.1 (a), the group is not perfect, so it has a proper and maximal characteristic subgroup containing . The quotient is then abelian, and by the proof of the second statement of [10, Theorem 1.7], we know that . This means that restricts to a bijective map
[TABLE]
Also, since is characteristic, the map induces a homomorphism
[TABLE]
Clearly, it follows directly from (2.2) that
[TABLE]
Analogous to (2.1), this implies that has a regular subgroup isomorphic to . Since is non-abelian simple, we deduce from [4] that . This proves that contains a copy of , as desired.
2.3. Classifying group extensions of by
In what follows, suppose that contains a copy of , and we shall prove Proposition 2.2. Since any subgroup of index two is necessarily normal, the hypothesis implies that fits in a short exact sequence
[TABLE]
We shall write for the image of in and for the non-trivial element in . Let us make two observations.
Lemma 2.8**.**
The short exact sequence (2.5) splits if .
Proof.
For each , note that we have an automorphism
[TABLE]
Fix an element . Suppose now that , so then , with corresponding to .
- (1)
If , then there exists such that has order two, which means that centralizes . 2. (2)
If , then there exists such that is the identity, which means that centralizes .
In both cases, since and , we deduce that has order two. Thus, by sending , we obtain a homomorphism which splits the short exact sequence (2.5), as desired. ∎
Lemma 2.9**.**
Let be a homomorphism such that
[TABLE]
for some . Then, we have
[TABLE]
Proof.
Note that must have order dividing two. Also, we have
[TABLE]
for all and . It is then straightforward to verify that
[TABLE]
defines an isomorphism if , and
[TABLE]
defines an isomorphism if . This proves the claim. ∎
We are now ready to prove Proposition 2.2. For , the claim may be verified using the magma code in the appendix. For , the claim is a direct consequence of Lemmas 2.8 and 2.9 because then .
3. Acknowledgments
The author would like to thank the referee for some helpful comments. She would also like to recognize the software magma [1] and gap [8] which were used in the computations to deal with the cases .
Appendix: magma codes
magma code :
G:=SymmetricGroup(4);
AutG:=AutomorphismGroup(G);
NN:=SmallGroups(24);
for i in [1..#NN] do
N:=SmallGroup(24,i);
AutN:=AutomorphismGroup(N);
Hol:=Holomorph(N);
RegSub:=RegularSubgroups(Hol);
L:=[0]; // sizes of the conjugacy classes of regular subgroups in Hol(N) isomorphic to G
for R in RegSub do
if IsIsomorphic(R‘subgroup,G) then
Append(~L,R‘length);
end if;
end for;
E:=(#AutG/#AutN)*&+L; // formula (1.1)
if E ne 0 then
print <i,E>;
end if;
end for;
magma code output:
<12,8> // SmallGroup(24,12) = S4
<13,36> // SmallGroup(24,13) = A4 x C2
<14,24> // SmallGroup(24,14) = S3 x C2 x C2
<15,48> // SmallGroup(24,15) = C6 x C2 x C2
// The identifications of SmallGroup(24,i) here may be checked using
the StructureDescription() or IdGroup() command in gap.
magma code :
A6:=AlternatingGroup(6);
NN:=SmallGroups(720);
for i in [1..#NN] do
N:=SmallGroup(720,i);
if not IsSolvable(N) then // for N to contain a copy of A6 necessarily N is insolvable
NorSub:=NormalSubgroups(N);
AA:=[A:A in NorSub|IsIsomorphic(A‘subgroup,A6)];
if not IsEmpty(AA) then
i;
end if;
end if;
end for;
magma code output:
763 // SmallGroup(720,763) = S6
764 // SmallGroup(720,764) = PGL(2,9)
765 // SmallGroup(720,765) = M10
766 // SmallGroup(720,766) = A6 x C2
// The identifications of SmallGroup(24,i) here may be checked using
the StructureDescription() or IdGroup() command in gap.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system. I. The user language , J. Symbolic Comput., 24 (1997), 23–265.
- 2[2] N. P. Byott, Uniqueness of Hopf-Galois structure of separable field extensions , Comm. Algebra 24 (1996), no. 10, 3217–3228. Corrigendum, ibid . no. 11, 3705.
- 3[3] N. P. Byott, Hopf-Galois structures on Galois field extensions of degree p q 𝑝 𝑞 pq , J. Pure Appl. Algebra 188 (2004), no. 1–3, 45–57.
- 4[4] N. P. Byott, Hopf-Galois structures on field extensions with simple Galois groups , Bull. London Math. Soc. 36 (2004), no. 1, 23–29.
- 5[5] S. Carnahan and L. N. Childs, Counting Hopf-Galois structures on non-abelian Galois field extensions , J. Algebra 218 (1999), no. 1, 81–92.
- 6[6] L. N. Childs, Taming wild extensions: Hopf algebras and local Galois module theory . Mathematical Surveys and Monographs, 80. American Mathematical Society, Providence, RI, 2000.
- 7[7] T. Crespo, A. Rio, and M. Vela, Hopf Galois structures on symmetric and alternating extensions , New York J. Math. 24 (2018), 451–457.
- 8[8] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.10.0; 2018.
