Group Theory Flashcards
(32 cards)
Define a generated group
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.
Define a finitely generated group
A group G is finitely generated if there exists a finite set S such that <S> = G.</S>
Define a word
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).
Define an elementary contraction
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.
Define a reduced word
A word with no elementary contractions.
Define concatenation of words
The concatenation of two words x1x2…xm and y1y2…yn is the word x1x2…xmy1y2…yn.
Define a free group
The free group on the set S are the reduced words in the alphabet S under concatenation.
Give the universal property of free groups
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.
Define normal closure
Let B be a subset of a group G. The normal closure of B is the smallest normal subgroup of G that contains B.
Define a presentation
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⟩⟩.
Define the canonical presentation
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.
State the First Isomorphism Theorem
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.
State the second isomorphism theorem
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.
State the third isomorphism theorem
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.
State the classification theorem of finite simple groups
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.
Define a composition series
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.
State Jordan Holder’s Theorem
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.
Define a solvable group
A finite group G is solvable if every composition factor of G is a cyclic group of prime order.
Define a commutator
[a, b] = a^(−1)b^(−1)ab.
Define the commutator subgroup
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⟩.
Define a derived series
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.
Define a derived length
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.
Define a semi direct product
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}.
Define an extension
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.