Definitions Flashcards
Group
(G, *), G non empty set G1: ¥g,h € G, h*g € G G2: ¥g,h,k € G, (gh)k =g(hk) G3: exist 1_G € G, ¥g € G, 1g=g=g1 G4: ¥g€G, exist g^-1€G s.t gg^-1=1_G=g^-1g
Subgroup
Suppose G is a group. H<=G means that if we restrict * to the elements of H then H is a group. H is a subgroup of G
Subgroup Criterion
Suppose G is a group H c= G, then H <= G <=>
i) H =! ø
ii) ¥x,y € H, xy^-1 € H
Right coset
Suppose H <= G
Let g € G
Hg = {xg | x € H}
Odd / Even permutation
Let n>=2, for σ∈S_n, say σ is an even (odd) perm if σ can be written as a product of even (odd) number of transpositions
Transposition
In S_n (α_1, α_2) is called a transposition
c(σ)
Let n>=2, let σ ∈ S_n, c(σ) is the number of cycles when we write σ as a product of pairwise disjoint cycles.
Alternating Group
Let n ∈ N, n>=2, A_n is called the set of all even permutations. A_n is called the alternating group of degree n
C_G(S)
C_G(S) = {g ∈ G | gx=xg, ∀x ∈ S}
N_G(S)
N_G(S) = {g ∈ G | s^g = s}
.< s >.
.< s >.= {x_1,x_2,…,x_m | x_i ∈ S U S^-, m ∈ N}
Z(G)
Z(G) = {g ∈ G | gx=xg ∀x∈G}
Centraliser in G of S
C_G(S) = {g ∈ G | gx=xg, ∀x ∈ S}
Centre of G
Z(G) = {g ∈ G | gx=xg ∀x∈G}
Normaliser in G of S
N_G(S) = {g ∈ G | s^g = s}
The subgroup of G generated by s
= {x_1,x_2,…,x_m | x_i ∈ S U S^-, m ∈ N}
S^g
S^g = {g^-1xg | x ∈ S}
Conjugate of S
S^g = {g^-1xg | x ∈ S}
x^G
x^G = {g^-1xg | g ∈ G}
Conjugacy class in G of x
x^G = {g^-1xg | g ∈ G} = all conjugates of x
P-Group
Let p be a prime, G be a group. G is called a p-group if |G| = p^a (a ∈ N U {0})
Cycle type of g
For g ∈ S_n, the cycle type of g is 1^c1, 2^c2, 3^c3…, meaning that when g is expressed as a product of pairwise disjoint cycles there are c1 1-cycles, c2 2-cycles etc etc. Convention omit i^ci if ci = 0
Group Action
Suppose G is a group and Ω (!= Ø ) a set. G acts on Ω (Ω is a G set) if for each g ∈ G, each α ∈ Ω, ∃ corresponding element in Ω denoted by αg such that:
A1) ∀g1, g2 ∈ G, ∀α ∈ Ω, α(g1g2)=(αg1)g2
A2) ∀α ∈ Ω, α1 = α
G_α
Suppose G is a group and Ω is a G set for α ∈ Ω, G_α = {g ∈ G| αg = α}