A Magnus theorem for some amalgamated products
Carsten Feldkamp

TL;DR
This paper proves the Magnus property for certain amalgamated products, including the fundamental group of a non-orientable surface of genus 3, extending previous results for higher genus surfaces.
Contribution
It establishes the Magnus property for specific amalgamated products, notably including genus 3 non-orientable surface groups, answering an open question in the field.
Findings
Magnus property holds for some amalgamated products
Includes fundamental groups of non-orientable surfaces of genus 3
Extends results previously known for genus greater than 3
Abstract
A group possesses the Magnus property if for every two elements with the same normal closure, is conjugate in to or . We prove the Magnus property for some amalgamated products including the fundamental group of a closed non-orientable surface of genus 3. This answers a question of O. Bogopolski and K. Sviridov, who obtained the analogous result for genus .
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.
A Magnus theorem for some amalgamated products
Carsten Feldkamp
Abstract
A group possesses the Magnus property if for every two elements with the same normal closure, is conjugate in to or . We prove the Magnus property for some amalgamated products including the fundamental group of a closed non-orientable surface of genus 3. This answers a question of O. Bogopolski and K. Sviridov, who obtained the analogous result for genus .
1 Introduction
A group possesses the Magnus property if for every two elements with the same normal closure, is conjugate in to or . The Magnus property was named after W. Magnus who proved the so-called Freiheitssatz (see Theorem 4.1) and the Magnus property for free groups [Mag30]. Since then, many mathematicians proved or disproved the Freiheitssatz and the Magnus property for certain classes of groups (see e.g. [Bog05], [BS08], [Edj89], [How81], [How04]).
Let , respectively , be the fundamental group of the compact orientable, respectively non-orientable, surface of genus . The Magnus property of for all was proved independently by O. Bogopolski [Bog05] (by using algebraic methods) and by J. Howie [How04] (by using topological methods). As observed in [Bog05], there is a third, model theoretic method: two groups , are called elementarily equivalent if their elementary theories coincide: , see [CG05]. It is easy to show that elementarily equivalent groups either both possess the Magnus property, or both do not possess it. Since the groups for and for are elementarily equivalent to the free group on two generators, all these groups possess the Magnus property.
In [BS08], O. Bogopolski and K. Sviridov proved the following theorem:
Theorem 1.1**.**
[BS08**, Main Theorem]*** Let , where , are non-trivial reduced words in letters , and have no common letters. Let be two elements with the same normal closures. Then is conjugate to or .*
As a corollary of that theorem ([BS08, Corollary 1.3]), they showed the Magnus property of for . Since the Magnus property trivially holds for genus and , the authors asked, whether it also holds for the fundamental group of the non-orientable surface of genus 3. With our Main Theorem, that proves the Magnus property for a slightly larger subclass of one-relator groups than in Theorem 1.1, we answer this question positively. The difficulty with genus is essential since it is well known that the group is not even existentially equivalent to a free group on generators. However, in large parts, our proof follows the proof of the Main Theorem in [BS08].
Main Theorem 1.2**.**
Let , where and is a non-trivial reduced word in the letters . Then possesses the Magnus property.
Using the isomorphism between and defined by and , we get the following corollary.
Corollary 1.3**.**
The group possesses the Magnus property.
In the proof of Theorem 1.1, the authors of [BS08] used an automorphism of with certain convenient properties. This automorphism is in general absent for the group given in our Main Theorem. For example, it is absent for the group . So we introduce an additional tool which we call - and -limits (see Section 3). Together with the results of [BS08, Bog05, How04] Corollary 1.3 implies the following.
Corollary 1.4**.**
The fundamental groups of all compact surfaces possess the Magnus property.
We will start the proof of our main theorem by recapitulating the notation of [BS08, Section 3] with some small alterations. In Section 3 we introduce - and -limits, --length and suitable elements. In Section 4 we give the proof for the case, where the --length of suitable elements is positive (the consideration of this case is close to that in [BS08]). In Section 5 we complete the proof in the remaining case.
2 Reduction to a new group and left/right bases
We denote the normal closure of an element in a group by and the exponent sum of an element in a letter by . Note that this sum is well-defined if all relations of considered as words of a free group have exponent sum [math] in . Our main theorem can be deduced from the following proposition in the same way as in the Main Theorem of [BS08] from [BS08, Proposition 2.1]. Therefore we leave this argumentation out.
Proposition 2.1**.**
Let , where and is a non-trivial reduced word in the letters . Further, let with . Then implies that is conjugate to or .
We briefly summarise the concept of left and right bases from [BS08]. For a given group and an element we denote by the element for .
Let be as in Proposition 2.1. We consider the homomorphism which sends to and to [math]. For each let , where . Using the rewriting process of Reidemeister-Schreier, we obtain that the kernel of has the presentation
[TABLE]
The group is the free product of the free groups with amalgamation, where and are amalgamated over a cyclic group that is generated by in and by in . This gives for all , where
[TABLE]
for .
Proposition 2.2**.**
For every , the group is free with basis
[TABLE]
Proof.
Since , it suffices to show that each has the basis
[TABLE]
We have , where . Using Tietze transformations, one can show that is free with basis . Since , the group is free with basis . ∎
Notation. Let , and for all with . Further, we use the
[TABLE]
Remark 2.3**.**
Let be written as a word in the letters . For an arbitrary we describe how to rewrite in the basis . First, replace each letter of by , if , and by , if , and reduce. If the resulting word contains that do not belong to , we repeat this procedure. After finitely many steps, we will obtain the desired form of . Analogously, we can rewrite in the basis .
3 - and -limits
We keep using the notation introduced in Section . An arbitrary element can be written in many ways as a reduced word in letters . For example, . We give an algorithm which finds a word representing such that the smallest index of letters used in is maximum possible. We call such index the -limit of and denote it by . In other words, is the largest index such that is an element of . The following algorithm rewrites an arbitrary word into the presentation of written in basis (see Lemma 3.2). For a word in the alphabet , let denote the minimal index of letters of .
Algorithm 3.1**.**
Let . Suppose that is given as a finite word in letters and (). In particular, . Let be the reduced word representing in basis . Increasing if necessary, we may assume that .
- (1)
Let be the word obtained from by replacement of each occurrence of the letter by followed by free reduction. Then presents in the following basis of :
[TABLE]
- (1a)
If does not contain a letter (), we reset , , and go back to . Clearly, the new is larger than the old one. 2. (1b)
If contains a letter (), the algorithm ends with and .
Lemma 3.2**.**
The output of Algorithm 3.1 coincides with the word representing in Basis , where is the -limit of .
Proof.
We shall prove that the algorithm ends and that the integer assigned to by the algorithm is really the -limit of .
The algorithm ends since the length of decreases with each iteration of (1) which does not terminate the algorithm. This can be verified in the following way: If we arrive in (1a), then the word does not contain a letter (). Recall that was obtained from by replacing all with and reducing the resulting word. The fact that there is no letter () left in means that each in occurred in a subword of the form . Therefore is shorter than .
Finally, we show that is not an element of , where as in (1b). Observe that
[TABLE]
By (1b), , written in basis ( ‣ (1)), uses a letter (). Therefore and . ∎
Corollary 3.3**.**
Let be an element from given as a word in some -left basis. Starting Algorithm 3.1 with , we either get the same presentation or a presentation of shorter length.
Proof.
In the proof of Lemma 3.2, we already showed that the length of in Algorithm 3.1 decreases with each iteration of (1) which does not terminate the algorithm. Moreover, the last iteration of Algorithm 3.1 does not change the current presentation . ∎
Analogously, we can find a presentation of a word such that the largest used index of letters in is minimum possible. We call this index -limit of and denote it by . In other words, is the smallest index such that is an element of . The algorithm to find can be received from Algorithm 3.1 by “mirroring” this algorithm using the -right basis of and replacements of by . We define the --length of by . Note that the --length of a non-trivial element can be non-positive.
Examples.
- (i)
Let and . To determine , we write and get . For we have Thus, and . Note that .
- (ii)
Let and . Clearly, . To determine , we write . Thus, and .
Lemma 3.4**.**
Let . Then and for all . In particular, for all .
Proof.
Indeed, can be obtained from by increasing the (second) indices of all letters by . ∎
Notation. Let . For the following two lemmata, let be the presentation of written in basis .
Lemma 3.5**.**
Let . The following statements are equivalent:
- (1)
For some , the word begins with a positive power of a -letter.
- (2)
For all , the word begins with a positive power of a -letter.
Proof.
The word can be obtained from , by replacement of each occurrence of in by followed by free reduction. The new letter does not lie in . That prevents cancellation between -letters in . Therefore starts with a positive exponent of a -letter if and only if starts with a positive exponent of a -letter. This proves the equivalence . ∎
Corollary 3.6**.**
For every there exists a conjugate of such that is cyclically reduced for each .
Proof.
Using conjugation, we may assume that is cyclically reduced. If contains only -letters, we are done with the element represented by . Suppose that contains a -letter. Let be the element represented by a cyclic permutation of which either starts with a positive power of a -letter, or ends with a negative power of a -letter (but not both). By Lemma 3.5, this has the desired property. ∎
Definition 3.7**.**
Let . Any element as in Lemma 3.6 is called suitable conjugate for .
Remark 3.8**.**
(dual structure of ) Denote , () and . We call the elements () dual to () and the subgroup dual to . Expressing -letters and -letters via their dual, we obtain , (), where () is the word obtained from by replacing each letter with . That justifies the terminology.
Observe that the old relations can be rewritten in dual letters as . Thus, the relations preserve their form. Moreover, we have that repeats the form . Other dual objects can be defined analogously: For example, and . We use the following bases of ():
[TABLE]
along with the
[TABLE]
For , let be the largest index such that is an element of and let be the smallest index such that is an element of . We denote .
Lemma 3.9**.**
For any non-trivial the following statements are valid.
- (1)
We have , , and . 2. (2)
Suppose that written in a basis is cyclically reduced and begins with a positive power of a -letter. Then written in the basis is cyclically reduced and begins with a positive power of a -letter.
Proof.
Both statements can be verified straightforward by using the relations , (). ∎
4 Proof of Proposition 2.1 for with positive --length
4.1 Properties of with positive --length
We use the following version of Magnus’ Freiheitssatz:
Theorem 4.1** (Magnus’ Freiheitssatz (cf. [Mag30])).**
Let be a free group on a basis , and let be a cyclically reduced word in with respect to , containing a letter . Then the subgroup generated by is naturally embedded into the group .
By abuse of notation, we write instead of , where is a group and .
Corollary 4.2**.**
Let be a suitable element. Then we get the embeddings and .
Proof.
By the definition of -limits, written in basis contains at least one letter in , and by Definition 3.7, the suitable element is cyclically reduced in this basis. We extend to a free basis of by adding the letters . The presentation of will not change by that. Now, follows immediately from Theorem 4.1. The other embedding follows analogously. ∎
Lemma 4.3**.**
Suppose that satisfies . Then , written in the basis of , contains at least one letter with .
Proof.
By assumption, . To the contrary, suppose that
[TABLE]
Then, using relations , we obtain
[TABLE]
Hence . A contradiction. ∎
4.2 The structure of some quotients of
This section and the next one are very similar to [BS08, Section 4 and 5], but due to some important changes we cannot skip them. Our aim in this subsection is to present as an amalgamated product. We denote .
Lemma 4.4**.**
Let be a suitable element with , and let be two integers with . We denote and . Then we have:
- (1)
N/\langle\!\langle\widetilde{r_{i}},\widetilde{r}_{i+1},\dots,\widetilde{r}_{j}\rangle\!\rangle\ \cong\ G_{-\infty,t}/\langle\!\langle\widetilde{r}_{i},\widetilde{r}_{i+1},\dots,\widetilde{r}_{j-1}\rangle\!\rangle\underset{\begin{array}[]{ll}w_{t-k+1}\!\!&=b_{t+1},\vspace*{-3mm}\\ \dots&\vspace*{-3mm}\\ w_{t}\!\!&=b_{t+k}\\ \end{array}}{\underset{G_{s,t}}{\ast}}G_{s,\infty}/\langle\!\langle\widetilde{r}_{j}\rangle\!\rangle.
- (2)
* naturally embeds into .*
Before we give a formal proof, we consider an illustrated example. This will help to visualise a lot of technical details in the formulation of lemma.
Example. Let . We consider the element and the integers and .
Algorithm 3.1 applied to gives . Its “mirrored” version gives . In particular, . Furthermore, we have and . Then Lemma 4.4 (1) says that
[TABLE]
In Figure 1, the word is pictured by the (partially dashed) line crossing the blocks since uses letters with indices from the segment . We can represent by the word that uses letters with indices from the segment , and we can represent by the word that uses letters with indices from the segment . To visualise the fact that and , we draw a continuous line crossing the blocks .
Proof.
First, we prove that (1) implies (2). By Corollary 4.2, we have , and if (1) holds, then we have . The composition of these two embeddings gives (2). Now we prove (1) for fixed by induction on .
Base of induction. For we shall show
[TABLE]
It suffices to show the following claim.
Claim. Let be the subgroup of generated by . Then
- (a)
embeds into and . 2. (b)
The abstract amalgamated product in the right side of (4.1) is canonically isomorphic to .
Proof of the claim. (a) Clearly, embeds into . So, we show that embeds into . Note that . Thus, the group is generated by the set
[TABLE]
This set is a part of the free basis of . By Definition 3.7, written in is cyclically reduced. Further, by statement (1) of Lemma 4.3, the element written in contains at least one letter with and . In particular, this letter does not lie in the set (4.2). By Magnus’ Freiheitssatz (Theorem 4.1), embeds into .
Now, the amalgamated product in (4.1) is well defined. It is easy to check that the groups written in (4.1) are isomorphic by finding a common presentation. This completes the base of induction.
Inductive step . We need to show the formula, where and :
[TABLE]
Let be the subgroup of generated by and the set . First, we prove that canonically embeds into both factors. As above embeds into . So we show that embeds into using the following commutative diagram:
[TABLE]
Let be the composition of the canonical embedding of the subgroup into and the canonical homomorphism from to the factor group . It remains to prove that is an embedding. Considering as a subgroup of and using statement (2) for (recall that (1) implies (2)), we have an embedding of into . Since the diagram is commutative, is an embedding. Again, it is easy to check that the groups in (4.3) are isomorphic. ∎
Finally, we need a “mirrored” version of Lemma 4.4:
Lemma 4.5**.**
Let be a suitable element with , and let be two integers with . We denote and . Then we have:
- (1)
N/\langle\!\langle\widetilde{r_{i}},\widetilde{r}_{i+1},\dots,\widetilde{r}_{j}\rangle\!\rangle\ \cong\ G_{-\infty,t}/\langle\!\langle\widetilde{r}_{i}\rangle\!\rangle\underset{\begin{array}[]{ll}w_{s-k}\!\!&=b_{s},\vspace*{-3mm}\\ \dots&\vspace*{-3mm}\\ w_{s-1}\!\!&=b_{s+k-1}\\ \end{array}}{\underset{G_{s,t}}{\ast}}G_{s,\infty}/\langle\!\langle\widetilde{r}_{i+1},\widetilde{r}_{i+1},\dots,\widetilde{r}_{j}\rangle\!\rangle.
- (2)
* naturally embeds into .*
Proof.
Due to the dual structure noticed in Remark 3.8, the statements of Corollary 4.2, Lemma 4.3 and Lemma 4.4 also hold for the dual objects. By rewriting the dual version of Lemma 4.4 with the help of Lemma 3.9, we get the desired statement. ∎
4.3 Conclusion of the proof for with positive --length
By assumption of Proposition 2.1, we have two elements with the same normal closure and . Thus, are elements of . By Lemma 3.6, we can choose conjugates of such that and are suitable elements. Normal closures are invariant under conjugation. So, without loss off generality, we can replace by . In this section we assume . Since the normal closures of and in are equal, the normal closures of and in are equal. In particular, is trivial in . Thus, there are indices such that is trivial in . We choose a pair with this property and minimal. By Lemma 4.4 (1), we have
[TABLE]
for some subgroup .
Lemma 4.6**.**
Suppose that . Then
- (1)
, 2. (2)
, 3. (3)
**
Proof.
(1) We prove . Suppose the contrary. Then . Since is trivial in , it is also trivial in the left factor of the amalgamated product (4.4). Therefore, is trivial in . This contradicts the minimality of . The inequality follows by Lemma 3.4 since . Inequalities (2) can be proved analogously with the help of Lemma 4.5 (1). Inequality (3) follows straightforward from (1) and (2). ∎
Since , we have by symmetry and therefore . By Lemma 3.4, this is equivalent to . This and the first two statements of Lemma 4.6 imply that , and , in particular, . Therefore, is trivial in , and the index is determined by . One can prove in the same way that is trivial in . Thus, . From Section 2 we know that is a free group. So by Theorem 4.1, is conjugate to in . Finally, is conjugate to in , and the proof of Proposition 2.1 in the case is completed. ∎
5 Proof of Proposition 2.1 for with non-positive --length
5.1 Properties of with non-positive --length
Lemma 5.1**.**
Let be an element in with . Then the reduced word representing in basis contains only ’s.
Proof.
We have . By definition, and .
Let be the reduced word representing in the basis of . Recall that
[TABLE]
where .
Let be the reduced word representing in the basis of . Recall that
[TABLE]
where .
For each , there is a unique such that . Then can be obtained from by replacements of all letters by followed by reduction (see Remark 2.3). The second indices of -letters appearing in these replacements lie in the interval . The second indices of -letters of lie in the interval . Therefore, the second indices of -letters of (if exist) lie in . Hence, does not have -letters. ∎
5.2 Conclusion of the proof for with non-positive --length
As in Section 4.3, we can replace the elements from Proposition 2.1 by suitable elements . In this section, we consider the case . Assuming , we immediately get a contradiction by applying Lemma 4.6 with reversed roles of and . Thus, we have .
By Lemma 5.1, there are presentations of and in which use only , . So by means of the relations , we get presentations of and as elements in
[TABLE]
that only use and .
Thus, , where is the subgroup of generated by and . We have the presentations
[TABLE]
where is the free group in two generators and the isomorphism to follows from the Magnus’ Freiheitssatz.
Convention. For , let be the normal closure of in and let be the normal closure of in .
Consider the canonical homomorphism . There are two cases:
Case 1. for all .
In this case is an embedding. We identify the subgroup of with its image in . Then
[TABLE]
Case 2. for some .
We choose the smallest with this property. Using Tietze transformations, we write:
[TABLE]
Thus, in both cases, we have the embedding .
We already know that is an element of the subgroup of . Further, is trivial in since . Now, we use the embedding to conclude that is trivial in . By symmetry, is trivial in , and we get .
As we have seen in (5.1), the group is isomorphic to the free group of rank 2, and this group possesses the Magnus property (cf. [Mag30]). Hence, is conjugate to in , and since , the element is conjugate to in . ∎
Acknowledgements. This work is based on my M.Sc. thesis, Heinrich Heine Universität Düsseldorf, 2015. I would like to express my special thanks to my supervisor Professor Oleg Bogopolski for the subject proposal and the support during and after the preparation of my M.Sc. thesis. I also want to thank Professor Benjamin Klopsch for his editorial help.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bog 05] O. Bogopolski. A surface group analogue of a theorem of Magnus. In Geometric Methods in Group Theory , pages 59–69. Contemp. Math., Bd. 372, Amer. Math. Soc., Providence, Rl, 2005.
- 2[BS 08] O. Bogopolski and K. Sviridov. A Magnus theorem for some one-relator groups. Geometry & Topology Monographs , 14:63–73, 2008.
- 3[CG 05] C. Champetier and V. Guirardel. Limit groups as limits of free groups: compactifying the set of free groups. Israel Journal of Mathematics , 146(1), 2005.
- 4[Edj 89] M. Edjvet. A Magnus theorem for free products of locally indicable groups. Glasgow Mathematical Journal , 31:383–387, 1989.
- 5[How 81] J. Howie. On pairs of 2-complexes and systems of equations over groups. Journal für die reine und angewandte Mathematik , 324:165–174, 1981.
- 6[How 04] J. Howie. Some results on one-relator surface groups. Boletín de la Sociedad Matemática Mexicana , 10(3):255–262, 2004.
- 7[Mag 30] W. Magnus. Über diskontinuierliche Gruppen mit einer definierenden Relation. (Freiheitssatz). Journal für die reine und angewandte Mathematik (Crelles Journal) , 163:141–165, 1930.
