Scribd
Upload
17 views3 pages

Theorems in Abstract Algebra

Uploaded by

nothing
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views3 pages

Theorems in Abstract Algebra

Uploaded by

nothing
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Symmetry

Fixed Point Theorem let G be a finite group of isometries of the


plane. There is a point in the plane, p, that is fixed by G.
(∀g ∈ G)g(p) = p

Cyclic Group C n , symmetries of rotations for a regular n-gon

Dihedral Group D n symmetries of rotations and reflections for a


regular n-gon. Generated by the relations x n = 1, y 2 = 1, yx = x −1 y. Note
that D 3 ≅S 3

Tetrahedral group T , symmetries of the regular tetrahedron. This group


is isomorphic to S 4

Icosahedral Group I, symmetries of the regular dodecahedron. This


group acts on are the 5 inscribed squares of the polyhedron. The
corresponding map φ : I → S 5 is an isomorphism to A 5 .

Group Actions
A group operation is a map G × S → S, where (∀s ∈ S)1s = s, (gg ′ )s = g(g ′ (s))

For some s ∈ S, the orbit is O s = {s ′ ∈ S|(∃g ∈ G)s ′ = gs}. The orbits


partition S. If there is only one, the operation is transitive. The
stabilizer is G s = {g ∈ G|gs = s}

Let G be a group acting on S. For a ∈ G and s, s ′ ∈ S, if as = s ′ , the


stabilizer of s ′ is the conjugate subgroup aG s a −1

Orbit Stabilizer Theorem Let G be a group acting on S, and s ∈ S. There


is a bijective map ϵ : G/H → O s defined [aH] ⇝ as. This map is compatible
with group operation. ϵ(g[C]) = gϵ([C])

Counting Formula for G acting on S, |G| = |G s ||O s | and |O s | = [G : G s ].


Furthermore, the orbits of S give |S| = |O 1 | + |O 2 | + … + |O k |

Operations can also be defined on subsets of a set.

Class Equation
The conjugation operation on G is defined (g, x) ⇝ gxg −1 . The stabilizer
of x ∈ G is the centralizer, Z(x) = {g ∈ G|gxg −1 = x}, or the set of
elements that commute with x. The orbit of x is the conjugacy class,
C(x) = {gxg −1 |g ∈ G}. From the counting formula, we have |G| = |Z(x)||C(x)|.

Conjugacy classes are orbits, and therefore partition. We can write


this partition as the class equation

|G| = |C 1 | + |C 2 | + … + |C k |

Note that each conjugacy class must divide the order of G. This allows
us to deduce some structure of G from the equation

p-Groups
A group with order p k for a positive prime p is a p-group.

The center of a p-group is not trivial. Every group of order p 2 is


abelian, and is the product of two cyclic groups, or a cyclic group
itself.

Simple Groups
A group G is simple if it has no proper normal subgroup (the only
subgroups are G and ⟨1⟩.

For N ⊲ G (normal subgroup), (∀x ∈ G)C(x) ⊂ N, and N is a disjoint union


of conjugacy classes.

Symmetric Group
Conjugating elements in the symmetric group is equivalent to
conjugating the indices of the cycle decomposition.

g(x 1 x 2 … x k )g −1 = (g(x 1 )g(x 2 ) … g(x k ))

For n ≥ 5, the alternating group A 5 is a simple group.

Normalizers
For H ≤ G (subgroup), the orbit of H of conjugation by G are the
conjugate subgroups [gHg −1 ]. The stabilizer of [H] is the normalizer,
N(H) = {g ∈ G|gHg −1 = H}. Then from the counting formula,
|G| = |N(H)|(number of conjugate subgroups). The number of conjugate subgroups
is the index [G : N(H)].
In general, H ⊲ N(H) < G, H ⊲ G ⇔ N(H) = G

Sylow Theorems
Let G be a group of order p e m, with p prime. A subgroup H < G with
|H| = p e is a Sylow p-subgroup.

First Sylow Theorem a finite group whose order is divisible by a prime


p contains a Sylow p-subgroup.

Then a finite group with order divisible by p contains an element of


order p

Second Sylow Theorem The Sylow p-subgroups are conjugate subgroups.


Every subgroup of G that is a p-group is contained in a Sylow p-
subgroup.

Then a group G has a single Sylow p-subgroup H IFF H is normal.

Third Sylow Theorem Let G be a group of order n = p e m, where p | e. Let


n p be the number of Sylow p-subgroups. n p ≡ 1 (mod p) divides m.

Classification of Finite Abelian Groups


A finitely generated abelian group V is the direct sum of cylic
subgroups with prime power orders

V = C pk1 ⊕ … ⊕ C pknn
1

You might also like