Abelian Groups

Total Page:16

File Type:pdf, Size:1020Kb

Abelian Groups Abelian Groups A group is Abelian if xy = yx for all group elements x and y. The basis theorem An Abelian group is the direct product of cyclic p−groups. This direct product de- composition is unique, up to a reordering of the factors. n1 nk Proof: Let n = p1 · · · pk be the order of the Abelian group G, with pi's distinct primes. By Sylow's theorem it follows that G has exacly one Sylow p−subgroup for each of the k distinct primes pi: Consequently G is the direct product of its Sylow p−subgroups. [We call the Sylow p−subgroups the p − primary parts of G:] It remains to show that an Abelian p−group (corresponding to a p−primary part of G) is the direct product of cyclic groups. We prove this by induction on the power m of the order pm of the p−group. Assume that the result is true for m: Let P be an Abelian group of order pm+1 and Q a subgroup m of P of order p (such Q exists by Sylow's theorem). By induction Q =< a1 > × < a2 > × · · · × < ar > with r ki j < ai > j = p ; k1 ≥ k2 ≥ · · · ≥ kr; X ki = m: i=1 p p s1 s2 sr t1 t2 tr Let a 2 P − Q: Then a 2 Q and therefore a = a1 a2 · · · ar : Taking b = aa1 a2 · · · ar p d1 d2 dr for suitable ti, we obtain b 2 P − Q; and b = a1 a2 · · · ar ; where for each i either di = 0 or (di; p) = 1: [Take a deep breath and convince ourself that such b exists.] 1 p If all the di are 0, then b = 1 and, by a cardinality argument, P =< a1 > × < a2 > × · · · × < ar > × < b > : kj +1 If not, let j be the first index for which dj =6 0; hence j < b > j = p : We show that P =< a1 > × · · · × < aj−1 > × < b > × < aj+1 > × · · · × < ar > : To prove this it suffices to show that < b > \(< a1 > × · · · × < aj−1 > × < aj+1 > × · · · × < ar >) = 1; or that pkj b 2=< a1 > × · · · × < aj−1 > × < aj+1 > × · · · × < ar >; k since every nontrivial subgroup of < b > contains bp j : However, from the choice of b − k kj 1 p j dj p we see that b contains in its decomposition aj which is different from 1 because (dj; p) = 1: It follows that pkj b 2=< a1 > × · · · × < aj−1 > × < aj+1 > × · · · × < ar >; and this shows that P is the direct product of cyclic groups. To see that this direct product decomposition is unique, it suffices to show that it is unique for each of the p−primary parts. Indeed, if pm1 is the highest order of an element in P; then any direct product decomposition necessarily contains a cyclic group of order pm1 as a direct factor. The factor group of P to this cyclic subgroup is of lesser order than P; and the uniqueness of its factors follows by induction. This ends the proof. A consequence of the above result is that if (x1; : : : ; xs) are the generators of the cyclic direct factors of the Abelian group G, then any element x 2 G can be written uniquely j1 js as x = x1 · · · xs ; for positive integers ji: We say that (x1; : : : ; xs) is a basis for G: The orders of the basis elements xi are the invariants of G: 2 For an Abelian p−group P of order pm with invariants pm1 ≥ · · · ≥ pmk we call the vector (m1; : : : ; mk) of positive integers m1 ≥ · · · ≥ mk, which satisfy P mi = m, the type of P: The type of P is a partition of m: Examining the extremes, a group of type m is cyclic of order pm; while a group of type (1, 1, : : : , 1) is a direct product of m cyclic groups each of order p: We call the latter group elementary Abelian. Graphically represent the type of P by k rows of dots, the first of which contains m1 dots, the second m2 dots, and so on; we call this graph the Ferrer diagram of P: Flip the Ferrer diagram in its main diagonal. What results is another Ferrer diagram with si dots in row i: We call the vector (s1; s2; : : :) the signature of P: [For example, if the type is (4, 2, 1), then the signature is (3, 2, 1, 1).] It is occasionally helpful to see the type and signature as vectors of infinite lengths with all but the first finitely many entries being zero. In view of the Basis Theorem proved above, it is clear that there is a bijection between the nonisomorphic Abelian p-groups of order pm and the partitions of m. There are, therefore, as many Abelian p−groups of order pm as there are partitions of m: A determination in "closed form" of the number of such partitions was made by Hardy and Ramanujan by a process called the "circle method". On the other hand, recurrences for such partitions can easily be found. !!!Include Delsarte's result here 3 Composition series A subnormal series of a group G is a sequence of subgroups G = G0 ≥ G1 ≥ · · · ≥ Gn such that Gi+1 is normal in Gi; for 0 ≤ i < n: The factors of the series are the quotient groups Gi=Gi+1. By the length of a series we understand the number of strict inclusions that occur in the series (or, equivalently, the number of nonidentity factors). If each of the groups that occur in a subnormal series are normal in G we call the series normal: A one term refinement of a subnormal series G = G0 ≥ G1 ≥ · · · ≥ Gn is a subnormal series G = G0 ≥ G1 ≥ · · · ≥ Gi ≥ H ≥ Gi+1 ≥ · · · ≥ Gn or a subnormal series G = G0 ≥ G1 ≥ · · · ≥ Gn ≥ H; the subgroup H is the inserted term. A refinement of a subnormal series is a subnormal series obtained by succesively performing a finite number of one term refinements. Note that a refinement may contain more terms than the original series without having greater length. This happens if the groups that are inserted are repetitions of groups already in the series. A subnormal series G = G0 ≥ G1 ≥ · · · ≥ Gn = 1 is a composition series if each factor Gi=Gi+1 is a simple group. Two subnormal series are equivalent if there is a bijective correspondence between the nonidentity factors of the two series such that the corresponding factors are isomorphic groups. [In particular, equivalent series must necessarily have the same length.] Lemma (Zassenhaus) 4 If A1 ¢ A and B1 ¢ B are subgroups of a group G; then (a) A1(A \ B1) is normal in A1(A \ B) (b) B1(A1 \ B) is normal in B1(A \ B) (c) A1(A\B) ∼ B1(A\B) : A1(A\B1) = B1(A1\B) Proof: Observe that B1 ¢ B implies that A \ B1 = (A \ B) \ B1 is normal in A \ B: Similarly (A1 \ B) ¢ (A \ B): It follows that D = (A1 \ B)(A \ B1) is a normal subgroup of A \ B: Define f : A1(A \ B) ! (A \ B)=D as follows. For a 2 A1 and c 2 A \ B let f(ac) = cD: The function f is a well-defined surjective homomorphism. [Indeed, f((a1c1)(a2c2)) = f(a1a3c1c2) = c1c2D = (c1D)(c2D) = f(a1c1)f(a2c2); where ai 2 A1; ci 2 A \ B; and −1 c1a2c1 = a3 since A1 ¢ A:] The kernel of f is kerf = A1(A \ B1): This shows that A (A \ B ) is normal in A (A \ B) and, by the First Isomorphism Theorem, A1(A\B) ∼ 1 1 1 A1(A\B1) = A\B D : An entirely parallel argument yields B1(A\B) ∼ A\B : The isomorphism written in (c) B1(A1\B) = D now follows. This concludes the proof. And now, a fundamental Theorem of Schreier. Theorem (Schreier) Any two subnormal series of a group have subnormal refinements that are equivalent. Proof: Take two subnormal series G = G0 ≥ G1 ≥ · · · ≥ Gn and G = H0 ≥ H1 ≥ · · · ≥ Hm: Append each with 1, that is, define Gn+1 = Hm+1 = 1: Consider the groups 5 Gi = Gi+1(Gi \ H0) ≥ · · · ≥ Gi+1(Gi \ Hj) ≥ · · · ≥ Gi+1(Gi \ Hm+1) = Gi+1; for each 0 ≤ i ≤ n: The Zassenhaus Lemma applied to Gi+1 ¢ Gi and Hj+1 ¢ Hj shows that Gi+1(Gi \ Hj+1) is normal in Gi+1(Gi \ Hj), for each 0 ≤ j ≤ m: Inserting the above groups between Gi and Gi+1, and denoting Gi+1(Gi \ Hj) by Gij; yields a subnormal refinement of G = G0 ≥ G1 ≥ · · · ≥ Gn. Specifically, G = G00 ≥ · · · ≥ G0m ≥ G10 ≥ · · · ≥ G1m ≥ · · · ≥ Gn0 ≥ · · · ≥ Gnm; where Gi0 = Gi: A parallel argument yields a refinement of G = H0 ≥ H1 ≥ · · · ≥ Hm; specifically, G = H00 ≥ · · · ≥ Hn0 ≥ H01 ≥ · · · ≥ Hn1 ≥ · · · ≥ H0m ≥ · · · ≥ Hnm; where Hij = Hj+1(Gi \ Hj) and H0j = Hj: Both refinements have (n + 1)(m + 1) not necessarily distinct terms. For each (i; j); the Zassenhaus Lemma applied to Gi+1 ¢Gi and Hj+1 ¢Hj yields the isomorphism: Gij = Gi+1(Gi\Hj ) ∼= Hj+1(Gi\Hj ) = Hij : Gi;j+1 Gi+1(Gi\Hj+1) Hj+1(Gi+1\Hj ) Hi+1;j This provides the bijective correspondence on factors, proving the equivalence of the two subnormal series. Note: An analogous result can be obtained for normal series in a similar manner. Let us examine Schreier's Theorem in the case of composition series. Since the factors of a composition series are simple groups, it follows that any refinement of a composi- tion series is equivalent to that series. Schreier's Theorem, therefore, implies that two composition series are necessarily equivalent. This result is stated below.
Recommended publications
  • Prof. Dr. Eric Jespers Science Faculty Mathematics Department Bachelor Paper II
    Prof. Dr. Eric Jespers Science faculty Mathematics department Bachelor paper II 1 Voorwoord Dit is mijn tweede paper als eindproject van de bachelor in de wiskunde aan de Vrije Universiteit Brussel. In dit werk bestuderen wij eindige groepen G die minimaal niet nilpotent zijn in de volgende betekenis, elke echt deelgroep van G is nilpotent maar G zelf is dit niet. W. R. Scott bewees in [?] dat zulke groepen oplosbaar zijn en een product zijn van twee deelgroepen P en Q, waarbij P een cyclische Sylow p-deelgroep is en Q een normale Sylow q-deelgroep is; met p en q verschillende priemgetallen. Het hoofddoel van dit werk is om een volledig en gedetailleerd bewijs te geven. Als toepassing bestuderen wij eindige groepen die minimaal niet Abels zijn. Dit project is verwezenlijkt tijdens mijn Erasmusstudies aan de Universiteit van Granada en werd via teleclassing verdedigd aan de Universiteit van Murcia, waar mijn mijn pro- motor op sabbatical verbleef. Om lokale wiskundigen de kans te geven mijn verdediging bij te wonen is dit project in het Engles geschreven. Contents 1 Introduction This is my second paper to obtain the Bachelor of Mathematics at the University of Brussels. The subject are finite groups G that are minimal not nilpotent in the following meaning. Each proper subgroup of G is nilpotent but G itself is not. W.R. Scott proved in [?] that those groups are solvable and a product of two subgroups P and Q, with P a cyclic Sylow p-subgroup and G a normal Sylow q-subgroup, where p and q are distinct primes.
    [Show full text]
  • A Characterization of Mathieu Groups by Their Orders and Character Degree Graphs
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS { N. 38{2017 (671{678) 671 A CHARACTERIZATION OF MATHIEU GROUPS BY THEIR ORDERS AND CHARACTER DEGREE GRAPHS Shitian Liu∗ School of Mathematical Science Soochow University Suzhou, Jiangsu, 251125, P. R. China and School of Mathematics and Statics Sichuan University of Science and Engineering Zigong Sichuan, 643000, China [email protected] and [email protected] Xianhua Li School of Mathematical Science Soochow University Suzhou, Jiangsu, 251125, P. R. China Abstract. Let G be a finite group. The character degree graph Γ(G) of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides some character degree of G. Let Ln(q) be the projective special linear group of degree n over finite field of order q. Xu et al. proved that the Mathieu groups are characterized by the order and one irreducible character 2 degree. Recently Khosravi et al. have proven that the simple groups L2(p ), and L2(p) where p 2 f7; 8; 11; 13; 17; 19g are characterizable by the degree graphs and their orders. In this paper, we give a new characterization of Mathieu groups by using the character degree graphs and their orders. Keywords: Character degree graph, Mathieu group, simple group, character degree. 1. Introduction All groups in this note are finite. Let G be a finite group and let Irr(G) be the set of irreducible characters of G. Denote by cd(G) = fχ(1) : χ 2 Irr(G)g, the set of character degrees of G.
    [Show full text]
  • Covering Group Theory for Compact Groups 
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Pure and Applied Algebra 161 (2001) 255–267 www.elsevier.com/locate/jpaa Covering group theory for compact groups Valera Berestovskiia, Conrad Plautb;∗ aDepartment of Mathematics, Omsk State University, Pr. Mira 55A, Omsk 77, 644077, Russia bDepartment of Mathematics, University of Tennessee, Knoxville, TN 37919, USA Received 27 May 1999; received in revised form 27 March 2000 Communicated by A. Carboni Abstract We present a covering group theory (with a generalized notion of cover) for the category of compact connected topological groups. Every such group G has a universal covering epimorphism 2 K : G → G in this category. The abelian topological group 1 (G):=ker is a new invariant for compact connected groups distinct from the traditional fundamental group. The paper also describes a more general categorial framework for covering group theory, and includes some examples and open problems. c 2001 Elsevier Science B.V. All rights reserved. MSC: Primary: 22C05; 22B05; secondary: 22KXX 1. Introduction and main results In [1] we developed a covering group theory and generalized notion of fundamental group that discards such traditional notions as local arcwise connectivity and local simple connectivity. The theory applies to a large category of “coverable” topological groups that includes, for example, all metrizable, connected, locally connected groups and even some totally disconnected groups. However, for locally compact groups, being coverable is equivalent to being arcwise connected [2]. Therefore, many connected compact groups (e.g. solenoids or the character group of ZN ) are not coverable.
    [Show full text]
  • The Theory of Finite Groups: an Introduction (Universitext)
    Universitext Editorial Board (North America): S. Axler F.W. Gehring K.A. Ribet Springer New York Berlin Heidelberg Hong Kong London Milan Paris Tokyo This page intentionally left blank Hans Kurzweil Bernd Stellmacher The Theory of Finite Groups An Introduction Hans Kurzweil Bernd Stellmacher Institute of Mathematics Mathematiches Seminar Kiel University of Erlangen-Nuremburg Christian-Albrechts-Universität 1 Bismarckstrasse 1 /2 Ludewig-Meyn Strasse 4 Erlangen 91054 Kiel D-24098 Germany Germany [email protected] [email protected] Editorial Board (North America): S. Axler F.W. Gehring Mathematics Department Mathematics Department San Francisco State University East Hall San Francisco, CA 94132 University of Michigan USA Ann Arbor, MI 48109-1109 [email protected] USA [email protected] K.A. Ribet Mathematics Department University of California, Berkeley Berkeley, CA 94720-3840 USA [email protected] Mathematics Subject Classification (2000): 20-01, 20DXX Library of Congress Cataloging-in-Publication Data Kurzweil, Hans, 1942– The theory of finite groups: an introduction / Hans Kurzweil, Bernd Stellmacher. p. cm. — (Universitext) Includes bibliographical references and index. ISBN 0-387-40510-0 (alk. paper) 1. Finite groups. I. Stellmacher, B. (Bernd) II. Title. QA177.K87 2004 512´.2—dc21 2003054313 ISBN 0-387-40510-0 Printed on acid-free paper. © 2004 Springer-Verlag New York, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis.
    [Show full text]
  • Group Theory
    Group Theory Hartmut Laue Mathematisches Seminar der Universit¨at Kiel 2013 Preface These lecture notes present the contents of my course on Group Theory within the masters programme in Mathematics at the University of Kiel. The aim is to introduce into concepts and techniques of modern group theory which are the prerequisites for tackling current research problems. In an area which has been studied with extreme intensity for many decades, the decision of what to include or not under the time limits of a summer semester was certainly not trivial, and apart from the aspect of importance also that of personal taste had to play a role. Experts will soon discover that among the results proved in this course there are certain theorems which frequently are viewed as too difficult to reach, like Tate’s (4.10) or Roquette’s (5.13). The proofs given here need only a few lines thanks to an approach which seems to have been underestimated although certain rudiments of it have made it into newer textbooks. Instead of making heavy use of cohomological or topological considerations or character theory, we introduce a completely elementary but rather general concept of normalized group action (1.5.4) which serves as a base for not only the above-mentioned highlights but also for other important theorems (3.6, 3.9 (Gasch¨utz), 3.13 (Schur-Zassenhaus)) and for the transfer. Thus we hope to escape the cartesian reservation towards authors in general1, although other parts of the theory clearly follow well-known patterns when a major modification would not result in a gain of clarity or applicability.
    [Show full text]
  • Hall Subgroups in Finite Simple Groups
    Introduction Hall subgroups in finite simple groups HALL SUBGROUPS IN FINITE SIMPLE GROUPS Evgeny P. Vdovin1 1Sobolev Institute of Mathematics SB RAS Groups St Andrews 2009 Introduction Hall subgroups in finite simple groups The term “group” always means a finite group. By π we always denote a set of primes, π0 is its complement in the set of all primes. A rational integer n is called a π-number, if all its prime divisors are in π, by π(n) we denote all prime divisors of a rational integer n. For a group G we set π(G) to be equal to π(jGj) and G is a π-group if jGj is a π-number. A subgroup H of G is called a π-Hall subgroup if π(H) ⊆ π and π(jG : Hj) ⊆ π0. A set of all π-Hall subgroups of G we denote by Hallπ(G) (note that this set may be empty). According to P. Hall we say that G satisfies Eπ (or briefly G 2 Eπ), if G possesses a π-Hall subgroup. If G 2 Eπ and every two π-Hall subgroups are conjugate, then we say that G satisfies Cπ (G 2 Cπ). If G 2 Cπ and each π-subgroup of G is included in a π-Hall subgroup of G, then we say that G satisfies Dπ (G 2 Dπ). The number of classes of conjugate π-Hall subgroups of G we denote by kπ(G). Introduction Hall subgroups in finite simple groups The term “group” always means a finite group.
    [Show full text]
  • Solvable Groups Whose Character Degree Graphs Generalize Squares
    J. Group Theory 23 (2020), 217–234 DOI 10.1515/jgth-2019-0027 © de Gruyter 2020 Solvable groups whose character degree graphs generalize squares Mark L. Lewis and Qingyun Meng Communicated by Robert M. Guralnick Abstract. Let G be a solvable group, and let .G/ be the character degree graph of G. In this paper, we generalize the definition of a square graph to graphs that are block squares. We show that if G is a solvable group so that .G/ is a block square, then G has at most two normal nonabelian Sylow subgroups. Furthermore, we show that when G is a solvable group that has two normal nonabelian Sylow subgroups and .G/ is block square, then G is a direct product of subgroups having disconnected character degree graphs. 1 Introduction Throughout this paper, G will be a finite group, and cd.G/ .1/ Irr.G/ D ¹ j 2 º will be the set of irreducible character degrees of G. The idea of studying the in- fluence of cd.G/ on the structure of G via graphs related to cd.G/ was introduced in [9]. The prime divisor character degree graph which is denoted by .G/ for G. We will often shorten the name of this graph to the character degree graph. The vertex set for .G/ is .G/, the set of all the prime divisors of cd.G/, and there is an edge between two vertices p and q if pq divides some degree a cd.G/. 2 The character degree graph has proven to be a useful tool to study the normal structure of finite solvable groups when given information about cd.G/.
    [Show full text]
  • Finite Groups with Unbalancing 2-Components of {L(4), He]-Type
    JOKRXAL OF ALGEBRA 60, 96-125 (1979) Finite Groups with Unbalancing 2-Components of {L(4), He]-Type ROBERT L. GKIE~S, JR.* AND RONALI) SOLOMON” Department of Mathematics, linivusity of BZichigan, Ann Arbor, Mizhigan 48109 rind Department of Mathematics, Ohio State IJniver.&y, Columbw, Ohio 43210 Communicated by Walter Feit Received September 18, 1977 1. INTR~DUCTJ~~ Considerable progress has been made in recent years towards the classification of finite simple grnups of odd Chevallcy type These groups may be defined as simple groups G containing an involution t such that C,(t)jO(C,(t)) has a subnormal quasi-simple subgroup. This property is possessed by most Chevalley groups over fields of odd order but by no simple Chevalley groups over fields of characteristic 2, hence the name. It is also a property of alternating groups of degree at least 9 and eighteen of the known sporadic simple groups. Particular attention in this area has focussed on the so-called B-Conjecture. R-Conjecture: Let G be a finite group with O(G) = (1 j. Let t be an involu- tion of G andL a pcrfcct subnormal subgroup of CJt) withL/O(fJ) quasi-simple, then L is quasi-simple. The R-Conjecture would follow as an easy corollary of the Unbalanced Group Conjecture (.5’-Conjecture). U-Chjecture: Let G be a finite group withF*(G) quasi-simple. Suppose there is an involution t of G with O(C,(t)) e O(G). Then F*(G)/F(G) is isomorphic to one of the following: (I) A Chevalley group of odd characteristic.
    [Show full text]
  • Pronormality of Hall Subgroups in Finite Simple Groups E
    Siberian Mathematical Journal, Vol. 53, No. 3, pp. , 2012 Original Russian Text Copyright c 2012 Vdovin E. P. and Revin D. O. PRONORMALITY OF HALL SUBGROUPS IN FINITE SIMPLE GROUPS E. P. Vdovin and D. O. Revin UDC 512.542 Abstract: We prove that the Hall subgroups of finite simple groups are pronormal. Thus we obtain an affirmative answer to Problem 17.45(a) of the Kourovka Notebook. Keywords: Hall subgroup, pronormal subgroup, simple group Introduction According to the definition by P. Hall, a subgroup H of a group G is called pronormal,ifforevery g ∈ G the subgroups H and Hg are conjugate in H, Hg. The classical examples of pronormal subgroups are • normal subgroups; • maximal subgroups; • Sylow subgroups of finite groups; • Carter subgroups (i.e., nilpotent selfnormalizing subgroups) of finite solvable groups; • Hall subgroups (i.e. subgroups whose order and index are coprime) of finite solvable groups. The pronormality of subgroups in the last three cases follows from the conjugacy of Sylow, Carter, and Hall subgroups in finite groups in corresponding classes. In [1, Theorem 9.2] the first author proved that Carter subgroups in finite groups are conjugate. As a corollary it follows that Carter subgroups of finite groups are pronormal. In contrast with Carter subgroups, Hall subgroups in finite groups can be nonconjugate. The goal of the authors is to find the classes of finite groups with pronormal Hall subgroups. In the present paper the following result is obtained. Theorem 1. The Hall subgroups of finite simple groups are pronormal. The theorem gives an affirmative answer to Problem 17.45(a) from the Kourovka Notebook [2], and it was announced by the authors in [3, Theorem 7.9].
    [Show full text]
  • Group Theory
    Algebra Math Notes • Study Guide Group Theory Table of Contents Groups..................................................................................................................................................................... 3 Binary Operations ............................................................................................................................................................. 3 Groups .............................................................................................................................................................................. 3 Examples of Groups ......................................................................................................................................................... 4 Cyclic Groups ................................................................................................................................................................... 5 Homomorphisms and Normal Subgroups ......................................................................................................................... 5 Cosets and Quotient Groups ............................................................................................................................................ 6 Isomorphism Theorems .................................................................................................................................................... 7 Product Groups ...............................................................................................................................................................
    [Show full text]
  • A Theorem on Special Linear Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBR4 16, 509-518 (1970) A Theorem on Special Linear Groups KOK-WEE PHAN Department of Mathematics, University of Notre Dame, Notre Dame, Iizdiana Communicated by W. Feit Received October 1, 1969 Let Xi be the set of all (TZ + 1) x (n + 1) matrices of determinant 1 over the finite field F, of q elements such that the diagonal entries (1, l),..., (i - 1, i - l), (i + 2, i + 2) ,..., (12 + 1, TZ + 1) are 1 and the non-diagonal (j, k) entry is 0 whenever (j, k) is not (i, i + 1) or (; + 1, i). Clearly Xi is a subgroup of SL(n + 1, q) isomorphic to SL(2, q) and it is well known that these Xi’s generate SL(n + 1,q). It is of interest to investigate what properties are possessed by this set of subgroups which would characterize SL(IZ + 1,q). This paper is a study in this direction. More precisely we shall prove the following result: THEOREM 1. Let G be a group generated by its subgroup Li , i = l,..., E each isomorphic to SL(2, q) zuh ere q > 4. Suppose that the Li’s satisfy the folloming conditions: (a) (Li , L,+& is isomorphic to SL(3, q); (b) there is an element ai of order q - 1 such that (ai , ai+l> is abelian of order (q - 1)2; (c) [L,,L,] = 1 wlzere 1 <i+l <j<n (d) (Li , ai+J z (L, , aj+> E GL(2, q) where 1 < i < n - 1 and 2 < j < Il.
    [Show full text]
  • Groups in Which Every Non-Nilpotent Subgroup Is Self-Normalizing
    ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 15 (2018) 39–51 https://doi.org/10.26493/1855-3974.1439.fdf (Also available at http://amc-journal.eu) Groups in which every non-nilpotent subgroup is self-normalizing Costantino Delizia University of Salerno, Italy Urban Jezernik , Primozˇ Moravec University of Ljubljana, Slovenia Chiara Nicotera University of Salerno, Italy Received 12 July 2017, accepted 29 August 2017, published online 2 November 2017 Abstract We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We describe solu- ble groups and finite perfect groups with the above property. Furthermore, we give some structural information in the infinite perfect case. Keywords: Normalizer, non-nilpotent subgroup, self-normalizing subgroup. Math. Subj. Class.: 20E34, 20D15, 20E32 1 Introduction A long standing problem posed by Y. Berkovich [3, Problem 9] is to study the finite p- groups in which every non-abelian subgroup contains its centralizer. In [6], the finite p-groups which have maximal class or exponent p and satisfy Berko- vich’s condition are characterized. Furthermore, the infinite supersoluble groups with the same condition are completely classified. Although it seems unlikely to be able to get a full classification of finite p-groups in which every non-abelian subgroup contains its cen- tralizer, Berkovich’s problem has been the starting point for a series of papers investigating finite and infinite groups in which every subgroup belongs to a certain family or it contains E-mail addresses: [email protected] (Costantino Delizia), [email protected] (Urban Jezernik), [email protected] (Primozˇ Moravec), [email protected] (Chiara Nicotera) cb This work is licensed under http://creativecommons.org/licenses/by/3.0/ 40 Ars Math.
    [Show full text]