Chapter 1 Flashcards
Definition 1.1. A group is a set G together with a binary operation (de- noted as multiplication) such that the following axioms hold:
Closure: G is closed for the operation: x, y ∈ G =⇒ xy ∈ G;
Associativity: (xy)z = x(yz) for all x, y, z ∈ G;
Identity: there exists an element e ∈ G (called the identity of G) such that xe = ex = x for all x ∈ G;
Inverses: for every element x ∈ G there exists an element x−1 ∈ G (called the inverse of x) such that xx−1 = x−1x = e.
Theorem 1.2. The following statements are true for any group G.
(i) (a^m)(a^n)=
(ii)(a^m)^n=
…(There are 7 in total)
a^(n+m), for all a∈G and all m,n∈Z
a^(mn), for al la∈G and all m,n∈Z
(iii) The identity element e is unique.
(iv) The inverse of any element is unique.
(v) (a^(−1))^(−1) =a for all a∈G.
(vi) (ab)^(-1) = b^(-1)a^(−1) for all a, b ∈ G.
(vii) The cancellativity laws hold:
for all a,x,y ∈ G.
ax = ay ⇒ x = y xa = ya ⇒ x = y
The order of a group G (denoted by |G|) is…
The number of elements of G.
Definition 1.4. Let G be a group. Two elements x, y ∈ G are said to commute if…
If all pairs of elements x,y ∈ G commute, G is said to be
xy=yx
Abelian
Let G be a group. Two elements x, y ∈ G are said to be conjugate if
y = a^(-1)xa, for some a ∈ G; this will sometimes be denoted x ∼ y.
Definition 1.6. Two groups G and H are said to be isomorphic (G ∼= H) if…
What kind of relation is this???
There is a bijection f : G −→ H, which agrees with their structures, in the sense that
f(xy) = f(x)f(y),
for all x, y ∈ G. Any such mapping is called an isomorphism.
An equivalence relation.
The sets Z of integers, Q of rationals, R of reals, and C of complex numbers all form…
abelian groups under addition.
Also the set
Zn ={0,1,…,n−1}
under addition modulo n forms a group.
if 0 is removed from the sets Q, R, C, then
They form multiplicative data.
The set Zn{0} is a multiplicative group if and only if
n is a prime
A permutation on X is
a bijection from X onto X
The set of all permutations of X is denoted
S_X
SX is a group; it is usually called the symmetric group on X. Its operation is…
Composition of mappings.
Assume that X = {1, . . . , n}. Then the order of SX is…
n!
Two cycles are disjoint if…
no element is moved by both of them; disjoint cycles commute.
It is well known that every permutation from Sn can be written as a product of disjoint cycles, and that this decom- position is unique up to the order of factors
A cycle of length 2 is called
a transposition.
Note that every cycle can be
written as a product of transpositions
However this product is NOT unique