Difference between revisions of "Cosets and Lagrange’s Theorem"
(Created page with "==Left and Right Cosets of Subgroups== <blockquote style="background: white; border: 1px solid black; padding: 1em;"> <td><strong>Definition:</strong> Let <span class="math-in...") |
|||
Line 30: | Line 30: | ||
<strong>e)</strong> <span class="math-inline"><math>g_1^{-1}g_2 \in H</math></span>.</td> | <strong>e)</strong> <span class="math-inline"><math>g_1^{-1}g_2 \in H</math></span>.</td> | ||
</blockquote> | </blockquote> | ||
+ | |||
+ | ==The Set of Left (Right) Cosets of a Subgroup Partitions the Whole Group== | ||
+ | <p>Recall that if <span class="math-inline"><math>(G, \cdot)</math></span> is a group, <span class="math-inline"><math>(H, \cdot)</math></span> is a subgroup, and <span class="math-inline"><math>g \in G</math></span> then the left coset of <span class="math-inline"><math>H</math></span> with representative <span class="math-inline"><math>g</math></span> is the set:</p> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad gH = \{ gh : h \in H \} \end{align}</math></div> | ||
+ | <p>The right coset of <span class="math-inline"><math>H</math></span> with representative <span class="math-inline"><math>g</math></span> is the set:</p> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad Hg = \{ hg : h \in H \} \end{align}</math></div> | ||
+ | <p>We will now look at a nice theorem which tells us that the set of all left cosets of a subgroup <span class="math-inline"><math>(H, \cdot)</math></span> actually partitions <span class="math-inline"><math>(G, \cdot)</math></span>. The proof below can be mirrored to analogously show that the set of all right cosets of a subgroup <span class="math-inline"><math>(H, \cdot)</math></span> also partitions <span class="math-inline"><math>(G, \cdot)</math></span>.</p> | ||
+ | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | ||
+ | <td><strong>Theorem 1:</strong> Let <span class="math-inline"><math>(G, \cdot)</math></span> be a group and let <span class="math-inline"><math>(H, \cdot)</math></span> a subgroup. Then the set of all left cosets of <span class="math-inline"><math>(H, \cdot)</math></span> partitions <span class="math-inline"><math>(G, \cdot)</math></span>.</td> | ||
+ | </blockquote> | ||
+ | <p><em>Recall that a partition of a set <span class="math-inline"><math>A</math></span> is a collection of nonempty subsets of <span class="math-inline"><math>A</math></span> that are pairwise disjoint and whose union is all of <span class="math-inline"><math>A</math></span>.</em></p> | ||
+ | <ul> | ||
+ | <li><strong>Proof:</strong> We first show that any two distinct left cosets of <span class="math-inline"><math>H</math></span> are disjoint. Let <span class="math-inline"><math>g_1, g_2 \in G</math></span>, <span class="math-inline"><math>g_1 \neq g_2</math></span> and assume the left cosets <span class="math-inline"><math>g_1H</math></span> and <span class="math-inline"><math>g_2H</math></span> are distinct. Suppose that <span class="math-inline"><math>g_1H \cap g_2H \neq \emptyset</math></span>. Then there exists an <span class="math-inline"><math>x \in g_1H \cap g_2H</math></span>. So <span class="math-inline"><math>x \in g_1H</math></span> and <span class="math-inline"><math>x \in g_2H</math></span> and there exists <span class="math-inline"><math>h_1, h_2 \in H</math></span> such that:</li> | ||
+ | </ul> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad x = g_1h_1 \quad (*) \end{align}</math></div> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad x = g_2h_2 \quad (**) \end{align}</math></div> | ||
+ | <ul> | ||
+ | <li>So using <span class="math-inline"><math>(*)</math></span> and <span class="math-inline"><math>(**)</math></span> we see that <span class="math-inline"><math>g_1h_1 = g_2h_2</math></span>. So <span class="math-inline"><math>g_1 = g_2h_2h_1^{-1}</math></span>. But <span class="math-inline"><math>h_2h_1^{-1} \in H</math></span> since <span class="math-inline"><math>(H, \cdot)</math></span> is a group and is hence closed under <span class="math-inline"><math>\cdot</math></span>. So <span class="math-inline"><math>g_1 \in g_2H</math></span>. But this means that <span class="math-inline"><math>g_1H = g_2H</math></span>, a contradiction since <span class="math-inline"><math>g_1H</math></span> and <span class="math-inline"><math>g_2H</math></span> distinct. So the assumption that <span class="math-inline"><math>g_1H \cap g_2H \neq \emptyset</math></span> was false. So:</li> | ||
+ | </ul> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad g_1H \cap g_2H = \emptyset \end{align}</math></div> | ||
+ | <ul> | ||
+ | <li>Now if <span class="math-inline"><math>i</math></span> is the identity element for <span class="math-inline"><math>(G, \cdot)</math></span> then <span class="math-inline"><math>i \in H</math></span> since <span class="math-inline"><math>(H, \cdot)</math></span> is a subgroup and must contain the identity element. So <span class="math-inline"><math>g = gi \in gH</math></span> for all <span class="math-inline"><math>g \in G</math></span>. So:</li> | ||
+ | </ul> | ||
+ | <div style="text-align: center;"><math>\begin{align} \quad G = \bigcup_{g \in G} gH \end{align}</math></div> | ||
+ | <ul> | ||
+ | <li>Therefore the left cosets of <span class="math-inline"><math>(H, \cdot)</math></span> partition <span class="math-inline"><math>(G, \cdot)</math></span>.</li> | ||
+ | </ul> | ||
+ | |||
== Licensing == | == Licensing == | ||
Content obtained and/or adapted from: | Content obtained and/or adapted from: | ||
* [http://mathonline.wikidot.com/left-and-right-cosets-of-subgroups Left and Right Cosets of Subgroups, mathonline.wikidot.com] under a CC BY-SA license | * [http://mathonline.wikidot.com/left-and-right-cosets-of-subgroups Left and Right Cosets of Subgroups, mathonline.wikidot.com] under a CC BY-SA license |
Revision as of 15:01, 17 November 2021
Left and Right Cosets of Subgroups
Definition: Let be a group and let be a subgroup. Let . Then the Left Coset of with Representative is the set . The Right Coset of with Representative is the set .
When the operation symbol “” is used instead of we often denote the left and right cosets of with representation with the notation and respectively.
For example, consider the group and the subgroup . Consider the element . Then the left coset of with representative is:
And the right coset of with representative is:
In this particular example we see that . But in general, is for a given subgroup of and for ? The answer is NO. There are many examples when left cosets are not equal to corresponding right cosets.
To illustrate this, consider the symmetric group . Let . Then is a subgroup of since , is closed under , and , (since is a transposition). Now consider the element . Then the left coset of with representative is:
And the right coset of with representative is:
We note that and so !
So, when exactly are the left and right cosets of a subgroup with representative equal? The following theorem gives us a simple criterion for a large class of groups.
Proposition 1: Let be a group and let be a subgroup. If is abelian then for all , .
- Proof: Let . If is abelian then for all (and hence for all ) we have that . So:
Proposition 2: Let be a group, a subgroup, and . Then the following statements are equivalent:
a) .
b) .
c) .
d) .
e) .
The Set of Left (Right) Cosets of a Subgroup Partitions the Whole Group
Recall that if is a group, is a subgroup, and then the left coset of with representative is the set:
The right coset of with representative is the set:
We will now look at a nice theorem which tells us that the set of all left cosets of a subgroup actually partitions . The proof below can be mirrored to analogously show that the set of all right cosets of a subgroup also partitions .
Theorem 1: Let be a group and let a subgroup. Then the set of all left cosets of partitions .
Recall that a partition of a set is a collection of nonempty subsets of that are pairwise disjoint and whose union is all of .
- Proof: We first show that any two distinct left cosets of are disjoint. Let , and assume the left cosets and are distinct. Suppose that . Then there exists an . So and and there exists such that:
- So using and we see that . So . But since is a group and is hence closed under . So . But this means that , a contradiction since and distinct. So the assumption that was false. So:
- Now if is the identity element for then since is a subgroup and must contain the identity element. So for all . So:
- Therefore the left cosets of partition .
Licensing
Content obtained and/or adapted from:
- Left and Right Cosets of Subgroups, mathonline.wikidot.com under a CC BY-SA license