Solve Binary Operations Question: Prove Isomorphism

  • Thread starter Thread starter Jumblebee
  • Start date Start date
  • Tags Tags
    Binary Operations
Click For Summary
SUMMARY

The discussion centers on proving the isomorphism between the structures (Z, .) and (Z, *) using the map φ: Z → Z defined by φ(n) = n + 1. The operation defined as m * n = mn - m - n + 2 is established as the necessary operation for the isomorphism. The user initially struggles with demonstrating that the operations are preserved but ultimately resolves the issue independently.

PREREQUISITES
  • Understanding of group theory concepts, specifically isomorphisms.
  • Familiarity with the set of integers Z and its operations.
  • Knowledge of function mapping and preservation of operations.
  • Basic algebraic manipulation skills.
NEXT STEPS
  • Study the properties of isomorphisms in group theory.
  • Learn about operation preservation in mathematical mappings.
  • Explore examples of isomorphic structures in algebra.
  • Investigate the implications of defining new operations on sets.
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone interested in understanding group theory and isomorphisms.

Jumblebee
Messages
12
Reaction score
0
So I have really been struggling with this question. The original question said: The map [tex]\varphi[/tex]:Z->Z defined by [tex]\varphi[/tex](n)=n+1 for n in Z is one to one and onto Z. For (Z, . ) onto (Z,*) (i am using . for usual multiplication) define * and show that * makes phi into an isomorphism.
I know that the operation must be m*n=mn-m-n+2. But I get stuck in proving that the operations are preserved. When I do [tex]\varphi[/tex](m.n) i get mn+1. and i can't get [tex]\varphi[/tex](m). [tex]\varphi[/tex](n) to work. I think I am doing something wrong. Can anyone help?
 
Physics news on Phys.org
Never mind! i just got it to work!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
1K
Replies
26
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K