For a subgroup of a group , a left coset is ; a right coset is . The name refers to the side on which the representative multiplies . Think of a coset as a translated copy of a subgroup: it remembers the relative differences allowed by , while moving the whole collection to another location in the group.
Two left cosets of the same subgroup are either equal or disjoint. Thus distinct left cosets form a partition of a set covering ; the same statement holds separately for right cosets. The useful membership test is
This also defines an equivalence relation: changing a representative by right multiplication with a member of leaves its left coset unchanged. These facts hold even for infinite groups. See MIT's coset notes, definitions 3.6 and 3.9.
For an explicit additive example, take the cyclic group , with modular arithmetic, and the subgroup . Adding each representative to both members gives exactly
Representatives repeat these three cosets, respectively. For example, , since . Every residue appears once in the displayed partition of a set. Each coset has two members, so the group order of is and its index of a subgroup is . Left and right cosets coincide here because is an abelian group.
Figure 1.
Three cosets of the order-two subgroup of the additive cyclic group of order six
. Details.
A coset need not be a subgroup. In this example, lacks the identity element , and leaves it. In fact, the only left or right coset of that is a subgroup is itself: a subgroup must contain the identity element, and the coset containing that element is . Equal sizes come instead from the bijection , whose inverse is ; for right cosets, use and .
The nonabelian group , the symmetric group on three letters, separates the two sides. Use function composition with the rightmost permutation applied first, and let . Then but , giving the differing pair
The complete partition of a set into left cosets consists of , and ; the complete partition of a set into right cosets consists of , and . Each lists all six permutations exactly once. Both have three parts of size two, although their parts differ.
Figure 2.
Left and right coset partitions in S3 with rightmost-first permutation composition
. Details.
Left cosets support a group action by for every subgroup, as in the coset action. Multiplication of representatives defines a quotient group operation precisely when is a normal subgroup. Otherwise the answer can depend on the representatives: in this example, and represent the same coset , yet and differ. In the additive example, is a normal subgroup, making valid. See MIT's quotient-group notes, theorem 9.1.
A nonempty subset of any group is a left coset of a subgroup if and only if any two left translates are equal or disjoint. No finiteness assumption is needed.
For the forward direction, write with a subgroup. Then , and distinct left cosets of are disjoint. For the converse, first assume . For every , , so . This proves closure under multiplication. Since , there is with , showing . Thus passes the subgroup test.
For a general nonempty , choose and set . It contains , and all its left translates have the assumed property because . The previous argument makes a subgroup, and is a left coset. This gives a recognition criterion for cosets from their translate intersections alone.
For a subgroup of a group and , its left coset is . Left multiplication is a bijection from onto . Left and right cosets agree for every exactly when is a normal subgroup.
For a subgroup of a group and , its right coset is . The map is a bijection from onto , with inverse ; in particular all right cosets have the same cardinality as . Multiplication by subgroup elements is on the left in this expression because is the factor on the right.
A right coset transversal for a subgroup chooses one representative for each right coset . Every then has a unique expression with and in the transversal. Choosing as the representative of makes membership in equivalent to having representative .
For subgroups , the double coset of is
The double cosets partition . The action of on the left cosets of gives
by the orbit-stabilizer theorem.
For the order-eight dihedral group generated by of order four and of order two with , let . There are exactly three double cosets: , , and , of sizes two, two, and four. Their number does not divide eight. This differs from the number of ordinary cosets, which divides group order by Lagrange's theorem.
A double coset is generally not a subgroup, so Lagrange's theorem does not force its size to divide the ambient group order. In , take . Then has size two, while has size four, which does not divide six. The general size formula explains why different double cosets can have different sizes.
For a group and subgroup such that every double coset has finitely many orbits under left multiplication by , this algebra consists of complex -bi-invariant functions on supported on finitely many double cosets. Its convolution is
The double coset indicator functions form a basis. On invariant modular functions it acts on the right by . For and , rational conjugation of finite-index modular subgroups verifies the finiteness condition. The determinant- Hecke operator uses the indicator of all integral determinant- matrices, not only a single double coset when is composite.
If is a Sylow subgroup of a finite group and , some intersection is a Sylow subgroup of . Otherwise every double-coset size
would be divisible by a larger power of than , as would their sum .

Ancestors (5)

  1. Group theory
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

In group theory, which is a branch of abstract algebra, a **coset** is a concept used to describe a way of partitioning a group into smaller, equally structured subsets. Cosets arise when considering a subgroup within a larger group.