Group Theory Flashcards

(32 cards)

1
Q

Define a generated group

A

Let G be a group S be a subset of G. The subgroup of G generated by S is the intersection of all subgroups of G that contain S.

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

Define a finitely generated group

A

A group G is finitely generated if there exists a finite set S such that <S> = G.</S>

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

Define a word

A

Given a set S and the inverse elements S^(-1) where S∩S^(-1) = ∅, a word is a finite sequence x1,… , xm where each xi ∈ S∪S^(−1).

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

Define an elementary contraction

A

A word w’ is an elementary contraction of a word w if all instances of xx^(−1) or x^(-1)x in w are removed.

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

Define a reduced word

A

A word with no elementary contractions.

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

Define concatenation of words

A

The concatenation of two words x1x2…xm and y1y2…yn is the word x1x2…xmy1y2…yn.

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

Define a free group

A

The free group on the set S are the reduced words in the alphabet S under concatenation.

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

Give the universal property of free groups

A

Given any set S, any group G and any function f : S → G, there is a unique homomorphism ϕ: F(S) → G such that the following diagram commutes: G ←f S i→ F(S) ϕ→ G , where i: S → F(S) is the canonical inclusion.

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

Define normal closure

A

Let B be a subset of a group G. The normal closure of B is the smallest normal subgroup of G that contains B.

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

Define a presentation

A

Let X be a set, and let R be a collection of elements of F(X). The group with presentation ⟨X | R⟩ is defined to be F(X)/⟨⟨R⟩⟩.

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

Define the canonical presentation

A

The canonical presentation for G is ⟨G | R(G)⟩, where R(G) is the kernel of the homomorphism mapping F(G) to the corresponding element in G.

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

State the First Isomorphism Theorem

A

Given a homomorphism ϕ: G1 → G2, there is a well-defined isomorphism between G1/kerϕ and Imϕ, given by gker(ϕ)→ ϕ(g) and the map ϕ factors into the canonical quotient map G1 → G1/ ker ϕ, the above isomorphism, and the inclusion Imϕ → G2.

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

State the second isomorphism theorem

A

Let G be a group, and H, N subgroups of G with N ◁ G. Then H∩N ◁ H and HN/N is isomorphic to H/H∩N.

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

State the third isomorphism theorem

A

Let N, K be normal subgroups of a group G, with K ⊆ N. Then N/K ◁ G/K and there is an isomorphism between (G/K)/(N/K) and G/N.

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

State the classification theorem of finite simple groups

A

Let G be a finite simple group. Then G is isomorphic to one of the following:
i) A cyclic group of prime order Cp.
ii) A group An for n > 4.
iii) A finite group of Lie type.
iv) An explicit list of 26 exceptions known as the sporadic groups.

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

Define a composition series

A

A composition series for a group G is a sequence of subgroups {e} = G0 ◁ G1 ◁ · · · ◁ Gn−1 ◁ Gn = G such that each composition factor Gi+1/Gi simple.

17
Q

State Jordan Holder’s Theorem

A

Let G be a finite group. Then all composition series of G have the same length and the same composition factors, including multiplicities up to permutation.

18
Q

Define a solvable group

A

A finite group G is solvable if every composition factor of G is a cyclic group of prime order.

19
Q

Define a commutator

A

[a, b] = a^(−1)b^(−1)ab.

20
Q

Define the commutator subgroup

A

Let G be a group. The derived subgroup or commutator subgroup of G is the subgroup G’ = ⟨a^(−1)b^(−1)ab such that a, b ∈ G⟩.

21
Q

Define a derived series

A

Let G be a finite group. Set G(0) = G and for k ≥ 1, define G(k) = (G(k−1))’. The series G = G(0) ≥ G(1) (= G′(2) ≥ … is called the derived series of G.

22
Q

Define a derived length

A

Given a derived series G(n), if k ≥ 0 is the first instance that G(k) = {e}, then k is known as the derived length of G.

23
Q

Define a semi direct product

A

Let G be a group, H ≤ G and N ◁ G. Then G is an internal semi-direct product of H and N, denoted G = N ⋊ H, if G = NH and H ∩ N = {e}.

24
Q

Define an extension

A

Let A and B be groups. Then an extension of A by B is a group G together with a normal subgroup K such that K is isomorphic to A and G/K is isomorphic to B.

25
Define a short exact sequence
Let M, N, P be groups. A short exact sequence involving M, N and P is a sequence {e} → M i→ N π→ P → {e} with i injective, π surjective and Im(i) = ker(π).
26
Define a split
An extension of a group A by a group B described by the short exact sequence {e} → A i→ G π→ B → {e} is said to split if there exists a group homomorphism j : B → G such that π◦j = id.
27
State Cauchy's Theorem
Given a group G and p a prime, if p divides |G|, then G has an element of order p.
28
Define a p-group
Let G be a finite group. We say that G is a p-group, where p is a prime, if the order of G is a power of p.
29
Define a Sylow p-subgroup
Let G a group of order p^a.m where p is a prime that does not divide m. Then we call a subgroup H of G a Sylow p-subgroup if H has order p^a.
30
State Sylow's 1st Theorem
Let G be a finite group, |G| = p^a.m, where p is a prime that does not divide m and a ≥ 0. Then, there is a Sylow p-subgroup of G.
31
State Sylow's 2nd Theorem
Let G be a finite group, |G| = p^a.m, where p is a prime that does not divide m and a ≥ 0. Then, two Sylow p-subgroups of G are conjugate.
32
State Sylow's 3rd Theorem
Let G be a finite group, |G| = p^a.m, where p is a prime that does not divide m and a ≥ 0. Then, the number of Sylow p-subgroups, n_p satisfies n_p ≡ 1 (mod p) and n_p divides m.