Index of a subgroup

Last updated

In 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

Contents

(interpret the quantities as cardinal numbers if some of them are infinite). Thus the index measures the "relative sizes" of G and H.

For example, let be the group of integers under addition, and let be the subgroup consisting of the even integers. Then has two cosets in , namely the set of even integers and the set of odd integers, so the index is 2. More generally, for any positive integer n.

When G is finite, the formula may be written as , and it implies Lagrange's theorem that divides .

When G is infinite, is a nonzero cardinal number that may be finite or infinite. For example, , but is infinite.

If N is a normal subgroup of G, then is equal to the order of the quotient group , since the underlying set of is the set of cosets of N in G.

Properties

with equality if . (If is finite, then equality holds if and only if .)
with equality if . (If is finite, then equality holds if and only if .)
This is known as the orbit-stabilizer theorem.
where ! denotes the factorial function; this is discussed further below.
  • As a corollary, if the index of H in G is 2, or for a finite group the lowest prime p that divides the order of G, then H is normal, as the index of its core must also be p, and thus H equals its core, i.e., it is normal.
  • Note that a subgroup of lowest prime index may not exist, such as in any simple group of non-prime order, or more generally any perfect group.

Examples

.

Infinite index

If H has an infinite number of cosets in G, then the index of H in G is said to be infinite. In this case, the index is actually a cardinal number. For example, the index of H in G may be countable or uncountable, depending on whether H has a countable number of cosets in G. Note that the index of H is at most the order of G, which is realized for the trivial subgroup, or in fact any subgroup H of infinite cardinality less than that of G.

Finite index

A subgroup H of finite index in a group G (finite or infinite) always contains a normal subgroup N (of G), also of finite index. In fact, if H has index n, then the index of N will be some divisor of n! and a multiple of n; indeed, N can be taken to be the kernel of the natural homomorphism from G to the permutation group of the left (or right) cosets of H. Let us explain this in more detail, using right cosets:

The elements of G that leave all cosets the same form a group.

Proof

If HcaHccG and likewise HcbHccG, then HcabHccG. If h1ca = h2c for all cG (with h1, h2 ∈ H) then h2ca−1 = h1c, so Hca−1Hc.

Let us call this group A. Let B be the set of elements of G which perform a given permutation on the cosets of H. Then B is a right coset of A.

Proof

First let us show that if b1B, then any other element b2 of B equals ab1 for some aA. Assume that multiplying the coset Hc on the right by elements of B gives elements of the coset Hd. If cb1 = d and cb2 = hd, then cb2b1−1 = hcHc, or in other words b2=ab1 for some aA, as desired. Now we show that for any bB and aA, ab will be an element of B. This is because the coset Hc is the same as Hca, so Hcb = Hcab. Since this is true for any c (that is, for any coset), it shows that multiplying on the right by ab makes the same permutation of cosets as multiplying by b, and therefore abB.

What we have said so far applies whether the index of H is finite or infinte. Now assume that it is the finite number n. Since the number of possible permutations of cosets is finite, namely n!, then there can only be a finite number of sets like B. (If G is infinite, then all such sets are therefore infinite.) The set of these sets forms a group isomorphic to a subset of the group of permutations, so the number of these sets must divide n!. Furthermore, it must be a multiple of n because each coset of H contains the same number of cosets of A. Finally, if for some cG and aA we have ca = xc, then for any dG dca = dxc, but also dca = hdc for some hH (by the definition of A), so hd = dx. Since this is true for any d, x must be a member of A, so ca = xc implies that cac−1A and therefore A is a normal subgroup.

The index of the normal subgroup not only has to be a divisor of n!, but must satisfy other criteria as well. Since the normal subgroup is a subgroup of H, its index in G must be n times its index inside H. Its index in G must also correspond to a subgroup of the symmetric group Sn, the group of permutations of n objects. So for example if n is 5, the index cannot be 15 even though this divides 5!, because there is no subgroup of order 15 in S5.

In the case of n = 2 this gives the rather obvious result that a subgroup H of index 2 is a normal subgroup, because the normal subgroup of H must have index 2 in G and therefore be identical to H. (We can arrive at this fact also by noting that all the elements of G that are not in H constitute the right coset of H and also the left coset, so the two are identical.) More generally, a subgroup of index p where p is the smallest prime factor of the order of G (if G is finite) is necessarily normal, as the index of N divides p! and thus must equal p, having no other prime factors. For example, the subgroup Z7 of the non-abelian group of order 21 is normal (see List of small non-abelian groups and Frobenius group#Examples).

An alternative proof of the result that a subgroup of index lowest prime p is normal, and other properties of subgroups of prime index are given in ( Lam 2004 ).

Examples

The group O of chiral octahedral symmetry has 24 elements. It has a dihedral D4 subgroup (in fact it has three such) of order 8, and thus of index 3 in O, which we shall call H. This dihedral group has a 4-member D2 subgroup, which we may call A. Multiplying on the right any element of a right coset of H by an element of A gives a member of the same coset of H (Hca = Hc). A is normal in O. There are six cosets of A, corresponding to the six elements of the symmetric group S3. All elements from any particular coset of A perform the same permutation of the cosets of H.

On the other hand, the group Th of pyritohedral symmetry also has 24 members and a subgroup of index 3 (this time it is a D2h prismatic symmetry group, see point groups in three dimensions), but in this case the whole subgroup is a normal subgroup. All members of a particular coset carry out the same permutation of these cosets, but in this case they represent only the 3-element alternating group in the 6-member S3 symmetric group.

Normal subgroups of prime power index

Normal subgroups of prime power index are kernels of surjective maps to p-groups and have interesting structure, as described at Focal subgroup theorem: Subgroups and elaborated at focal subgroup theorem.

There are three important normal subgroups of prime power index, each being the smallest normal subgroup in a certain class:

As these are weaker conditions on the groups K, one obtains the containments

These groups have important connections to the Sylow subgroups and the transfer homomorphism, as discussed there.

Geometric structure

An elementary observation is that one cannot have exactly 2 subgroups of index 2, as the complement of their symmetric difference yields a third. This is a simple corollary of the above discussion (namely the projectivization of the vector space structure of the elementary abelian group

,

and further, G does not act on this geometry, nor does it reflect any of the non-abelian structure (in both cases because the quotient is abelian).

However, it is an elementary result, which can be seen concretely as follows: the set of normal subgroups of a given index p form a projective space, namely the projective space

In detail, the space of homomorphisms from G to the (cyclic) group of order p, is a vector space over the finite field A non-trivial such map has as kernel a normal subgroup of index p, and multiplying the map by an element of (a non-zero number mod p) does not change the kernel; thus one obtains a map from

to normal index p subgroups. Conversely, a normal subgroup of index p determines a non-trivial map to up to a choice of "which coset maps to which shows that this map is a bijection.

As a consequence, the number of normal subgroups of index p is

for some k; corresponds to no normal subgroups of index p. Further, given two distinct normal subgroups of index p, one obtains a projective line consisting of such subgroups.

For the symmetric difference of two distinct index 2 subgroups (which are necessarily normal) gives the third point on the projective line containing these subgroups, and a group must contain index 2 subgroups – it cannot contain exactly 2 or 4 index 2 subgroups, for instance.

See also

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 mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group.

<span class="mw-page-title-main">Quotient group</span> Group obtained by aggregating similar elements of a larger group

A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. For example, the cyclic group of addition modulo n can be obtained from the group of integers under addition by identifying elements that differ by a multiple of and defining a group structure that operates on each such class as a single entity. It is part of the mathematical field known as group theory.

In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois who first discovered them.

<span class="mw-page-title-main">Group (mathematics)</span> Set with associative invertible operation

In mathematics, a group is a non-empty set and an operation that combines any two elements of the set to produce a third element of the set, in such a way that the operation is associative, an identity element exists and every element has an inverse. These three axioms hold for number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics.

<span class="mw-page-title-main">Normal subgroup</span> Subgroup invariant under conjugation

In abstract algebra, a normal subgroup is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup of the group is normal in if and only if for all and The usual notation for this relation is

In mathematics, a profinite group is a topological group that is in a certain sense assembled from a system of finite groups.

<span class="mw-page-title-main">Lagrange's theorem (group theory)</span> The order of a subgroup of a finite group G divides the order of G

In the mathematical field of group theory, Lagrange's theorem is a theorem that states that for any finite group G, the order of every subgroup of G divides the order of G. The theorem is named after Joseph-Louis Lagrange. The following variant states that for a subgroup of a finite group , not only is an integer, but its value is the index , defined as the number of left cosets of in .

<span class="mw-page-title-main">Coset</span> Disjoint, equal-size subsets of a groups underlying set

In mathematics, specifically group theory, a subgroup H of a group G may be used to decompose the underlying set of G into disjoint, equal-size subsets called cosets. There are left cosets and right cosets. Cosets have the same number of elements (cardinality) as does H. Furthermore, H itself is both a left coset and a right coset. The number of left cosets of H in G is equal to the number of right cosets of H in G. This common value is called the index of H in G and is usually denoted by [G : H].

In group theory, Cayley's theorem, named in honour of Arthur Cayley, states that every group G is isomorphic to a subgroup of a symmetric group. More specifically, G is isomorphic to a subgroup of the symmetric group whose elements are the permutations of the underlying set of G. Explicitly,

<span class="mw-page-title-main">Exact sequence</span> Sequence of homomorphisms such that each kernel equals the preceding image

An exact sequence is a sequence of morphisms between objects such that the image of one morphism equals the kernel of the next.

<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.

<span class="mw-page-title-main">Cayley graph</span> Graph defined from a mathematical group

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem, and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing families of expander graphs.

In mathematics, a congruence subgroup of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example would be invertible 2 × 2 integer matrices of determinant 1, in which the off-diagonal entries are even. More generally, the notion of congruence subgroup can be defined for arithmetic subgroups of algebraic groups; that is, those for which we have a notion of 'integral structure' and can define reduction maps modulo an integer.

In mathematics, especially in the field of group theory, a divisible group is an abelian group in which every element can, in some sense, be divided by positive integers, or more accurately, every element is an nth multiple for each positive integer n. Divisible groups are important in understanding the structure of abelian groups, especially because they are the injective abelian groups.

<span class="mw-page-title-main">Order (group theory)</span> Cardinality of a mathematical group, or of the subgroup generated by an element

In mathematics, the order of a finite group is the number of its elements. If a group is not finite, one says that its order is infinite. The order of an element of a group is the order of the subgroup generated by the element. If the group operation is denoted as a multiplication, the order of an element a of a group, is thus the smallest positive integer m such that am = e, where e denotes the identity element of the group, and am denotes the product of m copies of a. If no such m exists, the order of a is infinite.

In mathematics, the Ext functors are the derived functors of the Hom functor. Along with the Tor functor, Ext is one of the core concepts of homological algebra, in which ideas from algebraic topology are used to define invariants of algebraic structures. The cohomology of groups, Lie algebras, and associative algebras can all be defined in terms of Ext. The name comes from the fact that the first Ext group Ext1 classifies extensions of one module by another.

In group theory, a field of mathematics, a double coset is a collection of group elements which are equivalent under the symmetries coming from two subgroups. More precisely, let G be a group, and let H and K be subgroups. Let H act on G by left multiplication and let K act on G by right multiplication. For each x in G, the (H, K)-double coset of x is the set

The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a more elementary kind of structure, the abelian group. The direct sum of two abelian groups and is another abelian group consisting of the ordered pairs where and . To add ordered pairs, we define the sum to be ; in other words addition is defined coordinate-wise. For example, the direct sum , where is real coordinate space, is the Cartesian plane, . A similar process can be used to form the direct sum of two vector spaces or two modules.

In mathematics, the tensor product of modules is a construction that allows arguments about bilinear maps to be carried out in terms of linear maps. The module construction is analogous to the construction of the tensor product of vector spaces, but can be carried out for a pair of modules over a commutative ring resulting in a third module, and also for a pair of a right-module and a left-module over any ring, with result an abelian group. Tensor products are important in areas of abstract algebra, homological algebra, algebraic topology, algebraic geometry, operator algebras and noncommutative geometry. The universal property of the tensor product of vector spaces extends to more general situations in abstract algebra. The tensor product of an algebra and a module can be used for extension of scalars. For a commutative ring, the tensor product of modules can be iterated to form the tensor algebra of a module, allowing one to define multiplication in the module in a universal way.

References