P-group

Last updated

In mathematics, specifically group theory, given a prime number p, a p-group is a group in which the order of every element is a power of p. That is, for each element g of a p-group G, there exists a nonnegative integer n such that the product of pn copies of g, and not fewer, is equal to the identity element. The orders of different elements may be different powers of p.

Contents

Abelian p-groups are also called p-primary or simply primary.

A finite group is a p-group if and only if its order (the number of its elements) is a power of p. Given a finite group G, the Sylow theorems guarantee the existence of a subgroup of G of order pn for every prime power pn that divides the order of G.

Every finite p-group is nilpotent.

The remainder of this article deals with finite p-groups. For an example of an infinite abelian p-group, see Prüfer group, and for an example of an infinite simple p-group, see Tarski monster group.

Properties

Every p-group is periodic since by definition every element has finite order.

If p is prime and G is a group of order pk, then G has a normal subgroup of order pm for every 1 ≤ mk. This follows by induction, using Cauchy's theorem and the Correspondence Theorem for groups. A proof sketch is as follows: because the center Z of G is non-trivial (see below), according to Cauchy's theorem Z has a subgroup H of order p. Being central in G, H is necessarily normal in G. We may now apply the inductive hypothesis to G/H, and the result follows from the Correspondence Theorem.

Non-trivial center

One of the first standard results using the class equation is that the center of a non-trivial finite p-group cannot be the trivial subgroup. [1]

This forms the basis for many inductive methods in p-groups.

For instance, the normalizer N of a proper subgroup H of a finite p-group G properly contains H, because for any counterexample with H = N, the center Z is contained in N, and so also in H, but then there is a smaller example H/Z whose normalizer in G/Z is N/Z = H/Z, creating an infinite descent. As a corollary, every finite p-group is nilpotent.

In another direction, every normal subgroup N of a finite p-group intersects the center non-trivially as may be proved by considering the elements of N which are fixed when G acts on N by conjugation. Since every central subgroup is normal, it follows that every minimal normal subgroup of a finite p-group is central and has order p. Indeed, the socle of a finite p-group is the subgroup of the center consisting of the central elements of order p.

If G is a p-group, then so is G/Z, and so it too has a non-trivial center. The preimage in G of the center of G/Z is called the second center and these groups begin the upper central series. Generalizing the earlier comments about the socle, a finite p-group with order pn contains normal subgroups of order pi with 0 ≤ in, and any normal subgroup of order pi is contained in the ith center Zi. If a normal subgroup is not contained in Zi, then its intersection with Zi+1 has size at least pi+1.

Automorphisms

The automorphism groups of p-groups are well studied. Just as every finite p-group has a non-trivial center so that the inner automorphism group is a proper quotient of the group, every finite p-group has a non-trivial outer automorphism group. Every automorphism of G induces an automorphism on G/Φ(G), where Φ(G) is the Frattini subgroup of G. The quotient G/Φ(G) is an elementary abelian group and its automorphism group is a general linear group, so very well understood. The map from the automorphism group of G into this general linear group has been studied by Burnside, who showed that the kernel of this map is a p-group.

Examples

p-groups of the same order are not necessarily isomorphic; for example, the cyclic group C4 and the Klein four-group V4 are both 2-groups of order 4, but they are not isomorphic.

Nor need a p-group be abelian; the dihedral group Dih4 of order 8 is a non-abelian 2-group. However, every group of order p2 is abelian. [note 1]

The dihedral groups are both very similar to and very dissimilar from the quaternion groups and the semidihedral groups. Together the dihedral, semidihedral, and quaternion groups form the 2-groups of maximal class, that is those groups of order 2n+1 and nilpotency class n.

Iterated wreath products

The iterated wreath products of cyclic groups of order p are very important examples of p-groups. Denote the cyclic group of order p as W(1), and the wreath product of W(n) with W(1) as W(n + 1). Then W(n) is the Sylow p-subgroup of the symmetric group Sym(pn). Maximal p-subgroups of the general linear group GL(n,Q) are direct products of various W(n). It has order pk where k = (pn  1)/(p  1). It has nilpotency class pn−1, and its lower central series, upper central series, lower exponent-p central series, and upper exponent-p central series are equal. It is generated by its elements of order p, but its exponent is pn. The second such group, W(2), is also a p-group of maximal class, since it has order pp+1 and nilpotency class p, but is not a regular p-group. Since groups of order pp are always regular groups, it is also a minimal such example.

Generalized dihedral groups

When p = 2 and n = 2, W(n) is the dihedral group of order 8, so in some sense W(n) provides an analogue for the dihedral group for all primes p when n = 2. However, for higher n the analogy becomes strained. There is a different family of examples that more closely mimics the dihedral groups of order 2n, but that requires a bit more setup. Let ζ denote a primitive pth root of unity in the complex numbers, let Z[ζ] be the ring of cyclotomic integers generated by it, and let P be the prime ideal generated by 1−ζ. Let G be a cyclic group of order p generated by an element z. Form the semidirect product E(p) of Z[ζ] and G where z acts as multiplication by ζ. The powers Pn are normal subgroups of E(p), and the example groups are E(p,n) = E(p)/Pn. E(p,n) has order pn+1 and nilpotency class n, so is a p-group of maximal class. When p = 2, E(2,n) is the dihedral group of order 2n. When p is odd, both W(2) and E(p,p) are irregular groups of maximal class and order pp+1, but are not isomorphic.

Unitriangular matrix groups

The Sylow subgroups of general linear groups are another fundamental family of examples. Let V be a vector space of dimension n with basis { e1, e2, ..., en } and define Vi to be the vector space generated by { ei, ei+1, ..., en } for 1 ≤ in, and define Vi = 0 when i>n. For each 1 ≤ mn, the set of invertible linear transformations of V which take each Vi to Vi+m form a subgroup of Aut(V) denoted Um. If V is a vector space over Z/pZ, then U1 is a Sylow p-subgroup of Aut(V) = GL(n, p), and the terms of its lower central series are just the Um. In terms of matrices, Um are those upper triangular matrices with 1s one the diagonal and 0s on the first m−1 superdiagonals. The group U1 has order pn·(n−1)/2, nilpotency class n, and exponent pk where k is the least integer at least as large as the base p logarithm of n.

Classification

The groups of order pn for 0 ≤ n ≤ 4 were classified early in the history of group theory, [2] and modern work has extended these classifications to groups whose order divides p7, though the sheer number of families of such groups grows so quickly that further classifications along these lines are judged difficult for the human mind to comprehend. [3] For example, Marshall Hall Jr. and James K. Senior classified groups of order 2n for n ≤ 6 in 1964. [4]

Rather than classify the groups by order, Philip Hall proposed using a notion of isoclinism of groups which gathered finite p-groups into families based on large quotient and subgroups. [5]

An entirely different method classifies finite p-groups by their coclass , that is, the difference between their composition length and their nilpotency class. The so-called coclass conjectures described the set of all finite p-groups of fixed coclass as perturbations of finitely many pro-p groups. The coclass conjectures were proven in the 1980s using techniques related to Lie algebras and powerful p-groups. [6] The final proofs of the coclass theorems are due to A. Shalev and independently to C. R. Leedham-Green, both in 1994. They admit a classification of finite p-groups in directed coclass graphs consisting of only finitely many coclass trees whose (infinitely many) members are characterized by finitely many parametrized presentations.

Every group of order p5 is metabelian. [7]

Up to p3

The trivial group is the only group of order one, and the cyclic group Cp is the only group of order p. There are exactly two groups of order p2, both abelian, namely Cp2 and Cp × Cp. For example, the cyclic group C4 and the Klein four-group V4 which is C2 × C2 are both 2-groups of order 4.

There are three abelian groups of order p3, namely Cp3, Cp2 × Cp, and Cp × Cp × Cp. There are also two non-abelian groups.

For p  2, one is a semi-direct product of Cp × Cp with Cp, and the other is a semi-direct product of Cp2 with Cp. The first one can be described in other terms as group UT(3,p) of unitriangular matrices over finite field with p elements, also called the Heisenberg group mod p.

For p = 2, both the semi-direct products mentioned above are isomorphic to the dihedral group Dih4 of order 8. The other non-abelian group of order 8 is the quaternion group Q8.

Prevalence

Among groups

The number of isomorphism classes of groups of order pn grows as , and these are dominated by the classes that are two-step nilpotent. [8] Because of this rapid growth, there is a folklore conjecture asserting that almost all finite groups are 2-groups: the fraction of isomorphism classes of 2-groups among isomorphism classes of groups of order at most n is thought to tend to 1 as n tends to infinity. For instance, of the 49 910 529 484 different groups of order at most 2000, 49487367289, or just over 99%, are 2-groups of order 1024. [9]

Within a group

Every finite group whose order is divisible by p contains a subgroup which is a non-trivial p-group, namely a cyclic group of order p generated by an element of order p obtained from Cauchy's theorem. In fact, it contains a p-group of maximal possible order: if where p does not divide m, then G has a subgroup P of order called a Sylow p-subgroup. This subgroup need not be unique, but any subgroups of this order are conjugate, and any p-subgroup of G is contained in a Sylow p-subgroup. This and other properties are proved in the Sylow theorems.

Application to structure of a group

p-groups are fundamental tools in understanding the structure of groups and in the classification of finite simple groups. p-groups arise both as subgroups and as quotient groups. As subgroups, for a given prime p one has the Sylow p-subgroups P (largest p-subgroup not unique but all conjugate) and the p-core (the unique largest normalp-subgroup), and various others. As quotients, the largest p-group quotient is the quotient of G by the p-residual subgroup These groups are related (for different primes), possess important properties such as the focal subgroup theorem, and allow one to determine many aspects of the structure of the group.

Local control

Much of the structure of a finite group is carried in the structure of its so-called local subgroups, the normalizers of non-identity p-subgroups. [10]

The large elementary abelian subgroups of a finite group exert control over the group that was used in the proof of the Feit–Thompson theorem. Certain central extensions of elementary abelian groups called extraspecial groups help describe the structure of groups as acting on symplectic vector spaces.

Richard Brauer classified all groups whose Sylow 2-subgroups are the direct product of two cyclic groups of order 4, and John Walter, Daniel Gorenstein, Helmut Bender, Michio Suzuki, George Glauberman, and others classified those simple groups whose Sylow 2-subgroups were abelian, dihedral, semidihedral, or quaternion.

See also

Footnotes

Notes

  1. To prove that a group of order p2 is abelian, note that it is a p-group so has non-trivial center, so given a non-trivial element of the center g, this either generates the group (so G is cyclic, hence abelian: ), or it generates a subgroup of order p, so g and some element h not in its orbit generate G, (since the subgroup they generate must have order ) but they commute since g is central, so the group is abelian, and in fact

Citations

  1. proof
  2. ( Burnside 1897 )
  3. ( Leedham-Green & McKay 2002 , p. 214)
  4. ( Hall Jr. & Senior 1964 )
  5. ( Hall 1940 )
  6. ( Leedham-Green & McKay 2002 )
  7. "Every group of order p5 is metabelian". Stack Exchange. 24 March 2012. Retrieved 7 January 2016.
  8. ( Sims 1965 )
  9. Burrell, David (2021-12-08). "On the number of groups of order 1024". Communications in Algebra. 50 (6): 2408–2410. doi:10.1080/00927872.2021.2006680.
  10. ( Glauberman 1971 )

Related Research Articles

<span class="mw-page-title-main">Abelian group</span> Commutative group (mathematics)

In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.

In abstract algebra, the center of a group, G, is the set of elements that commute with every element of G. It is denoted Z(G), from German Zentrum, meaning center. In set-builder notation,

<span class="mw-page-title-main">Symmetric group</span> Type of group in abstract algebra

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are such permutation operations, the order of the symmetric group is .

<span class="mw-page-title-main">Simple group</span> Group without normal subgroups other than the trivial group and itself

In mathematics, a simple group is a nontrivial group whose only normal subgroups are the trivial group and the group itself. A group that is not simple can be broken into two smaller groups, namely a nontrivial normal subgroup and the corresponding quotient group. This process can be repeated, and for finite groups one eventually arrives at uniquely determined simple groups, by the Jordan–Hölder theorem.

<span class="mw-page-title-main">Cyclic group</span> Mathematical group that can be generated as the set of powers of a single element

In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted Cn, that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a generator of the group.

<span class="mw-page-title-main">Sylow theorems</span> Theorems that help decompose a finite group based on prime factors of its order

In mathematics, specifically in the field of finite group theory, the Sylow theorems are a collection of theorems named after the Norwegian mathematician Peter Ludwig Sylow that give detailed information about the number of subgroups of fixed order that a given finite group contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the classification of finite simple groups.

<span class="mw-page-title-main">Solvable group</span> Group that can be constructed from abelian groups using extensions

In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup.

<span class="mw-page-title-main">Nilpotent group</span> Group that has an upper central series terminating with G

In mathematics, specifically group theory, a nilpotent groupG is a group that has an upper central series that terminates with G. Equivalently, its central series is of finite length or its lower central series terminates with {1}.

<span class="mw-page-title-main">Glossary of group theory</span>

A group is a set together with an associative operation which admits an identity element and such that every element has an inverse.

In mathematics, the projective special linear group PSL(2, 7), isomorphic to GL(3, 2), is a finite simple group that has important applications in algebra, geometry, and number theory. It is the automorphism group of the Klein quartic as well as the symmetry group of the Fano plane. With 168 elements, PSL(2, 7) is the smallest nonabelian simple group after the alternating group A5 with 60 elements, isomorphic to PSL(2, 5).

<span class="mw-page-title-main">Quasidihedral group</span>

In mathematics, the quasi-dihedral groups, also called semi-dihedral groups, are certain non-abelian groups of order a power of 2. For every positive integer n greater than or equal to 4, there are exactly four isomorphism classes of non-abelian groups of order 2n which have a cyclic subgroup of index 2. Two are well known, the generalized quaternion group and the dihedral group. One of the remaining two groups is often considered particularly important, since it is an example of a 2-group of maximal nilpotency class. In Bertram Huppert's text Endliche Gruppen, this group is called a "Quasidiedergruppe". In Daniel Gorenstein's text, Finite Groups, this group is called the "semidihedral group". Dummit and Foote refer to it as the "quasidihedral group"; we adopt that name in this article. All give the same presentation for this group:

In mathematics, especially in the area of algebra known as group theory, the Fitting subgroupF of a finite group G, named after Hans Fitting, is the unique largest normal nilpotent subgroup of G. Intuitively, it represents the smallest subgroup which "controls" the structure of G when G is solvable. When G is not solvable, a similar role is played by the generalized Fitting subgroupF*, which is generated by the Fitting subgroup and the components of G.

<span class="mw-page-title-main">Frobenius group</span>

In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius.

<span class="mw-page-title-main">Hall subgroup</span>

In mathematics, specifically group theory, a Hall subgroup of a finite group G is a subgroup whose order is coprime to its index. They were introduced by the group theorist Philip Hall (1928).

<span class="mw-page-title-main">Cauchy's theorem (group theory)</span> Existence of group elements of prime order

In mathematics, specifically group theory, Cauchy's theorem states that if G is a finite group and p is a prime number dividing the order of G, then G contains an element of order p. That is, there is x in G such that p is the smallest positive integer with xp = e, where e is the identity element of G. It is named after Augustin-Louis Cauchy, who discovered it in 1845.

<span class="mw-page-title-main">Direct product of groups</span> Mathematical concept

In mathematics, specifically in group theory, the direct product is an operation that takes two groups G and H and constructs a new group, usually denoted G × H. This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics.

In mathematical finite group theory, the concept of regular p-group captures some of the more important properties of abelian p-groups, but is general enough to include most "small" p-groups. Regular p-groups were introduced by Phillip Hall (1934).

In mathematics, or more specifically group theory, the omega and agemo subgroups described the so-called "power structure" of a finite p-group. They were introduced in where they were used to describe a class of finite p-groups whose structure was sufficiently similar to that of finite abelian p-groups, the so-called, regular p-groups. The relationship between power and commutator structure forms a central theme in the modern study of p-groups, as exemplified in the work on uniformly powerful p-groups.

In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between isomorphism classes of finite groups of prime power order , for a fixed prime number and varying integer exponents . Such groups are briefly called finitep-groups. The vertices of a descendant tree are isomorphism classes of finite p-groups.

References

Further reading