Coset

Last updated March 15, 2024

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

Cosets are a basic tool in the study of groups; for example, they play a central role in Lagrange's theorem that states that for any finite group $G$ , the number of elements of every subgroup $H$ of $G$ divides the number of elements of $G$ . Cosets of a particular type of subgroup (a normal subgroup) can be used as the elements of another group called a quotient group or factor group. Cosets also appear in other areas of mathematics such as vector spaces and error-correcting codes.

Definition

Let $H$ be a subgroup of the group $G$ whose operation is written multiplicatively (juxtaposition denotes the group operation). Given an element $g$ of $G$ , the left cosets of $H$ in $G$ are the sets obtained by multiplying each element of $H$ by a fixed element $g$ of $G$ (where $g$ is the left factor). In symbols these are,

gH = {gh : h an element of H}

for

g

in

G

.

The right cosets are defined similarly, except that the element $g$ is now a right factor, that is,

Hg = {hg : h an element of H}

for

g

in

G

.

As $g$ varies through the group, it would appear that many cosets (right or left) would be generated. Nevertheless, it turns out that any two left cosets (respectively right cosets) are either disjoint or are identical as sets.^[1]

If the group operation is written additively, as is often the case when the group is abelian, the notation used changes to $g + H$ or $H + g$ , respectively.

First example

Let $G$ be the dihedral group of order six. Its elements may be represented by ${I, a, a 2, b, ab, a 2 b}$ . In this group, $a 3 = b 2 = I$ and $ba = a 2 b$ . This is enough information to fill in the entire Cayley table:

∗	$I$	$a$	$a 2$	$b$	$ab$	$a 2 b$
$I$	$I$	$a$	$a 2$	$b$	$ab$	$a 2 b$
$a$	$a$	$a 2$	$I$	$ab$	$a 2 b$	$b$
$a 2$	$a 2$	$I$	$a$	$a 2 b$	$b$	$ab$
$b$	$b$	$a 2 b$	$ab$	$I$	$a 2$	$a$
$ab$	$ab$	$b$	$a 2 b$	$a$	$I$	$a 2$
$a 2 b$	$a 2 b$	$ab$	$b$	$a 2$	$a$	$I$

Let $T$ be the subgroup ${I, b}$ . The (distinct) left cosets of $T$ are:

$IT = T = {I, b}$ ,
$aT = {a, ab}$ , and
$a 2 T = {a 2, a 2 b}$ .

Since all the elements of $G$ have now appeared in one of these cosets, generating any more can not give new cosets; any new coset would have to have an element in common with one of these and therefore would be identical to one of these cosets. For instance, $abT = {ab, a} = aT$ .

The right cosets of $T$ are:

$TI = T = {I, b}$ ,
$Ta = {a, ba} = {a, a 2 b}$ , and
$Ta 2 = {a 2, ba 2} = {a 2, ab}$ .

In this example, except for $T$ , no left coset is also a right coset.

Let $H$ be the subgroup ${I, a, a 2}$ . The left cosets of $H$ are $IH = H$ and $bH = {b, ba, ba 2}$ . The right cosets of $H$ are $HI = H$ and $Hb = {b, ab, a 2 b} = {b, ba 2, ba}$ . In this case, every left coset of $H$ is also a right coset of $H$ .^[2]

Let $H$ be a subgroup of a group $G$ and suppose that $g 1$ , $g 2 \in G$ . The following statements are equivalent:^[3]

$g 1 H = g 2 H$
$Hg 1 -1 = Hg 2 -1$
$g 1 H \subset g 2 H$
$g 2 \in g 1 H$
$g 1 -1 g 2 \in H$

Properties

The disjointness of non-identical cosets is a result of the fact that if $x$ belongs to $gH$ then $gH = xH$ . For if $x \in gH$ then there must exist an $a \in H$ such that $ga = x$ . Thus $xH = (ga) H = g (aH)$ . Moreover, since $H$ is a group, left multiplication by $a$ is a bijection, and $aH = H$ .

Thus every element of $G$ belongs to exactly one left coset of the subgroup $H$ ,^[1] and $H$ is itself a left coset (and the one that contains the identity).^[2]

Two elements being in the same left coset also provide a natural equivalence relation. Define two elements of $G$ , $x$ and $y$ , to be equivalent with respect to the subgroup $H$ if $xH = yH$ (or equivalently if $x -1 y$ belongs to $H$ ). The equivalence classes of this relation are the left cosets of $H$ .^[4] As with any set of equivalence classes, they form a partition of the underlying set. A coset representative is a representative in the equivalence class sense. A set of representatives of all the cosets is called a transversal. There are other types of equivalence relations in a group, such as conjugacy, that form different classes which do not have the properties discussed here.

Similar statements apply to right cosets.

If $G$ is an abelian group, then $g + H = H + g$ for every subgroup $H$ of $G$ and every element $g$ of $G$ . For general groups, given an element $g$ and a subgroup $H$ of a group $G$ , the right coset of $H$ with respect to $g$ is also the left coset of the conjugate subgroup $g -1 Hg$ with respect to $g$ , that is, $Hg = g (g -1 Hg)$ .

Normal subgroups

A subgroup $N$ of a group $G$ is a normal subgroup of $G$ if and only if for all elements $g$ of $G$ the corresponding left and right cosets are equal, that is, $gN = Ng$ . This is the case for the subgroup $H$ in the first example above. Furthermore, the cosets of $N$ in $G$ form a group called the quotient group or factor group $G / N$ .

If $H$ is not normal in $G$ , then its left cosets are different from its right cosets. That is, there is an $a$ in $G$ such that no element $b$ satisfies $aH = Hb$ . This means that the partition of $G$ into the left cosets of $H$ is a different partition than the partition of $G$ into right cosets of $H$ . This is illustrated by the subgroup $T$ in the first example above. (Some cosets may coincide. For example, if $a$ is in the center of $G$ , then $aH = Ha$ .)

On the other hand, if the subgroup $N$ is normal the set of all cosets forms a group called the quotient group $G / N$ with the operation $*$ defined by $(aN) * (bN) = abN$ . Since every right coset is a left coset, there is no need to distinguish "left cosets" from "right cosets".

Index of a subgroup

Every left or right coset of $H$ has the same number of elements (or cardinality in the case of an infinite $H$ ) as $H$ itself. Furthermore, the number of left cosets is equal to the number of right cosets and is known as the index of $H$ in G, written as $[G : H]$ . Lagrange's theorem allows us to compute the index in the case where $G$ and $H$ are finite:

|G|=[G:H]|H|.

This equation also holds in the case where the groups are infinite, although the meaning may be less clear.

More examples

Integers

Let $G$ be the additive group of the integers, $Z = ({..., -2, -1, 0, 1, 2, ...}, +)$ and $H$ the subgroup $(3 Z, +) = ({..., -6, -3, 0, 3, 6, ...}, +)$ . Then the cosets of $H$ in $G$ are the three sets $3 Z$ , $3 Z + 1$ , and $3 Z + 2$ , where $3 Z + a = {..., -6 + a, -3 + a, a, 3 + a, 6 + a, ...}$ . These three sets partition the set $Z$ , so there are no other right cosets of $H$ . Due to the commutivity of addition $H + 1 = 1 + H$ and $H + 2 = 2 + H$ . That is, every left coset of $H$ is also a right coset, so $H$ is a normal subgroup.^[5] (The same argument shows that every subgroup of an Abelian group is normal.^[6])

This example may be generalized. Again let $G$ be the additive group of the integers, $Z = ({..., -2, -1, 0, 1, 2, ...}, +)$ , and now let $H$ the subgroup $(m Z, +) = ({..., -2 m, - m, 0, m, 2 m, ...}, +)$ , where $m$ is a positive integer. Then the cosets of $H$ in $G$ are the $m$ sets $m Z$ , $m Z + 1$ , ..., $m Z + (m - 1)$ , where $m Z + a = {..., -2 m + a, - m + a, a, m + a, 2 m + a, ...}$ . There are no more than $m$ cosets, because $m Z + m = m (Z + 1) = m Z$ . The coset $(m Z + a, +)$ is the congruence class of $a$ modulo $m$ .^[7] The subgroup $m Z$ is normal in $Z$ , and so, can be used to form the quotient group $Z / m Z$ the group of integers mod $m$ .

Vectors

Another example of a coset comes from the theory of vector spaces. The elements (vectors) of a vector space form an abelian group under vector addition. The subspaces of the vector space are subgroups of this group. For a vector space $V$ , a subspace $W$ , and a fixed vector $a$ in $V$ , the sets

\{\mathbf {x} \in V\mid \mathbf {x} =\mathbf {a} +\mathbf {w} ,\mathbf {w} \in W\}

are called affine subspaces, and are cosets (both left and right, since the group is abelian). In terms of 3-dimensional geometric vectors, these affine subspaces are all the "lines" or "planes" parallel to the subspace, which is a line or plane going through the origin. For example, consider the plane $R 2$ . If $m$ is a line through the origin $O$ , then $m$ is a subgroup of the abelian group $R 2$ . If $P$ is in $R 2$ , then the coset $P + m$ is a line $m'$ parallel to $m$ and passing through $P$ .^[8]

Matrices

Let $G$ be the multiplicative group of matrices,^[9]

G=\left\{{\begin{bmatrix}a&0\\b&1\end{bmatrix}}\colon a,b\in \mathbb {R} ,a\neq 0\right\},

and the subgroup $H$ of $G$ ,

H=\left\{{\begin{bmatrix}1&0\\c&1\end{bmatrix}}\colon c\in \mathbb {R} \right\}.

For a fixed element of $G$ consider the left coset

{\begin{aligned}{\begin{bmatrix}a&0\\b&1\end{bmatrix}}H=&~\left\{{\begin{bmatrix}a&0\\b&1\end{bmatrix}}{\begin{bmatrix}1&0\\c&1\end{bmatrix}}\colon c\in \mathbb {R} \right\}\\=&~\left\{{\begin{bmatrix}a&0\\b+c&1\end{bmatrix}}\colon c\in \mathbb {R} \right\}\\=&~\left\{{\begin{bmatrix}a&0\\d&1\end{bmatrix}}\colon d\in \mathbb {R} \right\}.\end{aligned}}

That is, the left cosets consist of all the matrices in $G$ having the same upper-left entry. This subgroup $H$ is normal in $G$ , but the subgroup

T=\left\{{\begin{bmatrix}a&0\\0&1\end{bmatrix}}\colon a\in \mathbb {R} -\{0\}\right\}

is not normal in $G$ .

As orbits of a group action

A subgroup $H$ of a group $G$ can be used to define an action of $H$ on $G$ in two natural ways. A right action, $G \times H \to G$ given by $(g, h) \to gh$ or a left action, $H \times G \to G$ given by $(h, g) \to hg$ . The orbit of $g$ under the right action is the left coset $gH$ , while the orbit under the left action is the right coset $Hg$ .^[10]

History

The concept of a coset dates back to Galois's work of 1830–31. He introduced a notation but did not provide a name for the concept. The term "co-set" apparently appears for the first time in 1910 in a paper by G. A. Miller in the Quarterly Journal of Pure and Applied Mathematics (vol. 41, p. 382). Various other terms have been used including the German Nebengruppen (Weber) and conjugate group (Burnside).^[11] (Note that Miller abbreviated his self-citation to the Quarterly Journal of Mathematics; this does not refer to the journal of the same name, which did not start publication until 1930.)

Galois was concerned with deciding when a given polynomial equation was solvable by radicals. A tool that he developed was in noting that a subgroup $H$ of a group of permutations $G$ induced two decompositions of $G$ (what we now call left and right cosets). If these decompositions coincided, that is, if the left cosets are the same as the right cosets, then there was a way to reduce the problem to one of working over $H$ instead of $G$ . Camille Jordan in his commentaries on Galois's work in 1865 and 1869 elaborated on these ideas and defined normal subgroups as we have above, although he did not use this term.^[6]

Calling the coset $gH$ the left coset of $g$ with respect to $H$ , while most common today,^[10] has not been universally true in the past. For instance, Hall (1959) would call $gH$ a right coset, emphasizing the subgroup being on the right.

An application from coding theory

A binary linear code is an $n$ -dimensional subspace $C$ of an $m$ -dimensional vector space $V$ over the binary field $GF(2)$ . As $V$ is an additive abelian group, $C$ is a subgroup of this group. Codes can be used to correct errors that can occur in transmission. When a codeword (element of $C$ ) is transmitted some of its bits may be altered in the process and the task of the receiver is to determine the most likely codeword that the corrupted received word could have started out as. This procedure is called decoding and if only a few errors are made in transmission it can be done effectively with only a very few mistakes. One method used for decoding uses an arrangement of the elements of $V$ (a received word could be any element of $V$ ) into a standard array. A standard array is a coset decomposition of $V$ put into tabular form in a certain way. Namely, the top row of the array consists of the elements of $C$ , written in any order, except that the zero vector should be written first. Then, an element of $V$ with a minimal number of ones that does not already appear in the top row is selected and the coset of $C$ containing this element is written as the second row (namely, the row is formed by taking the sum of this element with each element of $C$ directly above it). This element is called a coset leader and there may be some choice in selecting it. Now the process is repeated, a new vector with a minimal number of ones that does not already appear is selected as a new coset leader and the coset of $C$ containing it is the next row. The process ends when all the vectors of $V$ have been sorted into the cosets.

An example of a standard array for the 2-dimensional code $C = {00000, 01101, 10110, 11011}$ in the 5-dimensional space $V$ (with 32 vectors) is as follows:

00000	01101	10110	11011
10000	11101	00110	01011
01000	00101	11110	10011
00100	01001	10010	11111
00010	01111	10100	11001
00001	01100	10111	11010
11000	10101	01110	00011
10001	11100	00111	01010

The decoding procedure is to find the received word in the table and then add to it the coset leader of the row it is in. Since in binary arithmetic adding is the same operation as subtracting, this always results in an element of $C$ . In the event that the transmission errors occurred in precisely the non-zero positions of the coset leader the result will be the right codeword. In this example, if a single error occurs, the method will always correct it, since all possible coset leaders with a single one appear in the array.

Syndrome decoding can be used to improve the efficiency of this method. It is a method of computing the correct coset (row) that a received word will be in. For an $n$ -dimensional code $C$ in an $m$ -dimensional binary vector space, a parity check matrix is an $(m - n) \times m$ matrix $H$ having the property that $x H T = 0$ if and only if $x$ is in $C$ .^[12] The vector $x H T$ is called the syndrome of $x$ , and by linearity, every vector in the same coset will have the same syndrome. To decode, the search is now reduced to finding the coset leader that has the same syndrome as the received word.^[13]

Double cosets

Given two subgroups, $H$ and $K$ (which need not be distinct) of a group $G$ , the double cosets of $H$ and $K$ in $G$ are the sets of the form $HgK = {hgk : h an element of H, k an element of K}$ . These are the left cosets of $K$ and right cosets of $H$ when $H = 1$ and $K = 1$ respectively.^[14]

Two double cosets $HxK$ and $HyK$ are either disjoint or identical.^[15] The set of all double cosets for fixed $H$ and $K$ form a partition of $G$ .

A double coset $HxK$ contains the complete right cosets of $H$ (in $G$ ) of the form $Hxk$ , with $k$ an element of $K$ and the complete left cosets of $K$ (in $G$ ) of the form $hxK$ , with $h$ in $H$ .^[15]

Notation

Let $G$ be a group with subgroups $H$ and $K$ . Several authors working with these sets have developed a specialized notation for their work, where^[16]^[17]

$G / H$ denotes the set of left cosets ${gH : g in G}$ of $H$ in $G$ .
$H \ G$ denotes the set of right cosets ${Hg : g in G}$ of $H$ in $G$ .
$K \ G / H$ denotes the set of double cosets ${KgH : g in G}$ of $H$ and $K$ in $G$ , sometimes referred to as double coset space.
$G // H$ denotes the double coset space $H \ G / H$ of the subgroup $H$ in $G$ .

More applications

Cosets of $Q$ in $R$ are used in the construction of Vitali sets, a type of non-measurable set.
Cosets are central in the definition of the transfer.
Cosets are important in computational group theory. For example, Thistlethwaite's algorithm for solving Rubik's Cube relies heavily on cosets.
In geometry, a Clifford–Klein form is a double coset space $Γ \ G / H$ , where $G$ is a reductive Lie group, $H$ is a closed subgroup, and $Γ$ is a discrete subgroup (of $G$ ) that acts properly discontinuously on the homogeneous space $G / H$ .

Notes

1 2 Rotman 2006 , p. 156
1 2 Dean 1990 , p. 100
↑ "AATA Cosets". Archived from the original on 2022-01-22. Retrieved 2020-12-09.
↑ Rotman 2006 , p.155
↑ Fraleigh 1994 , p. 117
1 2 Fraleigh 1994 , p. 169
↑ Joshi 1989 , p. 323
↑ Rotman 2006 , p. 155
↑ Burton 1988 , pp. 128, 135
1 2 Jacobson 2009 , p. 52
↑ Miller 2012 , p. 24 footnote
↑ The transpose matrix is used so that the vectors can be written as row vectors.
↑ Rotman 2006 , p. 423
↑ Scott 1987 , p. 19
1 2 Hall 1959 , pp. 14–15
↑ Seitz, Gary M. (1998), "Double Cosets in Algebraic Groups", in Carter, R.W.; Saxl, J. (eds.), Algebraic Groups and their Representation, Springer, pp. 241–257, doi:10.1007/978-94-011-5308-9_13, ISBN 978-0-7923-5292-1
↑ Duckworth, W. Ethan (2004), "Infiniteness of double coset collections in algebraic groups", Journal of Algebra, Elsevier, 273 (2): 718–733, arXiv: math/0305256 , doi:10.1016/j.jalgebra.2003.08.011, S2CID 17839580

Related Research Articles

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, given two groups, (G,∗) and (H, ·), a group homomorphism from (G,∗) to (H, ·) is a function h : G → H such that for all u and v in G it holds that

<span class="mw-page-title-main">Lie algebra</span> Algebraic structure used in analysis

In mathematics, a Lie algebra is a vector space $together with an operation called the Lie bracket, an alternating bilinear map, that satisfies the Jacobi identity. In other words, a Lie algebra is an algebra over a field for which the multiplication operation is alternating and satisfies the Jacobi identity. The Lie bracket of two vectors and is denoted . A Lie algebra is typically a non-associative algebra. However, every associative algebra gives rise to a Lie algebra, consisting of the same vector space with the commutator Lie bracket, .$

In group theory, a branch of mathematics, given a group $G$ under a binary operation ∗, a subset $H$ of $G$ is called a subgroup of $G$ if $H$ also forms a group under the operation ∗. More precisely, $H$ is a subgroup of $G$ if the restriction of ∗ to $H \times H$ is a group operation on $H$ . This is often denoted $H \leq G$ , read as " $H$ is a subgroup of $G$ ".

In mathematics, the tensor product $of two vector spaces V and W is a vector space to which is associated a bilinear map that maps a pair to an element of denoted$

In mathematics, topological groups are the combination of groups and topological spaces, i.e. they are groups and topological spaces at the same time, such that the continuity condition for the group operations connects these two structures together and consequently they are not independent from each other.

In algebra, the kernel of a homomorphism is generally the inverse image of 0. An important special case is the kernel of a linear map. The kernel of a matrix, also called the null space, is the kernel of the linear map defined by the matrix.

<span class="mw-page-title-main">Conjugacy class</span> In group theory, equivalence class under the relation of conjugation

In mathematics, especially group theory, two elements $and of a group are conjugate if there is an element in the group such that This is an equivalence relation whose equivalence classes are called conjugacy classes . In other words, each conjugacy class is closed under for all elements in the group.$

In abstract algebra, the direct sum is a construction which combines several modules into a new, larger module. The direct sum of modules is the smallest module which contains the given modules as submodules with no "unnecessary" constraints, making it an example of a coproduct. Contrast with the direct product, which is the dual notion.

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

In mathematics, the orthogonal group in dimension $n$ , denoted $O(n)$ , is the group of distance-preserving transformations of a Euclidean space of dimension $n$ that preserve a fixed point, where the group operation is given by composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of $n \times n$ orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact.

In physics and mathematics, the Lorentz group is the group of all Lorentz transformations of Minkowski spacetime, the classical and quantum setting for all (non-gravitational) physical phenomena. The Lorentz group is named for the Dutch physicist Hendrik Lorentz.

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$

<span class="mw-page-title-main">Adjoint representation</span> Mathematical term

In mathematics, the adjoint representation of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space. For example, if G is $, the Lie group of real n -by- n invertible matrices, then the adjoint representation is the group homomorphism that sends an invertible n -by- n matrix to an endomorphism of the vector space of all linear transformations of defined by: .$

<span class="mw-page-title-main">Homogeneous space</span> Topological space in group theory

In mathematics, a homogeneous space is, very informally, a space that looks the same everywhere, as you move through it, with movement given by the action of a group. Homogeneous spaces occur in the theories of Lie groups, algebraic groups and topological groups. More precisely, a homogeneous space for a group G is a non-empty manifold or topological space X on which G acts transitively. The elements of G are called the symmetries of X. A special case of this is when the group G in question is the automorphism group of the space X – here "automorphism group" can mean isometry group, diffeomorphism group, or homeomorphism group. In this case, X is homogeneous if intuitively X looks locally the same at each point, either in the sense of isometry, diffeomorphism, or homeomorphism (topology). Some authors insist that the action of G be faithful, although the present article does not. Thus there is a group action of G on X that can be thought of as preserving some "geometric structure" on X, and making X into a single G-orbit.

In mathematics, the Heisenberg group $, named after Werner Heisenberg, is the group of 3\times3 upper triangular matrices of the form$

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 concept of system of imprimitivity is used in mathematics, particularly in algebra and analysis, both within the context of the theory of group representations. It was used by George Mackey as the basis for his theory of induced unitary representations of locally compact groups.

In mathematics, a unipotent elementr of a ring R is one such that r − 1 is a nilpotent element; in other words, (r − 1)ⁿ is zero for some n.

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

References

Burton, David M. (1988), Abstract Algebra, Wm. C. Brown Publishers, ISBN 0-697-06761-0
Dean, Richard A. (1990), Classical Abstract Algebra, Harper and Row, ISBN 0-06-041601-7
Fraleigh, John B. (1994), A First Course in Abstract Algebra (5th ed.), Addison-Wesley, ISBN 978-0-201-53467-2
Hall, Jr., Marshall (1959), The Theory of Groups, The Macmillan Company
Jacobson, Nathan (2009) [1985], Basic Algebra I (2nd ed.), Dover, ISBN 978-0-486-47189-1
Joshi, K. D. (1989), "§5.2 Cosets of Subgroups", Foundations of Discrete Mathematics, New Age International, pp. 322 ff, ISBN 81-224-0120-1
Miller, G. A. (2012) [1916], Theory and Applications of Finite Groups, Applewood Books, ISBN 9781458500700
Rotman, Joseph J. (2006), A First Course in Abstract Algebra with Applications (3rd ed.), Prentice-Hall, ISBN 978-0-13-186267-8
Scott, W.R. (1987), "§1.7 Cosets and index", Group Theory, Courier Dover Publications, pp. 19 ff, ISBN 0-486-65377-3

External links

Nicolas Bray. "Coset". MathWorld .
Weisstein, Eric W. "Left Coset". MathWorld .
Weisstein, Eric W. "Right Coset". MathWorld .
Ivanova, O.A. (2001) [1994], "Coset in a group", Encyclopedia of Mathematics , EMS Press
Coset at PlanetMath .
Illustrated examples
"Coset". groupprops. The Group Properties Wiki.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Rotman2006-1] 1 2 Rotman 2006 , p. 156

[Dean-2] 1 2 Dean 1990 , p. 100

[3] "AATA Cosets". Archived from the original on 2022-01-22. Retrieved 2020-12-09.

[4] Rotman 2006 , p.155

[5] Fraleigh 1994 , p. 117

[Fraleigh-6] 1 2 Fraleigh 1994 , p. 169

[7] Joshi 1989 , p. 323

[8] Rotman 2006 , p. 155

[9] Burton 1988 , pp. 128, 135

[Jacobson-10] 1 2 Jacobson 2009 , p. 52

[11] Miller 2012 , p. 24 footnote

[12] The transpose matrix is used so that the vectors can be written as row vectors.

[13] Rotman 2006 , p. 423

[14] Scott 1987 , p. 19

[Hall-15] 1 2 Hall 1959 , pp. 14–15

[16] Seitz, Gary M. (1998), "Double Cosets in Algebraic Groups", in Carter, R.W.; Saxl, J. (eds.), Algebraic Groups and their Representation, Springer, pp. 241–257, doi:10.1007/978-94-011-5308-9_13, ISBN 978-0-7923-5292-1

[17] Duckworth, W. Ethan (2004), "Infiniteness of double coset collections in algebraic groups", Journal of Algebra, Elsevier, 273 (2): 718–733, arXiv: math/0305256 , doi:10.1016/j.jalgebra.2003.08.011, S2CID 17839580

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]