Groups and Group Actions Flashcards

1
Q

Define a binary operation

A

A binary operation on a set S is a function from SxS to S.

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

Define associativity

A

If * is associative, a(bc) = (ab)c for all a, b and c in the set.

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

Define an identity

A

e is an identity if ea = a = ae for all a in the set.

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

Define an inverse

A

If b is in S, then b is a’s inverse if ab = ba = e.

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

Define commutativity

A

If * is commutative, ab = ba for all a and b in the set

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

Define a group

A

(G,*) is a group if:
1. * is associative
2. * has an identity e
3. Every a ∈ G has an inverse

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

Define an Abelian group

A

A group that has a commutative binary operation.

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

Define a cyclic group

A

A group G is cyclic if there is an element x ∈ G such that G = {x^n: n ∈ Z}.

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

Define the dihedral group

A

D_2n is the set of all isometries of the regular n-gon in R^2, with the group operation being composition.

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

Define a generator.

A

If there exists an element x ∈ G such that G = {x^n: n ∈ Z}, x is said to be a generator for G.

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

Define a direct product

A

If we have two groups, (G,) and (G,o), then GxH (the direct product) is the set {(g,h): g ∈ G, h ∈ H} with group operation (g_1,h_1)”“(g_2,h_2) = (g_1*g_2,h_1oh_2) for all g_1, g_2 in G and h_1, h_2 in H.

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

Define a subgroup

A

H is a subgroup of G if H is a subset of G, e ∈ H, if x,y ∈ H then xy ∈ H and if x ∈ H, then x^-1 ∈ H.

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

Define the order of a group

A

The cardinality of the underlying set.

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

Gefine the order of an element

A

The order of g is the least positive integer r such that g^r = e.

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

Define an isomorphism

A

If we can define a bijection that maps from one set to another, this is called an isomorphism.

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

Define a permutation

A

A permutation of S is a bijection S -> S.

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

Define a cycle

A

A permutation σ ∈ S_n is a cycle if there are distinct elements a_1, … , a_k in {1, …, n} such that (a_i)σ = a_(i+1) for 1 ≤ i < k, (a_k)σ = a_1 and xσ = x for x ∉ {a_1, …, a_k}.

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

Define disjoint cycles

A

Two cycles are disjoint if none of the elements in each cycle are shared between the two cycles.

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

Define a cycle decomposition type

A

A list of the lengths of cycles in a permutation.

20
Q

Define conjugate permutations

A

Two permutations σ, τ ∈ S_n are conjugate if there exists ρ ∈ S_n such that (ρ^-1)τ ρ = σ.

21
Q

Define an odd permutation

A

A permutation is odd if it can be written as an odd number of transpositions.

21
Q

Define a transposition

22
Q

Define an even permutation

A

A permutation is even if it can be written as an even number of transpositions.

23
Q

Define the subgroup generated by S.

A

The smallest subgroup which contains S.

24
Define the highest common factor
The highest common factor of m and n is h such that =
25
Define the lowest common multiple
The lowest common multiple of m and n is l such that =
26
Define a binary relation
A binary relation on a set S is a subset of SxS
26
Define a reflexive relation
~ is reflexive if a~a for all a in S
27
Define a symmetric relation
~ is symmetric if a~b implies b~a for all a, b in S
28
Define a transitive relation
~ is transitive if a~b and b~c implies that a~c for all a, b, c in S
29
Define an Equivalence relation
~ is an equivalence relation if it is reflexive, symmetric and transitive
30
Define conjugate elements
For a group G, g, h ∈ G are conjugate if there exists k∈G such that g = k^-1hk.
31
Define an equivalence class
Given an equivalence relation ~, the equivalence class of a is the set {x∈S:x~a}.
32
Define a partition
Let S be a set and Λ be an indexing set. For λ∈Λ, A_λ partitions S if A_λ ≠ ∅ for all λ∈Λ, the union of A_λ = S and if λ≠µ, then A_λ∩A_µ = ∅.
33
Define a left coset
If H is a subgroup of G, then the left cosets of H are the sets gH = {gh:h∈H}.
34
Define a right coset
If H is a subgroup of G, then the right cosets of H are the sets Hg = {hg:h∈H}.
35
Define a homomorphism
φ: G -> H is a homomorphism if φ(g1*g2) = φ(g1)*φ(g2).
36
Define an automorphism
An isomorphism from G to G.
37
Define an endomorphism
A homomorphism from G to G.
38
Define the kernel of a group
The kernel of φ is ker(φ) = {g∈G such that φ(g) = e}.
39
Define the image of a group
The image of φ is Im(φ) = {φ(g) such that g∈G}.
40
Define a normal subgroup
H is a normal subgroup of G if H is a subgroup of G and gH = Hg for all g, or equivalently g^-1hg ∈ H for all g∈G and h∈H.
41
Define the centre of a group
Z(G) = {g∈G such that hg = gh for all h∈G}.
42
Define a quotient group
If H is a normal subgroup of G, then (G/H,*) is the quotient group.
43
Define a left action
ρ: GXS -> S is a left action if ρ(e,s) = s and ρ(g,ρ(h,s)) = ρ(gh,s) for all s∈S and g,h∈G.
44
Define an orbit
If a group G acts on a set S and s∈S, then Orb(s) := {g.s such that g∈G}.
45
Define a stabilizer
If a group G acts on a set S and s∈S, then Stab(s) := {g∈G such that g.s = s}.