P-groupIn 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. 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.
Solvable groupIn 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. Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equation. Specifically, a polynomial equation is solvable in radicals if and only if the corresponding Galois group is solvable (note this theorem holds only in characteristic 0).
Prüfer groupIn mathematics, specifically in group theory, the Prüfer p-group or the p-quasicyclic group or p∞-group, Z(p∞), for a prime number p is the unique p-group in which every element has p different p-th roots. The Prüfer p-groups are countable abelian groups that are important in the classification of infinite abelian groups: they (along with the group of rational numbers) form the smallest building blocks of all divisible groups. The groups are named after Heinz Prüfer, a German mathematician of the early 20th century.
Index of a subgroupIn mathematics, specifically group theory, the index of a subgroup H in a group G is the number of left cosets of H in G, or equivalently, the number of right cosets of H in G. The index is denoted or or . Because G is the disjoint union of the left cosets and because each left coset has the same size as H, the index is related to the orders of the two groups by the formula (interpret the quantities as cardinal numbers if some of them are infinite). Thus the index measures the "relative sizes" of G and H.
Frattini subgroupIn mathematics, particularly in group theory, the Frattini subgroup of a group G is the intersection of all maximal subgroups of G. For the case that G has no maximal subgroups, for example the trivial group {e} or a Prüfer group, it is defined by . It is analogous to the Jacobson radical in the theory of rings, and intuitively can be thought of as the subgroup of "small elements" (see the "non-generator" characterization below). It is named after Giovanni Frattini, who defined the concept in a paper published in 1885.
Focal subgroup theoremIn abstract algebra, the focal subgroup theorem describes the fusion of elements in a Sylow subgroup of a finite group. The focal subgroup theorem was introduced in and is the "first major application of the transfer" according to . The focal subgroup theorem relates the ideas of transfer and fusion such as described in . Various applications of these ideas include local criteria for p-nilpotence and various non-simplicity criteria focussing on showing that a finite group has a normal subgroup of index p.
Finite groupIn abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century.
Sylow theoremsIn 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. For a prime number , a Sylow p-subgroup (sometimes p-Sylow subgroup) of a group is a maximal -subgroup of , i.
Powerful p-groupIn mathematics, in the field of group theory, especially in the study of p-groups and pro-p-groups, the concept of powerful p-groups plays an important role. They were introduced in , where a number of applications are given, including results on Schur multipliers. Powerful p-groups are used in the study of automorphisms of p-groups , the solution of the restricted Burnside problem , the classification of finite p-groups via the coclass conjectures , and provided an excellent method of understanding analytic pro-p-groups .
Characteristic subgroupIn mathematics, particularly in the area of abstract algebra known as group theory, a characteristic subgroup is a subgroup that is mapped to itself by every automorphism of the parent group. Because every conjugation map is an inner automorphism, every characteristic subgroup is normal; though the converse is not guaranteed. Examples of characteristic subgroups include the commutator subgroup and the center of a group. A subgroup H of a group G is called a characteristic subgroup if for every automorphism φ of G, one has φ(H) ≤ H; then write H char G.
Abelian groupIn 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.
Symmetric groupIn 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 ( factorial) such permutation operations, the order (number of elements) of the symmetric group is .
Core (group theory)In group theory, a branch of mathematics, a core is any of certain special normal subgroups of a group. The two most common types are the normal core of a subgroup and the p-core of a group. For a group G, the normal core or normal interior of a subgroup H is the largest normal subgroup of G that is contained in H (or equivalently, the intersection of the conjugates of H). More generally, the core of H with respect to a subset S ⊆ G is the intersection of the conjugates of H under S, i.e.
Dihedral groupIn mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, D_n or Dih_n refers to the symmetries of the n-gon, a group of order 2n. In abstract algebra, D_2n refers to this same dihedral group.
Maximal subgroupIn mathematics, the term maximal subgroup is used to mean slightly different things in different areas of algebra. In group theory, a maximal subgroup H of a group G is a proper subgroup, such that no proper subgroup K contains H strictly. In other words, H is a maximal element of the partially ordered set of subgroups of G that are not equal to G. Maximal subgroups are of interest because of their direct connection with primitive permutation representations of G.
Generating set of a groupIn abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses. In other words, if is a subset of a group , then , the subgroup generated by , is the smallest subgroup of containing every element of , which is equal to the intersection over all subgroups containing the elements of ; equivalently, is the subgroup of all elements of that can be expressed as the finite product of elements in and their inverses.
Monster groupIn the area of abstract algebra known as group theory, the monster group M (also known as the Fischer–Griess monster, or the friendly giant) is the largest sporadic simple group, having order 2463205976112133171923293141475971 = 808,017,424,794,512,875,886,459,904,961,710,757,005,754,368,000,000,000 ≈ 8. The finite simple groups have been completely classified. Every such group belongs to one of 18 countably infinite families, or is one of 26 sporadic groups that do not follow such a systematic pattern.
Elementary abelian groupIn mathematics, specifically in group theory, an elementary abelian group is an abelian group in which all elements other than the identity have the same order. This common order must be a prime number, and the elementary abelian groups in which the common order is p are a particular kind of p-group. A group for which p = 2 (that is, an elementary abelian 2-group) is sometimes called a Boolean group. Every elementary abelian p-group is a vector space over the prime field with p elements, and conversely every such vector space is an elementary abelian group.
Homotopy groups of spheresIn the mathematical field of algebraic topology, the homotopy groups of spheres describe how spheres of various dimensions can wrap around each other. They are examples of topological invariants, which reflect, in algebraic terms, the structure of spheres viewed as topological spaces, forgetting about their precise geometry. Unlike homology groups, which are also topological invariants, the homotopy groups are surprisingly complex and difficult to compute.
Word problem for groupsIn mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G.
