Okay, I think I was wrong.
Here is a way to list all the elements in a nice way. Say instead of using as to represent a coset I will just use .
When . Define the "length" of to be . And as I explained different length give different cosets. So begin with length=0. In that case the cosets have the form . So it can be (identity) or , , but not anything else because, say, because . When length=1 we have , , and and that is it.
So we can make a little table (actually it is a large table because there are infinitely many elements):
length = 0: (0,0), (1,1), (2,2)
length = 1: (1,0), (2,1), (3,2)
length =-1: (0,1), (1,2), (2,3)
...
And we add these elements (cosets) in an obvious way. It should be obvious that if then this table has only a single coloum so it is cyclic but only in that case.
Okay! I think I got it for real this time. Your above post helped me realize my mistake, I didn't need the function I was trying to construct to be injective since I could just invoke the first isomorphism theorem.
by is an empimorphism.
is a homomorphism since
is an epimorphism, since is a homomorphism and it is a surjective function.
Now the
Hence by the first isomorphism theorem.
Excellent job. You are ready for you exam today.
By the way, the first isomorphism theorem according to your wonderful book is the one mentioned in section 7.1, what you just used is referred to as the fundamental homorphism theorem. However, other algebra books called the homomorphism theorem as the first isomorphism theorem; call your first isomorphism theorem as the second onel; and the books second theorem as the third theorem. So I am just letting you know that different algebra books call it differently, so do not be confused if you ever do that.