6
$\begingroup$

Suppose $C\leq A,B$ are finitely generated groups of finite exponent. Can $A$ and $B$ be amalgamated over $C$ in a group of finite exponent? What about if $A,B$ are periodic, can we find a periodic amalgam?

Note that if we assume that $A$ and $B$ are finite, then there is a finite amalgam by a classical construction of Neumann.

If we do not assume that the groups be finitely generated, then taking $C$ to be an infinite dimensional vector space over the field with $2$ elements, and $A,B$ to be appropriate expansions of $C$ by involutive automorphisms, we get an example where $A,B$ are of exponent 4 and every amalgam has an element of infinite order.

Thus, if this is true, the proof must use local finiteness, and if not, counterexamples must be (necessarily countably) infinite.

We could try to emulate the counterexample if we could find a f.g. group $C$ of finite exponent (or periodic) with two automorphisms of finite order whose product has infinite order (or generate jointly automorphisms of arbitrarily high order). But even then we would need to ensure that the group generated by $C$ together with each of these automorphisms is still finite exponent/periodic.

(I did not check carefully, but possibly, the conclusion is also true if we assume that $C$ is one of finite, finite index in one of $A,B$, or central in one of $A,B$, but I do not want to assume anything like that.)

$\endgroup$
15
  • 1
    $\begingroup$ Can you clarify what do you mean by "amalgamated in a group"? Nontrivial amalgamated product (i. e. $C$ does not coincide with either $A$ or $B$) always contains a free subgroup. $\endgroup$
    – Denis T
    Commented Aug 19, 2023 at 14:52
  • 2
    $\begingroup$ Well, then the answer is obviously "yes" for finite exponent case: just take quotient of amalgamated product by the normal subgroup generated by all elements of the form $x^r$, where $r$ is gcd of exponents of $A, B$. In other words, take pushout in the variety consisting of exponent $r$ groups. For periodic case I guess there will be a counterexample; I'd bet that product of carefully chosen Golod-Shafarevich groups over maximal finite subgroups can admit no torsion quotients with both free factors embedded. $\endgroup$
    – Denis T
    Commented Aug 19, 2023 at 16:28
  • 1
    $\begingroup$ The varieties of groups for which the factors embed in the pushout with the intersection the amalgamating subgroups seem to be limited and not a lot seems to be known. There is some on this in Hanna Neumann's book. My understanding I believe that to have strong amalgamation for a proper variety of groups, all the finite groups in the variety must be abelian, but I might have misunderstood. I'm not expert $\endgroup$ Commented Aug 19, 2023 at 23:07
  • 2
    $\begingroup$ @MoisheKohan, His notion is standard in universal algebra at least for groups and semigroups. In the case of a variety if anything works the pushout works but for some varieties the pushout doesn’t work. The variety doesn’t have the strong amalgamation property. $\endgroup$ Commented Aug 20, 2023 at 0:18
  • 1
    $\begingroup$ I was considering the case where you wanted the amalgam to have the same exponent. Then you would be in the variety case. I think most of these types of questions are open. Bernhard Neumann has example where you cannot find a locally finite or periodic amalgam when C is not finite but you seem aware of this and if C is finte, then I think there are no problems finding a locally finite amalgam if A,B are (I'm not sure about periodic) $\endgroup$ Commented Aug 20, 2023 at 15:55

1 Answer 1

4
$\begingroup$

It's not hard to construct counter-examples for large exponents.

Consider the following two automorphisms $\xi, \eta$ of the free group $F=F(x,y)$ of rank $2$, defined by $$\xi(x)=y,~\xi(y)=x \text{ and } \eta(x)=x,~\eta(y)=yx.$$ The composition $\xi \circ \eta \in Aut(F)$ is the so-called Fibonacci automorphism $\varphi$, given by $$\varphi(x)=y,~\varphi(y)=xy.$$

Now, for every $n \in \mathbb{N}$ the free Burnside group $B(2,n)$, of exponent $n$, is the quotient of $F$ by the verbal subgroup generated by all $n$-th powers. It follows that every automorphism of $F$ induces an automorphism of $B(2,n)$ (there is a natural homomorphism $Aut(F) \to Aut(B(2,n))$, $\alpha \mapsto \bar\alpha$).

Now, take $n$ be to sufficiently large and odd. Then it is known that the Fibonacci automorphism $\bar\varphi$ has infinite order in $Aut(B(2,n))$. This result was proved in [Cherepanov, E. A., Free semigroup in the group of automorphisms of the free Burnside group., Commun. Algebra 33, No. 2, 539-547 (2005). ZBL1121.20028.[, and was improved (for smaller exponents) in [Pajlevanyan, Ashot S., The Fibonacci automorphism of free Burnside groups., RAIRO, Theor. Inform. Appl. 45, No. 3, 301-309 (2011). ZBL1227.20038.]

Evidently $\bar\xi$ has order at most $2$ and $\bar\eta$ has order dividing $n$ in $Aut(B(2,n))$, because the order of the image of $x$ divides $n$ (in fact, the orders of $\bar\xi$ and $\bar\eta$ will be exactly $2$ and $n$). Therefore, the semidirect products $G=B(2,n) \rtimes_{\bar\xi} C_2$ and $H=B(2,n)\rtimes_{\bar\eta} C_n$, where $C_n$ is the cyclic group of order $n$, have exponents dividing $2n$ and $n^2$ respectively. It's easy to see that both $G$ and $H$ are generated by $2$ elements.

However, as the OP suggested in the post, since the composition $\bar \varphi$, of the automorphisms $\bar\xi$ and $\bar \eta$, has infinite order in $Aut(B(2,n))$, the groups $G$ and $H$ cannot be amalgamated over $B(2,n)$ in a periodic group.

$\endgroup$
3
  • $\begingroup$ I feel a bit stupid for not knowing the estimate for upper bound of the exponent of a semidirect product. That would've made it easier to find the example, I guess. This is very nice, thanks! $\endgroup$
    – tomasz
    Commented Aug 24, 2023 at 1:05
  • 2
    $\begingroup$ @tomasz It may be better to think about the estimate in terms normal subgroups: if a group $G$ has a normal subgroup $H$ such that $exp(H)=n$ and $exp(G/H)=k$ then $exp(G)$ divides $kn$. Obviously $exp(G/H)$ divides $|G:H|$. $\endgroup$ Commented Aug 24, 2023 at 6:47
  • $\begingroup$ You're right, exactly the same argument I had in mind works in this case. Thanks again! $\endgroup$
    – tomasz
    Commented Aug 24, 2023 at 7:03

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .