A Thesis Submitted for the Degree of PhD at the University of Warwick

Permanent WRAP URL: http://wrap.warwick.ac.uk/140389

Copyright and reuse: This thesis is made available online and is protected by original copyright. Please scroll down to view the document itself. Please refer to the repository record for this item for information to help you to cite it. Our policy information is available from the repository home page.

For more information, please contact the WRAP Team at: [email protected]

warwick.ac.uk/lib-publications CONTRIBUTIONS TO THE THEORY

OF

SUBNORMAL AND ASCENDANT SUBGROUPS

by

Jennifer Whitehead

A dissertation submitted for the degree of

Doctor of Philosophy

in the University of Warwick

1975

•. It «I . il il A

CONTENTS

Acknowledgments (0

A b stra ct (Ü)

Introduction 1

Notation and Terminology 7

P A R T O N E

Residuals and the Lower Central Series of Subnorm al and Ascendant Subgroups

C hapter 1 The Locally Nilpotent Residual 13 of the Join of two Subnormal Subgroups

C hapter 2 The Lower Central Series of 26 the Join of two Subnormal Subgroups

C hapter 3 Residuals of the Join of two 37 Ascendant Subgroups

P A R T T W O

C rtte ria for Subnormality and Ascendancy in Soluble and Generalized Soluble Groups

C hapter 4 Subnormality and Ascendancy in 45 Soluble and Generalized Soluble G roups

C hapter 5 Subnormality in Soluble Groups 60 with Flnlteness Conditions

Appendix 78

References 82 ACKNOWLEDGEMENTS

I would like to especially thank my supervisor, D r. Stewart Stonehewer, who has been a constant source of encouragement and ideas, and who has helped me over many difficulties. Thanks are also extended to Dr. Brian Hartley, for his interest and supervision during the first six months of 1974, and whose ideas helped to shape the second part of the thesis.

I am grateful to the Science Research Council for its financial support during the period 1971-1974.

Humble thanks go to Nalsey Tinberg who has so patiently and cheerfully done the difficult job of typing.

Finally, I would like to thank Michael Mailer who has offered me invaluable support, friendship and encouragement during the months of its preparation. (it )

A b stra ct

The thesis is divided into two main parts. We begin with a general introduction and then a section on notation and terminology. In part one, consisting of the first three chapters, we are concerned with residuals of the join of two subnormal or ascendant subgroups, and the lower central series of the join of two subnormal subgroups. The results generalize those of Wielandt [35], In chapter one, we prove some elementary results on J^-residuals, for a class of groups £ , and examine, in particular the locally nilpotent residual of a locally finite which is the join of two subnormal subgroups, and the locally nilpotent residual of the join of two subnormal subgroups satisfying the minimal condition for subnormal subgroups. In chapter two we prove results on the lower central series of the join, G, of two subnormal subgroups H and K in the cases when (l) G satisfies the minimal condition on normal subgroups and (ii) when H and K satisfy the maximal condition for subnormal subgroups. In chapter three, residuals of the Join, G, of two ascendant subgroups are studied when G is a locally finite group and when H and K satisfy the minimal condition for subnormal subgroups. In part two, we examine criteria for subnormality and ascendancy in soluble and generalized soluble groups. In chapter four we extend some of the recent work of Wielandt on criteria for subnormality in finite groups f3®]* to soluble groups and various classes of generalized soluble groups. In chapter five we consider conditions imposed on the generators of a finitely generated subgroup H of a soluble group, which imply subnormality subject to certain additional finiteness conditions. We examine first the case of a finite

eiUtMHliiMMSIf'

A b stra ct

The thesis is divided into two main parts. We begin with a general introduction and then a section on notation and terminology. In part one, consisting of the first three chapters, we are concerned with residuals of the join of two subnormal or ascendant subgroups, and the lower central series of the join of two subnormal subgroups. The results generalize those of Wielandt [35], In chapter one, we prove some elementary results on 3^-residuals, for a class of groups It , and examine, in particular the locally nilpotent residual of a locally finite group which is the join of two subnormal subgroups, and the locally nilpotent residual of the join of two subnormal subgroups satisfying the minimal condition for subnormal subgroups. In chapter two we prove results on the lower central series of the join, G, of two subnormal subgroups H and K in the cases when (i) G satisfies the minimal condition on normal subgroups and (li) when H and K satisfy the maximal condition for subnormal subgroups. In chapter three, residuals of the join, G, of two ascendant subgroups are studied when G is a locally finite group and when H and K satisfy the minimal condition for subnormal subgroups. In part two, we examine criteria for subnormality and ascendancy in soluble and generalized soluble groups. In chapter four we extend some of the recent work of Wielandt on criteria for subnormality in finite groups [36], to soluble groups and various classes of generalized soluble groups. In chapter five we consider conditions imposed on the generators of a finitely generated subgroup H of a soluble group, which imply subnormality subject to certain additional finiteness conditions. We examine first the case of a finite soluble group.

The work In this thesis, apart from the results attributed to others, is to the best of my knowledge, original. Introduction

Subnormality was first studied in 1939 by Wielandt f34]. He proves several fundamental results, here, for groups with a composition series; in particular that the join of two subnormal subgroups in this class is subnormal, and he shows how his proof can be extended to groups with the maximal condition for subgroups. The join J of two subnormal subgroups H and K need not, however, be subnormal in an arbitrary group, as an example by Zassenhaus shows ([37] Appendix D, Exercise 23). Even when H is an elementary abelian 2-group and K is of order 2, J need not be subnormal as an unpublished example by P. Hall shows. Other such examples are given in [31],

In the early 1960's Robinson [22] examined conditions imposed on a group G which ensure that joins of finitely many subnormal subgroups of G are subnormal. Since the intersection of finitely many subnormal subgroups is a , the groups for which the join property holds are just the class of groups| whose set of subnormal subgroups is a lattice (with respect to the operations set intersection and group theoretical join). Denoting this class of groups by JL in [22] Robinson shows that if G is a group whose derived subgroup G' satisfies the maximal condition for subnormal subgroups, then G belongs to i, , and that an extension of a group in the class £ by a group which satisfies the maximal condition for subgroups belongs to the class . He also examines conditions imposed on a pair of subnormal subgroups which will make their Join subnormal.

A subnormal coalition class is a class of groups, , for which a pair of subnormal 3E —subgroups generates a subnormal 36.- subgroup. These have been studied in the literature and include the class of finite, finite TT-gr'oups and polycyclic groups (Wielandt [34]), groups with the maximal condition for subgroups (Baer f3])* finitely generated nilpotent groups (Baer [2 ]), groups

i *

with maximal or minimal condition on subnormal subgroups (Robinson [23]; Roseblade [27] [29]), minimax groups (Roseblade unpublished), any subjunctive class of finitely generated groups [31], and more recently the class of groups with finite rank [5 ],

It is well-known that the join of two nilpotent subnormal subgroups need not be nilpotent, and in fact the Zassenhaus example [37] shows that this is so. Even when G is generated by two subnormal abelian subgroups of exponent 2 , th e ir join need not be nilpotent (see for example [31 ]). The fact that in all such examples as these, the join, although not nilpotent, was soluble, led to the conjecture that the join of two soluble subnormal subgroups was soluble. This had been proved by Wielandt in [34] for groups with a composition series, and in 1970 Stonehewer f32] showed it was true in general.

The nilpotency of the join J, of two nilpotent subnormal subgroups H and K, under addition hypotheses, are found in the literature, however. These include when H and K are finitely generated (Baer [2]), H and K satisfy the minimal condition for subnormal subgroups (Robinson [23] and Roseblade [27]), H and K satisfy the maximal condition for subnormal subgroups (Roseblade r29]) and H and K have finite rank [5].

Denoting the class of nilpotent groups by n. and the limit of the lower central series by G*”, in 1957 Wielandt ([35] Satz 1.5) showed more generally that if H and K are subnormal subgroups of a group G with a composition series, then

H*K - K HK and < H, K §■ = H* K* (1)

Again, denoting the class of soluble groups by A , and the limit of the derived series by G* , Wtelandt has shown ([34] Satz 2.3 and [35] Satz 2.4)

K hi* and H , K H*K* ( 2)

In both these results, the condition that G has a composition series cannot be removed, for let A be any group. Then by

A ik A ( i ti'iiM im uH M ir a

[9] lemma 13, A can be embedded in a normal product G of two free subgroups H and K. But by [13] HJl' = H^= K *1 = K = 1 and so if G^ = Gft-=1, this would imply = A^ = 1 for any group A.

Howevt -,in r32], Stonehewer shows that (2) holds provided that and are soluble. In [30] Roseblade

has generalized this still further, and shown that denoting the n-th term of the derived series of a group G by G^n\ then if J is the join of two subnormal subgroups H and K, then given any two positive integers and r^ there exists an integer r such that

(3 )

More recently, Stonehewer has shown in [33] that if H and K have finite rank, then (1) holds provided that e A- and K/j^tA .

In chapter 1'of the thesis we shall prove a result analogous to ( 1) for the locally nilpotent residual of the join of two subnormal subgroups H and K in a locally finite group, and when H and K satisfy the minimal condition for subnormal subgroups. In chapter two we shall obtain results similar to (3) for the lower central series when J satisfies the minimal condition on normal subgroups and when H and K satisfy the maximal condition for subnormal subgroups.

Closely tied to these results, is the question of permutability of subnormal subgroups which has been of interest since the 1939 paper. Wlelandt [34] showed that for groups with a composition series, a perfect subnormal subgroups permutes with every other subnormal subgroup. In [28] Roseblade extended this result and showed that if the tensor product

Is trivial and H and K are subnormal subgroups of any group G, then they permute.

Permutablltty also occurs in (1) and ( 2) since H^K, 1 *• t*

H* K, H*1" K*" , HA K* are subgroups.

In [30] Roseblade shows that there always exists some term of the derived series of H that permutes with K. However, it is not known in general whether this is true when derived series is replaced by lower central series. This is certainly true by adapting Wielandt's proof of (1) when H and K satsify the minimal condition for subnormal subgroups. In chapter two, we discuss this question for subnormal subgroups H and K of a group G satisfying the minimal condition for normal subgroups.

Finally, on the question of permutability, we note that in [17] Lennox showed that two subnormal subgroups H and K permute provided that they do so modulo each term of the derived series. Recently it has been shown by Brewster [4] that this remains true when derived series is replaced by lower central series.

In infinite groups, subgroups belonging to series of a group other than a finite series are also considered, in particular ascendant subgroups. A subgroup H of a group G is ascendant in G if there is an ordinal and subgroups

{ H s asp} of G such that H H H (a < p) a a+1 r 1 H U H If u s p is a limit ordinal and H a a < i

Ascendance was first studied by Plotkln [21 ] and Gruenberg [ 6] , and even earlier, although not explicitly, In Baer [1 ]. The Join of two ascendant subgroups need not be ascendant, as examples in the case of subnormality show that even the Join of two subnormal subgroups need not be ascendant (see for example [3 1 ]).

Examples of ascendant coalition classes, X., (the Join of two ascendant 31-subgroups is an ascendant 3£-subgroup) are the

d < lU M M liBlltSII 1 class of finitely generated nilpotent groups (Gruenberg [ 6] ) and groups with the minimal condition for subnormal subgroups (Robinson [23]).

In general, however, the problem of finding whether a class is an ascendant coalition class seems to be a more difficult problem than deciding whether it is a subnormal coalition class. It is not known whether the classes: finitely generated groups and groups with the maximal condition on subnormal or ascendant subgroups are ascendant coalition classes. Recently Hulse [12] has shown that certain sub-classes of the class of finitely generated groups are ascendant coalition c la s s e s .

Results analogous to (1) and (2) for a group G generated by two ascendant subgroups and various questions on permutabiltty of ascendant subgroups have not appeared in the literature. In chapter three of the thesis we discuss these questions when H and K are ascendant subgroups of a group G and H and K satisfy the minimal condition for subnormal subgroups.

Research in subnormality and ascendancy has in recent years been led by Wielandt to examine criteria for subnormality and ascendancy in various classes of groups.

In [36]* Wielandt has examined conditions in a finite group G which imply subnormality of a subgroup A. For example If A 1 ,... are generating sets of A such that

[ 9* * • • • ] £ A 19(6 (4 )

then A sn G.

Wielandt has also extended some of his results to groups satisfying the maximal condition, as yet unpublished.

In [10] Hartley and Peng have examined subnormality and ascendancy in groups with the minimal condition for subgroups.

I I ti i SiUilMMliiMMif!** They have shown that if (4) holds for

(t) n = n(g) and (ii) n a fixed integer then in case (i) A is ascendant in G and (ii) A is subnormal in G. Alternative proofs of results known about left-Engel elements are also obtained in both the cases when G is finite or G satisfies the minimal condition.

In chapter four we extend some of these criteria for subnormality and ascendancy to soluble and generalized soluble groups.

In [20] Peng examines subnormality in soluble-by-Max groups. We shall discuss his results more fully in chapter five, and obtatn a criteria for subnormality in soluble groups subject to certain finiteness conditions, which is weaker than those discussed previously. Notation and Terminology

Capital Roman letters are used to denote groups and small Roman letters for elements of a group. H s G, H G and H < G denote "H is a subgroup of G," "H is a proper subgroup of G," and "H is a of G." If X is any subset of G, then < X > denotes the subgroup of G generated by the elements of X. The normalizer of X in G is denoted by N (X) and the centralizer by C (X). C? G If V is a subset of G, we denote the normal closure of X in V by X and define it as X ^ = < x^: x ^ X, y g V > where x^ = y 'x y ,

If g1,... ,gn are elements of a group G, then

[ gr g2 ] = g , " f l ^ 1 ^ g2 and

[ 9i»....gn ] ™ [ ]* 9n ] •

If are subgroups of G, then

[ V y2 ] " < r v1 .y2 ] J yt € Yt» » = 1,2 > and

[ Y 1****»Y n ] = C C Y 1»****Yn_1 ]» Y n ] •

If V * G then Core^, V is the largest normal subgroup of G contained In V.

If p is a prime, then p’ denotes the set of primes different from p. Suppose that n is a set of primes then an element x of finite order In a group is said to be a Tr-element If the prime divisors of the order of x all lie in the set n . A group G is a yf-group If every element of G is a ^-e le m e n t.

We shalt use and assume the language of group classes and

We denote classes of groups as follows:

cf = finite groups = finite „-groups TT Oy = finitely generated groups O l = abelian groups Jl, = nilpotent groups A> = soluble groups

Max, Max-sn, Max-n = groups with the maximal condition on the set of all subgroups, subnormal subgroups, normal subgroups respectively.

Min, Min-sn, Min-n = groups with the minimal condition on the set of all subgroups, subnormal subgroups, normal subgroups respectively.

Le t 3L be a class of groups and le t G be any group. The 3E. -radical of G is the product of all the normal -subgroups of G. The ¿.-residual of G is the Intersection of all normal subgroups of G whose factor groups tn G are ¿-groups. at JE. We denote the x -residual of a group G by G . G/ G Jt is said to be a restdualty ¿-group. If G is a locally finite group we denote the „-residual, i.e. the Intersection of all normal subgroups of G whoso factors In G are L^f -groups, by On(G). TT

Series of Subgroups

Let H be a subgroup of a group G and let £ be a totally ordered set.

A series between H and__G of type £ is a set of subgroups of G [ U , V igfE} such that a o <0 each U and V contains H. 0 0 0 0 G \ H - u

(tv ) V U a a

A series between 1 and G is called a series in G.

The subgroups U and V are the terms of the series and o o the groups U are the factors of the series. A series (i V o in G is called a normal series tf the subgroups U and V a o are all normal subgroups of G.

If the totally ordered set £ is well-ordered then the series is said to be an ascending series.

In this case we obtain (see Robinson [25] p. 11)

H » V « V ^ ...... V * V ...... V = G O 1 rr n* • n where V ■ n V If \ Is a limit ordinal ' »«X 8

If e ' denotes £ with the reverse order < i.e. n < i if and only tf T < g , then tf j' is well-ordered the series is a descending series.

A subgroup H of a group G is termed serial in G If there is a series between H and G. Should the series be ascending, H is said to bo ascendant in G, and tf the series has finite length, H la said to be subnormal In G.

We w rite H ser G, H asc G, H sn G .

If there is a series between H and G with order type £, wo write H G .

liiBununttNian*' Let H £ G and let a descending series of subgroups of Let H & G and let i be a non-negative integer; then

H = H y*G H and H G if and only if y*G H s H (see Robinson [22 ]) .

We denote the n-th terms of the derived series, the lower central series and the upper central series by:

Yn. Cn

We denote the derived subgroup of G by G'. If G = G', G is said to be perfect. ^(G) = ^(G ) denotes the centre of G. The limit of the upper central series of a group G is called the hypercentre of G. G is said to be a hypercentral group if G coincides with its hypercentre.

G is called a Gruenberg group if G can be generated by its ascendant abelian subgroups.

We shall say a group G has finite (Prufer) rank, r, if every finitely generated subgroup can be generated by r elements and r is the teast positive integer with this property An abelian group has finite rank r if and only if

r «= r + max r <• m ° P P

whore the p-component of A is a direct product of r P cyclic or quast-cyctic groups A 1 , and the factor group of A with respect to its torsion-subgroup is isomorphic with a subgroup of a d ire ct .Si/M of r but no few er copies of the o additive group of rational numbers.

GL(n,F) ■ General linear group of alt invertible nxn matrices over a field F.

Other, more specific definitions are given in the text as they are required.

Mill * All

RESIDUALS AND THE LOWER CENTRAL

SERIES OF SUBNORMAL AND ASCENDANT

SUBGROUPS I

Chapter 1 The Locally Nil potent Residua! of the Join of two Subnormal Subgroups.

Sec. 1 Elementary Results

In this section we prove some elementary general results that wo will use later in the thesis. We begin by examining the effect of homomoi'phisms on the 3£ - residual of a group G.

Lemma 1 .1 Let it = Q i and suppose that G is a group such that G ^x 6 36 • Then if e is any homomorphism of j. * G , we have (G 0 ) = ( G ) 0 and GJ/( g g)*1 e ^ *

Proof Let N = Ker 9. T h e n N 4 G and

^ < * 1 y N* < = > * - * •

Hence ( G 9 ) s ( G * ) 9 .

Now let N s L s G be such that L ^ «j G ^ N and

•* I* Therefore L < G and G ^ *. £ _3fc •

Hence G* s L and G* * L^ .

Since this is true for all such L ^ we have

(G*) 9 i (G 9 )* and hence equality. AUo °*<6o? ’ °>*1Lo

Therefore G Q f 36 .

We next examine the 36 - residual of the Join of a subnormal and a normal subgroup. Lemma 1 .2 Let 3i = N 3E. = S £ = Q 3: . Suppose that ------o n G = H K where H sn G, K ^ G and that at € i >

1 * « « * • ^ * 3E Th e n G ^ * 6 £ and G 1 = H*K*

Proof Let N G such that G ^.. T h e n ^ N € 3t •

€ S n z = x .

Since E. we have !^i< n n - K > * « 3 z z VI X and so K ^ ^ K q • n N € 3r X Since this is true for any such N we have K s G . Similarly, H ^ s G * . I % i f Now K char K^G K G . Since K s G* , » t using lemma 1.1 we may factor G by K and assume K = 1 £ * £ K Hence we must show that H = G By above, H s G

Let H

. K > where HjxpX € 3E. «•* K H^h» ^ H* € Q* = * .

So G^J'x Is generated by two normal 3£ - subgroups and by N - closure we have G ^ x € 3t •

i at Hence G * s H** and we have equality and G ^j^ € 3L •

Now suppose m > 1 . Let H^ = H , Then

H , - H 1 n H K = Hi ( Ht n K ) where n K € Sn £ = Z . m -1 Since H H1 by induction H. H 3^ and V « ,* i3fe • X 3t Then, by the case m ■ 1 , wo have H^ ■ G and

G/ g * € *•

I t Hence H = H = G and the lemma is proved.

Although G/^X is always a residually — I group, it is not necessarily an - group unless G satisfies the minimal condition on normal subgroups, or unless the class 36 is R - closed. In the case of locally finite groups, however, we have the following known result.

Lemma 1 .3 Let 3t = < S, R q > s if".

T h e n RLlnL^ = Li. U t «L3tf>«-3F Proof Obviously, L £ R L 36. p L Let F be a finitely generated sugbroup of G. Since G ( L?- then F g ^ . Let 1 x € F . Since G g R L jfc there exists a x f K (x ) .

Now F/p n K (x) * F K (x ^ (x) which is a finite subgroup of the L 1 - group G/K . ^

Hence is contained in some 36 - group.

Therefore, F K (*)/£ ^ € S 36 = 36 .

Now

n ( F n k (x) ) = ( 1 )

1*x€F

S o , f £ r 3L = 3b . o Hence G g L 36 ,

The following result relates the L St - residual of a locally finite group G to the 3L - residuals of its finite subgroup Lem m a 1 .4 Let G be a locally finite group. Let f be a class of groups such that 9E = < S, R q > s ¿f- . Th e n if 9t is also Q — closed we have L3t 3t G = < F | F is a finite subgroup of G > .

Proof By lemma 1 .3 we have that G/£.LX g l 3E .

Le t R = < F j F is a finite subgroup of G > .

Then R

F Ry^ — p R which is a homomorphic

image of FyjLjj. £ R0 IE = ^ •

Therefore F Ryj^ g Q 35. = X. .

Now let Ky^ be any finite subgroup of *

Let K/ r = < R k1 , • • •, R > •

T h e n = < • *^n £ 3t by the above.

l3L „ Hence G y ^ £ Lit and it follows that G s R .

However, if F is any finite subgroup of G,

FG/ S L* t SX . X. a n d

T h e re fo re , F ^ - s F p G^- ^ s G^" ^ ,

So R s G*~^ and we have equality.

Sec. 2 Permutabtllty of Locally Nilpotent Residuals

Wlelandt has shown in £ 5], that for a finite group G, generated by two subnormal subgroups H and K

G *1 = H>VKn' and H^K = K H1'”.

We are concerned here with similar results for the locally nilpotent residual of a group G, generated by two subnormal subgroups, and shall show that permutablllty occurs when L i t L i t H K > and H/j_|LJt g LIT,

As Stonehewer points out in [33]» the difficulty in extending the Wielandt proof of permutability of nilpotent residuals is that his proof depends on the fact that for some integer r, defining H** ^ (H^y -h1-1 * h A = ( h?1 ) we have H.it is a perfect subnormal subgroup, and hence permutes with all subnormal subgroups of G (see Wielandt ). In general the series

H . * ^ • will not terminate, and so we do not know whether for some integer r, is perfect. However, following the method in [33] we use the following generalization by Brewster in w of a re su lt by Lennox [1^ ] .

Lemma 1.5 (Brewster) Suppose that H and K are subnormal subgroups of a group G, that G = < H, K > and that for all finite c a 1 , G = H K V (G). Then G = H K.

A proof of this result is included in the Appendix.

We are now able to generalize theorem A of [jag and obtain:

T h e o re m A L e t G = < H , K > where H , K are subnorm al subgroups of G, and suppose that L it L3X = < M 1 ^ > • The n

G*-^ = HL*''KLi'‘ provided that € l K.

P ro o f Let M = G*- ^ - and for some Integer c s 1 let

N = Yc (M ) . Hence M < G . Since the class L lT - satisfies the hypothesis of lemma 1.2 and since by lemma 1.1

I V'fiuwiHiiaiiHffir ( H Ljv C LJV , we may apply lemma 1 .2 / X H > ^ N ) to the product

H = (H ^N )( M/ N ) •

l Jl Now M/ n g ft and so (M ^ ) = 1

Hence ( H ) L,V = ( H ) LJl"

By lemma 1 .1 we have (H ^ = and therefore ^ H ) = H N^j anc*

hL31X N 4 Hf^N *

So N we

have

M = H*-* K1-^ Yc(M ) .

As this is true for all finite c ^ 1 , by lemma 1.5 we have

M = H L Jt

Corollary Let G = < H, K > where H, K sn G and I suppose that , L f t L i t K L i L - < H

Th e n If hJ^LTL € Lh, , we have

L i t G,J'- - H1^ and H ^ K K H W K ^ = Proof This follows from theorem A and the next lemma.

Lem m a 1 .6 L e t G = < H, K > and let X be a class of groups such that G* = H* K* . Th e n H * K = K and H = H K • * Proof K H* = K K£ H* = KGJ = G* K since G

Sec. 3 T h e Join P roblem

In this section we shall be concerned solely in proving that for a locally finite group G, generated by two subnormal subgroups H and K we have G although it generalizes the methods used by Wielandt [35]> is independent of the finite case. In chapter 3, we shall discuss the locally nilpotent and locally soluble residuals of a locally finite group generated by two serial subgroups, and give an alternative proof which reduces to the finite case and the Wielandt theorem

We shall need the following well-known structure theorem for locally nilpotent, locally finite groups.

Lemma 1 .7 Let G 5 L( J fl JX)* Then the set G^ of p—elements of G is a subgroup of G, and G is the direct product of the G . P Proof See Kurosh [|(,] Vol II p. 230.

We shall also need

L e m m a 1.8(Htrsch - Plotkln - Baer) If 3E. - < N » S > 36 s M ax then L 36. is N' - closed.

Proof See Robinson [jj^] p. 57 Theorem 2.31 .

We begin by examining the n — residual O^CG) of a

locally finite group G. Since the class Is S and Rq - closed

we have by lemma 1.3 that G ^ tvG) is a locally finite n - group. kl\J

Lemma 1 .9 Let X, V be subgroups of a locally finite group G such that G = < X, Y > and Y sn G. Suppose that every finite subgroup of X lies in a subnormal subgroup of G in X. If On(Y) s X n Y then O^G) s X .

Proof Let Y G and proceed by induction on m.

Case 1 m = 1. Then Y <, G , By lemma 1 .4

O^G) = < On(F) | F is a finite subgroup of G > (*)

Now if F is any finite subgroup of G, then F is contained in some finite subgroup F 1 where

Fr1 = < x1,...,x n,y1,...,y m > where xt € X, y^ e Y .

Therefore F1 = < X p F , Y p F^ > .

By hypothesis there exists a subnormal subgroup X of G such that x n F1 S X1 s X .

Hence F1 = < n F1, Y n F1 > and X, n F, sn F^

Y n F, 4 F, .

Since F is finite X p F ^ 1 1 X t n F 1 ) * " and Y n F. v» e *£. and since the class ^ >6"CY n F, ) ' satisfies the hypotheses of lemma 1.2 we have by lemma 1.2

O^CF,) - o"( X 1 n F 1 ) o"( Y n f 1 ) s x .

Therefore O^CF) s X for all finite subgroups F of G and so by (*)

On(G) s X as required.

Case 2 m > 1 Suppose by Induction that the lemma is true when Y has subnormal defect less than m . Let Y^ = Y . Now If F Is any finite subgroup of

V f) X, then by hypothesis there exists a subnormal subgroup S of G such that

F s S s X .

Then F £ S p Y^ £ Y^ p X and since Y^

S n < S sn G , i.e. S p Y sn G.

Hence the group Y = < Y^ p X, Y > satisfies the m™1 *. ___ hypotheses of the lemma and Y Y since Y £ Y .

Therefore, by induction we have O^Y) £ X p Y^ .

Let M = O^CY), X = X p Y and N = On(*) .

Then M s X . Using lemma 1.3 we have

> 6 < L 9 -„ a" d « l 5 -„ • Since O^CM) char M char V we have On(M) X . Therefore, by the P — closure of the class

x/o ”(M) * L 3 -n •

Hence N = O^CM) char V and so N = O^Y) and N <] G.

S ince * Y % € I-3- y N « TT ' IN TT • 0 £ £ > - n Now -- - y G n/ n | x e X > . - < n < -< S ince 'If € L- 2 ~ x

* TT we know that Y . is generated by subnormal - subgroup TT X n Since the class satisfies the hypotheses of le m m a 1 . 8, TT |_^i- is N*- closed and hence Y y g L jf- . TT X n v

We have reduced to case 1, applied to the group

g/ n = < x/ n , y i / n > slnce y i / n < g/ n *

Hence we may deduce that

° " < g/ n ) ‘ x / n •

By lemma 1.1

On (G/N ) = ° nCG >N /N *

Therefore O^G) N 4 X and O^G) s X .

Lem m a 1.10 Le t G be a locally finite group. Let A, B be subnormal subgroups of G and let J = < A , B > . Then if F ts any finite subgroup of J, there exists a subnormal subgroup S of G such that F < S s J . Proof This follows immediately from Roseblade and Stonehewer [jjj] Theorem A.

It is now an easy consequence of lemmas 1.9 and 1.10 to prove

Theorem 1 .1 Let G be a locally finite group generated by two subnormal subgroups H and K. Then On(G) = < O^H), On(K) > .

Proof Since ^ oTT(G) a H 0"(G^qTT(G) € L ^ we have O^H) s On(G) . Similarly On(K) s O^CG) , and so

< Q"(H), On(K) > s 0"(G) .

B y le m m a 1.10, the group < O ^H ), On(K) > satisfies the hypotheses of the subgroup X in lemma 1.9 . Hence in lemma 1 .9 let G = < On(H), K > , X = < O^CH), O^CK) > and V = K. Then we have

O" ( < Q"(H), K > ) s < 0" .

Agatn in lemma 1 .9 let G = G, X = < O^H), K > and V = H. The subgroup X satisfies the hypotheses of lemma 1.9 by lem m a 1.10 . Hence we have

On(G) s < O^H), K > .

Let L = O™ ( < On(H), K > ) . Then L s < O^H), On(K) > and L

n

Since O^CG) char G, we have by lemma 1.3 that

So O^G) s L < < O^CH), On(K) > and hence

0"(G) = < 0"(H), 0"(K) > . We now prove the main theorem of this section.

T h e o re m B Let G be a locally finite group generated by two subnormal subgroups H and K. Th e n G/gLJX , H/HL)X , Ky^LlX c LjX

LJX l jx LJX. and G - < H , K

Proof By lemma 1 .3 we know that Gy^LlX , Hy'^Lj'L , Ky'^LJl- are locally nilpotent. By theorem A we know since Hy' |_|L_JV £ LlX that

H*~^" and permute, provided that their join is equal to L)L U t, . Hence it is enough to prove that G ^ H , K

Now H y 'n n G U V = H G ^ g U V f U V and therefore

H L j l , . Similarly G*-^ and so LJX LJX LJX < H , K > S G

In theorem 1 .1 let n = { p } and apply to the group G generated by H and K. Then

0 P(G ) = < 0 P( H ) , 0 P(K ) > .

B y lem m a 1.7, is the direct product of p-groups.

Hence 0P’(0P(K) ) s .

Let L = 0P(G). Applying theorem 1.1 to the group L w ith tt “ { P' } we have

Op'(L) = < 0 P’cOP(H) ), oP'(oP(K) ) > .

LJX P Now G s O (G) and so by lemma 1.3

,LJX ,LÌL is an , - group. / CoreG< H*-*1, , K

This Is true for all primes p. Hence _LjX LJV LIT H . K 25

Corollary Let H, K g Min—sn and let H, K be subnormal in their join G = < H, K > Then G/^LJV , HlyS^Lth are locally nilpotent and o'-*- - * - Ha’-KLJU .

Proof By the subnormal coalescence of the class Min-sn (see for example gjj]) we know that G g Min-sn .

T h e re fo re G ^ / q LJI- , K/^LJl, , are locally nilpotent, since H, K and G satisfy Min-sn.

Now H/ h LJ1. , K / KLiV are locally nilpotent groups satisfying Min-sn and therefore they satisfy Min and are soluble (see Robinson [^y] p. 154 ). By the condition Min-sn we have G^<& » » anci

Ky^i, are soluble and so by Stonehewer [y] we have H u i . K i.n .

Hence, without loss of generality, we may assume G = 1 . and G is soluble. Since G satisfies Min-sn, G is ¿Sernikov and locally finite.

LJV u x LJL ( 1Lh . L J L Hence G = < H K H K by theorem B . C h a p te r 2. The Lower Central Series of the Join of two Subnormal Subgroups.

Sec. 1 The Minimal Condition on Normal Subgroups.

We consider the nilpotent residual of a group G, generated by two subnormal subgroups H and K, which has the minimal condition on normal subgroups. The condition Min-n of course ensures that the nilpotent residual of G has nilpotent factor group. However, since the condition Min-n is not necessarily inherited by normal subgroups of G (See Robinson p. 153 ), we have no guarantee that and K^Jvare nilpotent.

However, we are able to prove more generally:

Theorem C Let G g Min-n and let H and K be subnormal subgroups of G such that G = < H, K >. Then for any positive integers , r 2 we have that

s Y (H ) Y (K ) r t r x For the proof we shall need the following result on the derived series of the Join of two subnormal subgroups, given

‘ n bo]*

Lemma 2.1 (Roseblade) Let H and K be subnormal subgroups of a group G = < H, K > and let a» 3 be ®hy positive integers. Then there exists an integer j such that

g ( 6) s h ( ol) K ( p )

We shall also require the following well-known results on groups satisfying M ln-n. Lemma 2.2 (Baer) A soluble group which satisfies Min-n is locally finite.

Proof See Robinson [Is’j p. 153.

Lemma 2.3 (Carin, Me Lain) The locally nilpotent groups which satisfy Min-n are precisely the hypercentral Cernikov groups. Thus for locally nilpotent groups, the properties Min and Min-n co in cid e .

P ro o f See Robinson [a$] p . 154.

Lemma 2.4 (Baer) G is a nilpotent group satisfying Min if and only if ^(G) satisfies Min and ls a hilpotent group.

Proof See Robinson [a«g p. 69.

Wielandt has shown in [36J» for groups G with a composition series, and generated by two subnormal subgroups H and K, that once the Join property G*1, = < H^"f K^*> is established for groups in this class, then we have permutabllity of the residuals, t.e. G**" = Hn-K*\ Wtelandt's argument can be adapted to groups in the class Min-sn, and this we prove In lemma 2.5. Following Wielandt, we define G* inductively by:

„ r «.r - 1 G*1 = ( G*1- ) ftnJ Suknerm J Lemma 2.5 Suppose that for a group G »¿satisfying the minimal condition on subnormal subgroups and generated by two subnormal subgroups H and K, that G^1, = < H* «*•>. Then

JH**- permutes with and so G^*“

Proof Since H is subnormal In G, H satisfies the minimal condition on subnormal subgroups.

i i i M K n a n w r Hence for r sufficiently large

and is a perfect subnormal subgroup of G. By £ 8] * r we obtain that Hrt permutes with all subnormal subgroups of G.

In particular is a subgroup.

Now suppose that for any integer l, that KnHtt is a subgroup. Then i v»1“ 1 :*H, t = K h Hh' H 11* * 1-1 Now H*1, , K g Min-sn and since Min-sn is a subnormal coalition class [¿3], the group < K, H*'- > £ Min-sn, and is subnormal in G.

By hypothesis < K, H**" H**' >.

j, . i - 1 * 1-1 * 1-1 H ence, K 1 l-T1 = < K, H > H and since

* 1-1 h ni_1 < K , H11 > is normalized by H we have that K ^ H * 1“ 1 is a subgroup. By induction on l decreasing we obtain K ^ ’ H*'" is a subgroup.

We are now able to prove theorem C.

Rr-pof of theorem C. We know that there exist positive integers a and p such that

H (o) s Y and k(P) * Y

So by lemma 2.1 there exists an Integer j such that

— <6) s Y Y b r \ rx Now y . ( V * and similarly v r < h g ^ X g (6)> = rr ^ G y G^ 2 2

Hence, without loss of generality, we may assume G ^ and that G is soluble. By lemma 2.2, G is locally finite. By theorem B we know that the factors G/gLlt, H/^LM,

V k 1* are locally nilpotent and that

GUV = HUlKLn s Y rCH)Yr,0<) 1 2

As before, we may assume G^" = 1 so that G is locally nilpotent. But by lemma 2.3 G satisfies the minimal condition. Hence H^n, and are nilpotent and

* y V 1-1) Yr2

We wish to show that G**’ = < H**’ , K^> for then by lemma 2.5 we know that G**" = H^K***.

Let X = < H*1-, K1V> .

Then X G** sin ce H ^ (Jn. - H € f t

=> H *1 s Gn , and similarly K ^s G11- .

Now by lemma 2.3, G is a ¿ernlkov group, t.e. ar. extension of an abelian group satisfying Min by a finite group. Let F be the finite residual of G. Then F is abelian and G ^ is a finite nilpotent group.

Now by lemma 1.2 ( H F = H^’F*'" = H*1 since F is abelian. Similarly ( K F = K*'". Hence without loss of generality we may assume that F s H p K. Also since G,/'. n*'P°tent we bave G ^ s F . Consider H^^H. The finite residual of H^tv is • Since

» / » * ■ is nilpotent, we have by lemma 2.4 that <

Jry^Ti. S C C hx/'H*V > * S ° e v e ry sub9rotJP l/ h »T- contained in lySyfL

Is centralized by H, and so H normalizes every subgroup L such that s L s F. In particular, H normalizes X. Similarly K normalizes X. Hence X

Now G/x = < H/x , >

Since g ft. , is generated by two

subnormal nilpotent subgroups and G ^, satisfies Min.

Hence by gjj] we have that G/x £ ft end so X.

Hence G^ = < H^- , > and the theorem follows since

= H ^ K ^ i Yr 1 CH > Yr 2^K ^ We Introduce some notation before proving a corollary to the theorem. If H and K are subgroups of a group G, then the permutizer, PH(K), of K in H is defined in [Sl]

to be the largest subgroup of H which permutes with K.

Corollary Let G g Min-n and let G = < H, K > where H and K are subnormal subgroups of G. Then there exists a positive integer j such that Y (H) «; 6 H

Proof We have that G^" s H K from theorem C. Hence if L = G* K, then L = ( H p L ) K, and since L is a subgroup we have that H f) L permutes with K. Hence H p L * P (K) . Since Y (H) £ P H for sorhe 6 H 6 we have that Y (H) s H p L. 6 Hence Y (H) PJK) . 6 M We note that the proof of the corollary is taken from that given in the case of the derived series in (see (So) corollary to Theorem B).

Sec, g The Maximal Condition on Subnormal Subgroups.

We begin with an important theorem of Mal'cev which relates subgroups of a polycyclic group to the subgroups of finite index that contain them. Although the Mal'cev theorem is true for a slightly larger class of groups than polycyclic groups, we shall only be concerned here with the polycyclic case. We shall need this theorem several times tn the thesis and since it is not readily accessible in the literature we give a proof here based on that given by Mal'cev in [|j] .

Theorem 2.1 (Mal'cev) Let G be a polycyclic group. Then any subgroup of G is equal to the intersection of all the subgroups

of finite index that contain it.

tl«BHMMMFlitSIIMISr Proof We use induction on d, the derived length of G. If d = 1 , then G is abelian. Hence every subgroup of G is a normal subgroup of G, and since each factor group is residually finite, the theorem follows. So assum e d > 1 arid le t G 1 be the derived group of G. Let H be any subgroup of G and let F be the intersection of all subgroups of finite index containing it. Then obviously H £ F. Suppose for a contradiction that H < F. Hence we can find an element f g F such that f j H. We consider

f j H G„ . Since f is contained in the intersection of T subgroups of finite index containing H G^ , we may , without loss of generality, factor G by G^ and assume G^ = 1 and G is abelian. But then by the case d = 1 , we obtain f g H, a contradiction.

C a se 2. f g H G r Then f = h^ Le t 91 h1 € H . £>! e •

T = H n g 1 . Th e n ^ T and has derived series of 9 1 G 1 length d - 1 . Hence by induction there exists a subgroup F^ of finite index in G , containing T such that » . 1 F r Le t s . Th e n I G 1 8 F 1 I = s * G < G , SO and • G^ char 1 G1S"

Suppose that f g H G ^ - . Then f = h2 g£ where g H,

01 s

CM g G 1 • , and h2 gg = h , 0l •

So h 1 _1 h2 = 91 92_1 g H n G , = T - So 9l g H G , * 1' w hich is a contradiction to ( 1 ). So f j! h G l sJ.

Hence, without loss of generality, we may factor G si b y G 1 " and assume G , € * and G ^ S‘ = 1 .

■U rliUllMMIiiHMiL So | H G 1 s H | = | G 1 : H n G 1 J = t, say. t> - i t* Let M = H G 1 . Then M ‘ s H . So f i M • and we may t' 1 ' assume M ’ = 1 and M is finite. Then H is finite, of order n, say. Since G is residually finite, for each h. g H i = 1 ,....,n there exists a normal subgroup N. of G such that | G : | < „ and N. . f N t ■* ni I L e t N = 0 N. . Th e n | G : N | is finite and 1=1 1 H N . But H s H N and | G : H N | is finite, a contradiction.

W e also use the following lemma.

Lernm a 2 .6 Let G = H N where N

y J G ) s Yr CH) Yr (N) . r r 1 1

Proof Since N

H = H < H 4 . . . < H .

Now for each i, H J_1

L e t l = n-1. Then by Fitting's theorem we obtain that

H is nilpotent.

Hence there exists an integer c^ 1 such that

Yc * Y -C H ) . n- 1 1

uiM M KriaiKUi!

▼ a i. i * vs *voo* Suppose that we have found an integer cj_ 1 such that

Y c * Yr C H ). 't-1

Then by Fitting's theorem H > is nilpotent. ' VYc 1-1 1 1 Hence there exists an integer c^ such that

Yc. * Yc^C^-W * Yr/H>*

By induction on i decreasing we obtain an integer c q = r such that

y^(G) s (H) and the lemma is proved.

We shall now prove the following theorem on the join of two subnormal subgroups which satisfy the maximal condition on subnormal subgroups.

Theorem D, Suppose that H and K are subnormal subgroups *1 of their join G = < H, K > , and that H and K satisfy the maximal condition for subnormal subgroups. Then, given any two positive integers r^ and r # there exists a positive integer r such that

YrCG) * < Y r Yr 0<) > * 1 2 Proof By the subnormal coalescence of the class Max-sn, , we have that G £ Max-sn. Now there exist positive Integers s„ , s such that 1 2 ► W * Yr K (S 25 s Y r

Then by lemma 2.1 there exists a positive integer s such that G (S) £ H ^ l 5 K(S 25 s < y (H ), Y 1 2 Let X = < v_ (H), Vr< (K) > . Now, without loss of r 1 r 2 generality, we may assume Core^X) 1. Hence G^8^ ■ 1 and

V '{¡WMIIfliiHIHiKli:1 G is soluble. Since G £ Max-sn, G is polycyclic. Let G have derived length d. We use induction on d. If d = 1, then G is abelian and the theorem is trivially true. So assume d > 1 and that the theorem is true for soluble groups of derived length less than d. Let N be the last but one term of the derived series. Then G/j^ has derived length d-1 , and by induction there exists a positive integer r^ such that Y (G) * NX. r 3 By lemma 2.6 there exist positive integers t^ , t^ such that

Vt(NH) * Yr

So replacing ^ , r 2 by t<, tg respectively, we may assume that N £ H p K . Hence N normalizes X and so X <, X N . Now X ty x ~ % n x € ei

Let L = Y (G). 3 Th e n L ' < ( X N ) ' s X, and since L'

Let M = X L. Then X < M and M/x a- L/\_n x * Ot

Since M is polycyclic, there exists F

Then Mn s F, so we have | M ! MnX | is finite and

MnX ^ is torsion-free.

Now by theorem 2.1, there exists a subgroup F q of G such that | G ! F q | < « and

M ° X = F p M . o "

By Wlelandt [35] we have that there exists an integer r 4 such that Yr (G) * * CoreG(Fo) ‘ 4 Let R = Core_(F ) and let r _ = max } , then o o 5 i V r 4

Y r (G ) 5 X R n M 5

= X ( R n M ) ) = X M n , * X ( Fo n m

and that Hence we may suppose that L = V r f ) o is torsion-free. By the same method we can now show that for all primes there exist positive integers r(p) such that

vKp)tG) s xmP ■ Let l be the rank of G. , l Then ,p has order less than or equal p . / X M Since L = v (G) we have r 5 v ..(G) < X Mp for all primes p. ' r j H D

Hence Y r +i^G^ « fl x • 5 p

Now ( ) P = X and since is

torsion-free abelian of finite rank

n ( ^ ) P " * •

Hence n x m p = X and Y ..(G) = * • T r +1 p 5 Let r = r_ + l . Then o

Y_CG) s < y > Y CK) > and the theorem is Cl *^o p ro ve d . Chapter 3 Residuals of the Join of two Ascendant Subgroups.

Sec. 1 Locally Finite Groups.

We begin with an alternative proof to theorem B, which also works for serial subgroups. The proof, however, reduces to the finite case and the Wielandt theorem given in [55] .

Theorem 3.1 Let G = < A, B > be a locally finite group, where A and B are serial subgroups of G. Let & = 3£ and suppose that for any two finite o subgroups X and V which are subnormally embedded in their join that < X, V ^ = < X*-, V* > = X* V .L* AUt _L* .Li L£ T h e n G/^l-X. g L^t and G = < A , B > = A B

Proof By lemma 1 .J we have G/^U (■ g L*< .

Let N = GL3t and M = < AL* , BLX-> . We will show first that M = N.

Now a/ a n N * Ar% e L ( * n3t)

So A^-^- s A n N s N. Similarly B*- s N.

S o M N.

By lemma 1.4 N = < F* | F is a finite subgroup of G > * So it is enough to prove that F s M for finite subgroups

F of G . Let F be any finite subgroup of G. Then F is contained in some subgroup F^ where

F^ = f A kj € ® •

Then F is finite and

f 1 = < F-, fl A* n B > • OD

S o F ' X < f , n A, F1 n B

Since A is a serial subgroup of G, A p is subnormal in the finite subgroup F . Similarly B n F 1 is subnormal in F . So, by hypothesis

f *■ s < A n Fi * B n Fi >*

= < (A n Fi )* » ( B n ) >

s M

So N s M and we have

a f G - < 1-* ’ > • L i „ L X , „ a L X To show permutabillty of A and B let a £ A and b f. B*- ^ - . Then a b g G*- *" and as before

. L i < F * | F is a finite subgroup of G > .

So a b c E* . . . E * where E is finite 1 s i s s. ^ 1 s > UJ A • • • • Let E = < E 1 •

T h e n a b < E *■ and E is some finite subgroup E 9 such that E n A , E n B > o ~o ~ < “o " "• “o i — Hence a b £ E < E * o

- < A n E 0 * B i , , B ( A n E0 ) Ci i , ■ ( b n E 0 ) C -

i BL l A L>t

L * , L * e a LX Hence a b f B A So B A Sec ■ 2 Groups with the Minimal Condition on Subnormal S u b g ro u p s■

Let G £ Min—sn. Let F (G) be the smallest subgroup of finite index of the group G. Let E (G) = F (G)*. Then E (G) is the smallest subgroup with Cernikov factor group. The following lemma is proved by Hartley and Peng in [(c>] . We include their proof as it has not yet appeared in the literature.

Lemma 3.1 Let H, K g Min-sn and suppose that H and K are ascendant subgroups of a group G. Then E (H) < N(K) .

Proof Suppose for a contradiction that the result is false

so that there exist ascendant subgroups H , K q of a group G which satisfy Min-sn but are such that H_ = E (H ) o 1 o does not normalize K . Among the subnormal subgroups of o K which are not normalized by H , let K be minimal, o 1 i and le t G 1 = < H 1, K 1 > . By construction, normalizes

every proper subgroup of , and hence normalizes also their product L. Therefore L < , and clearly L .

Letting G = , H = H, l/ l , K = ^ L/ l

we now have, using the fact that for any group G, E (E(G) ) = E (G) (since the class of Cernikov groups is extension closed)

H, K asc G ( 1 ) H = E (H ) ( 2 ) K is sim ple (3 ) H (4 ) i n g (K) From Robinson ([¿ 5 ] Lemma 4.3 and Corollary) , we obtain

H «j2 G (5 ) 2 If K = K', then it follows from (1) and (3) that K G . This follows by a simple Induction on the length of a series connecting K to G , using the well-known fact that a non—abelian simple subnormal subgroup of a group is at most 2 - step subnormal. But then H s N_(K) since F (G) normalizes every subnormal subgroup (see [aYj ) . Hence (4 ) is contradicted.

Therefore K is cyclic of prime order p, and the Q normal closure K = K is a locally finite p - group, by ( 1 ) and [as*] p . 20 according to which the class of locally finite p - groups is closed under forming joins of ascendant — — G subgroups. Now from (5) we have [K,H]^KpH — R and [ R, H ] £ K n H = s*a normal locally finite p - subgroup of H. Since H satisfies Min-sn , so does S, and hence S is Bernikov ( fa$] p. 171 ). Now is finite

and F (S) is the union of its finite characteristic subgroups; since S

H' = H centralizes S. Hence H stabilizes by conjugation the series

1

of K and we find successively that H' = H centralizes R and then K . We now have H s NG(K), a final contradiction to (4).

We examine E (G) in the following case:

Lemma 3.2 Let G = < H, K > where H, K asc G and H, K g Mln-sn. Then G f Mln-sn and

E (G ) = E(H)E(K) .

Proof The class Mln-sn forms a subnormal and an ascendant coalition class (see fAJfl theorems 4.1 and 4.2 ). Hence

G £ Min-sn. Now E (H) H and so E (H) e Min-sn; similarly E (K) g Mln-sn. Since E (H) and E (K) have no proper subgroups of finite index, they are subnormal in G, and normalize each other ( [a'i] lernma 4.3 ). Hence from above E (H) E (K) is a subnormal subgroup of G satisfying Min-sn.

Let X = E (H) E (K) .

Th e n E (H ) E (G ) and E (K ) s E (G) . Hence £ 2 X s E (G ), and X « E ( G ) , by lem m a 3.1. Hence X

We consider L = < H , E(K ) > . Then by lemma 3.1

E (G ) S n g (H) and hence X s N q (H) . S o L -• X H .

I

Now X

Then X H^H = XH H/^, H - H^H ^ H

which is Cerntkov. .H A ls o X xH n x H «= x ( x n h )

H H which is Cemikov. and therefore X /^ e? X p H/£ ^ h Since | X H : N x H(X) | < „ (see frt] or C»»] ) and by the P-closure of the class of Cernikov groups ( £ 5-] p.69 )

X H is Cernikov. >£°rex H(X)

Hence E ( X H ) * X . But E (H) £ E (X H) and E (K) = E ( E (K) ) £ E (X H) .

Therefore E (X H) = X and X is normalized by H. Similarly X is normalized by K. So X

G/X = < H , K X^, >

is generated by two ascendant Bernikov groups, and so is Sernikov by [jj,^ theorem 4.2.

Hence E (G) £ X and so

E (G) = E (H) E (K) .

We are now able to prove:

Theorem E Let G = < H, K > where H, Kg Mln-sn and

H, K asc G. Then G^ a e * and

G * = < H -6 , K A > = H*KA.

Proof Since Mln-sn is an ascendant coalition class we have

G £ Min-sn. Hence A £ Jb •

Let A = GA and B = < H Since, as before H^ £ GA and K -5 s G . VI < m

Now G^. G) is Cemtkov, and hence is

Now ( G ^ e (G)> “ ( (G )

and by the Q-closure of the class we have by lem m a 1 .1 c °sk (G) g * e É : c g >

S in ce is locally finite, we may apply theorem 3.1 (G) to obtain A E (G) = B E (G) = H6 K * E ( G ) .

Now G,£ is Cemikov. Hence E (G) ^ A.

Similarly, E (H) s H4 , E (K ) KC* . By lemma 3.2 we have

E(G ) = E (H) E (K) .

Hence G* = hf K^.

Corollary Let H be a perfect ascendant subgroup of a group G, and let K be an ascendant subgroup of G. Then if H, K g Min-sn H permutes with K.

Proof This follows from theorem E and lemma 1.6 .

Theorem F Let G : = < H 9 K > H, K £ Min-sn and H, K asc G. T h e n G/Q-tl g L3V

and GL?t = < h l t v KLn-> - HlJVK L ’ 1

Proof As in theorem E, we obtain that G g Min-sn. Hence G ^ L J L g L it .

Locally nilpotent groups satisfying Mln-sn are Cernikov and soluble (see, for example, [¿q p. 154 ). Therefore H/^UV » , and G^LJl are soluble.

By theorem E „A H * K * .

So without toss of generality, we may assume G^ = 1 , and is soluble. But then G is ternikov and so locally finite.

I I li («UHMHHiHHSIL Hence by theorem 3.1

GLJ>- - H ^K 1^ .

We note that the equivalent theorem is not true for nilpotent residuals, since the join of two ascendant nilpotent subgroups which s a tis fy M in -s n need not be nilpotent. 0 II Let G = < t, A;afc=a 1, ~I 1 . a g A > where A o. Cgo, . Then T = < t > and A a re ascendant in G and belong to Min-sn q JV . But G is not nilpotent. P A R T T W O

CRITERIA FOR SUBNORMALITY AND

ASCENDANCY IN SOLUBLE AND

GENERALIZED SOLUBLE GROUPS

■ 4.1 Chapter 4 Subnormality and Ascendancy in Soluble and Generalized Soluble Groups.

The results in this chapter are based on those proved by Wielandt for finite groups in [34,]. Following Kurosh [|fc] we use the following definitions:

A class of generalized soluble groups is a class satisfying

? n l s A « ^

i.e. a finite 3t-group is soluble and every soluble group is an group. A group is SN* or SI* if tt has respectively an ascending or ascending normal series with abelian factors.

S e c . 1 Soluble Groups.

The main theorems in this section will be: Theorem G.1 Let G be a soluble group of derived length d, and let H be a subgroup of G . Suppose that for all sequences h1 ,.... .h^; hj ( H, n a fixed integer, and fo r a ll g g G

[ 9* ^ > • • • • nd Then H < G .

Corollary G.1 Let G be a soluble group of derived length

d and H a subgroup of G . Then tf H n < H,g > vg € G» n a fixed integer, then H 0(1 G .

The corollary follows easily from the theorem since if

L = < H,g >, some g € G , by hypothesis we have Y L h "* H .

thiiuM iiiH atns; I

Hence the subgroup H satisfies also the hypothesis of the theorem.

Theorem H.1 Let G be a soluble group and let H be a subgroup of G . Then H is subnormal in G if and only if there exists an integer n * 0 and for each g g G a sequence

H. H of generating sets of H such that T g,H H ] s l 1 n '■in

For our proof of theorem G.1 we examine closely the following special case:

Lemma 4 ■ 1 Let G be a group and let H be a subgroup of G , and suppose that G = HA where A

If, for all sequences h ...... h^; h^ f H, n a fixed

integer, and for all g £ G

[ 9 , ------,h n ] 6 H

then H «q1 G .

Proof Since A < G we have A f| H

Now let a g A. Let g1 ...... ,g n be any sequence in G .

Since G = HA we have ... that g( = at hj where

a, € A, ht € H.

Hence [ a, g 1 ...... ,9 n ] = [ a , a ^ ...... anhn ]

Now [ a, a^h^ ] = [ *, h^ ] [ a, a^ ] 1

by simple commutator calculus - [ a , h1 ] since A g ©Jj Now A < G and so [a , h ]gA. Hence by a simple induction we have

[ a , , . , . . ,h^ ] = [ a, ]•

But by hypothesis [ a, h1 ...... h^ ] £ H and since A

£ a , , ...... h^ ] € A .

So £ a, h^ , .... ,h^ ] € a n h = 1 .

So £ a, g1, .. . . ,gn ] = 1 for all sequences g 1 * .....g r).

Hence a g r ( G ) and since a was arbitrary A s £ ^ (G ). n

N o w since •

H C t ^ « H C l+i

H < H C, (G ) < • • . <3 H C n ( G ) = G

. . n l»c* H ^ G •

We can now easily prove theorem G,1 with the aid of the le m m a .

Proof (of theorem G.1) We use induction on d. If d = 1 then G is abelian and H is obviously a normal subgroup. Hence assume d > 1 and that the theorem is true for soluble groups of derived length less than d. Let A be the last but one term of the derived series of G . Then A < G and A ( ffl . Since the hypotheses of the theorem remain true on taking homomorphic images of G , we have by induction on d, since

G / A has derived length d-1, that

H A / A <3nCd" ’ ) G /A

« u a n (d - ) _ i . e . H A

But the group HA satisfies the hypotheses of lemma 4.1 and so by the lemma

H n H A

nd Hence H

We prove theorem H . 1 in a fairly similar way using the following lemma in place of lemma 4.1.

Lemma 4,2 Let G = HA where A

H ^ ,....,H ^ of generating sets of H such that

[ g , H 1 ...... ] s H, then H

Proof As in lemma 4.1 we have H n A o G and since our hypotheses remain true under homomorphic images of G we may factor by H p A and assume H p A = 1.

Let a g A. Then by hypothesis, for a sequence ,.... ,H ^

of generating sets of H we have X [ H 1# ...... H n ^

S ince A < G we have [ a , H 1 ( ....,H n ] s A and so

S H n A = 1 . [ a» * • • •' ,Hn 3

Hence [ a, H H ^ ] centralizes all elements in a generating set of H and so is contained in the centralizer of H.

Now suppose that [ a, ,.. •. *Hn_j ] s C anc*

ll+1 € f a ' H l , " , , , H n-

As before if g = h a' some h € H. a' € A

[ il+1. a ] - C It+1 * h 3

Since we supposed [ a, ,.... ] s wc

have [ 1|+1, g ] € Ct V 9 € G.

Hence l J+1 € C1+1

By induction on i we obtain A s Cn(G ).

As before, since

H Ct(G ) H C i t , ( G J . Ct(G ) ^ C , C O )

with r „(G)- 1 , wo have * o

»> .SlunUMIWUMSKE H

Hence H «3 G .

Proof of Theorem H . 1 To show sufficiency of the condition we use induction on d, the derived length of G . If d = 1 then G is abelian and H 1 and that the theorem is true for all soluble groups of derived length less than d. We in fact nd prove by induction that H < G. Let A be the last but one term of the derived series of G . T h e n A £ Ol and A

n(d- 1 ) a h / a V a

Hence H A <3 ^ G .

Since the group H A satisfies the conditions of lemma 4.2 we obtain H

To show the necessity of the condition let H sn G and have normal closure series

H = Ln < Ln_i o • • • o L 0 = G

Th e n if H ...... H are generating sets of H and 1 m g g G we have

[ 9 , H 1 ...... Hm ] s L m 0 s m s n.

Sec. 2 Generalized Soluble Groups

For SI* - groups we obtain the following two theorems analogous to theorems G.1 and H.1 in section 1 of this chapter.

>1 Theorem G.2 Let G be an SI* - group, and let H be a subgroup of G Suppose that for each g g G and for all sequences h^ ,., of H that there exists an integer n = n (g ) such that [ g , , ,h n ] € H . T h e n H is ascendant in G . Corollary G.2 Let G be an SI* - group and let H be a subgroup of G Then H asc < H, g > yggG im p lie s that H asc G. Theorem H .2 Let G be an SI* - group and let H be a subgroup of G Then if for each g g G there exists an integer n = n(g) and a sequence of generating sets of H such that [ g H ,H T s H then 1 ’ n J H asc G .

We mention that as shown in [i©] the condition stated in theorem H .2 is not necessary for ascendancy, for let G be the wreath product C\B of a group C of type by an elementary abelian group of order 4 generated by i and J. Then G Is locally nilpotent and satisfies the minimal condition, and hence is hypercentral. Let H = < C , l> , then H asc G since G ts hypercentral Now for any sequence ,., .. , of generating sets of H we have that

,H I where [ [ J• c ]n_ 1 l ] € [ J* n J c Is any generator of C. By a simple induction we can show that n-2 _ ^ - 2 ^ - 2 ¿ 1-B _ ^ - 2 (- 1 ) ( c c J c c J ) c r J’ C )n - 1 1 3 ^ - 2 But if this element lies In H we must have c However for eaqlp n we can always find a generator c 1 such that c 1 / 1. Hence we can not find a sequence of generating sets of H such that [ j, H , ] s i-

We note, however, that if H is finitely generated then the condition is necessary [ See [ 10] lemma 2.4 ].

We begin the proof of theorem G.2 with the following lemma.

Lemma 4.3 Let G be a group and let H be a subgroup of G . Suppose that G = H A where A

A € ©l and so CA(H) <, G . Hence we can define groups A for ordinals a by a

- C A ^ (H ) «"/A l X a

and A = n A for limtt ordinals \ . X , a a

Then A H <- A , . H and so if A = y A we have H asc A H. +1 a a a a

Since our hypotheses remain true on taking homomorphic images of G , it is enough to show that if A > 1 then C^CH) > 1 so that A = K and H asc A H = G . Hence, suppose for a contradiction that A ^ 1 but C^(H) = 1. Then if 1 f a 1 ( A then a 1 j CA(H). Hence there exists

^44 € H such that

[ *v hi 3 * 1

Let a„ = r a. > h„ "l. Then a„ c A since A

[ a2» h2 ] * 1

Let a = r a , h ]. Continuing in this way and defining 3 2 2 a = r a ,, , h _ 1 we can find a sequence h., h „,....,h , n 1 n - 1 ’ n- 1 J 1 2 n such that a 4= 1 for any n. But this contradicts the hypotheses n 1 of the le m m a .

Hence if A ^ 1, C^CH) > 1 and so A = A and H asc G.

Corollary Let G = H A where H is a subgroup of G and A a normal subgroup, A g ®L. Then if H asc < H, g > y g g G we have H asc G . Proof This follows from lemma 4.3 and the following lemma.

Lemma 4.4 Let G be a group and let H be an ascendant subgroup of G. For any two sequences

91 * 92 ’ ’ *** hi * h2 ...... 9t € G » H such that

9i+1 = £ °t' ht 3 there is an m > 0 such that gm g H.

Proof Let g1, Bg»• • • • h1 *h2»•••• be two sequences with gt € G. ht € H such that 9l+1 " C V hl 3* Now

H asc G so there exists an ascending series X II V

H 0 H 1 <

Suppose fo r a ll 9i i H for some ordinal «. T h e n gt p H \ H i e at+1X *i

Now since H < H we have Qi +1 H « + 1 H n

S o ai+1 < Oj •

Hence we can find an infinite descending chain of ordinals a1 > °2 > **’ * which is impossible. Hence g pH for some m. m

Theorem G.2 now follows easily from lemma 4.3.

Proof of Theorem G.2 Let 1 = G

Now H G H G G + i . L + 1

and G y ç

Since the gr oup H satisfies the hypotheses of

lemma 4.3 we may apply this lemma to obtain

H G . asc H G .. y v 6 a+yo ' a ' a

Hence H G asc HG ... This is true for all a < P 80 a a+1 H G H asc G H G , i.e. H asc G. o P

Proof of Corollary G.2 This follows from theorem G.2 and le m m a 4.4.

We now prove theorem H.2 in a similar way with the following lemma playing the role of lemma 4.3.

Lemma 4.5 Let G be a group and H a subgroup of G. Let G = HA where A ... . , H n of generating sets of H such that [ g, ] s H then H asc G.

Proof As in lemma 4.3 we may assume H p A = 1 . A s before C.(H)

A = y A for limit ordinals ^ X a

T h e n A H 0 A H and so if 5 = i|A we have H asc A H. a a+1 a

As in lemma 4.3 it is enough to show that if A > 1 then

C a (H ) > 1 Suppose for a contradiction that A ^ 1 and C^(H) = 1.

Let 1 * a £ A, then a f CA(H). By hypothesis there exists a sequence of generating sets of H, m = m(a) such that H [ a * H1 m But since A

[ a . H 1 *...... Hm ] s H f| A = 1 .

Now a ^ C^CH) s o there exists h^ g H such that

[ a, h1 ] 1. Since [ a, h^ ] g A we know

Ca» hi 3 i c a

[ a. h1t h2 ] # 1.

So continuing in this way we obtain a sequence h^ , h^,., m h( £ H ( such that

[ a * ^ » h2* * • * * ,hm ^ ^

But [ a, h^, h2’ ‘ ” *’hm 3 € [ a» ^ = 1'

This contradiction shows that C^(H) >1 if A > 1 and hence H asc G.

Proof of Theorem H.2 Let 1 = G

be an ascending abelian series with G^

Applying lemma 4.5 to the group H G we obtain in a+V e a a similar way to the proof of theorem G.2, that H G asc H G a a+1 and hence H = G H asc G H = G, i.e. H asc G. o p

SN* - groups. We are able to obtain similar theorems to theorems G.2 and H.2 with the use of lemmas 4.3 and 4.5, provided that we can obtain an ascending abelian series of G, an SN* - group, which is normalized by the subgroup H.

T m This is possible by putting conditions on our subgroup H. We do not know whether the theorems remain true for arbitrary subgroups H.

We introduce a subclass *}' * of the class of finitely Q generated groups by G e fljl* if for all x g G, < x > is finitely generated.

We denote by Max-asc the class of all groups which have the maximal condition on the set of all ascendant subgroips.

Theorem G.3 Let G be an SN* — group, and let H be a subgroup of G. Suppose that for each g g G and for all sequences ...... h,,.... of H that there exists an Integer n = n(g) such that [ g, h , ...... h^ ] g H . T h e n

If H g p Max-asc) then H asc G.

Corollary G.3 Let G be an SN* - group and H a subgroup of G, Suppose that H asc < H, g > ygpG.

Then if H * p(»J, p Max-asc) then H asc G.

Theorem H.3 Let G be an SN*- group and let H be a subgroup of G. Then if for each g £ G there exists an Integer n = r

H asc G ,

Let G be an SN* - group and let 1 = G G = G be an ascending series of G with ° P abelian factors. — H Let G = p G a h€H 0

» , s iUHiC i f Then by Corollary 2.2 of [ j^ j since H € f i j , * u ( 0^ p M a x -a s c ) then G <, G and G - (j G j, , a limit a * ß

G € & l • ° /6 a - 1

Hence { G l is an ascending abelian series of G with all a aip terms normalized by H. Hence for all a < p

G

Using this fact we are able to apply lemmas 4.3 and 4.5 and the proofs of theorems G.3 and H.3 follow the same lines as theorems G.2 and H.2 respectively. The proof of corollary G.3 ts the same ns the proof of c o ro lla ry G.2.

Locally Sotuble Groups.

Let G be a locally soluble group and let H be a subgroup of G. Then if H sn < H, g > y g g G, we need not have H asc G, as the following example shows.

Example. Let p denote the first uncountable ordinal and for each a < p let H be cyclic with prime order p. a As ascending chain of groups f W * a * p } *s defined by the 1 Aa rules W = 1 and W = n W o X ß

» . c until m sa a iH U i.....— — the wreath product is the standard one and is embedded in w in the natural way. (xl 1 The group W is a locally finite p - group. So let H be a finitely generated subgroup. Then < H, g > is also

finitely generated for each g e w » and so is a finite P ” group and hence nilpotent.

So H sn < H, g > v 9 6 W-

But H is not ascendant in W, since the Gruenberg radical of W is trivial. [ See Robinson [jt] p. 28 Theorem 0.27 ].

M l Chapter 5 Subnormality in Soluble Groups with Finiteness Conditions.

Sec. 1 Introduction

In Peng examines the subnormality of a subgroup H in a soluble - by - Max group where H satisfies the condition that there exists an integer n ^ 0 such that [ g.^h ] p H y g p G and y h p H . He shows that this implies H is subnormal in G, provided that H is polycyclic - by - finite.

This theorem is not true for arbitrary subgroups H even when G is a metabelian group, for example let G be the standard wreath product of a group of order 2 with a countably infinite elementary abelian 2-group, H. Then [ x,y,y,y ] = 1 fo r a ll x, y p G. Although every k-generator subgroup of G is nilpotent of class k+1 for k ;> 2, G is itself not nilpotent. (A proof of these is given in [;^] p.98.)

So [ g,gh ] p H yg p G and h p H. But H is shown - l “ '3 j ^ ' - - in [4o] to be lts own normalizer in G.

We note that our conditions in theorem G.1 were stronger than those considered by Peng, but that theorem G.1 was true for arbitrary subgroups.

In Gio]» the case is also considered when n is not a fixed Integer, but depends on g and h. Provided that H is polycyclic - by - finite, H is shown to be ascendant in G.

We shall be concerned here with a weaker condition that implies subnormality in soluble groups; first by imposing finiteness conditions on the group G, and then considering an arbitrary soluble group but imposing conditions on the subgroup H. Sec. 2 The Finite Case.

We would like to thank D r. Brian Hartley for suggesting the following result, and for indicating the method of proof. We do not know whether the theorem is true for non-soluble finite groups, and we leave this as an open question.

Theorem 5.1 Let G be a finite soluble group. Let H = < tv | Ifiisrn >. Then H is subnormal in G, if and only if [ g«nbt ] € H V 9 6 G» n = |G |, i = 1 ,...., m .

T o prove this we introduce tw'O concepts:

Let G be any group and let a £ G. We define subgroups X (a) for integers r * 0 by r Xr(a) = < a, [ g,pa ] ; g e G >

Then X^(a) a X^Ca) for ®11 integers r a 0.

Following Wielandt, we define the subnormalizer of a subgroup X of a group G, to be the intersection of all subnormal subgroups

of G containing X.

We denote the subnormalizer of X by X’iiG In general X,|VJ need not be subnormal in G. For let G be the Infinite dihedral group: —1 —1 2 D = < a ,x | a x a = x , a = 1 > «->•! K »■ < • > .

If N = < x > then a 1n a = n 1 y n g N and so

X (a) = < x‘ , a > . r Then X^(a)

But if X"G is subnormal in G then X (a) s X"G fo r m some integer m. Therefore the chain G • • • s Xj(a) * Xt_.j(a) *...£< a > s G

terminates after finitely many steps.

y * * illlHHUIBUMMBMkMn—iiWMt*1 But for all positive integers r

V a) < *r-1(a) Q Hence X" is not subnormal in G.

We note however, that when G satisfies the minimal G condition on subnormal subgroups, X" is a subnormal subgroup of G, since the intersection of finitely many subnormal subgroups is subnormal. Theorem 5.1 will follow from:

Lemma 5.1 Let G be a finite soluble group and let a £ G. Th e n if n ■= |G| we have

< a >"G = X^a), V r > " . 0 Proof Since G is finite we have < a >" is subnormal in G , and since |G| = n the subnorm al index is bounded by n . Hence

X n "G

So it is enough to show that X^(a) is subnormal in G. Suppose for a contradiction that this is false and let G be a minimal counterexample.

Let X = X^fa) wherein = |G|. X is not subnormal in G.

Let G 1 = < a G > . If G 1 < G then the subgroup 1

X 1 = < a . [ 91 » ma 3 } 91 € G ì > m “ lG i| I is subnormal in G ^ . Since G^ < G we have X^ is subnormal 1 in G . G Hence < a >" s X1 and so X s X^. Since m = |G1 |

we have < a * [ Si » ra 3 5 9i € G 1 > “ and so X 1 * X.

Hence X = X. , and X is subnormal in G which is a 1 G contradiction. Hence G = < a > .

A ft I I ! Let N be a minimal normal subgroup of G.

T h e n X N ^ n sn G/N .

Q Hence X N = G since G = < a > ,

Since G is soluble, N is an elementary abelian p-group, for some prime p. Hence X p N ^ G . If X p N = N then N ^ X and G = X . So X p N = 1 . Let V be a proper maximal subgroup of G containing X, Th e n Y = YpXN = X(YpN). Since Y p N < G, Y p N = 1 since Y G. Hence Y = X and X Is a maximal subgroup of G. Since X is not subnormal in G, and X is a maximal subgroup we have X = NG(X) .

Now CG(a) s N g ( X ) s X .

Hence C^Ca) = 1.

Let N1 be a minimal a - invariant subgroup of N.

Then [ N1» a ] = Ni

= C * *»••••» a ]

= [ N1 , ra ] s X

But this is a contradiction to the definition of X. Hence X is subnormal In G and the lemma is proved.

Proof of theorem 5.1 We have H = < h^ | 1 s i * m >

- < X n(h .) ; i = 1 ,... ,m > where n = |G|.

By lemma 5.2 we know that each X^Chj) ts subnormal

In G , 1 t l t m . Since G is finite, the Join of the finitely many subgroups

X (h.) is subnormal, n l Hence H is subnormal in G. Obviously the converse holds

>5 Sec. 3 Subnormality in Polycyclic Groups.

We begin with a result proved by Kegel in [ 15] . A s o u r proofs in this section will depend heavily on this result, we give a proof here and note that it is an alternative one to that given in

[•S3*

Theorem 5.2 (Kegel) Let G be a polycyclic group and X a subgroup of G. Suppose that X is subnormal in G modulo normal subgroups of finite index in G, then X is subnormal in G ,

We shall need the following lemmas in the proof.

Lemma 5.2 Let G be a polycyclic group and X a subgroup of G. Let X sn G modulo normal subgroups of finite index of G. Then if X s H < G we have that X is subnormal in H modulo normal subgroups of finite index of H.

Proof Let X s H < G and let M be a normal subgroup of finite index of H. Then using Mal'cevs theorem given in theorem 2.1 we have that there exists a subgroup F of G with finite index in G, such that M = H p F. Let F_ = Core_(F). Then by hypothesis, there exists G G an integer r such that

X [ G, r ] i x f g

i.e. [ H, X x f g n H r 3 <

« x ( H p Fg)

« X M .

Hence X ts subnormal ln H modulo M.

Le m m a 5.3 Let M be a non-trivial normal^ subgroup in the hypercentre of a group G, then M p j(G) ^ 1

Proof See Robinson [¿gy p. 47 Lemma 2.16. Proof of ' leorem 5.2 We use induction on d, the derived length of G. Since the hypothesis of the theorem remains true on taking homomorphic images of G, if N is the last but one term of the derived series of G we obtain by induction

x n/ n s "

Hence X N sn G. By lemma 5.2 the group X N also satisfies the hypothesis of the theorem, so we may assume G = X N. Now X p N

Case 1 N is finite. If X is finite we have by hypothesis that X is subnormal in G. Hence we assume X is infinite. Since N is finite \ G:CG(N) | < „ . Now CQ(N) G

since N G. Hence X p CG(N) X and X p C q (N) is

normalized by N.

So X p C q (N )

and assume X p CG(N) = 1 .

So X e X/x n C g (N) “ X CG(N>CG(N) € &

i.e. X is finite and so X sn G.

Case 2 N is infinite.

Let N be the periodic subgroup of N. Then N q is finite and by case 1 we have X sn X N^. Since N^ char N G

N

We now have that N is free abelian of finite rank.

•> • ¡iitititu a iM s« .,« « « ’

* w AlliVi KVQO H Now NP char N

B y case 1

and this is true for alt primes p. Hence [ G, ^ X

for some integer n = n(p). S o [ N , s X N P n N

= N P ( X p N )

= N P since X p N = 1. A s N ^ (ft. and N < G

[ N. nG ] - [ N, nX ]

Hence N^p £ Cn ( ) l Let G have rank l. Then N^p Pas order dividing p‘ . By lemma 5.3 we have

N^ N P * Cl (-G'^NP > and so [ N, tX] s NP .

Since l does not depend on the prime p we obtain [ N, jX ] * NP for alt primes p,

i.e. [ N, jX ] s p NP

But N is free - abelian ( of finite rank) and so p NK = 1 . P Hence [ N, G ] = [ Nf X ] = 1 and

N £ C,(G) .

Since X Ci(<^ ^ t(G) < X Ci+1(^f,(0 ) V*

w here £q(G) “ 1 we have

X «1 X Ci < . . .

Theorem 5.3 Let G be a polycyclic group. Let H s G and suppose that H = < tv | 1 s i i m > . Then if there exists an integer n=h. such that [ g, h^ ] g H y 9 € ®

i = then H is subnormal in G.

Proof Since the hypotheses of the theorem remain true on taking homomorphic images of G we know, by theorem 5.1, that H is subnormal in G modulo normal subgroups of finite index. Hence by theorem 5.2, H is subnormal in G.

As was shown before, in the case of the infinite dihedral group the chain Q ... s X^a) s £ • . • £ < a > £ G

need not terminate after finitely many steps. We do not know in general whether, in a polycyclic group G, a £ G, we have X^(a) *s subnormal in G for some integer

n. However we do obtain

Lemma 5.4 Let G be a polycyclic group and let a g G. Suppose for some integer r that X p(a ) X r t ,(a ) y l j. 0

then X (a) is subnormal in G. r Proof By lemma 5.1 if X = X^a) then X is subnormal in G modulo normal subgroups of finite index in G. Hence by theorem 5.2 X is subnormal in G.

Also, when G is a finitely generated abelian - by - finite soluble group, there exists an integer N such that X^Ca) Is subnormal in G yn > N. This will be proved in the next

section. Sec. 4 Our main result here is

Theorem 1 Let G be a soluble group. Let H - < h, | 1 s i s m > s G such that [ g, ^h. ] g H y g g G , I - 1 ,...,m , n a fixed integer. Then if H is Min - by - Nilpotent, H is subnormal in G .

For the proof of the theorem, we begin with the following le m m a s .

Lemma 5.6 Let G be any group. Let X £ G and let N be a normal abelian subgroup of G. Let a £ X and suppose that

X = < a» [ 91 » r» ] | 91 € X N >

and X N = 5< N . r Th e n X X N .

Proof Without loss of generality we may suppose that G = XN, Now 5< p N «j X and X p N N since N f {(,. Hence we may factor G by X p N and assume X p N = 1. IX w 2 • L e t N 1 = 2 Th e n

N since N € 01 • Hence r > i By Induction define N t A bv

2 S= X N T V n w C - A . , 5

We wish to show N = N . r Since C_(a) < N_(3^ we have b G

C N( « ) * N , and [ n , ^a]gNpX=1 .

Hence [ n, ^ a ] g cN(a) i N1 • Factoring G by we obtain similarly that

C n * r - f ] € N 2 •

By a simple induction we obtain N = .

Then >< o XN4 > . . .

Lemma 5.7 Let G be a soluble group and let a g G. Suppose that for some integer m that Xm(a) = Xm+r(a) V r * 0 .

Then X (a) is subnormal in G. m Proof We use induction on d, the derived length of G. If d = 1 then G is abelian and the lemma is trivially true. Hence assume d > 1 and let N be the last but one term of the derived series of G. Then if X = X (a) we obtain by induction that m

x n/ n sn G/ n • l Hence X N sn G, and suppose XN 4 * G.

L e t X = .

Then Xj+rn(a) s X .

By hypothesis X = X •

Hence X s X s X . So X = X. Hence X N = X N and

by lemma 5.6 X = 5^ sn XN , Therefore X sn G.

Proof of theorem 1.

H*> Then by hypothesis X ^ ) s H;

1 t l < m . Since H is Min -• by - nilpotent, for each h. g H we can find an integer k ^ n such that

< V r 9» khi ] > = < V r g* k+r hi ] > i P i 0 -

Let t be the largest such k. Then y lj 1 s i s m

X t+r(ht) = X t(h.) v r * 0 .

By lemma 5.7 X fc(h.) Is subnormal in G. Now

H £ Min - by - Max. Hence, for example by [5 ] the join H of the finitely many subnormal subgroups X t(tv) is subnormal tn G .

We finally prove, as a special case

Lemma 5.8 Let G be a finitely generated abelian - by - finite soluble group. Let a g G. Then there exists a positive integer M such that X^(a) sn G y r a M.

Proof Since G is abelian - by - finite there exists an abelian normal subgroup, N, of G with finite index in G. Let |G : N | = n .

Then by lemma 5.1

X (a) N = X (a) N

We choose a fixed Integer r ^ n and let X = X^(a) .

Then X N sn G.

Let X (a) = m u rr'

N ow X n N <5 X N and X^£ ^ N - X € *3-.

Hence there exists an integer, l, such that

X~|(aj ( X n N ) = Xs(a) ( X n N ) ys »I 1

and X t(a) ( X p N ^ N is finite Hence by lemma 5.7 X ^a) (XpN n N sn X N

i.e. Xg(a) ( X n N ) = >TJ(a) ( X n N ) sn X N .

But X N sn G and so X ^(a) ( X p N ) sn G .

Hence there exists an integer p such that

x (a ) £ x j(a ) ( x n N ) P

If p £ l then X £ 1<*>

^ P > l then X p(a) £

Hence In either case we obtain the existence of an integer s ^ r such that

Xs(a) * >yi) ( X n N ) s X.

But from (1) Xg(a) N = X N .

Hence X = ( X N ) n X = ( Xg(a) N ) n X

= X s(a ) ( N n X )

£ X (a) ( X n N ) s X O

i.e. X = Xg(a) ( X n N ) .

Since Xg(a) ( X n N ) is subnormal in G we have that

X is subnormal in G.

Sec. 5 Soluble Minimax Groups.

A group G has finite rank r if every finitely generated subgroup of G can be generated by r elements and r is the

smallest Integer with this property.

Following Robinson , we shall use the term abelian S - group to describe an abelian group of finite rank whose torsion

subgroup is Cernikov.

i IttiuHflUBtaaiw“ »“- — i A soluble group is said to be an S1 - group if the factors in a normal abelian series are abelian S1 - groups.

A minimax group is a group G which has a series of finite length, each of whose factors satisfies Max or Min. Since the class of groups of finite rank is P - closed [ See Robinson lemma 1 .44 ] and since every polycyclic group and every Cernikov group has finite rank, we see that a soluble minimax group has finite rank. Since a periodic polycyclic group is finite, a periodic soluble minimax group is a Cernikov group. Hence a soluble minimax group is an S^ - group.

We state the main result of this section.

Theorem J Let G be a soluble minimax group and let G be such that

yg g G, some integer n, t = 1,, Then H sn G.

We note that when H s G satisfies [ g, ^h ] g H y g g G,

y h £ H when n is a fixed integer or varies with g and h, then Peng has Droved the following theorems in g^0] :

Theorem (Peng) Let G be a (soluble - minimax) - by - Min group and let H be any subgroup of G. If there exists an Integer n a 0 such that [ g, ^h ] f H yg f G and h g H

then H sn G.

Theorem (Peng) Let G be a (soluble of finite rank) - by - Min group and let H be any subgroup of G. If, for each g £ G and h £ H there exists an Integer n = n(g, h) * 0 such that

T 9» nh ] € H then H asc G.

We begin by defining:

»I A group is said to be radicable, if each element is an n - th power, for every positive integer n.

Lemma 5.9 Let A be a normal radicable abelian subgroup of a group G, and let H be a subgroup of G such that

[ A , H , . . . , H ] = 1 <------r ------> for some positive integer r.

If H ^, ^ periodic then f A, H ] = 1 .

Proof See Robinson [¿s’] lemma 3.13 .

L e m m a 5.10 Let G be a soluble group and suppose G = A H where A G, A £ o l • Then if H = < h. | 1 s I s m > and [ g, ^ ] € H f g f G, some integer n, i = 1 ,... ,m then H sn H A if

(i) A is finite . (li) A is a torsion - free minimax group, and Ann* A. (tii) A is a direct sum of r groups of type C ^ .

Proof Since A p H ^ G, we may assume that A p H = 1. L e t C = C_(A). Then H p C < G and we may assume H p C = 1 G T h e n

H - ^ p C and we may regard H as a subgroup of the automorphism group of A .

C ase (l). The automorphism group of A is finite and so H is finite. Hence by theorem 5.1, H sn G .

Case (li). AP char A AP G. Now A^^p Is direct product of cyclic groups

(Kaplansky Theorem 6). Hence, since A is a mtnimax group, A has finite rank and so A ^ p is a finite elementary

iiAMlflMMIfll&'tt abelian p - group. B y case ( l )

HA/ i ,p sn H ^ p

and so f A , nH ] s H A*5 for some integer n. T h e re fo re , H AP n A r A ’ nH ] * = AP( H n A )

= AP

Let A have rank r , then r A , rH ] *

T h is is true for all p rim e s p and so

[ A . r H 3 * n AP p

But by Robinson pl+] Theorem 4.31 p A P = 1 , since A P is a torsion - free abelian minirnax group.

Therefore [ A . pH ] = 1, and H sn G.

Case (iii). Regarding A additively H may be regarded as a group of linear transformations of an r - dimensional vector

space V, over the field of p - adic numbers. ( See (ajg p. 79.)

Suppose that the action of H on V is Irreducible. Then by Mal'cev's structure theorem for soluble linear groups (See £$■] theorem 3.21 ) H is abelian - by - finite. Moreover, with respect to a suitable basis of V , H has a normal subgroup N, of finite index such that N consists of

diagonal matrices. Now an element g ( GL(r, F), F a field, is called unipotent if (g - ir)r - o.

Since f o, h( ] { H (i A » 1 , in additive notation this means

that hj has untpotent action on A.

So A(hjS - 1p ) r • 0 for every integer s > 0.

SS« 1 1 2 »PWaiMHilMIttflni...... urtjtfHL »1

< Let | H : N | = t. Then Ht ^ N and so h.* can be represented as a diagonal matrix. But, by the above, the action of 1 on V is unipotent and so all its eigenvalues l are 1 . So h.* can be represented by the unit matrix 1 .

Hence h{ = 1 and this is true for all t: 1 s i s: m.

Now for each 1» < h > sn < h. > A (by, for example,

Peng ) .

Hence [ A, < hj >t . . . » < > ] = 1 <------l ------V

But < h. > is periodic. Therefore, applying lemma 5.9 we have, since A is radicable, that

[ A, < ht > ] = 1 .

So [A , H ] = 1 and H acts trivially on V.

Now let H act reducibly on V, and form an F H - composition series in V, where F is the field of p - adic numbers. Then, from the above, H acts trivially on each composition factor. So H can be represented by a group of unltrlangular r x r matrices. Hence [ A, ^H ] = 1 and so H sn G.

Proof of theorem J

We use induction on d, the derived length of G. If d = 1, then G is abelian and so the theorem is trivially true. So assume d > 1 and let N be the last but one term of the derived series of G. By induction we have

h n / n GA> and so H N sn G.

w li ▼ « . I i ’ Since the group H N satisfies the hypotheses of the theorem we may assume G = H N. Since H p N

Let T be the torsion subgroup of N. Then T char N o G, and therefore T ^ G. Now N^ torsion -

sn G . free , hence by lemma 5.10 ( i i ) H w

Hence we may assume G = H T . L e t T be the P component of T. T^ char T < G and T P - + T p < G ' P is a direct product of finitely many cyclic and quasi - cyclic

p - groups. Let F be the finite residual of T . Then P P F char T < G F

Now F is a direct product of finitely many groups of P type C a, . Hence by lemma 5.10 (iii) H sn H F^ .

Hence H sn H T and so for each primo p there exists P an Integer n = n(p) such that

r T , H T p n H = 1 • l p n ] *

Since and T 6 ©l w obtain tp « g

r t , h r T , H T L p n 3 = 1 p n 3 = [ V nG 3 " 1 *

5 0 T p ‘ Cn (G) *

Now T is an - group and so has elements of only

ftnltely many distinct prime orders. Hence we can find an integer s such that

J « l I I k] 'i

% for all primes p occurring as orders of elements of T

Th e n T s £ g(G ) 3 and as in previous proofs H

We give a proof of the following result by Brewster [4], The proof is based on that for the derived series given by Lennox [17], and was communicated to us by Dr. Stewart Stonehewer, whom we thank for his permission to include it here.

Theorem (Brewster) Suppose that G subnormal subgroups H and K and

V r s 1 G = H X Yr

Then G = H K .

We shall use:

Lemma Suppose G = H K with H G and K ^ G. Then, given integers c, d there exists an integer e such that

Ve(G ) * Yc

Proof We use induction on m. When m = 1, the lemma follows from lemma 2.6 of the thesis. Hence suppose that m > 1. Now if H1 = HG, then H „m 1 and H1 = H ( p K ).

Hence by induction, there exists an integer e1 such that

Ye * yc Yd( H1 n *< ) .

But by the case m = 1, with H1 replacing H, we have

that there exists an integer e such that

Y.(Q) S Ve^H) Vd(K) .

T h e re fo re Ye^G ^ * VC( H ) vd( K ) *

Proof of theorem Suppose that H

induction on m.

• Ail f M H I C a s e _m = 1 Clearly G = H K Case m = 2 Let K <9n G. We use induction on n. If n = 1, then G = H K. Hence we may assume n > 1.

Let H1 = H G, K1 = K G, L = ^ n .

Let M = H p L < H . Then G = H and so

= H1 p H K1 = H ( H1 p K1 ) = H L. K Let M* = M . Since H centralizes L/^, H

normalizes M* and so M* 4 G.

Q Hence H^ = H centralizes L^^* and * is

abelian. Therefore H * is abelian. 1/H M*

By the lemma, there exists an integer c, such that

v (G) s H • K s H M* K . T C I

Hence G = H v (G) K ^ H M* K and G — H M* K .

Le t J = < M , K >#

Therefore G = H J (1)

Since M* ^ G, J = M* K sn G.

Therefore, by the lemma, for any positive Integer r,

there exists an Integer d such that

vd(G) * H Yr from (1) *

But by hypothesis G * H y^CG) K and 50 G = H vr(J)

Therefore, J = ( H p J ) K V r z 1 and

J * < M, K > t * J.

Hence J=.

At I .! .QlUitilUtaHIMK Now J s K( and K ^ K1 . T h e re fo re by induction on

j = ( H n J ) K .

Then from (1) G = H K as required.

Case m a 3

Let H = H o H 4 ••• «a H1 <1 G be m h n -i • the normal closure series of H in G. T h e n , by induction on m , G = H m _.) K *

Thus, by the lemma, given any integer r there exists

an integer s such that

Ys (G ) s Yr K -

Th e re fo re H. = H v (G ) K p H 1 fi H yr ( Hm_! > K P I s < H(vr(Hm.1)K 0 H1 )

S H Yp(Hm_1) ( K p H p

< H P H ! ) < H1*

Therefore H, = H ^(H ,) (K p H, ) v r (3)

But by (2) H1 = Hm_(1 (K P ) and

H p H m_2) • m -2 H _ H 2 k n m-2 ■ H (K p H. ) So H. H m S(K p

< 4 H, K p H since m

< H1*

Hone. H, - < H, K n H, , -A Induction on

m and (3) g‘ve

AAAI I I . B iUHife H 1 = H ( K p H 1 ) .

Therefore G = H^K = H(Kp as requi red Bibi ioqraphy

1. R . B ae r Nilpotent Groups and their generalizations. Trans. Amer. Math. Soc. 47, 393-434 (1940)

2 . R . B a e r Nilgruppen. Math.Z. 62 (1955) 402-437

3 . R . B a e r Lokal Noethersche Gruppen. Math.Z. 66 (1957), 341-363

4. D. Brewster A Criterion for the Permutability of Subnormal Subgroups. J. Algebra (To appear)

5. M. Drukker, The Subnormal Coalescence of some D.J.S. Robinson, classes of groups of finite rank. I.N. Stew art J. Austral. Math.Soc. 16, 324-327 (1973)

6. K.W. Gruenberg The Engel Elements of a Soluble Group. Illinois J. Math. 3, 151-168 (1959)

7 . K.W, G ruenberg The Upper Central Series in Soluble Groups. Illinois J. Math. 5, 436—466 (1961

8. P. H a ll On Non-Strictly Simple Groups. Proc. Cambridge Philos. Soc. 59, 531-553 (1963)

9. P. Hall, The Stability Group of a Series of B . H a rtle y Subgroups. Proc. London Math. Soc. Ill Ser. 16, 1-39 (1966)

10. B. Hartley, Subnormality, Ascendancy and the T.A, Peng Minimal Condition. To appear.

11. K.A. H irsch On Infinite Soluble Groups IV. J. London Math. Soc. 27, 81-85 (1952)

12. J.A. Hulse Joins of Ascendant Subgroups. Proc. London Math. Soc. (3) 25, 399—412 (1972)

13. K. Iwasawa Einlge Satze uber frele Gruppen. **Proc. Acad. Tokyo. 19 (1943) 272-274

14. I. Kaplansky Infinite Abelian Groups. Ann Arbor: U n lv . M ichigan P ress 1954 Uber den Normalisator von Subnormalen 15. O.H. Kegel und erreichbaren Untergruppen. Math. Ann. 103 , 248-258 (1966) 16. A. G. Kurosh The Theory of Groups, 2nd ed. ( 2 vols.) New York: Chelsea 1960

17. J.C. Lennox Ph.D. thesis Cambridge (1970)

18. A.I. M a l'c e v Homornorphisms of Finite Groups. Ivanov, gosudarst. ped. Inst, ucenye. Zapiski. *iz-mat. Nauki 18, 49-SO (1958)

19. H. Neumann Varieties of Groups. Berlin/Heidelberg/ New York: Springer (1967)

2 0 . T.A. Peng Subnormality in Soluble-by-Max Groups. T o appear.

2 1 . B.I. Plotkin Radical Groups. Mat. Sb. 37, 507-526 (1955) Amer. Math. Soc. Translations (2) 17, 9 -2 8 (1961)

22. D .J.S. Robinson Joins of Subnormal Subgroups. Illinois J. Math 9, 144-168 (1965)

23. D .J.S . Robinson On the Theory of Subnormal Subgroups. Math. Z. 89, 30-51 (1965)

24. D.J.S. Robinson Residual Properties of some classes of Infinite Soluble Groups. Proc. London M a th . Soc. (3 ) 17, 257-270 (1967)

2 5 . D.J.S. Robinson Finiteness Conditions and Generalized Soluble Groups, Part 1 . Berlin/ Heidelberg/ New York Springer 1972

26. D.J.S. Robinson Finiteness Conditions and Generalized Soluble Groups, Part 2. Berlin/ Heidelberg/ New York Springer 1972

27. J.ET. Roseblade On Certain Subnormal Coalition Classes. J. Algebra 1, 132-138 (1964)

28. J.E. Roseblade The Permutabillty of Orthogonal Subnormal subgroups. Math. Z. 90, 365-372 (1965)

29. J.E. Roseblade A note on subnormal coalition classes. Math. Z. 90, 373-375 (1965)

3 0 . J.E. Roseblade The derived series of the Join of subnorma subgroups. Math. Z. 117, 57—69 (1970)

31. J.E. Roseblade Subjunctive and Localty Coalescent Classes S.E. Stonehewer of groups. J. Algebra 8, 423-435 (1968) 32. S.E. Stonehewer The. Join of Finitely many subnormal subgroups. Bull. London Math. Soc. 2, 77-82 (1970)

33. S.E. Stonehewer Nilpotent Residuals of Subnormal Subgroups Math. Z . 139 , 45-54 (1974)

34. H. Wielandt Eine Verallgemeinerung der invariante Untergruppen. Math.Z. 45, 209-244 (1939)

35. H. Wielandt Vertauschbare nachinvariante Untergruppen. Abh. Math. Sem. Univ. Hamburg 21, 55-62 (1957)

36. H. W ielandt Kriterien für subnorrnalität in endlichen gruppen. Math.Z. 138, 199—203 (1974)

37. H. Zassenhaus The Theory of Groups. 2nd ed. New Y o r k : Chelsea 1958