2_5433995835534761618-Copy
2_5433995835534761618-Copy
Chapter 4
4.1 Cosets
In this section, we partition a group into disjoint union of non-empty sets with the help of a
given subgroup such that each member of the partition contains the same number of elements
as the subgroup. After that, we prove that the order of a finite subgroup divides the order of
the finite group.
Definition 4.1: Let < 𝐺,∗> be a group and 𝐻 be a subgroup of 𝐺. For each 𝑎 ∈ 𝐺 the sets
𝑎 ∗ 𝐻 = {𝑎 ∗ ℎ |ℎ ∈ 𝐻} and 𝐻 ∗ 𝑎 = {ℎ ∗ 𝑎 |ℎ ∈ 𝐻}
Remark 4.1: If the group operation of a group 𝐺 is additively, then a left coset of 𝐻 in 𝐺 and
a right coset of 𝐻 in 𝐺 should be written, respectively, as
𝑎 + 𝐻 = {𝑎 + ℎ ∶ ℎ ∈ 𝐻 } and 𝐻 + 𝑎 = {ℎ + 𝑎 ∶ ℎ ∈ 𝐻}
In general, we have 𝑎 ∗ 𝐻 ≠ 𝐻 ∗ 𝑎.
Example 1: Let 𝐻 = {0̅, 2̅, 4̅} be a subgroup of a group < 𝑍6 , +6 >. Then find all left and right
cosets of 𝐻 in 𝑍6 .
52
Chapter 4: Normal Subgroups and Quotient Groups
Clearly, 0̅ +6 𝐻 = 2̅ +6 𝐻 = 4̅ +6 𝐻 = 𝐻 and 1̅ +6 𝐻 = 3̅ +6 𝐻 = 5̅ +6 𝐻.
Example 2: Consider the group < 𝑍6 , +6 > and the subgroup 𝐻 = {0,3} of 𝑍6 . Determine all
right cosets of 𝐻 in 𝑍6 .
Solution: Exercise.
Example 3: Let 𝐻 = {1̅, 2̅, 4̅} be a subgroup of a group < 𝑍7 \{0}, •7 >. Then find all left
cosets of 𝐻 in 𝑍7 \{0}.
Clearly, 1̅ •7 𝐻 = 2̅ •7 𝐻 = 4̅ •7 𝐻 = 𝐻 and 3̅ •7 𝐻 = 5̅ •7 𝐻 = 6̅ •7 𝐻.
Proposition 4.1: Let < 𝐺,∗> be a group, let 𝐻 ≤ 𝐺 and let 𝑎, 𝑏 ∈ 𝐺. Then
1. 𝑎 ∈ 𝑎 ∗ 𝐻;
2. 𝑎 ∗ 𝐻 = 𝐻 = 𝐻 ∗ 𝑎 if and only if 𝑎 ∈ 𝐻;
3. 𝑎 ∗ 𝐻 ≠ 𝐻 and 𝑎 ∗ 𝐻 ∩ 𝐻 = ∅ if and only if 𝑎 ∉ 𝐻;
4. |𝑎 ∗ 𝐻 | = |𝐻 ∗ 𝑎| = |𝐻 |;
5. 𝑏 ∗ 𝐻 = 𝑎 ∗ 𝐻 if and only if 𝑏 ∈ 𝑎 ∗ 𝐻;
6. 𝑏 ∗ 𝐻 = 𝑎 ∗ 𝐻 if and only if 𝑏 −1 ∗ 𝑎 ∈ 𝐻;
|𝐺|
7. The number of different left (or right) cosets of 𝐻 in 𝐺 is equal to |𝐻| ;
8. 𝑏 ∗ 𝐻 = 𝑎 ∗ 𝐻 or (𝑏 ∗ 𝐻 ) ∩ (𝑎 ∗ 𝐻 ) = ∅. ∎
Theorem 4.2: If 𝐻 is any subgroup of a group 𝐺, then the union of all the distinct left (or right)
cosets of 𝐻 in 𝐺 is equal to 𝐺, i.e.
⋃ 𝑎 ∗ 𝐻 = ⋃ 𝐻 ∗ 𝑎 = 𝐺. ∎
∀𝑎∈𝐺 ∀𝑎∈𝐺
|𝐺 |
[𝐺: 𝐻 ] = .
|𝐻 |
|𝑍7 \{0}| 6
That is, [𝑍7 \{0}: 𝐻 ] = = = 2.
|𝐻| 3
54
Chapter 4: Normal Subgroups and Quotient Groups
Theorem 4.3 (Lagrange’s Theorem) The order of any subgroup 𝐻 of a finite group < 𝐺,∗>
is divides the order of the group 𝐺.
|𝐺 | = |𝐻 | • [𝐺: 𝐻 ].
⟹ |𝑎1 ∗ 𝐻 ⋃ 𝑎2 ∗ 𝐻 ∪ … ∪ 𝑎𝑟 ∗ 𝐻 | = |𝐺 |
⟹⏟
𝑘 + 𝑘 + ⋯ + 𝑘 = 𝑚.
𝑟−𝑡𝑖𝑚𝑒𝑠
⟹ 𝑘𝑟 = 𝑚.
Example: If 𝐻 = {2ℤ} be a subgroup of a group < ℤ, +>, then find all left cosets of 𝐻 in ℤ.
𝑎 + 𝐻 = {𝑎 + ℎ: ℎ ∈ 𝐻}.
0 + 2ℤ = ∓2 + 2ℤ = ∓4 + 2ℤ = ⋯ = 2ℤ = 𝐻. {By Proposition 4.1 (2)}
1 + 2ℤ = {… , −5, −3, −1, 1, 3, 5, 7, … } = {∓1, ∓3, ∓5, ∓7, … }
3 + 2ℤ = {… , −3, −1, 1, 3, 5, 7, 9, … } = {∓1, ∓3, ∓5, ∓7, … }
55
Chapter 4: Normal Subgroups and Quotient Groups
Definition 4.3: (Normal Subgroup) Let 𝐻 be a subgroup of a group < 𝐺,∗>. Then 𝐻 is said
to be a normal subgroup of 𝐺 (or that 𝐻 is normal in 𝐺) if
𝐻 ∗ 𝑎 = 𝑎 ∗ 𝐻; ∀𝑎 ∈ 𝐺.
I.e. 𝑎−1 ∗ 𝐻 ∗ 𝑎 = 𝐻.
Example: Let 𝐺 be a group with identity 𝑒. Then it is obvious that both {e} and 𝐺 are normal
subgroups of 𝐺and called trivial normal subgroups of 𝐺.
Definition 4.4: (Simple Group) A group < 𝐺,∗> is said to be a simple group, if it has only
the trivial normal subgroups.
For Examples:
1. The subgroup 𝐻 = {0̅, 2̅, 4̅} of a group < 𝑍6 , +6 > is a normal subgroup becouse
𝑎+6 𝐻 = 𝐻+6 𝑎, ∀𝑎 ∈ 𝑍6 .
56
Chapter 4: Normal Subgroups and Quotient Groups
𝑎 + 𝐻 = 𝐻 + 𝑎, ∀𝑎 ∈ ℤ.
Theorem 4.4: An abelian group 𝐺 is a simple group if and only if 𝐺 ≅ 𝑍𝑝 for some prime 𝑝. ∎
𝑔𝐻 = {𝑔ℎ: ℎ ∈ 𝐻 }.
⟹ 𝐻 ⊴ 𝐺. ∎
Theorem 4.6: Let 𝐺 be a group and 𝐻 be a subgroup of 𝐺 with index 2. Then 𝐻 is a normal
subgroup of 𝐺.
Proof: Since [𝐺: 𝐻 ] = 2, then 𝐻 has only two different left (right) cosets.
Let 𝑥 ∈ 𝐺 ⟹ either 𝑥 ∈ 𝐻 𝑜𝑟 𝑥 ∉ 𝐻.
If 𝑥 ∈ 𝐻 ⟹ 𝑥𝐻 = 𝐻𝑥 = 𝐻 ⟹ 𝐻 is a normal subgroup of 𝐺.
𝐺 = 𝐻 ∪ 𝐻𝑥 𝐻 ∩ 𝐻𝑥 = 𝜑 and
𝐺 = 𝐻 ∪ 𝑥𝐻; 𝐻 ∩ 𝑥𝐻 = 𝜑.
⟹ 𝐻 is a normal subgroup of 𝐺. ∎
57