|
|
|
|
quotient group
|
(Definition)
|
|
|
Before defining quotient groups, some preliminary definitions must be introduced and a few propositions established.
Given a group and a subgroup of , the relation on defined by if and only if
is called left congruence modulo ; similarly the relation defined by if and only if
is called right congruence modulo (observe that these two relations coincide if is abelian).
Proof. We will only give the proof for left congruence modulo  , as the argument for right congruence modulo  is analogous. Given  , because  is a subgroup, contains the identity  of  , so that
 ; thus  , so  is reflexive. If  satisfies  , so that
 , then by the closure of  under the formation of inverses,
 , and  ; thus  is symmetric. Finally, if  ,  , and  , then we have
 , and the closure of  under the binary operation of  gives
 , so that  , from which it follows that  is transitive, hence an equivalence relation. 
It follows from the preceding proposition that is partitioned into mutually disjoint, non-empty equivalence classes by left (resp. right) congruence modulo , where are in the same equivalence class if and only if (resp. ); focusing on left
congruence modulo , if we denote by the equivalence class containing under , we see that
Thus the equivalence class under containing is simply the left coset of in . Similarly the equivalence class under containing is the right coset of in (when the binary operation of is written additively, our notation for left and right cosets becomes
and
). Observe that the equivalence class under either or containing is . The index of in , denoted by
, is the cardinality of the set (read “ modulo " or just “ mod ") of left cosets of in (in fact, one may demonstrate the existence of a bijection between the set of left cosets of in and the set of right cosets of in , so that we may well take
to be the cardinality of the set of right cosets of in ).
We now attempt to impose a group on by taking the product of the left cosets containing the elements and , respectively, to be the left coset containing the element ; however, because this definition requires a choice of left coset representatives, there is no guarantee that it will yield a well-defined binary operation on . For the operation of left coset
multiplication to be well-defined, we must be sure that if
and
, i.e., if
and
, then
, i.e., that
. Precisely what must be required of the subgroup to ensure the satisfaction of the above condition is the content of the following proposition:
Proposition The rule
gives a well-defined binary operation on if and only if is a normal subgroup of .
Proof. Suppose first that multiplication of left cosets is well-defined by the given rule, i.e, that given
 and
 , we have
 , and let  and  . Putting  ,
 , and
 , our hypothesis gives
 ; this implies that
 , hence that
 for some
 . Multiplication on the left by  gives
 , and because  and  were chosen arbitrarily, we may conclude that
 for all  , from which it follows that  . Conversely, suppose  is normal in  and let
 and
 . There exist
 such that
 and
 ; now, we have
, |
|
and because
 by assumption, we see that
 , where
 by the closure of  under multiplication in  . Thus
 , and because left cosets are either disjoint or equal, we may conclude that
 , so that multiplication of left cosets is indeed a well-defined binary operation on  . 
The set , where is a normal subgroup of , is readily seen to form a group under the well-defined binary operation of left coset multiplication (the satisfaction of each group axiom follows from that of ), and is called a quotient or factor group (more specifically the quotient of by ). We conclude with several examples of specific quotient groups.
Example A standard example of a quotient group is
 , the quotient of the additive group of integers by the cyclic subgroup generated by
 ; the order of
 is  , and the distinct left cosets of the group are
 . Observe that the relation of congruence modulo
 on
 is precisely that of congruence modulo  which
Example Although the group  is not abelian, each of its subgroups its normal, so any will suffice for the formation of quotient groups; the quotient
 , where
 is the cyclic subgroup of  generated by  , is of order  , with elements
 , and
 . Since each non-identity element of
 is of order  , it is isomorphic to the Klein  -group  . Because each of
 ,
 , and
 has order  , the quotient of  by any of these subgroups is necessarily cyclic of order  .
Example The center of the dihedral group  of order  (with presentation
 ) is
 ; the elements of the quotient
 are
 ,
 ,
 ,
 ,
 , and
 ; because
, |
|
 is non-abelian, hence must be isomorphic to  .
|
"quotient group" is owned by azdbacks4234. [ full author list (5) | owner history (2) ]
|
|
(view preamble)
Cross-references: dihedral group, center, cyclic, isomorphic, order, generated by, cyclic subgroup, integers, multiplication, disjoint, implies, hypothesis, normal subgroup, well-defined, bijection, cardinality, right coset, left coset, equivalence classes, mutually disjoint, binary operation, closure, symmetric, inverses, identity, contains, equivalence relation, right, abelian, relation, congruence, subgroup, group, definitions
There are 129 references to this entry.
This is version 29 of quotient group, born on 2001-12-21, modified 2007-08-02.
Object id is 1127, canonical name is QuotientGroup.
Accessed 18395 times total.
Classification:
| AMS MSC: | 20-00 (Group theory and generalizations :: General reference works ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|