MATH 415 Lecture 10

From Notes
Jump to navigation Jump to search

« previous | Thursday, September 26, 2013 | next »


Homorphism

Let and be groups. The function is a homomorphism if and only if for all


Example: Integration

Let represent the group of all functions over addition.

where is a homomorphism:


Images and Ranges

Let and .

  • is the image of over
  • is the range of .

It is also possible to find inverse images:

Theorem 13.12

is a homomorphism

  1. if is the identity element in , then � is the identity in .
  2. if , then .
  3. if is a subgroup of , then is a subgroup in .
  4. if is a subgroup of , then is a subgroup in .


Proof.

  1. . By transitivity, , so .
  2. Since , we can say . Therefore .
  3. Let for . Since is a group, then and thus .Furthermore, if , then .
quod erat demonstrandum


Kernel

Let be a homomorphism. is the trivial subgroup of .

We define to be the kernel of .

The kernel is a subgroup in that maps all of its members to in . Thus the kernel is collapsing down to .

Example

Let , where , where is a matrix.

The kernel of is the null space of

Theorem 13.15

Let be a homomorphism, , and let . Then the set is the left coset and at the same time is the right coset (thus implying )


Proof. Consider , thus for . Because is a homomorphism, we have .

, then , . Therefore implies , so . a similar strategy shows that . Thus the right and left cosets are identical.

quod erat demonstrandum


Example

Let be the group of differentiable mappings from over addition.

Therefore is well-defined. Consider with .

Observe that is a homomorphism because .

The kernel of is the set of all functions whose derivative is 0, thus it is the set of constant functions.


Corollary

Corollary. A group homomorphism is injective if and only if its kernel is .

If , then is not one-to-one since for . Alternatively, if , then assuming , we arrive at the contradiction that the kernel must have at least two elements.

Relation to Isomorphism

Recall that if is an isomorphism, then

  1. is a homomorphism
  2. is injective (hence its kernel is )
  3. is surjective


Normal Subgroups

A subgroup of a group is normal if its left and right cosets coincide. That is, if for all .

Notation:

Corollary. The kernel of a homomorphism is a normal subgroup of .


Factor Groups

Given a group partitioned into cosets, we want to collapse all cosets (for ) into individual elements in another group . In general, this is not possible, but it is possible if is a normal subgroup.


Theorem 14.1

Let be a group homomorphism and . Then the cosents of form a group (called a factor group; denoted ), where . The identity element is .

Furthermore, the map defined by is an isomorphism.

Both coset multiplication and are well-defined independent of the choices and from the cosets.

Note: It's important to note that each coset contains multiple elements, so choosing any representative still refers to the same coset.

Proof. By definition, . What about ? If , then there exists an such that . Similarly, if , then for . Thus Since and is a normal subgroup, we can say , so implies for some . Thus . is closed, so let . Thus .

quod erat demonstrandum