Theorems Flashcards
Lagranges Theorem
If G is a finite group and H <= G then |G| = |H|[G:H] where [G:H] is the number of right cosets in G a.k.a index of H in G
|GL_n(q)|
|GL_n(q)| = (q^n-q^0)(q^n-q^1)…(q^n-q^n-1)
Class equation of a finite group
Suppose G is a finite group. Let x1,..,xk ∈ G. One chosen from the conjugacy class of G. Set n_i = |xi^G|
i) |G| = SUM_1^k n_i = SUM_1^k [G: C_G(xi)]
ii) |G| = |Z(G)| + SUM_l+1^k ni
iii) |G| = |Z(G)| + SUM_l+1^k [G: C_G(xi)]
Cauchy Theorem
Let p be a prime and G a finite group. If p | |G| then G has at least one element of order p
Classification theorem for finitely generated abelian groups
Any finitely generated abelian group is isomorphic to a direct product of cyclic groups G ~= Zm1 x Zm2 x … x Zmk x Z^s, for some s > 0 and m1|m2….mk-1|mk
s = rank of G
m1,m2,m3… are the torsion coefficients of G
G a group and N <= G. Then N # G is equivalent to any of the following:
i) G=N_G(N)
ii) the conjugates of N = {N}
iii) ∀g ∈ G, ∀n ∈ N, g^-1ng ∈ N
iv) for every g in G, Ng=gN, all right cosets of N are left cosets
First Isomorphism Theorem
Suppose A:G –> K is a homomorphism and G and K are groups. Then G/kerA ~= AG
Sylows Theorem
Suppose G is a finite group. |G| = p^r m where p is a prime, r in Z, p!|m. Then,
i) ∃at least 1 subgroup of P of G with |P| = p^r
ii) subgroups of G order p^r they all conjugate
iii) if x <= G and x is a p-group then x<=P^g for some g in G
iv) if n is the number of subgroups of G of order p^r then n|m and n=1modp
For any z in x^G then…
z^G = x^G
Two permutations in Sn are conjugate <==>
They have the same cycle type
Two permutations in Sn have the same cycle type <==>
They are conjugate
If g belongs to C_G(S) then…
S^g=S and therefore g belongs to N_G(S)
If S <= N_G(S) then…
|S| | |N_G(S)|
G is a disjoint union of its…
Conjugacy classes
|Omega| |G_a| =
|G|