MATH 415 Lecture 12

From Notes
Jump to navigation Jump to search

« previous | Thursday, October 3, 2013 | next »

End Exam 1 content


Exam on Tuesday.

Group Factorization

Normal Subgroups

Normal Subgroups

Any of the following conditions are equivalent:

  1. for all .
  2. for all
  3. for all and .

is called the conjugation of .

Let's call this function . It happens that this function also works over (since , that is, , where for all .

Automorphisms

Automorphisms of are of the form: , where is an isomorphism. The set of Automorphisms is a group over composition

Theorem. From our example above, is a member of the automorphisms of :

  1. It is injective: implies , in particular .
  2. It is surjective: . Thus if if
  3. is a homomorphism:

Hence is an isomorphism.

Inner and Outer Automorphisms

If we have , then .

The group is a subgroup of with identity element . We call this group the inner automorphisms of

Inn(G) is a normal subgroup of Aut(G), so Aut(G)/Inn(G) exists, and we wil call this group the outer automorphisms of G

Going batk to our above criteria, we add the following:

  1. for all .
  2. for all if and only if
  3. for all and .
  4. is invariant with respect to inner automorphisms


For a group , we can construct as the disjoint union of all left cosets , where for transversal .


It was mentioned last time that

  • If and , , and , then


If , then the index is equivalent to the number of cosets.

  • If is finite, then the index must be finite.
  • If is infinite, then the index may or may not be finite.

In the case where , then Failed to parse (unknown function "\lefttriangle"): {\displaystyle H \lefttriangle G} is normal. In particular, we have and , where .

This does not hold necessarily for , etc.


Let be the symmetric group, and let be the alternating group. By definition, if and only if can be expressed as a product of an even number of transpositions.

Therefore consists of all odd permutations, and . Thus because we can express as the disjoint union of and () for any .

Equivalently, , so is isomorphic to .


Let is abelian, and let be the cyclic subgroup generated by . Note that .

because and have 4 and 6 elements respectively.

because

Therefore .


This example calls to mind that any group of the form , so .


What about ? Then , so . Then .

We know that this group is abelian by the #Theorem, so it is isomorphic to one of the following groups (only choices for abelian groups of order 12):

The main difference between the first group and the second is that the first has no element of order 4. In fact, its only maximal orders are 2, 3, and 2×3=6.

Therefore, our group must be isomorphic to .


Theorem

Theorem. A factor of an abelian group is also abelian: Given an abelian group and , then is abelian.

Proof. We can find that in because , which is true by the fact that is abelian.

quod erat demonstrandum


Theorem. A factor group of a cyclic group is also cyclic. Given and , then is also cyclic.

Proof. . Observe that , so can be expressed in cyclic form generated by the coset containing .

quod erat demonstrandum


Example 5.12

Let and . What is ?

Semantically, represents the set of points with integer coordinates, and represents the points along the diagonal .

The cosets of will represent the diagonal lines that are parallel to with integer points.

The transversal can be formed from any line perpendicular to the cosets. Therefore the index is infinite, and its quotient is infinite. In particular, .


Exam Review

Bring your own paper.

Calculator is not needed, but if wanted, only 4-function

Start with name.


  • Complex Numbers, roots of unity, etc
  • Binary Structures: set with binary operation
    • Isomorphism of binary structure
    • Identity element of binary structure
  • Groups and Subgroups (axioms and definitions)
    • Def of Subgroup: , for , and implies
  • Cyclic Groups and Subgroups: groups that can be generated by : , where
    • Orders of elements: (or if does not exist
    • Note that the order of (or the order of ) is denoted , not !
    • In all cases, either is a proper subgroup or generates the group.
    • Cyclic subgroups are isomorphic to if infinite, and isomorphic to if finite and .
    • A subgroup of cyclic group is also cyclic.
    • Subgroups of cyclic groups can always be expressed as or
    • By Theorem 6.14,
    • If is a finite cyclic group generated by , and is a cyclic subgroup generated by , then for , .
  • Permutations, symmetric group from all permutations of elements, and alternating group from all even permutations
    • cycles, orbits, etc.
  • Direct Products
    • Order of element of direct product is LCM of each element in respective group.
  • Fundamental Theorem of Finitely Generated Abelian Groups
  • Normal Subgroups (definitions)
    • Homomorphism, Kernel
  • Factor Groups
    • Definition of product of cosets