quotient group
Before defining quotient groups, some preliminary definitions must be introduced and a few established.
Given a group G and a subgroup H of G, the http://planetmath.org/node/122relation
∼L on G defined by a∼Lb if and only
if b-1a∈H is called left congruence
modulo H; similarly the relation defined by a∼Rb if
and only if ab-1∈H is called congruence modulo H (observe that these two relations coincide if G is abelian
).
Proposition.
Left (resp. right) congruence modulo H is an equivalence relation on G.
Proof.
We will only give the proof for left congruence modulo H, as the for right congruence modulo H is analogous.
Given a∈G, because H is a subgroup, H contains the identity e of G, so that a-1a=e∈H; thus a∼La, so ∼L is http://planetmath.org/node/1644reflexive
. If b∈G satisfies a∼Lb, so that b-1a∈H, then by the of H under the formation of inverses
, a-1b=(b-1a)-1∈H, and b∼La; thus ∼L is symmetric
. Finally, if c∈G, a∼Lb, and b∼Lc, then we have b-1a,c-1b∈H, and the closure of H under the binary operation
of G gives c-1a=(c-1b)(b-1a)∈H, so that a∼Lc, from which it follows that ∼L is http://planetmath.org/node/1669transitive
, hence an equivalence relation.
∎
It follows from the preceding that G is partitioned into mutually disjoint, non-empty equivalence
classes by left (resp. right) congruence modulo H, where a,b∈G are in the same equivalence class if and only if a∼Lb (resp. a∼Rb); focusing on left congruence modulo H, if we denote by ˉa the equivalence class containing a under ∼L, we see that
ˉa={b∈G∣b∼La}={b∈G∣a-1b∈H}={b∈G∣b=ah for some h∈H}={ah∣h∈H}. |
Thus the equivalence class under ∼L containing a is simply the left coset aH of H in G. Similarly the equivalence class under ∼R containing a is the right coset Ha of H in G (when the binary operation of G is written additively, our notation for left and right cosets becomes a+H={a+h∣h∈H} and H+a={h+a∣h∈H}). Observe that the equivalence class under either ∼L or ∼R containing e is eH=H. The index of H in G, denoted by |G:H|, is
the cardinality of the set G/H (read “G modulo H” or just “G mod H”) of left cosets of H in G (in fact, one may demonstrate the existence of a bijection
between the set of left cosets of H in G and the set of right cosets of H in G, so that we may well take |G:H| to be the cardinality of the set of right cosets of H in G).
We now attempt to impose a group on G/H by taking the of the left cosets containing the elements a and b, respectively, to be the left coset containing the element ab; 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 G/H. For the of left coset to be well-defined, we must be sure that if a′H=aH and b′H=bH, i.e., if a′∈aH and b′∈bH, then a′b′H=abH, i.e., that a′b′∈abH. Precisely what must be required of the subgroup H to ensure the of the above condition is the content of the following :
Proposition.
The rule (aH,bH)↦abH gives a well-defined binary operation on G/H if and only if H is a normal subgroup
of G.
Proof.
Suppose first that of left cosets is well-defined by the given rule, i.e, that given a′∈aH and
b′∈bH, we have a′b′H=abH, and let g∈G and h∈H. Putting a=1, a′=h, and b=b′=g-1, our hypothesis gives hg-1H=eg-1H=g-1H; this implies that hg-1∈g-1H, hence that hg-1=g-1h′ for some h′∈H. on the left by g gives ghg-1=h′∈H, and because g and h were chosen arbitrarily, we may conclude that gHg-1⊆H for all g∈G, from which it follows that H⊴. 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 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 of each group 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 of integers by the cyclic subgroup generated by ; the order of is , and the distinct left cosets of the group are .
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 http://planetmath.org/node/2182presentation
) is ; the elements of the quotient are , , , , , and ; because
is non-abelian, hence must be isomorphic to .
Title | quotient group |
Canonical name | QuotientGroup |
Date of creation | 2013-03-22 12:04:06 |
Last modified on | 2013-03-22 12:04:06 |
Owner | azdbacks4234 (14155) |
Last modified by | azdbacks4234 (14155) |
Numerical id | 35 |
Author | azdbacks4234 (14155) |
Entry type | Definition |
Classification | msc 20-00 |
Synonym | factor group |
Synonym | quotient |
Related topic | Group |
Related topic | NormalSubgroup |
Related topic | Subgroup |
Related topic | EquivalenceRelation |
Related topic | Coset |
Related topic | NaturalProjection |
Defines | left congruence modulo a subgroup |
Defines | right congruence modulo a subgroup |
Defines | index |