Changes

Jump to: navigation, search

Left cosets partition a group

1,401 bytes added, 00:07, 4 July 2011
Proof in form (4)
# The left cosets of <math>H</math>, namely <math>gH, g \in G</math>, form a partition of the group <math>G</math>. In other words, <math>G</math> is a disjoint union of left cosets of <math>H</math>.
# The relation <math>a \sim b \iff a \in bH</math> is an equivalence relation on <math>G</math>
# For every <math>g \in G</math>, there is ''exactly'' one left coset of <math>H</math> in <math>G</math> containing <math>g</math>.
# If <math>aH</math> and <math>bH</math> are left cosets of <math>H</math> in <math>G</math>, then either <math>aH = bH</math> or <math>aH \cap bH</math> is empty.
==Equivalence of statements==
These statements are equivalent because of the following general fact about sets and equivalence relations. If <math>S</math> is a set, and <math>\sim</math> is an equivalence relation on <math>S</math>, then we can partition <math>S</math> as a disjoint union of ''equivalence classes'' under <math>\! \sim</math>. Two elements <math>a</math> and <math>b</math> are defined to be in the same equivalence class under <math>\! \sim</math> if <math>\! a \sim b</math>.
Conversely, if <math>S</math> is partitioned as a disjoint union of subsets, then the relation of being in the same subset is an equivalence relation on <math>S</math>.
Let <math>G</math> be a group, <math>H</math> be a subgroup.
For <math>a,b \in G</math>, we say that <math>a</math> is in the left coset of <math>b</math> with respect to <math>H</math> if there exists <math>h \in H</math> such that <math>a = bh</math>.<section end=beginner/><section begin=revisit/> ==Related facts== ===Converse=== A partial converse to this result is true. If <math>H</math> is a subset of <math>G</math> ''containing the identity element'' with the property that the set of all left translates of <math>H</math>, i.e. the set of subsets <math>gH</matH>, form a partition of <math>G</math>, then <math>H</math> is a subgroup of <math>G</math>. {{further|[[Subset containing identity whose left translates partition the group is a subgroup]]}} ===Analogues in other algebraic structures=== The proof that the left cosets of a subgroup partition the group uses all the properties of groups: the existence of identity element is used to prove reflexivity, the existence of inverses (along with associativity and the identity element) was used to prove symmetry, and associativity is used to prove transitivity. Hence, extending the result to algebraic structures ''weaker'' than groups is in general hard. There are, however, some ways of extending. {| class="wikitable" border="1"! Statement !! Analogue of [[group]] !! Analogue of subgroup !! Comment|-| [[Left cosets of a subgroup partition a monoid]] || [[monoid]] (associative, identity element, not necessarily any inverses) || submonoid that is in fact a group || We do not require the ''bigger structure'' to be a group. All we need is associativity in the bigger structure. Thus, the left cosets of a ''subgroup'' in a monoid, still partition it. (Note that we still do require ''associativity'' in the bigger structure).|} ===Relation with right cosets and normal subgroups=== * [[Right cosets partition a group]]: The proof of this is analogous to that for left cosets.* [[Left cosets are in bijection via left multiplication]]: In particular, any two left cosets of a subgroup have the same size as the subgroup.* [[Equivalence of definitions of coset]]: A subset of a group occurs as the left coset of a subgroup if and only if it occurs as the right coset of a subgroup.* For a [[normal subgroup]], the set of left cosets coincides with the set of right cosets, and this set can be given the structure of a group called the [[quotient group]]. Any homomorphism of groups is obtained by composing the quotient map to a quotient group with an injection: see [[normal subgroup equals kernel of homomorphism]] and [[first isomorphism theorem]]. ===Other related facts=== * [[Lattice of subgroups embeds in partition lattice]]: As we see here, every subgroup gives rise to a partition of the group (namely, the partition into left cosets). This gives a function from the [[lattice of subgroups]] of a group to the partition lattice of the group. It turns out that this map is a lattice embedding, i.e., it preserves the lattice operations. <section end=revisit/><section begin=beginner/> 
==Proof in form (2)==
===Reflexivity===
'''To prove''': For any <math>a \in G</math>, <math>\! a \sim a</math>.
'''Proof''': Clearly <math>e \in H</math> (since <math>H</math> is a subgroup). Hence, for any <math>a \in G</math>, <math>a = ae</math>, so <math>\! a \sim a</math>: <math>a</math> is in its own left coset.
===Symmetry===
'''To prove''': For any <math>a,b \in G</math> such that <math>\! a \sim b</math>, we have <math>\! b \sim a</math>.
'''Proof''': If <math>a = bh</math>, for some <math>h \in H</math>, then <math>b = ah^{-1}</math>. Since <math>h \in H</math> and <math>H</math> is a subgroup, <math>h^{-1} \in H</math>. Thus, if <math>a</math> is in the left coset of <math>b</math>, then <math>b</math> is in the left coset of <math>a</math>. In symbols, <math>a \sim b \implies b \sim a</math>.
===Transitivity===
'''To prove''': If <math>a,b,c \in G</math> are such that <math>\! a \sim b</math>, and <math>\! b \sim c</math>, then <math>a \sim c</math>
'''Proof''': If <math>a = bh</math>, and <math>b = ck</math>, for <math>h, k \in H</math>, and <math>a = ckh</math>. Since <math>H</math> is a subgroup, <math>h,k \in H \implies kh \in H</math>, so <math>a</math> is in the left coset of <math>c</math>.
For this, suppose <math>c \in aH \cap bH</math>. Then, there exist <math>h_1,h_2</math> such that <math>ah_1 = bh_2 = c</math>. Thus, <math>b = ah_1h_2^{-1} \in aH</math> and <math>a = bh_2h_1^{-1} \in bH</math>.
Now, for any element <math>ah \in aH</math>, we have <math>ah = bh_2h_1^{-1}h \in bH</math>, and similarly, for every element <math>bh \in bH</math>, we have <math>bh = ah_1h_2^{-21}h \in aH</math>. Thus, <math>aH \subset subseteq bH</math> and <math>bH \subset subseteq aH</math>, so <math>aH = bH</math>.
<section end=beginner/>
<section begin=revisit/>
 
==Converse==
 
A partial converse to this result is true. If <math>H</math> is a subset of <math>G</math> ''containing the identity element'' with the property that the set of all left translates of <math>H</math>, i.e. the set of subsets <math>gH</matH>, form a partition of <math>G</math>, then <math>H</math> is a subgroup of <math>G</math>.
 
{{further|[[Subset containing identity whose left translates partition the group is a subgroup]]}}
==Other proofs==
The only left congruences on a group are those that arise as partitions in terms of left cosets of a subgroup.
<section end=revisit/>
==In other algebraic structures==
 
We observed that the proof that the left cosets of a subgroup partition the group used all the properties of groups: the existence of identity element was used to prove reflexivity, the existence of inverses (along with associativity and the identity element) was used to prove symmetry, and associativity was used to prove transitivity. Hence, extending the result to algebraic structures ''weaker'' than groups is in general hard. There are, however, some ways of extending.
 
* [[Left cosets of a subgroup partition a monoid]]: We do not require the ''bigger structure'' to be a group. All we need is associativity in the bigger structure. Thus, the left cosets of a ''subgroup'' in a monoid, still partition it. (Note that we still do require ''associativity'' in the bigger structure).
* [[Left cosets of a cyclic subgroup partition an alternative loop]]: An [[alternative loop]] is an [[algebra loop]] where any two elements generate a subgroup. It turns out that in an alternative loop, the left cosets of any cyclic subgroup give a partition.
<section end=revisit/>
==References==
===Textbook references===
* {{booklink-proved|DummitFoote}}, Proposition 4, Page 80
Bureaucrats, emailconfirmed, Administrators
38,910
edits

Navigation menu