English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Kind of a long one:

Lef f: G to H be a homomorphism, and suppose that the order of the ker(f) = n. For any h in f(G), find the number of elements in f ^-1(h). I got that part, heres the part I'm having trouble with.
Let f, G, and H be as in part a. Use your result in a to prove taht if K is a finite subgroup of G, then the order of f(K) divides the order of K.

Thanks

2006-11-29 04:00:17 · 1 answers · asked by mobaxus 2 in Science & Mathematics Mathematics

1 answers

The previous result is that the number of elements in the preimage of each element in f(K) (or more generally in f(G)) is n. All those sets are disjoint and their union is K, so the total number of elements in K is n * (Number of elements in f(K)).
--> |K| is a multiple of |f(K)|

Another way of looking at is that if N is the kernel of f, f(K) is isomorphic to the quotient group K/N which always divides the order of K.

2006-11-29 05:21:15 · answer #1 · answered by shimrod 4 · 0 0

fedest.com, questions and answers