On the normalizer of an iterated wreath product
Fernando Szechtman

TL;DR
This paper characterizes the normalizer of an iterated wreath product of a group G within the symmetric group on G^n, revealing it as a semi-direct product involving automorphisms of G.
Contribution
It provides a precise description of the normalizer of iterated wreath products in symmetric groups, including a recursive description of automorphism actions.
Findings
Normalizer equals a semi-direct product involving automorphisms
Explicit recursive description of automorphism action
Applicable to both finite and infinite groups
Abstract
Given a group and , let be the associated iterated wreath product -- unrestricted when is infinite -- viewed as a permutation group on . We prove that the normalizer of in the symmetric group is equal to , where is isomorphic to~. The action of on is recursively described.
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.
Taxonomy
TopicsAdvanced Algebra and Geometry · Geometric and Algebraic Topology · Finite Group Theory Research
On the normalizer of an iterated wreath product
Fernando Szechtman
Department of Mathematics and Statistics, University of Regina, Canada
Abstract.
Given a group and , let be the associated iterated wreath product – unrestricted when is infinite – viewed as a permutation group on . We prove that the normalizer of in the symmetric group is equal to , where is isomorphic to . The action of on is recursively described.
2020 Mathematics Subject Classification:
20E22, 20B35
The author was partially supported by NSERC grant RGPIN-2020-04062
1. Introduction
Given a group and , we let stand for the associated iterated standard wreath product, taken in the unrestricted sense when is infinite, where is viewed as a permutation group on itself via the regular representation and, correspondingly, is viewed as a permutation group on .
If is a prime number, is a Sylow -subgroup of the symmetric group [K], and the normalizer of in is equal to , where is isomorphic to [BJ, Appendix 13]. As it turns out, is but the simplest group for which the latter holds.
Theorem. The normalizer of in the symmetric group is equal to , where is isomorphic to .
The action of on is recursively described in Section 3.
The problem of computing normalizers in the general context of finite permutation groups is addressed in [CCR] from an algorithmic standpoint (see also references therein). The normalizers of certain finite subgroups of the so-called homogeneous symmetric groups are determined in [GK]. The automorphism group of for odd is studied in [B] and [L], and the the automorphism group of the normalizer in is described in [BL]. A variation of with first term , as well as the corresponding automorphism group, is investigated in [R]. The irreducible representations of the iterated wreath product of finite cyclic groups are elucidated in [IW].
2. Unrestricted wreath product of permutation groups
Given permutation groups and acting on sets and respectively, the unrestricted wreath product of and is defined as a permutation group on as follows.
For we set , where , and let , so that is partition of . Given and we define by for all and let , whence the maps and yield a similarity from to .
We naturally view each as a subgroup of . Let be the subgroup of of all permutations of such that for all , and let be the subgroup of all such that the restriction of to is in for each .
We have an embedding , where is given by for all , , and . If no risk of confusion is possible we will identify with . Thus
[TABLE]
It follows that normalizes with , and we set and . The group is known as the base group of and is isomorphic to the Cartesian product of the , . Note that if is finite then is the internal direct product of its subgroups , . Observe also that if then is similar to (this case arises in the inductive proof of our main result when passing from to ).
Lemma A. If and are transitive then so is .
Proof. Given and there are and such that and , so .
Lemma B. If is semiregular, then conjugation by any element of sends every back into .
Proof. Suppose, if possible, that there is such that for some and we have . Then , where and . For let be the subset of of points moved by . Thus and , so
[TABLE]
which implies and a fortiori , a contradiction.
Lemma C. If is semiregular and is transitive, then the partition of is -stable. Thus, there is a group homomorphism , say , with kernel .
Proof. Let and . Take any . Then for a unique . Given any other , we have for some , so that . By Lemma B, , so
[TABLE]
Thus and therefore . But and , so by above . Hence and therefore .
We suppose for the remainder of this section that is regular. Thus, we may assume without loss that under the regular representation.
Lemma D. The map given by
[TABLE]
is a group monomorphism satisfying
[TABLE]
[TABLE]
Proof. This is a routine calculation.
We suppose for the remainder of this section that is transitive.
Lemma E. The image of is .
Proof. As , we see that is contained in the normalizer of the regular subgroup . It is well-known [H, Ch. 6] that this normalizer is the semidirect product of by the group of permutations of associated to the automorphisms of . This group is precisely .
If no risk of confusion is possible, we will write instead of .
Lemma F. We have .
Proof. This is a consequence of Lemmas C and E.
We assume in what follows that for some subgroup of . To each we associate defined by for all and . It is clear that the map yields a group monomorphism whose image will be denoted by .
Lemma G. We have , where , , and .
Proof. Recall that for , , and , we write for the restriction of to , and for the map . Given and , we let be given by for all , and set . Thus .
We claim that . Clearly . Let . Given any , we have , whence . Thus, there is such that satisfies for all . We assert that for some , so that , whence , thereby proving the claim. To see the assertion, let . As , there exists (where the superscript indicates dependence on ) such that , that is, for all . Setting , we proceed to show that . As and , we have , so there exist and (where the superscripts indicate dependence on ) such that . Here , with , so making use of the homomorphism from Lemma C, we infer . On the other hand, as , the very definition of ensures the existence of (where the superscript indicates dependence on ) such that , that is, for all . Thus for every , we have
[TABLE]
Hence for all . As and , with , we deduce for all . Therefore
[TABLE]
which implies , as stated. It now follows from Lemma F that . It is easy to see that and , whence . Here normalizes by construction, and normalizes by Lemma D.
Suppose, finally, that for some , , , and . Applying the homomorphism from Lemma C, we see that and . Then , so forces and .
3. Proof of the theorem and action of on
Lemma H. The unrestricted iterated wreath product is a transitive subgroup of .
Proof. We argue by induction on . The result is clear if . Suppose is a transitive subgroup of for some . Set , where and , and take and . Then is a transitive subgroup of by Lemma A.
Proof of the theorem. We argue by induction on , the theorem being trivially true when . Suppose the result is true for some . Adopting the notation of Lemma H, the inductive hypothesis yields , where . By Lemma H, is transitive, whence Lemma G gives , with , , and , so .
Let us recursively indicate the action of on . If there is nothing to do. Given , we have in the notation of Lemma H, where the action of on is assumed to be known. According to Lemma G, we have with . The action of on is given in Lemma D, while the action of on is described prior to Lemma G.
Acknowledgment. We thank the referee for a careful reading of the manuscript.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[B] Y.V. Bodnarchuk, Structure of the automorphism group of a Sylow p 𝑝 p -subgroup of the symmetric group S p n subscript 𝑆 superscript 𝑝 𝑛 S_{p^{n}} ( p ≠ 2 ) 𝑝 2 (p\neq 2) , Ukr. Mat. Zh. 36 (1984) 688–694.
- 3[BJ] Y. Berkovich and Z. Janko, Groups of prime power order, Volume 1, Berlin, New York, De Gruyter, 2008.
- 4[BL] Y.V. Bodnarchuk and Y.V. Lavrenyuk The automorphism group of a normalizer of the Sylow p 𝑝 p -subgroup of the symmetric group S p n subscript 𝑆 superscript 𝑝 𝑛 S_{p^{n}} , Dopov. Nats. Akad. Nauk Ukr. Mat. Prirodozn. Tekh. Nauki 7 (1999) 7–12.
- 5[CCR] M.S. Chang, C. Jefferson and C.M. Roney-Dougal, Computing normalisers of intransitive groups , J. Algebra 605 (2022) 429–458.
- 6[GK] Ü.B. Güven and M. Kuzucuoğlu, Normalizers of finite subgroups in homogenous symmetric groups and automorphisms , Commun. Algebra 47 (2019) 5182–5191.
- 7[H] Marshall Hall, Jr., The theory of groups , New York, Mac Millan Co., 1959.
- 8[IW] M.S. Im and A. Wu, Generalized iterated wreath products of cyclic groups and rooted trees correspondence , Advances in the mathematical sciences, 15-28, Assoc. Women Math. Ser., 15, Springer, Cham, 2018.
