Welcome to roadinet.com on July 5 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Index of a subgroup

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In mathematics, specifically group theory, the index of a subgroup H in a group G is the “relative size” of H in G. For example, if H has index 2 in G, then intuitively “half” of the elements of G lie in H. The index of H in G is usually denoted |G : H| or [G : H].

If G and H are finite groups, then the index of H in G is simply the quotient of the orders of the two groups:

|G:H| = \frac{|G|}{|H|}.

By Lagrange's theorem, this number is always a positive integer.

If G and H are infinite, then the index of H is G is defined as the number of cosets of H in G. (The number of left cosets of H in G is always equal to the number of right cosets.) For example, let Z be the group of integers under addition, and let 2Z be the subgroup of Z consisting of the even integers. Then 2Z has two cosets in Z (namely the even integers and the odd integers), so the index of 2Z in Z is two. In general,

|\mathbb{Z}:n\mathbb{Z}| = n

for any positive integer n.

If N is a normal subgroup of G, then the index of N in G is equal to the order of the quotient group G / N.

Contents

[edit] Properties

  • If H is a subgroup of G and K is a subgroup of H, then
|G:K| = |G:H|\,|H:K|.
  • If H and K are subgroups of G, then
|G:H\cap K| \le |G : H|\,|G : K|,
with equality if HK = G. (If |G : H ∩ K| is finite, then equality holds if and only if HK = G.)
  • Equivalently, if H and K are subgroups of G, then
|H:H\cap K| \le |G:K|,
with equality if HK = G. (If |H : H ∩ K| is finite, then equality holds if and only if HK = G.)
  • If G and H are groups and φG → H is a homomorphism, then the index of the kernel of φ in G is equal to the order of the image:
|G:\operatorname{ker}\;\varphi|=|\operatorname{im}\;\varphi|.
|Gx| = |G:G_x|.\!
This is known as the orbit-stabilizer theorem.
  • As a special case of the orbit-stabilizer theorem, the number of conjugates gxg−1 of an element x ∈ G is equal to the index of the centralizer of x in G.
  • Similarly, the number of conjugates gHg−1 of a subgroup H in G is equal to the index of the normalizer of H in G.
  • If H is a subgroup of G, the index of the normal core of H satisfies the following inequality:
|G:\operatorname{Core}(H)| \le |G:H|!
where ! denotes the factorial function.

[edit] Examples

\{(x,y) \mid x\text{ is even}\},\quad \{(x,y) \mid y\text{ is even}\},\quad\text{and}\quad
\{(x,y) \mid x+y\text{ is even}\}.

[edit] 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 |H : G| 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.

[edit] Finite index

An infinite group G may have subgroups H of finite index (for example, the even integers inside the group of integers). Such a subgroup always contains a normal subgroup N (of G), also of finite index. In fact, if H has index n, then the index of N can be taken as some factor of n!. This can be seen more concretely, by considering the permutation action of G on left cosets of H when multiplying them on the right by elements of G (or, equally, multiplying right cosets on the left). This provides a quotient group of G, the kernel of this permutation representation, which is a subgroup of the symmetric group on n elements.

Let us explain this now in more detail. The elements of G that leave all cosets the same form a group.

(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 the cardinality (size) of B is equal to the cardinality of A, and in fact B is a right coset of A.

(If cb1 = d and cb2 = hd (a member of the same coset as d), then cb1b2-1 = db-1 = h-1cHc. Since this is the case for any b2 and for any c (with appropriate d), b1b2-1A and the size of B is less than or equal to the size of A. Conversely, Hcb1 = Hcab1, and since the left-hand side is in Hd then so is the right-hand side: Hcab1Hcd, showing that for any element of A there is a different element of B, and thus the size of A is less than or equal to the size of B.)

Since the number of possible permutations of cosets is finite, namely n! (assuming H is of finite index 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!. Finally, if for some cG and aA we have ca = xc, then for any dG dca = hdc for some hH, but also dca = dxc, so hd = dx. Since this is true for any d, x must be a member of A, so ca = xc implies that A is a normal subgroup.

A special case, n = 2, gives the general result that a subgroup of index 2 is a normal subgroup, because the normal group (A above) must have index 2 and therefore be identical to the original subgroup.

The above considerations are true for finite groups as well. For instance, 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.

[edit] See also

Personal tools
Languages

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs