Ask your own question, for FREE!
Mathematics 14 Online
OpenStudy (zzr0ck3r):

group theory: f:G->H is a homomorphism if n is in Z s.t. (n,|H|)=1 prove: if a^n in the kernel of f, then a is in the kernel of f

OpenStudy (zzr0ck3r):

thought I would tag you two @joemath314159 @KingGeorge because you two love some group theory:)

OpenStudy (zarkon):

You want to work through this problem. I'm not an algebraist, but I have an idea.

OpenStudy (anonymous):

@saifoo.khan and @jim_thompson5910 and @satellite73 might be of good good help :P

OpenStudy (anonymous):

@zzr0ck3r

OpenStudy (zzr0ck3r):

sure would love to

OpenStudy (zarkon):

what is \[f(a^n)\]

OpenStudy (zzr0ck3r):

e

OpenStudy (zzr0ck3r):

and f(a)^n

OpenStudy (zarkon):

right

OpenStudy (zarkon):

you know what this is <f(a)>

OpenStudy (zzr0ck3r):

real fast, we proved if f is homomorphism then f(a^-1) = f(a) ^ -1 how can f have an inverse if we do not know its one to one and onto?

OpenStudy (zzr0ck3r):

yes I do

OpenStudy (zzr0ck3r):

sorry save the second question till after.

OpenStudy (zarkon):

ok

OpenStudy (zzr0ck3r):

<f(a)> would be the cyclic group generated by f(a)

OpenStudy (zarkon):

yes

OpenStudy (zarkon):

you know Lagrange's theorem

OpenStudy (zzr0ck3r):

yes any order of a subgroup divides the order of the parent group

OpenStudy (zarkon):

so that tells us that ...

OpenStudy (zzr0ck3r):

so n divides order of H?

OpenStudy (zzr0ck3r):

but (n,|H|) = 1

OpenStudy (zarkon):

well |<f(a)>| divides |H|

OpenStudy (zzr0ck3r):

right

OpenStudy (zarkon):

need to show |<f(a)>| divides n...then we are done

OpenStudy (zzr0ck3r):

why ?

OpenStudy (zarkon):

why it divides or why we are done?

OpenStudy (zzr0ck3r):

why we are done

OpenStudy (zarkon):

(n,H)=1 and n and |h| will have a common factor...thus |<f(a)>|=1 and hence f(a)=e

OpenStudy (zarkon):

|H|

OpenStudy (zzr0ck3r):

ahhhh very clever

OpenStudy (zarkon):

if a|b and a|c and (b,c)=1 then a=1

OpenStudy (zzr0ck3r):

right right

OpenStudy (zzr0ck3r):

so we are using the fact that f(a)^n = e and thus f(a) has finite order and thus forms a cyclic subgroup

OpenStudy (zarkon):

you should have a theorem or corollary that states that if \(a^k=e\) then \(|a|\) divides \(k\)

OpenStudy (zzr0ck3r):

yes for sure

OpenStudy (zarkon):

that is all you need

OpenStudy (zzr0ck3r):

wow tyvm. tnx for dragging me along also. it helps allot.

OpenStudy (zarkon):

np

OpenStudy (zarkon):

what about this "real fast, we proved if f is homomorphism then f(a^-1) = f(a) ^ -1 how can f have an inverse if we do not know its one to one and onto?"

OpenStudy (zzr0ck3r):

yes

OpenStudy (zzr0ck3r):

very confused by that

OpenStudy (zarkon):

this is still a group homomorphism?

OpenStudy (zzr0ck3r):

yes

OpenStudy (zarkon):

so if \(f:G\to H\) then f(a) is an element of the group H. All group elements have an inverse

OpenStudy (zzr0ck3r):

ahh so the inverse is an inverse of the element f(a) in H so f(a)^-1 is in H not G? talking about f:g->h

OpenStudy (zarkon):

call if \(f^{-1}(a)\)

OpenStudy (zzr0ck3r):

so its a notation thing that is confusing me

OpenStudy (zzr0ck3r):

ahh so f^-1(x) is a fuction and f(x)^-1 is an element? in this context?

OpenStudy (zzr0ck3r):

well I guess that question is redundant, but I'm pretty sure I understand

OpenStudy (zarkon):

you know the proof

OpenStudy (zarkon):

maybe that would help you understand if you saw that

OpenStudy (zzr0ck3r):

yeah, I do. I was just thinking that. I think someone in class confused me today because they said f had an inverse. I will clear it up with them and take all the credit:) jk

OpenStudy (zzr0ck3r):

wow for not being an algebraist you have quite a memory of what the proofs look like...

OpenStudy (zarkon):

did you want me to show you or do you know it...it is short

OpenStudy (zzr0ck3r):

I do know it, ty.

OpenStudy (zarkon):

ok

OpenStudy (zarkon):

I took quite a few algebra class in graduate school, but most of my course work was in probability and mathematical statistics

OpenStudy (zzr0ck3r):

you an actuary?

OpenStudy (zarkon):

I'm a math professor

OpenStudy (zzr0ck3r):

ahhh it all makes sense now

OpenStudy (zarkon):

my Ph.D. is in mathematical statistics

OpenStudy (zzr0ck3r):

very cool, I want to be you - the stats:) + something else in exchange

OpenStudy (zarkon):

but i really love algebra...beautiful subject

OpenStudy (zzr0ck3r):

yeah I really like it so far. this is just 300 level group theory but I have to do 2 term 400 sequence in the fall, with 400 real analysis as well.

OpenStudy (zarkon):

nice...real analysis is fun too

OpenStudy (zzr0ck3r):

I took the 300 level one, for us its 311 and 312. I like it, but I like the algebra much more. I am ok with a summer of no deltas or epsilons.

OpenStudy (kinggeorge):

I'm not a huge fan of analysis either to be honest. I much prefer algebra.

OpenStudy (zarkon):

lol

OpenStudy (zarkon):

I find algebra to be more elegant

OpenStudy (zzr0ck3r):

for sure. there is just something sort of hand-wavey about calculus. (not really but ...)

OpenStudy (zarkon):

I understand what you are saying

OpenStudy (kinggeorge):

Same.

OpenStudy (zzr0ck3r):

@Zarkon how do we know <f(x)> forms a cyclic subgroup?

OpenStudy (zarkon):

by definition <a> is the cyclic group generated by a

OpenStudy (zzr0ck3r):

so If group G has finite order than any element in G creates a cyclic subgroup?

OpenStudy (zarkon):

THeorem: Let \(G\) be a group, and let \(a\) be any element of \(G\). Then, \(<a>\) is a subgroup of \(G\)

OpenStudy (zzr0ck3r):

great.. ty

OpenStudy (zarkon):

np

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!