DOCSLIB.ORG

On the Subgroup Structure of Exceptional Groups of Lie Type

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On the Subgroup Structure of Exceptional Groups of Lie Type TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 350, Number 9, September 1998, Pages 3409{3482 S 0002-9947(98)02121-7 ON THE SUBGROUP STRUCTURE OF EXCEPTIONAL GROUPS OF LIE TYPE MARTIN W. LIEBECK AND GARY M. SEITZ Abstract. We study finite subgroups of exceptional groups of Lie type, in particular maximal subgroups. Reduction theorems allow us to concentrate on almost simple subgroups, the main case being those with socle X(q)ofLie type in the natural characteristic. Our approach is to show that for sufficiently large q (usually q>9 suffices), X(q) is contained in a subgroup of positive dimension in the corresponding exceptional algebraic group, stabilizing the same subspaces of the Lie algebra. Applications are given to the study of maximal subgroups of finite exceptional groups. For example, we show that all maximal subgroups of sufficiently large order arise as fixed point groups of maximal closed subgroups of positive dimension. Introduction In this paper we establish results aimed at the study of the subgroup structure of the finite exceptional groups of Lie type, in particular of their maximal subgroups. Let G(r) be an exceptional group of Lie type over a finite field Fr of order r,where p0 ris a power of the prime p.WriteG(r)=O (Gσ), where G is a simple algebraic ¯ group over Fr and σ is a Frobenius morphism of G. The reduction theorem [LS1, Theorem 2] determines all maximal subgroups of G(r) which are not almost simple. Thus we concentrate on almost simple maximal subgroups of G(r); let M be such a subgroup. Of particular interest is the so-called “generic case”, in which F ∗(M)=X(q), a group of Lie type over a field Fq, also of characteristic p. Our approach to the generic case is to attempt to show that the embedding X(q) <G(r) lifts to an embedding X¯ G,whereX¯is a simple closed connected subgroup of G of the same type as X(q).≤ Once this is achieved, we are in a position to apply results from [Se2, LS1] on the subgroup structure of algebraic groups. The first lifting result for exceptional groups appeared in [ST1], and showed that the finite embedding can be lifted under certain hypotheses, one of the hypotheses being that the characteristic p be suitably large. In this paper we establish lifting results in which there are hypotheses on the size of the ground field Fq, but no assumptions on the characteristic. Consequently, the results hold for all but finitely many possibilities for the group X(q). For example, Theorem 6 below shows that for q sufficiently large, either X(q) is the group of fixed points of an automorphism of Received by the editors October 11, 1996. 1991 Mathematics Subject Classification. Primary 20G40, 20E28. The authors acknowledge the support of NATO Collaborative Research Grant CRG 931394. The second author also acknowledges the support of an NSF Grant. c 1998 American Mathematical Society 3409 License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 3410 MARTIN W. LIEBECK AND GARY M. SEITZ p0 ¯ ¯ G(r), or X(q)=O (Xσ) with X maximal among closed connected M σ -invariant subgroups of G. (In most cases, “sufficiently large” means that q>9.)h i Once the lifting has been achieved we can apply the results of [Se2, LS1], which determine those subgroups X¯ of G as in the last sentence of the previous paragraph, under some mild characteristic restrictions. These restrictions are much weaker than those required for the result in [ST1]; in particular, p =0orp>7covers all the restrictions. However, in view of the results obtained in this paper, it becomes a high priority issue to extend the analysis in [Se2, LS1] so as to remove the characteristic restrictions. Such an analysis is under way. The preceding discussion has been couched in terms of maximal subgroups, but our results apply much more generally. We establish lifting results for all subgroups X(q)ofG(r), with q sufficiently large. Namely, in Theorem 1 we show that any such subgroup is contained in a closed connected subgroup X¯ of G stabilizing precisely the same subspaces of the Lie algebra L(G)asX(q). We also show (Theorem 4 and Corollary 5) that this connected group X¯ is almost always proper p0 ¯ in G, and that, given mild characteristic restrictions, X(q)=O (Xδ)forsome Frobenius morphism δ (Theorem 10). At this point the results of [LS2] determine the conjugacy class of X(q)inG(r). Finally, we use our lifting results to clear up a nagging problem on classical groups. In Theorem 11, we show that an embedding X<Y <Cof finite groups of Lie type in the same characteristic, with C classical and X absolutely irreducible on the usual module for C, can usually be lifted to a corresponding embedding of simple algebraic groups; such embeddings of algebraic groups are known [Se1]. See [Se3] for further discussion of this problem. We now state our results in detail, beginning with our main lifting results. As indicated above, these require no assumption on the characteristic p, but do need an assumption on q,whereX=X(q) is as above. In order to specify this assumption we need the following definition. Definition. Let G be a simple adjoint algebraic group, and let Σ = Σ(G)bethe root system of G. For a subgroup L of the lattice ZΣ, let t(L) be the exponent of the torsion subgroup of ZΣ/L.Forα, β Σ, call the element α β of ZΣaroot difference. Define ∈ − t(Σ(G)) = max t(L):La subgroup of ZΣ generated by root differences . { } Theorem 1. Let X = X (q) be a quasisimple group of Lie type in characteristic p, and suppose that X<G,whereGis a simple adjoint algebraic group of exceptional type, also in characteristic p. Assume that 2 2 q>t(Σ(G)).(2,p 1) if X = A1(q), B2(q) or G2(q), q>9and X = A−(16) otherwise. 6 2 Then the following hold: (i) there is a closed connected subgroup X¯ of G containing X, such that every X-invariant subspace of the Lie algebra L(G) is also X¯ -invariant; (ii) if also X Gσ where σ is a Frobenius morphism, then there is a σ-stable ≤ ¯ and NG(X)-stable subgroup X containing X such that each X-invariant subspace of each G-composition factor of L(G) is also X¯ -invariant. Theorem 4 below will show that the subgroup X¯ in the conclusion is proper in G, unless X has the same type as G. License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use THE SUBGROUP STRUCTURE OF EXCEPTIONAL GROUPS OF LIE TYPE 3411 Remark. If p is a good prime for G,thenL(G) is irreducible as a G-module, so the subspace invariance conditions in conclusions (i) and (ii) are equivalent; however, for bad primes L(G) can be reducible (see Proposition 1.10 below), in which case (i) is stronger than (ii). In view of Theorem 1, it is of interest to know the values of t(Σ(G)), particularly for groups G of exceptional type. Dr Ross Lawther has informed us that he has verified (using a computer) that t(G2) = 12, t(F4) = 68, t(E6) = 124 and t(E7)= 388, while t(E8) is unknown at present. 2 2 The bounds in Theorem 1 for groups of type A1, B2, G2 are relatively large, and follow from Corollary 3 below, which we shall deduce from the following general proposition. It should be possible to improve these bounds with additional work. Proposition 2. Let G be a simple adjoint algebraic group, and let x be a semisim- ple element of G of finite order greater than mt(Σ(G)), for some positive integer m. Then there is an infinite closed subgroup S of G such that the following both hold: (i) x S, and some nontrivial power of x, of order greater than m,liesinS0; (ii) every∈ x-invariant subspace of L(G) is also S-invariant. Corollary 3. Let X = X (q) be a quasisimple group of Lie type in characteristic p, and suppose that X<G,whereGis a simple adjoint algebraic group, also in characteristic p. Assume that q>t(Σ(G))m(X),wherem(X)is the order of the Schur multiplier of X/Z(X). Then conclusions (i) and (ii) of Theorem 1 hold. Note that Proposition 2 and Corollary 3 apply to all types of simple algebraic group, not just exceptional types. The proofs of Proposition 2 and Corollary 3 are rather short, and are given in 2. Reducing the bounds on q to those in Theorem 1 requires a great deal more effort.§ After some preliminary results in 3, this is carried out for p =2in 4,5 and in 6forp= 2. With some further effort,§ our proof could no doubt6 be extended§§ to improve§ the q>9 bound for subgroups X of rank larger than 2; indeed, when X has rank greater than half the rank of G, [LST, Theorem 2] gives a stronger conclusion assuming only that q>2. In order to make use of Theorem 1 (or Corollary 3), we need to know that the subgroup X¯ is proper in G. For this it suffices to show that X¯ acts reducibly on some G-composition factor of L(G). This information is provided by the next result. ( ) Definition. We define X and G to be of the same type if X ∼= Gσ∞ for some Frobenius morphism σ;wealsosaythatXis a group of type G.
Load more

Recommended publications
  • ON the SHELLABILITY of the ORDER COMPLEX of the SUBGROUP LATTICE of a FINITE GROUP 1. Introduction We Will Show That the Order C
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 353, Number 7, Pages 2689{2703 S 0002-9947(01)02730-1 Article electronically published on March 12, 2001 ON THE SHELLABILITY OF THE ORDER COMPLEX OF THE SUBGROUP LATTICE OF A FINITE GROUP JOHN SHARESHIAN Abstract. We show that the order complex of the subgroup lattice of a finite group G is nonpure shellable if and only if G is solvable. A by-product of the proof that nonsolvable groups do not have shellable subgroup lattices is the determination of the homotopy types of the order complexes of the subgroup lattices of many minimal simple groups. 1. Introduction We will show that the order complex of the subgroup lattice of a finite group G is (nonpure) shellable if and only if G is solvable. The proof of nonshellability in the nonsolvable case involves the determination of the homotopy type of the order complexes of the subgroup lattices of many minimal simple groups. We begin with some history and basic definitions. It is assumed that the reader is familiar with some of the rudiments of algebraic topology and finite group theory. No distinction will be made between an abstract simplicial complex ∆ and an arbitrary geometric realization of ∆. Maximal faces of a simplicial complex ∆ will be called facets of ∆. Definition 1.1. A simplicial complex ∆ is shellable if the facets of ∆ can be ordered σ1;::: ,σn so that for all 1 ≤ i<k≤ n thereexistssome1≤ j<kand x 2 σk such that σi \ σk ⊆ σj \ σk = σk nfxg. The list σ1;::: ,σn is called a shelling of ∆.
    [Show full text]
  • ON the INTERSECTION NUMBER of FINITE GROUPS Humberto Bautista Serrano University of Texas at Tyler
    University of Texas at Tyler Scholar Works at UT Tyler Math Theses Math Spring 5-14-2019 ON THE INTERSECTION NUMBER OF FINITE GROUPS Humberto Bautista Serrano University of Texas at Tyler Follow this and additional works at: https://scholarworks.uttyler.edu/math_grad Part of the Algebra Commons, and the Discrete Mathematics and Combinatorics Commons Recommended Citation Bautista Serrano, Humberto, "ON THE INTERSECTION NUMBER OF FINITE GROUPS" (2019). Math Theses. Paper 9. http://hdl.handle.net/10950/1332 This Thesis is brought to you for free and open access by the Math at Scholar Works at UT Tyler. It has been accepted for inclusion in Math Theses by an authorized administrator of Scholar Works at UT Tyler. For more information, please contact [email protected]. ON THE INTERSECTION NUMBER OF FINITE GROUPS by HUMBERTO BAUTISTA SERRANO A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science Department of Mathematics Kassie Archer, Ph.D., Committee Chair College of Arts and Sciences The University of Texas at Tyler April 2019 c Copyright by Humberto Bautista Serrano 2019 All rights reserved Acknowledgments Foremost I would like to express my gratitude to my two excellent advisors, Dr. Kassie Archer at UT Tyler and Dr. Lindsey-Kay Lauderdale at Towson University. This thesis would never have been possible without their support, encouragement, and patience. I will always be thankful to them for introducing me to research in mathematics. I would also like to thank the reviewers, Dr. Scott LaLonde and Dr. David Milan for pointing to several mistakes and omissions and enormously improving the final version of this thesis.
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • (Hereditarily) Just Infinite Property in Profinite Groups
    Inverse system characterizations of the (hereditarily) just infinite property in profinite groups Colin D. Reid October 6, 2018 Abstract We give criteria on an inverse system of finite groups that ensure the limit is just infinite or hereditarily just infinite. More significantly, these criteria are ‘universal’ in that all (hereditarily) just infinite profinite groups arise as limits of the specified form. This is a corrected and revised version of [8]. 1 Introduction Notation. In this paper, all groups will be profinite groups, all homomorphisms are required to be continuous, and all subgroups are required to be closed; in particular, all references to commutator subgroups are understood to mean the closures of the corresponding abstractly defined subgroups. For an inverse system Λ= {(Gn)n>0, ρn : Gn+1 ։ Gn} of finite groups, we require all the homomorphisms ρn to be surjective. A subscript o will be used to indicate open inclusion, for instance A ≤o B means that A is an open subgroup of B. We use ‘pronilpotent’ and ‘prosoluble’ to mean a group that is the inverse limit of finite nilpotent groups or finite soluble groups respectively, and ‘G-invariant subgroup of H’ to mean a subgroup of H normalized by G. A profinite group G is just infinite if it is infinite, and every nontrivial normal subgroup of G is of finite index; it is hereditarily just infinite if in addition every arXiv:1708.08301v1 [math.GR] 28 Aug 2017 open subgroup of G is just infinite. At first sight the just infinite property is a qualitative one, like that of simplicity: either a group has nontrivial normal subgroups of infinite index, or it does not.
    [Show full text]
  • Orders on Computable Torsion-Free Abelian Groups
    Orders on Computable Torsion-Free Abelian Groups Asher M. Kach (Joint Work with Karen Lange and Reed Solomon) University of Chicago 12th Asian Logic Conference Victoria University of Wellington December 2011 Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 1 / 24 Outline 1 Classical Algebra Background 2 Computing a Basis 3 Computing an Order With A Basis Without A Basis 4 Open Questions Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 2 / 24 Torsion-Free Abelian Groups Remark Disclaimer: Hereout, the word group will always refer to a countable torsion-free abelian group. The words computable group will always refer to a (fixed) computable presentation. Definition A group G = (G : +; 0) is torsion-free if non-zero multiples of non-zero elements are non-zero, i.e., if (8x 2 G)(8n 2 !)[x 6= 0 ^ n 6= 0 =) nx 6= 0] : Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 3 / 24 Rank Theorem A countable abelian group is torsion-free if and only if it is a subgroup ! of Q . Definition The rank of a countable torsion-free abelian group G is the least κ cardinal κ such that G is a subgroup of Q . Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 4 / 24 Example The subgroup H of Q ⊕ Q (viewed as having generators b1 and b2) b1+b2 generated by b1, b2, and 2 b1+b2 So elements of H look like β1b1 + β2b2 + α 2 for β1; β2; α 2 Z.
    [Show full text]
  • Arxiv:1509.08090V1 [Math.GR]
    THE CLASS MN OF GROUPS IN WHICH ALL MAXIMAL SUBGROUPS ARE NORMAL AGLAIA MYROPOLSKA Abstract. We investigate the class MN of groups with the property that all maximal subgroups are normal. The class MN appeared in the framework of the study of potential counter-examples to the Andrews-Curtis conjecture. In this note we give various structural properties of groups in MN and present examples of groups in MN and not in MN . 1. Introduction The class MN was introduced in [Myr13] as the class of groups with the property that all maximal subgroups are normal. The study of MN was motivated by the analysis of potential counter-examples to the Andrews-Curtis conjecture [AC65]. It was shown in [Myr13] that a finitely generated group G in the class MN satisfies the so-called “generalised Andrews- Curtis conjecture” (see [BLM05] for the precise definition) and thus cannot confirm potential counter-examples to the original conjecture. Apart from its relation to the Andrews-Curtis conjecutre, the study of the class MN can be interesting on its own. Observe that if a group G belongs to MN then all maximal subgroups of G are of finite index. The latter group property has been considered in the literature for different classes of groups. For instance in the linear setting, Margulis and Soifer [MS81] showed that all maximal subgroups of a finitely generated linear group G are of finite index if and only if G is virtually solvable. The above property also was considered for branch groups, however the results in this direction are partial and far from being as general as for linear groups.
    [Show full text]
  • Expansion in Finite Simple Groups of Lie Type
    Expansion in finite simple groups of Lie type Terence Tao Department of Mathematics, UCLA, Los Angeles, CA 90095 E-mail address: [email protected] In memory of Garth Gaudry, who set me on the road Contents Preface ix Notation x Acknowledgments xi Chapter 1. Expansion in Cayley graphs 1 x1.1. Expander graphs: basic theory 2 x1.2. Expansion in Cayley graphs, and Kazhdan's property (T) 20 x1.3. Quasirandom groups 54 x1.4. The Balog-Szemer´edi-Gowers lemma, and the Bourgain- Gamburd expansion machine 81 x1.5. Product theorems, pivot arguments, and the Larsen-Pink non-concentration inequality 94 x1.6. Non-concentration in subgroups 127 x1.7. Sieving and expanders 135 Chapter 2. Related articles 157 x2.1. Cayley graphs and the algebra of groups 158 x2.2. The Lang-Weil bound 177 x2.3. The spectral theorem and its converses for unbounded self-adjoint operators 191 x2.4. Notes on Lie algebras 214 x2.5. Notes on groups of Lie type 252 Bibliography 277 Index 285 vii Preface Expander graphs are a remarkable type of graph (or more precisely, a family of graphs) on finite sets of vertices that manage to simultaneously be both sparse (low-degree) and \highly connected" at the same time. They enjoy very strong mixing properties: if one starts at a fixed vertex of an (two-sided) expander graph and randomly traverses its edges, then the distribution of one's location will converge exponentially fast to the uniform distribution. For this and many other reasons, expander graphs are useful in a wide variety of areas of both pure and applied mathematics.
    [Show full text]
  • The Classical Groups and Domains 1. the Disk, Upper Half-Plane, SL 2(R
    (June 8, 2018) The Classical Groups and Domains Paul Garrett [email protected] http:=/www.math.umn.edu/egarrett/ The complex unit disk D = fz 2 C : jzj < 1g has four families of generalizations to bounded open subsets in Cn with groups acting transitively upon them. Such domains, defined more precisely below, are bounded symmetric domains. First, we recall some standard facts about the unit disk, the upper half-plane, the ambient complex projective line, and corresponding groups acting by linear fractional (M¨obius)transformations. Happily, many of the higher- dimensional bounded symmetric domains behave in a manner that is a simple extension of this simplest case. 1. The disk, upper half-plane, SL2(R), and U(1; 1) 2. Classical groups over C and over R 3. The four families of self-adjoint cones 4. The four families of classical domains 5. Harish-Chandra's and Borel's realization of domains 1. The disk, upper half-plane, SL2(R), and U(1; 1) The group a b GL ( ) = f : a; b; c; d 2 ; ad − bc 6= 0g 2 C c d C acts on the extended complex plane C [ 1 by linear fractional transformations a b az + b (z) = c d cz + d with the traditional natural convention about arithmetic with 1. But we can be more precise, in a form helpful for higher-dimensional cases: introduce homogeneous coordinates for the complex projective line P1, by defining P1 to be a set of cosets u 1 = f : not both u; v are 0g= × = 2 − f0g = × P v C C C where C× acts by scalar multiplication.
    [Show full text]
  • CHAPTER 4 Representations of Finite Groups of Lie Type Let Fq Be a Finite
    CHAPTER 4 Representations of finite groups of Lie type Let Fq be a finite field of order q and characteristic p. Let G be a finite group of Lie type, that is, G is the Fq-rational points of a connected reductive group G defined over Fq. For example, if n is a positive integer GLn(Fq) and SLn(Fq) are finite groups of Lie type. 0 In Let J = , where In is the n × n identity matrix. Let −In 0 t Sp2n(Fq) = { g ∈ GL2n(Fq) | gJg = J }. Then Sp2n(Fq) is a symplectic group of rank n and is a finite group of Lie type. For G = GLn(Fq) or SLn(Fq) (and some other examples), the standard Borel subgroup B of G is the subgroup of G consisting of the upper triangular elements in G.A standard parabolic subgroup of G is a subgroup of G which contains the standard Borel subgroup B. If P is a standard parabolic subgroup of GLn(Fq), then there exists a partition (n1, . , nr) of n (a set of positive integers nj such that n1 + ··· + nr = n) such that P = P(n1,...,nr ) = M n N, where M ' GLn1 (Fq) × · · · × GLnr (Fq) has the form A 0 ··· 0 1 0 A2 ··· 0 M = | A ∈ GL ( ), 1 ≤ j ≤ r . . .. .. j nj Fq . 0 ··· 0 Ar and In1 ∗ · · · ∗ 0 In2 · · · ∗ N = , . .. .. . 0 ··· 0 Inr where ∗ denotes arbitary entries in Fq. The subgroup M is called a (standard) Levi sub- group of P , and N is called the unipotent radical of P . Note that the partition (1, 1,..., 1) corresponds to B and (n) corresponds to G.
    [Show full text]
  • Math 602 Assignment 1, Fall 2020 Part A
    Math 602 Assignment 1, Fall 2020 Part A. From Gallier{Shatz: Problems 1, 2, 6, 9. Part B. Definition Suppose a group G operates transitively on the left of a set X. (i) We say that the action (G; X) is imprimitive if there exists a non-trivial partition Q of X which is stable under G. Here \non-trivial" means that Q 6= fXg and Q 6= ffxg : x 2 Xg : Such a partition Q will be called a system of imprimitivity for (G; X). (ii) We say that the action (G; X) is primitive if it is not imprimitive. 1. (a) Suppose that (G; X; Q) is a system of imprimitivity for a transitive left action (G; X), Y 2 Q, y 2 Y . Let H = StabG(Y ), K = StabG(y). Prove the following statements. • K < H < G and H operates transitively on Y . • jXj = jY j · jQj, jQj = [G : H], jY j = [H : K]. (These statements hold even if X is infinite.) (b) Suppose that (G; X) is a transitive left action, y 2 X, K := StabG(y), and H is a subgroup of G such that K < H < G. Let Y := H · y ⊂ X, and let Q := fg · Y j g 2 Gg. (Our general notation scheme is that StabG(Y ) := fg 2 G j g · Y = Y g.) Show that (G; X; Q) is a system of imprimitivity. (c) Suppose that (G; X) is a transitive left action, x 2 X. Show that (G; X) is primitive if and only if Gx is a maximal proper subgroup of G.
    [Show full text]
  • Semigroups and Monoids 
    S Luis Alonso-Ovalle // Contents Subgroups Semigroups and monoids Subgroups Groups. A group G is an algebra consisting of a set G and a single binary operation ◦ satisfying the following axioms: . ◦ is completely defined and G is closed under ◦. ◦ is associative. G contains an identity element. Each element in G has an inverse element. Subgroups. We define a subgroup G0 as a subalgebra of G which is itself a group. Examples: . The group of even integers with addition is a proper subgroup of the group of all integers with addition. The group of all rotations of the square h{I, R, R0, R00}, ◦i, where ◦ is the composition of the operations is a subgroup of the group of all symmetries of the square. Some non-subgroups: SEMIGROUPS AND MONOIDS . The system h{I, R, R0}, ◦i is not a subgroup (and not even a subalgebra) of the original group. Why? (Hint: ◦ closure). The set of all non-negative integers with addition is a subalgebra of the group of all integers with addition, because the non-negative integers are closed under addition. But it is not a subgroup because it is not itself a group: it is associative and has a zero, but . does any member (except for ) have an inverse? Order. The order of any group G is the number of members in the set G. The order of any subgroup exactly divides the order of the parental group. E.g.: only subgroups of order , , and are possible for a -member group. (The theorem does not guarantee that every subset having the proper number of members will give rise to a subgroup.
    [Show full text]
  • Computing the Maximal Subgroups of a Permutation Group I
    Computing the maximal subgroups of a permutation group I Bettina Eick and Alexander Hulpke Abstract. We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Or method uses a “hybrid group” approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts. 1991 Mathematics Subject Classification: primary 20B40, 20-04, 20E28; secondary 20B15, 68Q40 1. Introduction Apart from being interesting themselves, the maximal subgroups of a group have many applications in computational group theory: They provide a set of proper sub- groups which can be used for inductive calculations; for example, to determine the character table of a group. Moreover, iterative application can be used to investigate parts of the subgroups lattice without the excessive resource requirements of com- puting the full lattice. Furthermore, algorithms to compute the Galois group of a polynomial proceed by descending from the symmetric group via a chain of iterated maximal subgroups, see [Sta73, Hul99b]. In this paper, we present a new approach towards the computation of the conju- gacy classes of maximal subgroups of a finite permutation group. For this purpose we use a “hybrid group” method. This type of approach to computations in permu- tation groups has been used recently for other purposes such as conjugacy classes [CS97, Hul], normal subgroups [Hul98, CS] or the automorphism group [Hol00]. For finite solvable groups there exists an algorithm to compute the maximal sub- groups using a special pc presentation, see [CLG, Eic97, EW].
    [Show full text]