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 (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. If H is a subgroup of G and K is a subgroup of H, then If H and K are subgroups of G, then with equality if . (If is finite, then equality holds if and only if .) Equivalently, if H and K are subgroups of G, then with equality if . (If is finite, then equality holds if and only if .) If G and H are groups and is a homomorphism, then the index of the kernel of in G is equal to the order of the image: Let G be a group acting on a set X, and let x ∈ X. Then the cardinality of the orbit of x under G is equal to the index of the stabilizer of x: This is known as the orbit-stabilizer theorem. As a special case of the orbit-stabilizer theorem, the number of conjugates of an element is equal to the index of the centralizer of x in G. Similarly, the number of conjugates of a subgroup H in G is equal to the index of the normalizer of H in G.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (8)
MATH-310: Algebra
This is an introduction to modern algebra: groups, rings and fields.
CS-308: Introduction to quantum computation
The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch
MATH-335: Coxeter groups
Study groups generated by reflections
Show more
Related concepts (26)
P-group
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. 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.
Finite group
In 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.
Coset
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 (both left and right) 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].
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.