I know that but would ?
P.S. Sorry for the bad formatting, trying to learn the LaTeX formatting for this site :-)
This question arose from a question in my text that asked:
Show that is not a cyclic group. I was assuming that the quotient group was isomorphic to , i.e., the Klein 4-group, which is not cyclic (prob. #21 pg 176 in Beachy's Abstract Algebra)
By, I meant the cyclic subgroup generated by (n,n), i.e. { ..., (-2n, -2n), (-n,n), (0,0), (n,n), (2n,2n), ...}
So I think we agree, but just different notation right?
This problem appears in Beachy+Blair problem 21 on section 3.8. It is very possible you go to CCNY and are in the abstract algebra course. However, it was not assignent as a homework problem (I am not in the class but I do know which homework is assigned).
No you are wrong. There is a large difference between and . One is a Cartesian product and the other is not.
We can prove that (like you asked that),
for .
First, is a subgroup of so it is normal because subgroups of an abelian group are normal.
Okay now the subgroup is the set . The cosets have the form . Note that is then .* So we can express uniquely everything as where . Thus, there are a total of elements in this coset. You can prove isomorphism with by defining and . So your conjecture is true.
So are you in CCNY, everything tells me that you are? Are you afraid that I am going to kill you or something like that.
*)Important side note: This is why this group modulo is infinite (problem 20) while is actually finite because for no matter what you chose because everything is congruent to mod 1. So the cosets behave completely differently if you know what I mean.
Really. That is awesome, I am a student at CCNY also. But I am not taking Algebra. I happen to know the automorphism of the symettric group was assigned as an extra credit problem (it really is an interesting problem). I am a (undergraduate) student, who likes to think I am a professor. Maybe we have seen eachother and never realized it. I am taking Multi-variable Advanced Calculus and Probability Theory.
You have an exam on Tuesday? He did not do a review session as he usually does.
Did you find this site by pure coincidence?
I actually found this site maybe 2 years ago when I was at Cooper Union. I don't remember exactly how I stumbled upon it, but I had a problem in my Analysis on Manifolds class that I could not do - and my professor didn't give me the best explaination either. So I wound up surfing the web (as I do frequently since so many math problems are solved here - usually with good explainations) hoping to find some help.
I am a first year graduate student at CCNY. I am taking topology, real analysis, algebra (as you figured out), and statistics II.
It seems that you are really advanced for an undergrad. I was a chemical engineering major undergrad. I had a decent math background coming to CCNY, but algebra is giving me the most headaches, although it also gives me the biggest satisfaction when I solve a problem as well.
Post #7 was a mistake. Let me try again.
I said that which is absolute garbage. Sorry about that.
Okay here is how it works.
Note that, .
Now if are integers then determines the coset . Note that there is an invariance that exists among all its ordered pairs, namely, the difference from the first entry and the second entry is fixed. This means and can only be the same coset if (because of this invariance) so . Thus, two numbers being congruent to each other mod is not sufficient for them to be the same coset. Now turning the question around we ask if and such that do they determine the same coset? The easiet way to answer this question is to look at a specific example say note and have the same difference of their coordinates but these cosets are not the same, namely, the first one has among its first member while the second one amond its second member. However if and and then this is sufficient for them to be the exactly the same coset. This condition is also necessary, thus, we have completely described all the cosets.
So we can think of this cosets as the following. Let be a group of where . Define an equivalence relation on as two elements are equivalent if the first and second members are congruent, and the differences are the same. Define the group operation as basic component addition. This will be a group. The special case is when because everything is congruent to eachother so the only condition is that the difference between the elements is the same to determine the same equivalence class.
So I do not see any "nice" way of describing what this group is when , it certainly is not finite.
I think I got a "nice" representation. I haven't had time to check everything properly, but your equilvance relation idea sparked a few ideas in my head. I think it is that case that:
Hopefully, I will get a chance later to flush everything out and I will post it there.