MATH 415 Lecture 10

From Notes
Jump to navigation Jump to search

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


Homorphism

Let ⟨G,⋅⟩ and ⟨G′,*⟩ be groups. The function ϕ:G→G′ is a homomorphism if and only if for all x,y∈G

ϕ(x⋅y)=ϕ(x)*ϕ(y)


Example: Integration

Let F represent the group of all functions over addition.

ϕ:F→ℝ where ϕ(f)=∫abf(x)dx is a homomorphism:

∫ab(f+g)(x)dx=∫abf(x)dx+∫abg(x)dx


Images and Ranges

Let ϕ:X→Y and A⊆X.

  • ϕ[A]={ϕ(a)∣a∈A} is the image of ϕ over A
  • ϕ[X] is the range of ϕ.

It is also possible to find inverse images:

ϕ−1[B]={x∈X∣ϕ(x)∈B}

Theorem 13.12

ϕ:G→G′ is a homomorphism

  1. if e is the identity element in G, then �ϕ(e)=e′ is the identity in G′.
  2. if a∈G, then ϕ(a−1)=ϕ(a)−1.
  3. if H is a subgroup of G, then ϕ[H] is a subgroup in G′.
  4. if K′ is a subgroup of G′, then ϕ−1[K′] is a subgroup in G.


Proof.

  1. ϕ(a)=ϕ(ae)=ϕ(a)ϕ(e)=ϕ(a)e′. By transitivity, ϕ(a)=ϕ(a)e′, so ϕ(e)=e′.
  2. Since e′=ϕ(e)=ϕ(aa−1), we can say ϕ(aa−1)=ϕ(a)ϕ(a−1=e′. Therefore ϕ(a−1)=ϕ(a)−1.
  3. Let ϕ(a),ϕ(b)∈ϕ[H] for a,b∈G. Since G is a group, then ab∈G and thus ϕ(ab)=ϕ(a)ϕ(b)∈ϕ[H].Furthermore, if ϕ(a)∈ϕ[H], then ϕ(a−1)=ϕ(a)−1∈ϕ[H].
quod erat demonstrandum


Kernel

Let ϕ:G→G′ be a homomorphism. {e′} is the trivial subgroup of G′.

We define ϕ−1[{e′}]={x∈G∣ϕ(x)=e′} to be the kernel of ϕ.

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

Example

Let ϕ:ℝn→ℝm, where ϕ(x→)=Ax→, where A is a m×n matrix.

The kernel of ϕ is the null space of A

Theorem 13.15

Let ϕ:G→G′ be a homomorphism, H=kernel(ϕ), and let a∈G. Then the set ϕ−1[{ϕ(a)}]={x∈G∣ϕ(x)=ϕ(a)} is the left coset aH and at the same time is the right coset Ha (thus implying aH=Ha)


Proof. Consider x∈aH, thus x=ah for h∈H. Because ϕ is a homomorphism, we have ϕ(x)=ϕ(ah)=ϕ(a)ϕ(h)=ϕ(a)⋅e′=ϕ(a).

x∈A

, then

ϕ(x)=ϕ(a)

,

ϕ(x)ϕ(a)−1=e′=ϕ(x)ϕ(a−1)

. Therefore

(xa−1=h)∈(H=kernel(H))

implies

x=ha

, so

x∈Ha

. a similar strategy shows that

x∈aH

. Thus the right and left cosets are identical.

quod erat demonstrandum


Example

Let D be the group of differentiable mappings from ℝ→ℝ over addition.

Therefore f′ is well-defined. Consider ϕ:D→D with ϕ(f)=f′.

Observe that ϕ is a homomorphism because ϕ(f+g)=ϕ(f)+ϕ(g)=f′+g′.

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 ϕ:G→G′ is injective if and only if its kernel is {e}.

If |kernel(ϕ)|>1, then ϕ is not one-to-one since x,y∈kernel(ϕ) for x≠y. Alternatively, if kernel(ϕ)={e}, then assuming ϕ(a)=ϕ(x)=e, we arrive at the contradiction that the kernel must have at least two elements.

Relation to Isomorphism

Recall that if ϕ:G→G′ is an isomorphism, then

  1. ϕ is a homomorphism
  2. ϕ is injective (hence its kernel is {e})
  3. ϕ is surjective


Normal Subgroups

A subgroup H of a group G is normal if its left and right cosets coincide. That is, if gH=Hg for all g∈G.

Notation: H⊴G

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


Factor Groups

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


Theorem 14.1

Let ϕ:G′ be a group homomorphism and H=kernel(ϕ). Then the cosents of H form a group (called a factor group; denoted G/H), where (aH)(bH)=(ab)H. The identity element is eH=H=kernel(ϕ).

Furthermore, the map μ:G/H→ϕ[G] defined by μ(aH)=ϕ(a) is an isomorphism.

Both coset multiplication and μ are well-defined independent of the choices a and b 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, (aH)(bH)=(ab)H. What about (a1H)(b1H)? If a1H=aH, then there exists an h1∈H such that a1=ah1. Similarly, if b1∈bH, then b1=bh2 for h2∈H. Thus a1b1=ah1bh2 Since h1b∈Hb and H is a normal subgroup, we can say Hb=bH, so h1b∈bH implies h1=bh3 for some h3∈bH. Thus a1b1=abh3h2. H is closed, so let h3h2=h′∈H. Thus (a1b1)H=(ab)H.

…

quod erat demonstrandum