<<

Algebra Colloquium 12 : 4 (2005) 709–714 Algebra Colloquium °c 2005 AMSS CAS & SUZHOU UNIV

On Conditions for an Endomorphism to be an

Alireza Abdollahi Department of , University of Isfahan Isfahan 81746-73441, Iran E-mail: [email protected] G´erardEndimioni CMI - Universit´ede Provence, UMR-CNRS 6632 39, rue F. Joliot-Curie, F-13453 Marseille Cedex 13, France E-mail: [email protected]

Received 9 October 2003 Communicated by Jiping Zhang

Abstract. If K is a of of a G, an endomorphism θ : G → G is said to be K-pointwise if for each element t ∈ G, there exists an element ϕ ∈ K such that θ(t) = ϕ(t). This generalizes the notion of pointwise inner automorphism. We show that in some special cases, a K-pointwise endomorphism is necessarily an automorphism (it is not true in general). 2000 Mathematics Subject Classification: 20E36 Keywords: endomorphism, automorphism, soluble group

1 Introduction By definition, a pointwise inner automorphism of a group G is an automorphism θ : G → G such that t and θ(t) are conjugate for any t ∈ G. This notion appears already in the famous book of Burnside [1, Note B, p. 463]. There are many examples of groups (finite or infinite) admitting a pointwise inner automorphism which is not inner (see, for instance, [2], [9], [7] or [8], where these groups are besides nilpotent). On the other hand, each pointwise inner automorphism is inner for example in a free group [4] or in a free nilpotent group [3]. In the same way, we define a pointwise inner endomorphism of G as an endo- θ : G → G such that t and θ(t) are conjugate for any t ∈ G. Equivalently, an endomorphism θ of G is pointwise inner if and only if θ(tG) ⊆ tG for each t ∈ G, where tG is the of t in G. Clearly, a pointwise inner endomorphism is always injective. But it is not nec- essarily surjective. Indeed, let S(N) be the finitary on the set of 710 A. Abdollahi, G. Endimioni

natural . In other words, S(N) is the set of of N having finite support, with the operation of composition (the support of a f is the set {n ∈ N | f(n) 6= n}). Consider the mapping θ : S(N) → S(N), where for each element f ∈ S(N), the permutation θ(f) is defined by

θ(f)(0) = 0, and θ(f)(n) = 1 + f(n − 1) when n > 0

(θ could be called the 1-right-shift). It is easy to verify that θ is an endomorphism of S(N). Moreover, for any f ∈ S(N), we have

θ(f) = (0 1 2 . . . k k+1) ◦ f ◦ (0 1 2 . . . k k+1)−1,

where the k is chosen such that the set {0, 1, 2, . . . , k} contains the support of f. Therefore, θ is a pointwise inner endomorphism. But θ is not surjective since

θ (S(N)) = {f ∈ S(N) | f(0) = 0} 6= S(N).

However, we shall see that in a soluble group, each pointwise inner endomorphism is surjective (and so is an automorphism). In fact, we shall prove a slightly stronger result. For that, we shall consider the notion of pointwise inner endomorphism as a particular case of a more general concept.

2 Results We denote by A(G) the set of automorphisms of a group G and by I(G) the set of inner automorphisms. Let K be a of A(G). An endomorphism θ : G → G is said to be K-pointwise if for each element t ∈ G, there exists an element ϕ ∈ K such that θ(t) = ϕ(t). When K is a subgroup, that means that for each t ∈ G, we have θ(tK ) ⊆ tK , where tK denotes the orbit of t under the action of K. In particular, when K = I(G), the notions of “pointwise inner endomorphism” and “K-pointwise endomorphism” coincide. Obviously, any K-pointwise endomorphism is injective. We aim in this paper to show that under a suitable hypothesis on G and K, each K-pointwise endomorphism is an automorphism. For example, suppose that K is a finite subgroup of A(G). K K A K-pointwise endomorphism θ induces an injection θt : t → t for any t in G. K But since t is finite, θt is bijective and so θ is an automorphism. It turns out that more generally, the result remains true when K is a finite subset of A(G).

Proposition 2.1. Let G be a group and K a finite subset of A(G). Then each K-pointwise endomorphism θ : G → G is an automorphism.

In addition, the proof of this result will show that there exist a subgroup H ≤ G of finite index and an automorphism ϕ ∈ K such that θ(x) = ϕ(x) for all x ∈ H. If |K| = 2, θ is actually in K but this is not always the case when |K| ≥ 3 (see the remark following the proof of Proposition 2.1 in the next section). Now recall that a normal automorphism ϕ of a group G is an automorphism such that ϕ(H) = H for each H of G. We shall denote by An(G) the set of normal automorphisms of G. On Conditions for an Endomorphism to be an Automorphism 711

Proposition 2.2. In a soluble group G, each An(G)-pointwise endomorphism is an automorphism.

Notice that the automorphism obtained in the conclusion of this proposition is obviously a normal automorphism. Since An(G) contains I(G), each pointwise inner endomorphism is also an An(G)- pointwise endomorphism. Thus, as an immediate consequence of Proposition 2.2, we can state:

Corollary 2.3. In a soluble group, each pointwise inner endomorphism is an automorphism.

As mentioned in the introduction, this automorphism is not necessarily inner. Proposition 2.2 cannot be extended to A(G)-pointwise endomorphisms. In- deed, consider for example the free of countably infinite rank. If {e0, e1, e2,... } is a free basis, the endomorphism θ defined by θ(ei) = ei+1 (i = 0, 1, 2,... ) is A(G)-pointwise but is not an automorphism. However, we have:

Proposition 2.4. Let G be a soluble group of finite rank. Then each A(G)- pointwise endomorphism is an automorphism.

Recall that a group is said to be of finite rank (in the sense of Pr¨ufer)if there is a positive integer n such that every finitely generated subgroup can be generated by n elements. We do not know whether in a finitely generated soluble group G, each A(G)- pointwise endomorphism is an automorphism. Nevertheless, we can positively an- swer in a particular case.

Proposition 2.5. In a 2-generated nilpotent-by-abelian group G, each A(G)- pointwise endomorphism is an automorphism.

We end this section with a question:

Question. Suppose that K = I(G) or K = A(G). Is it possible to find a finitely generated group G and a K-pointwise endomorphism θ : G → G which is not an automorphism?

Obviously, a positive answer when K = I(G) would imply a positive answer when K = A(G).

3 Proofs In the following, we shall use the evident fact that any K-pointwise endomorphism is injective. The proof of the first lemma is straightforward and is omitted.

Lemma 3.1. Let H be a normal subgroup of a group G. Let θ be an endomorphism of G such that θ(H) ≤ H. Denote by θ (respectively, θ0) the endomorphism induced by θ in G/H (respectively, in H). If θ and θ0 are surjective, then so is θ. 712 A. Abdollahi, G. Endimioni

Lemma 3.2. In a group G, consider an injective endomorphism τ. Suppose that the subgroup H = {x ∈ G | τ(x) = x} is of finite index in G. Then τ is an auto- morphism.

Proof. We must prove that τ is surjective. Recall that the core HG of H in G is the T −1 normal subgroup of G defined by HG = x∈G x Hx. Since H is of finite index in G, so is HG. Clearly, τ induces in the subgroup HG the identity automorphism, and in the quotient G/HG an injective endomorphism. But this quotient is finite, so τ induces an automorphism in G/HG. Hence, it follows from Lemma 3.1 that τ is surjective. 2

Proof of Proposition 2.1. Suppose that K = {ϕ1, . . . , ϕn}. For each integer i = −1 1, . . . , n, consider the subgroup {x ∈ G | τi(x) = x}, where τi = ϕi ◦ θ. Notice that τi is injective. Since θ is K-pointwise, we have G = H1 ∪ · · · ∪ Hn. It follows then from a well-known result of B.H. Neumann [5] that among the subgroups H1,...,Hn, at least one, say Hj, is of finite index in G. By Lemma 3.2, τj is an automorphism; hence so is θ. 2

Remark. We keep here the notation used in the proof of Proposition 2.1. If n = 2, then G = H1 ∪ H2. It is well known and easy to see that such an equality implies G = H1 or G = H2. In other words, θ = ϕ1 or θ = ϕ2. On the other hand, if K contains three elements, a K-pointwise endomorphism is not always in K. For example, let G be the Klein 4-group. This group can be considered as a of dimension 2 over the finite field of order 2. Let ϕ1, ϕ2, ϕ3 be the automorphisms of G corresponding to the matrices µ ¶ µ ¶ µ ¶ 1 1 1 0 0 1 , , . 0 1 1 1 1 0

Then, if we take K = {ϕ1, ϕ2, ϕ3}, the identity automorphism θ = IdG is a K- pointwise endomorphism but it is not in K.

Proof of Proposition 2.2. Let θ be an An(G)-pointwise endomorphism of G. We argue by induction on the derived length r of G. First suppose that r = 1. It suffices to prove that θ is surjective. For that, consider an arbitrary element y ∈ G. There exists a normal automorphism ϕ ∈ An(G) such that θ(y) = ϕ(y). Since G is abelian, the subgroup hyi is normal and so ϕ (hyi) = hyi. It follows that y = ϕ(ym) for some integer m and thus

y = ϕ(y)m = θ(y)m = θ(ym).

Therefore, θ is surjective (and so is an automorphism). Now consider a soluble group G of derived length r > 1 and denote by G(r−1) (r−1) its (r − 1)th derived subgroup. Then¡ θ induces¢ in the quotient G/G an endo- (r−1) morphism θ which is clearly an An G/G -pointwise endomorphism. Thus, by induction, we can say that θ is an automorphism. By Lemma 3.1, the proof will (r−1) (r−1) be complete if we show that the endomorphism θ0 : G → G induced by θ in G(r−1) is surjective. Hence, consider an element y ∈ G(r−1). According to the On Conditions for an Endomorphism to be an Automorphism 713

hypothesis, there exists a normal automorphism ϕ ∈ An(G) such¡ that θ¢(y) = ϕ(y). In particular, if hyGi is the normal closure of hyi in G, we have ϕ hyGi = hyGi. It follows that y can be expressed in the form ¡ ¢ −1 λ1 −1 λk y = ϕ u1 y u1 ··· uk y uk ,

where u1, . . . , uk are elements of G and λ1, . . . , λk integers. Thus,

−1 λ1 −1 λk y = ϕ(u1) ϕ(y) ϕ(u1) ··· ϕ(uk) ϕ(y) ϕ(uk)

−1 λ1 −1 λk = ϕ(u1) θ(y) ϕ(u1) ··· ϕ(uk) θ(y) ϕ(uk).

Since θ is surjective, we can find for each integer i = 1, . . . , k an element vi ∈ G (r−1) λi and an element wi ∈ G such that ϕ(ui) = wiθ(vi). Notice that wi and θ(y) being in G(r−1), they commute. Thus, we may write

−1 −1 λ1 −1 −1 λk y = θ(v1) w1 θ(y) w1θ(v1) ··· θ(vk) wk θ(y) wkθ(vk) = θ(v )−1θ(y)λ1 θ(v ) ··· θ(v )−1θ(y)λk θ(v ) ¡ 1 1 ¢k k −1 λ1 −1 λk = θ v y v1 ··· v y vk ¡1 k ¢ −1 λ1 −1 λk = θ0 v1 y v1 ··· vk y vk .

Hence, θ0 is surjective as required. 2 Recall that the class of groups of finite rank is closed under taking subgroups and quotients. This property, easy to verify, will be freely used in the next proof.

Proof of Proposition 2.4. Let G be a soluble group of finite rank and let θ be an A(G)-pointwise endomorphism. We argue by induction on the derived length of G. First suppose that G is abelian. We must show that θ is surjective.Q For each prime p, denote by Tp the p-primary component of G and by T = p Tp its torsion- subgroup. Since Tp is of finite rank, it satisfies the minimal condition on subgroups [6, Theorem 4.3.13] and so is co-hopfian (namely, each injective endomorphism is an automorphism). It follows that θ(Tp) = Tp, therefore we have θ(T ) = T . Clearly, since θ is injective, so is the endomorphism θ of G = G/T induced by θ. Moreover, G is a torsion-free abelian group of finite rank. Hence, there is a e e positive integer e such that G ≤ θ(G) and in addition, the quotient G/G is finite (see the proof of Theorem 15.2.3 in [6]). It follows that the quotient G/T.G e e (isomorphic to G/G ) is finite. Therefore, θ induces on G/T.G e an A(G/T.G e)- pointwise endomorphism which is in fact an automorphism. Consequently, we have e the equality G = T.G e.θ(G). But T.G e ≤ T.θ(G) for G ≤ θ(G), so G = T.θ(G). Since T = θ(T ), we obtain G = θ(G), as required. Now suppose that G is soluble of derived¡ length¢ r > 1. Then θ induces in G/G(r−1) (respectively, in G(r−1)) an A G/G(r−1) -pointwise endomorphism (re- ¡ ¢ spectively, an A G(r−1) -pointwise endomorphism). By induction, these endomor- phisms are automorphisms. Then the result follows from Lemma 3.1. 2

Proof of Proposition 2.5. Let G be a 2-generated nilpotent-by-abelian group. Hence, the derived subgroup G0 is nilpotent, of class say c. If c = 0 (namely G0 = {1}), 714 A. Abdollahi, G. Endimioni the result follows from Proposition 2.4. Now suppose that c > 0 and argue by induction on c. Let θ be an A(G)-pointwise endomorphism. If G is generated by a and b, consider the d = [a, b] = a−1b−1ab. By assumption, there exists an automorphism ϕ ∈ A(G) such that θ(d) = ϕ(d). Therefore, if τ = ϕ−1 ◦ θ, we have τ(d) = d. Obviously, τ is an A(G)-pointwise endomorphism. Moreover, if 0 0 0 γc(G ) denotes the cth term of the lower central series of G , τ induces in G/γc(G ) 0 an A(G/γc(G ))-pointwise endomorphism τ. By the inductive hypothesis, τ is an 0 0 automorphism and so G = γc(G ).τ(G). Since the derived subgroup G is clearly the normal closure of d in G, it is generated by the set of elements of the form

−1 −1 −1 ¡ −1 ¢ 0 τ(v) w dwτ(v) = τ(v) dτ(v) = τ v dv (v ∈ G, w ∈ γc(G )).

0 0 It follows that τ(G) contains G . Since G = γc(G ).τ(G), we obtain G = τ(G). Hence, τ is an automorphism and so is θ = ϕ ◦ τ. 2

References [1] W. Burnside. Theory of Groups of Finite Order, 2nd ed., Cambridge University Press, Cambridge, 1911. Reprint: Dover Publications, New York, 1955. [2] W. Burnside, On the outer automorphisms of a group, Proc. London Math. Soc. 11 (1913) 40–42. [3] G. Endimioni, Pointwise inner automorphisms in a free nilpotent group, Quart. J. Math. 53 (2002) 397–402. [4] E.K. Grossman, On the residual finiteness of certain mapping class groups, J. London Math. Soc. (Ser. 2) 9 (1974/75) 160–164. [5] B.H. Neumann, Groups covered by permutable , J. London Math. Soc. 29 (1954) 236–248. [6] D.J.S. Robinson, A Course in the Theory of Groups, Springer-Verlag, New York- Berlin, 1982. [7] C.H. Sah, Automorphisms of a finite group, J. Algebra 10 (1968) 47–68. [8] D. Segal, On the outer of a polycyclic group, in: Proceedings of the Second International Group Theory Conference (Bressanone, 1989), Rend. Circ. Mat. Palermo (2) Suppl. No. 23, 1990, pp. 265–278. [9] G.E. Wall, Finite groups with class-preserving outer automorphisms, J. London Math. Soc. 22 (1947) 315–320.