1.4 Cosets and Lagrange’s Theorem
Definition 1.4.1. Let \(H\) be a subgroup of \(G\). Define \(aH = \{ah|\, h\in H\}\) and \(Ha = \{ha|\, h\in H\}\) for \(a\in G\). The set \(aH\) is called the left coset of \(H\)
in \(G\). \(Ha\) is called the right coset of \(H\) is \(G\).
Note. If the group operation is addition, then the left coset is \(a + H\) and the right coset is \(H + a\).
Note. Every element of the group is in \(aH\). (every element of a group can be represented by \(aH\)).
Solution.
\(S_3 = \{(1)\, ,\, (1\,2)\, , \, (1\, 3)\,,\, (2\,3)\,,\, (1\,2\,3)\,,\,(1\,3\,2)\}\).
Let cosets are all \(aH = \{ah:\, a\in S_n\) and \(h\in H\}\)
- 1.
- \(a = (1) H = \{(1)\,,\,(1\,3)\} = H\)
- 2.
- \(a = (1\,2) \implies \, (1\,2)H = \{(1\,2)\, , \, (1\,3\,2)\}\)
- 3.
- \((1\,3)H = \{(1\,3)\, ,\, (1)\} = H \hspace {1cm} a = (1\,3)\)
- 4.
- \((2\, 3)H = \{(2\, 3)\, , \, (1\, 2\, 3)\} \hspace {1cm} a = (2\, 3)\)
- 5.
- \((1\, 2\,3)H = \{(1\, 2\, 3)\, , \, (2\, 3)\}\hspace {1cm} a = (1\, 2\, 3)\)
- 6.
- \((1\, 3\, 2)H = \{(1\, 3\, 2)\, ,\, (1\, 2)\}\)
\[ 1 = 3\hspace {1cm} 2 = 6\hspace {1cm} 4 = 5\]
Note that there are only three distinct cosets of \(H\) in \(G\), since \begin {align*} (1) H & = (1\, 3)H\\ (1\, 2)H & = (1\, 3\,2)H\\ (2\,3)H & = (1\, 2\, 3)H\\\\ \end {align*}
Exercise 1.4.3. Let \(\, G = \mathbb {Z}_9\, , \, \, H = \mathbb {Z}_{9/3} \cong \, 3\mathbb {Z}_3\)
Find all the left cosets of \(H\) in \(G\).
Solution. \(\mathbb {Z}_9 = \{0, \, 1,\, 2,\, 3,\, 4,\, 5,\, 6, \, 7,\, 8\}\)
\(\mathbb {Z}_{9/3} = \{0,\, 3,\, 6\}\)
The left cosets are all \(a + H\) such that \(\, a\in \mathbb {Z}_9\)
\((1)\hspace {0.5cm}0 + H = \hspace {0.3cm}\)
| \((2)\hspace {0.5cm} 1 + H = \hspace {0.3cm} \)
|
||||||||||||||||||||||||||
\((3)\hspace {0.5cm} 2 + H = \hspace {0.3cm}\)
| \((4)\hspace {0.5cm} 3 + H= \hspace {0.3cm}\)
|
||||||||||||||||||||||||||
\((5)\hspace {0.5cm} 4 + H = \hspace {0.3cm}\)
| \((6)\hspace {0.5cm} 5 + H = \hspace {0.3cm}\)
|
||||||||||||||||||||||||||
\((7)\hspace {0.5cm} 6 + H = \hspace {0.3cm}\)
| \((8) \hspace {0.5cm} 7 + H =\hspace {0.3cm}\)
|
||||||||||||||||||||||||||
\((9)\hspace {0.5cm} 8 + H = \hspace {0.3cm}\)
|
| \(- (1)\hspace {0.6cm} 0 + H = \{0\, , \, 3\, , \, 6\}\) | \((2)\hspace {0.6cm} 1 + H = \{1\, , \, 4\, ,\, 7\}\) | ||
| \(\checkmark \, (3)\hspace {0.6cm} 2 + H = \{2\,, \, 5\, , \, 8\}\) | \((4)\hspace {0.6cm} 3 + H = \{3\, , \, 6\, , \, 0\}\) | ||
| \((5)\hspace {0.6cm} 4 + H = \{4\, , \, 7\, , \, 1\}\) | \((6)\hspace {0.6cm} 5 + H = \{5\, , \, 8\, ,\, 2\}\) | ||
| \(-\,(7)\hspace {0.6cm} 6 + H = \{6\, , \, 0\, , \, 8\}\) | \(\cancel {(8)\hspace {0.6cm} 7 + H = \{7\, , \, 1\, , \, 4\}}\) | ||
| \(\checkmark \,(9)\hspace {0.6cm} 8 + H = \{8\, , \, 2\, , \, 5\}\) |
Definition 1.4.4. Given a group \(G\), the number of elements in \(G\) denoted as \(\begin {vmatrix} G\\ \end {vmatrix}\) is called order of \(G\).
Definition 1.4.5. The order of an element \(g\in G\) is the least positive integer \(n\) such that \(g^n = e\).
\(\underbrace {\text {e.g the order}\hspace {0.3cm} g(1) = 1\, , \, (1\,2) = 2\,\, \, (1\, 2\, 3) = 3\hspace {0.3cm} \text {since}\hspace {0.3cm}(1)^1 = e\,\, \, (1\,2)^2 = e\hspace {0.3cm}\text {and}\hspace {0.3cm}(1\, 2\, 3) = e}_{\textit {By nemwine}}\)
Note. In case there is no such \(n\), then we say \(g\) is of infinite order. e.g integers \(\mathbb {Z}\) with addition, \(3\in \mathbb {Z}\) is
of infinite order, but in \(\mathbb {Z}_5, \, \, 3\) is of order 2. \(\,\) i.e \(3^2 = 3 + 5 = 6 = 0\).
Definition 1.4.6. In a group \(G\), all elements \(g\in G\) such that \(g^2 = e\) are called torsion elements.
E.g(by nemwine)
\(1\cdot (1\,2)\in S_n\hspace {0.5cm} n\geq 2\) is a torsion element since \((1\, 2)^2 = e\).
\(2\cdot 3 \in \mathbb {Z}_6\) is a torsion element since \(3^2 = 3 + 3 = 6 = 0\).
Theorem 1.4.7. Let \(H\) be a subgroup of \(G\). Let \(a\, , \, b\in G\), then
- (i)
- \(a H = b H\) if and only if \(b^{-1}a\in H\). In particular \(aH = H\) if and only if \(a\in H\).
- (ii)
- If \(a H\cap bH \neq \emptyset \), then \(a H = b H\).
- (iii)
- \(\begin {vmatrix} a H\\ \end {vmatrix} = \begin {vmatrix} H\\ \end {vmatrix}\,\) “where \(\begin {vmatrix} \cdot \\ \end {vmatrix} \implies \) number of elements”
Proof.
- (i)
- Assume \(a H = b H\), then we show that \(b^{-1}a\in H\) and assume \(b^{-1}aH\) and then show that \(aH = bH\).
Suppose \(a H = b H\), then \(ah_1 = bh_2\) for some \(h_1\, , \, h_2\in H\). Then \(a = bh_2h^{-1}_1 = bh_0\) where \(h_0 = h_2h^{-1}_1\in H\). Since \(a = bh_0\), then \(b^{-1}a = h_0\in H\).
Conversely, suppose \(b^{-1}a\in H\), we need to show that \(a H = b H\). We have that \(b^{-1}a\in H\) implies that \(a = bh_0\) for some \(h_0\in H\). If \(x\in aH\), then \(x = ah = bh_0\in bH\implies aH \subset bH\cdots \cdots (*)\). If \(y\in H\), then \(y = bh\implies y = ah^{-1}_0h\in aH\). (Since \(a = bh_0\)
\(\implies b = ah_0^{-1}).\, \implies bH\subset aH\cdots \cdots (**)\).
By \((*)\) and \((**),\, \, aH = bH\).
- (ii)
- If \(x\in aH \cap bH\), then \(x\in aH\) and \(x\in bH. \implies x = ah_1\), and \(x = bh_2\implies (ah_1 = bh_2)\) for some \(h_1\, , \, h_2\in H\). We get \(ah_1 = bh_2\implies b^{-1}a = h_2h_1^{-1}\in H\). So by (i) \(\, aH = bH\).
- (iii)
- To show that \(\begin {vmatrix} aH\\ \end {vmatrix} = \begin {vmatrix} H\\ \end {vmatrix}\), we need a bijection \(f: \, H \longrightarrow aH\). For each \(h\in H\), define \(f(h) \implies ah\). We need to show that \(f\) as defined is
one-one and onto. Suppose
\(f(h_1) = f(h_2)\) in \(aH\). \begin {align*} \implies \, & ah_1 = ah_2\\ \implies \, & a^{-1}ah_1 = a^{-1}ah_2\\ \implies \, & h_1 = h_2\hspace {0.5cm} \text {Hence one-one} \end {align*}Now for each element \(y\in aH\), there must be some \(h'\in H\) such that \(y = ah'\). Thus \(f(h') = ah' = y\). Hence we have that for onto. So that \(f\) is a bijection. We have \(\begin {vmatrix} aH\\ \end {vmatrix} = \begin {vmatrix} H\\ \end {vmatrix}\).
Note. The left cosets of \(H\) in \(G\) are either disjoint or equal. Hence the cosets \(aH\) for \(a\in G\) partition the
group into a collection of non-empty pair wise disjoint subsets of \(G\).
Questions on this section
Stuck on something here? Ask below and it stays attached to this topic.