Results 1 to 7 of 7

Math Help - Problem solving algebraic structures task

  1. #1
    Junior Member
    Joined
    Jun 2010
    From
    Skopje
    Posts
    54

    Problem solving algebraic structures task

    Hi i got some problem solving this:

    Let (G, *) be abelian group, then the function f:G->G defined with f(x) = x*x , for x E G is homomorphism, you must prove this is homomorphism.

    I know what is homomorphism, one function is homomorphism if it is well defined over the operations between groups, for e.g. if we have op * in one group and # in other group than f is homomorphism defined as f(x*y) = f(x) # f(y) for every x,y E G, it is homomorphism between G and some other group H, so this task confused me , since the function is defined on the same group, as i get it the result from operating in bouth the groups for the same operands should be the same and that's how we say the function is homomorphic, if it gives same result for operating with the operations from the groups, for this reason i tought the function f is not homomorphic cause x != x*x , actualy i dont know what exactly the operation does but if in the group holds the idmepotentity law then x*x = x might be true, but that was not defined so i realy dont know how to solve this problem.

    Thanks for help!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,383
    Thanks
    1474
    Awards
    1
    Quote Originally Posted by goroner View Post
    Let (G, *) be abelian group, then the function f:G->G defined with f(x) = x*x , for x E G is homomorphism, you must prove this is homomorphism.
    The key here is Abelian group.
    f(x \cdot y) = (x \cdot y) \cdot (x \cdot y) = x \cdot (yx) \cdot y = (x \cdot x)(y \cdot y) = f(x) \cdot f(y)
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Jun 2010
    From
    Skopje
    Posts
    54
    yes i started like that and i got the same result , but i doubted about it cause i had this tought in my mind: the result x != x*x, and i never managed to see that i was doing it ok, thanks anyway ) it makes sense
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Junior Member
    Joined
    Jun 2010
    From
    Skopje
    Posts
    54
    i dont like to open one more thread, i got one more question, how do i prove that in tree there's exactly one central vertex or two but they should be neighbour vertexes, i think the terms are central and bicentral vertex.i tought for a moment that i can prove it with mathematical induction but there're problems like: the tree might be verige, or it might be rooted tree with n children per node, etc. also i tought something about the radius of a tree cause central got to do with radius as it should be the centar node like in circle there's centar point and a radius so i think of it that way but dont know if that's the case cause on faculty i havent studied nothing about central points in graphs, nor trees and they gave this as task on exams and when i asked them how do i prove it they said write what you think about it no formal prove is needed, cause as the task was given a central point in graph concept was bit explaned but not well cause was an exam task.. thanks!
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,383
    Thanks
    1474
    Awards
    1
    Always start a new tread for a different question.
    That is a rule of the forum.
    Follow Math Help Forum on Facebook and Google+

  6. #6
    Junior Member
    Joined
    Jun 2010
    From
    Skopje
    Posts
    54
    ok sry, ill start new one thanks!
    Follow Math Help Forum on Facebook and Google+

  7. #7
    Banned
    Joined
    Oct 2009
    Posts
    769
    Quote Originally Posted by goroner View Post
    Hi i got some problem solving this:

    Let (G, *) be abelian group, then the function f:G->G defined with f(x) = x*x , for x E G is homomorphism, you must prove this is homomorphism.

    I know what is homomorphism, one function is homomorphism if it is well defined over the operations between groups, for e.g. if we have op * in one group and # in other group than f is homomorphism defined as f(x*y) = f(x) # f(y) for every x,y E G, it is homomorphism between G and some other group H, so this task confused me , since the function is defined on the same group, as i get it the result from operating in bouth the groups for the same operands should be the same and that's how we say the function is homomorphic, if it gives same result for operating with the operations from the groups, for this reason i tought the function f is not homomorphic cause x != x*x , actualy i dont know what exactly the operation does but if in the group holds the idmepotentity law then x*x = x might be true, but that was not defined so i realy dont know how to solve this problem.

    Thanks for help!
    Just noting that this should have been posted in the linear and abstract algebra section.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. About Subgroups( Algebraic Structures)
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: January 12th 2010, 08:27 AM
  2. About orders of elements(Algebraic structures-subgroups)
    Posted in the Advanced Algebra Forum
    Replies: 6
    Last Post: January 12th 2010, 07:24 AM
  3. Names of algebraic structures
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: January 25th 2009, 07:04 PM
  4. Problem Solving Task
    Posted in the Calculus Forum
    Replies: 2
    Last Post: July 27th 2008, 12:55 AM
  5. Algebraic Structures Matrix
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: May 18th 2008, 11:44 AM

Search Tags


/mathhelpforum @mathhelpforum