Definitions Flashcards

1
Q

Group

A
(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
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Subgroup

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Subgroup Criterion

A

Suppose G is a group H c= G, then H <= G <=>

i) H =! ø
ii) ¥x,y € H, xy^-1 € H

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Right coset

A

Suppose H <= G
Let g € G
Hg = {xg | x € H}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Odd / Even permutation

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Transposition

A

In S_n (α_1, α_2) is called a transposition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

c(σ)

A

Let n>=2, let σ ∈ S_n, c(σ) is the number of cycles when we write σ as a product of pairwise disjoint cycles.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Alternating Group

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

C_G(S)

A

C_G(S) = {g ∈ G | gx=xg, ∀x ∈ S}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

N_G(S)

A

N_G(S) = {g ∈ G | s^g = s}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

.< s >.

A

.< s >.= {x_1,x_2,…,x_m | x_i ∈ S U S^-, m ∈ N}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Z(G)

A

Z(G) = {g ∈ G | gx=xg ∀x∈G}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Centraliser in G of S

A

C_G(S) = {g ∈ G | gx=xg, ∀x ∈ S}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Centre of G

A

Z(G) = {g ∈ G | gx=xg ∀x∈G}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Normaliser in G of S

A

N_G(S) = {g ∈ G | s^g = s}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The subgroup of G generated by s

A

= {x_1,x_2,…,x_m | x_i ∈ S U S^-, m ∈ N}

17
Q

S^g

A

S^g = {g^-1xg | x ∈ S}

18
Q

Conjugate of S

A

S^g = {g^-1xg | x ∈ S}

19
Q

x^G

A

x^G = {g^-1xg | g ∈ G}

20
Q

Conjugacy class in G of x

A

x^G = {g^-1xg | g ∈ G} = all conjugates of x

21
Q

P-Group

A

Let p be a prime, G be a group. G is called a p-group if |G| = p^a (a ∈ N U {0})

22
Q

Cycle type of g

A

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

23
Q

Group Action

A

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 = α

24
Q

G_α

A

Suppose G is a group and Ω is a G set for α ∈ Ω, G_α = {g ∈ G| αg = α}

25
Q

Stabiliser of α in G

A

G_α = {g ∈ G| αg = α}

26
Q

Normal Subgroup

A

G a group, N <= G, N is a normal subgroup of G if Ng = gN for all g in G denoted N # G

27
Q

Simple Group

A

A group is simple means G != {1} and the only normal subgroups of G are {1} and G

28
Q

G Orbit

A

{αg | g ∈ G} = α^G = G orbit of α