Algebra - Midterm I Flashcards
group + 5 properties
(1) associativity
(ab) c = a(bc)
(2) identity element
(3) inverses
A monoid satisfies (1) and (2)
A semigroup satisfies (1)
Properties:
- identity is unique
- inverse is unique
- (a^{-1})^{-1} = a
- (ab)^{-1} = b^{-1} a^{-1}
- a_1 a_2 … a_n is well-defined
commutative / abelian
If ab=ba for all a,b in G
examples of groups
- (Z,+)
- (Q,+), (Q*,•)
- vector spaces wrt addition
- GLn(R) = {A \in Mn(R) with det(A)≠0 }
- SLn(R) = { A \in Mn(R) with det(A) = 1 }
- SLn(Z)
- Z / nZ = Z_n
Sn, An, Dn
Sn = group of permutations on {1,2,…,n}
ie. bijections from {1,2,…,n} to itself
An = even permutations in Sn
Dn = group of symmetries on a regular n-gon
|Sn|=n!
|An| = n!/2
|Dn| = 2n
subgroup
A non-empty subset H in G such that
- g,h \in H then gh \in H
- g \in H then g^{-1} \in H
subgroup criterion: for g,h \in H then gh^{-1} \in H
subgroup generated by S
For S subset of G, the subgroup generated by S is denoted and is the smallest subgroup containing S (ie. intersection of all subgroups containing S)
It consists of all products g_1^{a_1} … g_m^{a_m} where g_i \in S and a_i \in \bZ
homomorphism
a map f:G⟹H between groups is a homomorphism if f(ab)=f(a)f(b)
f(g)=e is the trivial homomorphism
A homomorphism is called a
- monomorphism if it is injective
- epimorphism if it is onto
- isomorphism if it is bijective (ie. it has an inverse)
If ∃f:G⟹H isomorphism, we write G≅H
equivalence relation
~ is an equivalence relation if
- a~a
- a~b then b~a
- a~b and b~c then a~c
ex. for H≤G define g~h if gh^{-1} \in H
cosets
We call gH a left coset
The set of left cosets is denoted G/H
Note: the map aH↔︎Ha is not well-defined
ex. G=S_3, H=≤(12)>, then H(13) = H(132) but (13)H≠(123)H
Lagrange’s Theorem (+ 2 corollaries)
If H≤G then |H| divides |G|
Corollary 1: If |G| is prime, the only subgroups are the trivial ones
Corollary 2: If |G| is prime, then G is cyclic
index
|G/H| = [G:H]
If G is finite, [G:H] = |G| / |H|
If G>H>K
[G:K] = [G:H][H:K]
completely classify ≤g>
If all g^n are different, then ≤g> ≅≈\bZ
If not, then ker is a non-zero subgroup of \bZ. d=min(H⋂\bZ) so dZ ≈ ker(n \mapsto g^n)
Then ≤g>≈Z/dZ
Theorem (subgroups of Z)
Every subgroup of Z is of the form dZ for some d \in \bN
normal subgroup + Theorem
H≤G is normal if gH = Hg
Equivalently, g^{-1}Hg = g
We write H◁G
Theorem: If [G:H] = 2 then H◁G
conjugation
Conjugation by g∈G is the map x \mapsto g^{-1}xg
This is an isomorphism
(an isomorphism with itself is called an automorphism)
we write it as x^g = g^{-1}xg