I am looking for an example of a finite abelian group (G) where the
Ʃa ǂ 0 where a ϵ G
Can someone help me with this one?
I am looking for an example of a finite abelian group (G) where the
Ʃa ǂ 0 where a ϵ G
Can someone help me with this one?
This really makes no sense:
[tex]\sum a[/tex]
Can you explain the notation?
edit:
Did you mean:
[tex]\displaystyle \sum_{a\in G} a \neq 0[/tex]?
Last edited by daon2; 01-19-2012 at 12:07 AM.
Yes exactly I meant that...
Then how about [tex]\mathbb{Z}/2\mathbb{Z}[/tex]?
I just cant imagine group theory scenarios, have been trying hard to think about the Z/2Z situation but cant understand why the summation under addition of all elements should not be the neutral element, the reason being the inverse of the element will also be present in the group right? so each element can be added to its inverse to give us the neutral element and in the end the summation of all the neutral element should give us the neutral element back...isn't it?
I am not getting much confidence in group theory, could you suggest how I can get better in it?
Another notation for [tex]\mathbb{Z}/2\mathbb{Z}[/tex] is [tex]\mathbb{Z}_2 = \{0,1\}[/tex]. Are you sure you don't see how [tex]\sum_{a \in \mathbb{Z}_2}{a}\ne 0[/tex]?
Every element in a group has a unique inverse, yes. However, some elements are their own inverses (1 is its own inverse in the above group). Here is a more general approach to this problem, but certainly not the most general.
Take any even integer [tex]n=2k[/tex], and form the group [tex]\mathbb{Z}/n\mathbb{Z}[/tex]. As SlipEternal mentioned, that quotient group can be thought of as the group [tex](\{0,1,...,n-1\}, +)[/tex], where [tex]+[/tex] is addition mod n. Then what is the sum of the group elements?
[tex]\displaystyle \sum_{i=0}^{n-1} i = \frac{(n-1)(n)}{2} = \frac{(n-1)(2k)}{2} = k(n-1)[/tex].
Now [tex]n-1[/tex] is really the same element as [tex]-1[/tex], so in [tex]G[/tex] The sum is equal to [tex]-k[/tex]. However [tex]k[/tex] is its own inverse, so the sum is just [tex]k[/tex] (which is not 0 if n>0).
For your last question, I was in your place once. I suggest you do every exercise you can. Many books give as exercises very central ideas. Confidence comes from experience.
Maybe think about exactly when it will happen that the sum is the identity, and do the proof.
Yep I kind of get it now, thank you both so so much for your inputs. , I believe Math can be best learnt as you said by practice and also by the exchange of ideas and different approaches to a problem. I am glad I bumped into this forum. Thanks again, I guess I will keep coming in as and when I am stuck, hoping that its not that often
Let G be a ﬁnite abelian group. If g ∈ G we write 2g for the element
g + g. Show that
2 Ʃa = 0 a ϵ G.
I am sorry I dont know how to use mathematical notations like the way you guys have mentioned in your replies. Please let me know how to do that too.
This is very related to the more general example I have above. Recall that the example I gave had an element that was its own inverse. If an element g is its own inverse then g+g=0. It takes care of those "problem" elements who are their own inverses... Can you finish it now?
For the notation, double click on the image to see the code. Put that code inside: [tex.] [/tex.] without the periods.
Last edited by daon2; 01-19-2012 at 10:45 PM.
Bookmarks