E1 - introduction to cosets
introduction
- consider a group
, with a non-empty subset - for any
, the set is denoted by , and analogously, and - when
is a subgroup of , is called the left coset, and the right coset of in containing
-
is called the coset representative of (or ) -
is used to denote the number of elements in -
eg:
and , then the left cosets of in are:
- cosets group together elements of
inro equal-sized blocks - here,
and , so there are left cosets, each with two elements
example: finding cosets
- to find the cosets of
in - the first coset is
- for the second, choose an element
, eg: 3, so - for the next, chose another element that have not appeared in the previous two cosets, so
- and similarly, all elements from
that have not appeared in previous cosets can be picked as representatives until is exhausted
properties
-
let
be a subgroup of , and let , ie. absorbs an element if and only if the element belongs to and or , ie. two left cosets of are either identical or disjoint, and any element of a left coset can be used to represent the coset , ie. all left cosets of have the same size is a subgroup of if and only if
-
properties 1, 5 and 7 guarantee that the left cosets of
partition into blocks of equal size -
cosets allow organisation of group elements in a coherent way with every element sharing a special property
-
is often chosen such that the cosets partition the group in some highly desirable way -
eg: if
is a 3-space , and is a plane through the origin, then the coset (component-wise addition) is the plane passing through , parallel to -
cosets of
constitute a partition of into planes parallel to -
if
and , then for any , is the set of all matrices with the same determinant as