On the Replacement Property for PSL(2, p)
David Cueto Noval, Aidan A. Lorenz, Baran Zadeo\u{g}lu

TL;DR
This paper investigates the replacement property for the group PSL(2, p), providing a complete characterization for primes p > 5, extending previous partial results and deepening understanding of generating sets in these groups.
Contribution
It offers a comprehensive proof establishing the replacement property for PSL(2, p) when p > 5, filling a gap in the existing literature.
Findings
Complete proof of the replacement property for PSL(2, p) for primes p > 5
Extension of partial results by Nachman to a full characterization
Enhanced understanding of generating sets in finite simple groups
Abstract
The replacement property (or Steinitz Exchange Lemma) for vector spaces has a natural analog for finite groups and their generating sets. For the special case of the groups PSL(2, p), where p is a prime larger than 5, first partial results concerning the replacement property were published by Benjamin Nachman [7]. The main goal of this paper is to provide a complete answer for PSL(2, p).
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Advanced Topology and Set Theory
On the Replacement Property for
David Cueto Noval, Aidan A. Lorenz and Baran Zadeoğlu
Abstract
The replacement property (or Steinitz Exchange Lemma) for vector spaces has a natural analog for finite groups and their generating sets. For the special case of the groups , where is a prime larger than 5, first partial results concerning the replacement property were published by Benjamin Nachman [10]. Second partial results were published by Lam [8]. The main goal of this paper is to provide a complete answer for .
1 Introduction
There is an ongoing effort to create a theory for groups and their generating sequences, analogous to the theory of vector spaces and their respective bases; see [2], [8], [9], [10]. In detail, for a given group , a sequence such that is generated by the is called a generating sequence of length ; if no proper subsequence of generates , then is called irredundant. The largest possible length of an irredundant generating sequence of will be denoted by . The group is said to satisfy the replacement property (abbr. ) if any can replace an element in all irredundant generating sequences of length to yield a new generating sequence of . This property, an obvious analog of the Steinitz Exchange Lemma, does not generally hold for groups. Note that in the case of groups, the new generating sequence need not be irredundant. This definition is motivated further below.
This paper focuses on the groups , where is a prime number . Our main tool is an analysis of the maximal subgroups and their intersections. The following theorem summarizes our findings.
Theorem 1.1
The groups with satisfy . For all other primes , satisfies if and only if or mod and or mod . In other words, we have the following:
[TABLE]
Even though fails for the majority of primes, examples of failure are rare in these cases, in the sense that most elements of can still replace an element in every irredundant generating sequence of length . An element that fails to do so will be called a witness to failure.
Theorem 1.2
Witnesses to failure for must have order or ; if , they must have order .
The rare occurrences of witnesses to failure can be observed empirically via computer algebra systems such as GAP [4]. In fact, checking whether a finite group satisfies can be done computationally. All the code used for this paper can be found on the second author’s GitHub page. For the majority of this paper, proof methodology is elementary and applicable for other classes of groups provided that and the isomorphism classes of maximal subgroups are known. However, the latter half of the proof of the Theorem 1.1 uses extensive knowledge about the subgroup lattice of the group. This can be reduced to character theoretic level using Mackey’s theorem and other considerations of [7].
2 Notational conventions and definitions
Definition 2.1
For a finite group , r() (resp. m()) denotes the length of the shortest (resp. longest) irredundant generating sequence of .
Notation 2.2
* will denote the set of all irredundant generating sequences of of length .*
Applying a more general theorem of Tarski [11] to groups, D. Collins was able to show that for all with , .
Definition 2.3
A sequence of subgroups of a group is said to be in general position if, for all , we have
[TABLE]
We think of maximal subgroups in general position as group theoretic analogs of hyperplanes in general position: maximal subobjects which become strictly smaller upon intersection.
Definition 2.4
For a sequence of maximal subgroups of a group, we say a sequence corresponds to if for all , but .
Given an irredundant generating sequence of a finite group , we can construct a corresponding sequence of maximal subgroups in the following fashion: let
[TABLE]
Since is finite, each is contained in some maximal subgroup . We thus associate to the irredundant generating sequence , the sequence of maximal subgroups . It is straight forward to see that is in general position.
Remark 2.5
Though we can associate any irredundant generating sequence with a corresponding sequence of maximal subgroups in general position, we typically cannot do the converse. One can observe that given a sequence of maximal subgroups in general position , any sequence corresponding to will be irredundant. However these irredundant sequences are not necessarily generating sequences. The question remains open as to when we can make the converse association.
Definition 2.6
Given a sequence of maximal subgroups , we call the radical of S (denoted ) the intersection of all :
[TABLE]
In each of the following two definitions, is a finite group, and is an irredundant generating sequence of .
Definition 2.7
* satisfies the replacement property relative to s if for all , there exists such that generates .*
Remark 2.8
An alternative definition to 2.7 replaces “” with “” where denotes the Frattini subgroup of , which is well known to consist of all non-generators of . For our purposes in studying , we have that for all , so the definitions are equivalent.
Thanks to an unpublished result from R.K. Dennis and D. Collins, we know that for a given finite group and for all with , there exists some such that does not satisfy the replacement property relative to . This allows us to define the replacement property in full generality:
Definition 2.9
Let . We say satisfies the replacement property (abbreviated ) if satisfies the replacement property for all .
Remark 2.10
In the case when , one could also use the definition that satisfies if and only if satisfies (in the sense of 2.9). This is in accordance with Remark 2.8.
Notice, in Definition 2.7, we do not require to be irredundant. If we did, this would quickly lead to the result that for any group satisfying we would have that , which too strictly limits the groups that might possibly enjoy this property. This can be demonstrated by the group , an irredundant generating set containing transpositions and a cycle of length 4.
Some examples of groups that satisfy include [10] and (for it follows from Theorem 2.1 in [1]).
Notation 2.11
Given a finite group , let . We call the subset
[TABLE]
the set of witnesses to failure.
3 An equivalent condition and applications to PSL(2,p)
Proposition 3.1** **(R.K. Dennis & D. Collins (Unpublished))
For a finite group , let . Then satisfies if and only if for every sequence of maximal subgroups in general position of length corresponding to some irredundant generating sequence, , we have that rad.
Proof.
We prove the “if” direction by contrapositive: assume does not satisfy . Then there exists an irredundant generating sequence and an element such that for no can be replaced by to yield a generating sequence. Now for each , let
[TABLE]
with proper containment because was irredundant and fails the replacement property relative to . For each , pick a maximal subgroup such that . Clearly, the sequence corresponds to (thus, is in general position), and by construction, for all .
For the “only if” direction, assume there exists a sequence of maximal subgroups in general position of length , corresponding to some irredundant generating sequence of , , where rad so there exists a nontrivial element, . Then,
[TABLE]
because by assumption. Since was arbitrary, we know that fails the replacement property relative to , and hence does not satisfy . ∎
For a sequence of maximal subgroups in general position corresponding to an irredundant generating sequence we have that . It is known that for any finite non-abelian simple group , . A further result by Jambor [5] follows:
Theorem 3.2** **(Jambor [5])
* for all primes except 7, 11, 19, and 31 in which cases we have .*
Another important result that will be useful in our discussion is the classification of isomorphism types of maximal subgroups of from [3]:
Theorem 3.3
All maximal subgroups of are isomorphic to one of the following:
** 2. 2.
** 3. 3.
** 4. 4.
* if and only if * 5. 5.
* if and only if * 6. 6.
* if and only if ** and ** *
where we use the convention that .
In fact, Dickson studied all subgroups of . One can find a modern version of his work in [6].
For the isolated cases when , B. Nachman showed that satisfies in [10]. In the same paper, Nachman showed that for primes that are congruent to , does not satisfy . Later, Ravi Fernando came up with the conjecture that is our Theorem 1.1.
Before we prove our main theorem, we state and prove some helpful lemmas.
Lemma 3.4
If is a simple group, and maximal subgroups of , and there exists such that , then .
Proof.
Trivial. ∎
Lemma 3.5
For a triple of maximal subgroups to be in general position it must be the case that:
all pairwise intersections are nontrivial 2. 2.
all of the maximal subgroups must have 2 distinct chains of nontrivial subgroups of length at least 3 (where we say the length of a chain is the number of non-trivial subgroups involved, including itself)
Proof.
The first statement is trivial. As for the second, let be a sequence of maximal subgroups in general position. The chains and are distinct chains of length 3 as are in general position. ∎
Lemma 3.6
Let . For , there does not exist an element of order in .
Proof.
Suppose there exists some with order . Then must lie in some maximal subgroup with order divisible by . From Theorem 3.3, we can see that must lie in a copy of . Hence, . But by Lemma 3.4, there is only one such maximal subgroup. Thus cannot be in the intersection of 3 maximal subgroups in general position. Therefore . ∎
We can now return to our main theorem. Its proof is divided in several cases. In Proposition 3.7, we consider the case where, or and or . In Proposition 3.12, we consider the rest of the cases.
Proposition 3.7
If and , then satisfies .
Proof.
According to Theorem 3.3, the possible maximal subgroups in this case are
2. 2.
3. 3.
4. 4.
We will show that no triple of these maximal subgroups can be in general position while still having a nontrivial radical, thus proving the theorem by Proposition 3.1.
Firstly, looking at the subgroup lattice, all chains of nontrivial subgroups of length 3 in contain the unique normal subgroup as the middle term. Therefore, by Lemma 3.5, cannot appear in any triple of maximal subgroups in general position with nontrivial intersection.
Next, suppose we have a sequence of maximal subgroups in general position where each is isomorphic to or and suppose there is a nontrivial element in . By Lemma 3.6, we know that this element can’t have order . Assume further that there exists an element such that . Then,
[TABLE]
In fact, we have . Now, if or contains an element of order larger than 2, then by the argument above we have that
[TABLE]
which contradicts the general position assumption. Now assume contains only elements of order 2 and the identity. If we have then,
[TABLE]
In particular, both and contains elements of order larger than 2. We again get the above contradiction. Now assume all maximal subgroups are isomorphic to and their pairwise intersections have no element of order larger than 2. Then, we must have that for and . However, all isomorphic copies of in a dihedral group must contain the group’s center. In particular,
[TABLE]
Hence, which implies has a center, contradiction. The same arguments also applies to the cases where each are isomorphic copies of or .
Finally, we realize that and cannot appear in the same triple of maximal subgroups in general position with non-trivial radical since any intersection of and can have order at most 2, leaving the intersection with the third maximal subgroup to be trivial.
We have therefore showed that no triple of maximal subgroups from the list of possibilities can be in general position and have nontrivial radical simultaneously. The proof is thereby complete. ∎
Corollary 3.8
Witnesses to failure in have order 2 or 3.
Proof.
Notice that in Proposition 3.7, we only used the criterion that and to build a list of possible maximal subgroups that could occur. Since we showed in the proof that no triple consisting of subgroups isomorphic to can constitute a triple of maximal subgroups in general position with nontrivial radical, we know (from Theorem 3.3) that any triple of maximal subgroups in general position with nontrivial radical must contain an or . That is to say, any witness to failure must lie in some or . Hence, a witness to failure can have order only , or .
To rule out elements of order 5, consider any triple of maximal subgroups in general position: . Suppose this triple corresponds to an irredundant generating sequence and does not intersect trivially, but contains some element such that . Then . The only chain of subgroups of containing is as follows:
[TABLE]
Thus, for the triple to be in general position, it must be the case that
[TABLE]
and
[TABLE]
But , whence Lemma 3.4 implies that and hence,
[TABLE]
which is a contradiction.
We also rule out an element’s having order 4 by the same argument by realizing that the only chain of subgroups of of length 3 ending with a subgroup that contains an element of order 4 is
[TABLE]
∎
Corollary 3.9
The groups with satisfy .
Proof.
By Theorem 3.2, for these primes, it suffices by the Proposition 3.1 that any sequence of maximal subgroup in general position of length 4 would have a trivial radical. Similar considerations as of Corollary 3.8 and of Lemma 3.5 leads to the following observation. Any sequence of maximal subgroup of length 3 in general position with non-trivial radical must have or as its radical. Hence any sequence of maximal subgroups of length 4 must have trivial radical. ∎
We will actually be able to refine Corollary 3.8 using techniques discussed in the following proofs. Even though we will use explicit knowledge about the subgroup lattice of the groups of the type , a similar conclusion can be drawn using the character table. The main tool in this case would be Mackey’s theorem and similar work can be found in [7].
It remains to show that fails for in the remaining cases. To begin this endeavor, we quote a lemma from King [6]:
Lemma 3.10
There are subgroups of isomorphic to . 2. 2.
If , there are subgroups of isomorphic to . 3. 3.
If , then there are subgroups of isomorphic to . 4. 4.
If , then there are subgroups of isomorphic to .
A simple consequence of Lemma 3.10 that is used in subsequent proofs follows:
Lemma 3.11
For (resp. ), always contains two isomorphic copies of ,(resp. ) that intersect in a copy (resp. ).
Proof.
We know that for , has distinct subgroups isomorphic to (item 3 of Lemma 3.10). Further, each has four distinct copies of . Suppose all these copies of were distinct. Then there would be at least
[TABLE]
subgroups of isomorphic to . This contradicts item of Lemma 3.10. Therefore, there exist two copies of must intersect in an . The same line of arguments with corresponding parts of Lemma 3.11 shows that when there exist two copies of that must intersect in an . ∎
We can now prove the rest of Theorem 1.1. Our strategy for the proof will be to use the maximal subgroups in Lemma 3.11 and their intersections to construct irredundant generating sequences of length 3 that fail to replace an element.
Proposition 3.12
If or and , then fails .
Proof.
Case 1: :
We take two subgroups and isomorphic to such that their intersection is isomorphic to . Consider an element of order 2 contained in . Then there is only one subgroup of that is isomorphic to and contains . There is also a unique subgroup of containing . We now take as a maximal subgroup of containing the centralizer of . More precisely, we take as the only subgroup isomorphic to (plus or minus sign according to )[6] that contains both and , namely, is the centralizer of . It is clear that the maximal subgroups , , and are in general position and have nontrivial intersection.
We take to be the element of order 2 in distinct from that is conjugate to in . We take in . Let be an element of order 3 in . Then and is an irredundant generating sequence of since it is irredundant by construction and , which is a maximal subgroup not containing . Finally, note that does not satisfy the replacement property as .
{M_{2}}$${M_{1}\cong S_{4}}$${M_{3}\cong S_{4}}$${A\cong{\mathbb{Z}}_{2}\times{\mathbb{Z}}_{2}}$${M_{1}\cap M_{3}\cong S_{3}}$${B\cong{\mathbb{Z}}_{2}\times{\mathbb{Z}}_{2}}$${{\mathbb{Z}}_{3}\cong\langle g_{2}\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{3}\rangle}$${{\mathbb{Z}}_{2}\cong\langle w\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{1}\rangle}
Case 2: :
We consider two subgroups and isomorphic to such that . Let be an element of order 2 contained in . Then there is only one subgroup of isomorphic to and contains . There is also a unique subgroup of that contains . We now take as a maximal subgroup of containing the centralizer of in . More precisely, we take as the only subgroup isomorphic to (here the order of this dihedral group depends on )[6] which is the centralizer of and contains both and . It is clear that the maximal subgroups , , and are in general position and have nontrivial intersection.
We take an element of order 2 in . We take in . Let be an element of order 5 in . Then and is an irredundant generating sequence of since it is irredundant by construction and , which is a maximal subgroup not containing . Similarly, does not satisfy the replacement property.
{M_{2}}$${M_{1}\cong A_{5}}$${M_{3}\cong A_{5}}$${A\cong{\mathbb{Z}}_{2}\times{\mathbb{Z}}_{2}}$${M_{1}\cap M_{3}\cong D_{10}}$${B\cong{\mathbb{Z}}_{2}\times{\mathbb{Z}}_{2}}$${{\mathbb{Z}}_{5}\cong\langle g_{2}\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{3}\rangle}$${{\mathbb{Z}}_{2}\cong\langle w\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{1}\rangle}
∎
From the last proof it follows that:
Corollary 3.13
If the replacement property fails for , then there is a witness to failure of order 2.
Proposition 3.14
* has a witness to failure of order 3 if and only if .*
Proof.
If , then a similar argument to the one used in the previous proof shows that there exist three maximal subgroups in general position such that (here the order of this dihedral group depends on ), , , , , and . This allows to construct an irredundant generating sequence with a witness to failure of order 3 such that , and .
{M_{1}\cong D_{p\mp 1}}$${M_{2}\cong A_{5}}$${M_{3}\cong A_{5}}$${M_{1}\cap M_{2}\cong S_{3}}$${M_{2}\cap M_{3}\cong A_{4}}$${M_{1}\cap M_{3}\cong S_{3}}$${{\mathbb{Z}}_{3}\cong\langle g_{1}\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{3}\rangle}$${{\mathbb{Z}}_{3}\cong\langle w\rangle}$${{\mathbb{Z}}_{2}\cong\langle g_{2}\rangle}
Conversely, if there is an irredundant generating sequence with a witness to failure of order 3 and , then one of the maximal subgroups of the corresponding sequence of maximal subgroups in general position must be isomorphic to (without loss of generality, ). This leads to a contradiction as both and would have to be equal to the only copy of containing . ∎
Acknowledgement. The authors are thankful to R. K. Dennis for patiently and carefully teaching us the requisite information needed for this paper and for guiding our inquiries in fruitful directions. Further thanks goes to the math department at Cornell University for hosting the SPUR/REU program and of course to our group mates without whom progress would have been far slower and less enjoyable. The first author is grateful to María Cristina Masaveu Peterson Foundation for their funding. The second author would also like to acknowledge and thank the Science Scholars Program at Temple University for summer funding. The third author would like to thank The Crossing Paths for their traveling grant.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Peter J. Cameron and Philippe Cara. Independent generating sets and geometries for symmetric groups. J. Algebra , 258:641–650, 2002.
- 2[2] Dan Collins. Generating Sequences of Finite Groups Senior Thesis , 2010.
- 3[3] Leonard Eugene Dickson. Linear groups: With an exposition of the Galois field theory . with an introduction by W. Magnus. Dover Publications, Inc., New York, 1958.
- 4[4] The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.9.2 , 2018.
- 5[5] Sebastian Jambor. The minimal generating sets of PSL ( 2 , p ) PSL 2 𝑝 {\rm PSL}(2,p) of size four. LMS J. Comput. Math. , 16:419–423, 2013.
- 6[6] Oliver H. King. The subgroup structure of finite classical groups in terms of geometric configurations. In Surveys in combinatorics 2005 , volume 327 of London Math. Soc. Lecture Note Ser. , pages 29–56. Cambridge Univ. Press, Cambridge, 2005.
- 7[7] Edward A. Komissartschik and Sergey V. Tsaranov. Intersections of maximal subgroups in simple groups of order less than 10 6 superscript 10 6 10^{6} . Communications in Algebra , 14(9):1623–1678, 1986.
- 8[8] Hy P. G Lam. The Replacement Property of PSL ( 2 , p ) 2 𝑝 (2,p) and PSL ( 2 , p 2 ) 2 superscript 𝑝 2 (2,p^{2}) . ar Xiv e-prints , page ar Xiv:1709.08745, September 2017.
