MHB Help Proving Isomorphism of a group

  • Thread starter Thread starter Bruce Wayne1
  • Start date Start date
  • Tags Tags
    Group Isomorphism
Click For Summary
To prove that a cyclic group G of order n is isomorphic to the ring Z_n under addition, one must define an explicit isomorphism. The proposed function f maps elements of G, represented as g^k, to their corresponding integers k in Z_n. The proof requires demonstrating that f is one-to-one, onto, and preserves the operation. Understanding that every element in G can be expressed as a power of a generator g is crucial for establishing the isomorphism. The discussion emphasizes the need for clarity in defining the function and ensuring it meets the necessary conditions for isomorphism.
Bruce Wayne1
Messages
15
Reaction score
0
Hi!

I'm trying to prove a cyclic group is isomorphic to ring under addition. What the strategy I would take? How would I get it started?

Here's what I know so far:

I need to meet 3 conditions-- 1 to 1, onto, and the operation is preserved. I also know that isomorphic means that the group is homomorphic with onto and 1 to 1.
 
Physics news on Phys.org
Bruce Wayne said:
I'm trying to prove a cyclic group is isomorphic to ring under addition. What the strategy I would take? How would I get it started?
You need to come up with an explicit definition of an alleged isomorphism.
 
are you tring to prove a cyclic group G of order n is isomorphic to Z_n ={0,...,n-1}?Define $f(g)=g^n$ (mod n)
 
Poirot said:
are you tring to prove a cyclic group G of order n is isomorphic to Z_n ={0,...,n-1}?Define $f(g)=g^n$ (mod n)
I may be missing something. Is $f:G\to\mathbb{Z}_n$? Then what is $g^n\pmod{n}$?
 
Poirot said:
are you tring to prove a cyclic group G of order n is isomorphic to Z_n ={0,...,n-1}?Define $f(g)=g^n$ (mod n)

Yes, exactly. I want to show that a cyclic group G of order n is isomorphic to Zn.

I understand the concepts, and I know how to prove it for a relatively small n, but I haven't been able to find a completed proof online. I'd like to read it, and ask a few questions on the theory of why it works (should any arise).
 
Since $G$ is cyclic of order $n$, there exists a $g\in G$ such that every $x\in G$ can be represented as $g^k$ for some $0\le k<n$. Therefore, we can define an $f:G\to\mathbb{Z}_n$ as follows: $f(g^k)=k$. It rests to show that $f$ is one-to-one, onto and a homomorphism.
 
Evgeny.Makarov said:
I may be missing something. Is $f:G\to\mathbb{Z}_n$? Then what is $g^n\pmod{n}$?

yes sorry I mean f(g^k)=k (mod n), where g is the generator of G
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
486
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 26 ·
Replies
26
Views
810