3
$\begingroup$

I have already tried with $S_3$, and indeed, the product is $(13)$, and $(13)^2=e$

enter image description here

But what about this: I define + in this way:$45=2$,$26=3$, $1$ is the identity. therefore, $123456=2326=233=3$, and as you can see from the picture, the inverse of $3$ is not itself, thus contradicts the statement. My question:
What is wrong with my argument?
And How do you prove the statement?
it seems that my set of numbers perfectly forms a group under the operation I defined via the table above. first it's closed, second there is an identity, third every elements have an inverse. By the way it's commutitive. I tried (45)2=22=6=42=4(52), (45)6=26=3=43=4(56), so associativity seems to be satisfied.

$\endgroup$
  • $\begingroup$ $S_3$ is not abelian. What order did you use? Or do you get $x^2=e$ for every order? $\endgroup$ – lhf Apr 25 '14 at 3:05
  • $\begingroup$ the product isn't necessarily the identity $\endgroup$ – pxc3110 Apr 25 '14 at 3:06
  • $\begingroup$ What you have defined is obviously not a group. E.g. you've already seen that 22=6=42, but then (22)3=(42)3 and -- if associativity would hold -- 2=4. $\endgroup$ – Ansgar Esztermann Apr 25 '14 at 7:09
  • $\begingroup$ This question is mostly a duplicate of math.stackexchange.com/questions/53026/finite-abelian-group $\endgroup$ – Chris Culter Jul 25 '15 at 8:47
3
$\begingroup$

$$a_1a_2a_3\ldots a_n a_1a_2a_3\ldots a_n$$ Let's start by canceling $a_1$. Some other, unique $a_i$ is equal to $a_1^{-1}$. Since the group is abelian, we can move that $a_i=a_1^{-1}$ from the second half over beside the $a_1$ in the first half (everything commutes, so order doesn't matter). So, those cancel, leaving $$a_2\ldots a_na_1\ldots a_{i-1}a_{i+1}\ldots a_n$$ Now we can do the same thing to cancel the $a_1$ on the right, we can just move it over next to the $a_i=a_1^{-1}$ on the left, and they cancel, so now we have $$a_2\ldots a_{i-1}a_{i+1}\ldots a_na_2\ldots a_{i-1}a_{i+1}\ldots a_n$$ Now both $a_1$ and $a_i$ are dealt with, and we're one step closer to the identity. We can do the same with $a_2,a_3,$ and so on.

What I'm writing isn't a rigorous proof, but do you get my drift as to why this works intuitively? Could you turn it into a rigorous proof?

Think about pairing each element with its inverse. Can you show that $x^2=a_1a_1^{-1}a_2a_2^{-1}\ldots a_na_n^{-1}a_1a_1^{-1}a_2a_2^{-1}\ldots a_na_n^{-1}$?

Extended question to consider: why is it that we can't just write $x=a_1a_2\ldots a_n=e$ using the above logic? What is the one thing that could mess that up and make us need another copy of $x$?

$\endgroup$
  • $\begingroup$ thank you sir. And what's wrong with the operation I defined? will the set form a group under this operation? $\endgroup$ – pxc3110 Apr 25 '14 at 3:18
  • $\begingroup$ @pxc3110 Like Zarrax said, you haven't defined a group. Are you sure you understand the definition of a group? $\endgroup$ – Alexander Gruber Apr 25 '14 at 3:21
  • $\begingroup$ About your extended question: I realized in the first place that some non trivial elements could have itself as its inverse, there fore their product needs not be the identity, is that correct? $\endgroup$ – pxc3110 Apr 25 '14 at 3:21
  • $\begingroup$ @pxc3110 Yes, so if you know Cauchy's, you can then say that $x=a_1a_2\ldots a_n=e$ in an abelian group if and only if the order of the group has what property? $\endgroup$ – Alexander Gruber Apr 25 '14 at 3:35
  • $\begingroup$ If the finite group is of odd order, the by lagrange's theorem, none of the elements has order of 2, therefore, none of them has itself as its inverse, or all of them can paired together, don't know a thing about Chauchy's though $\endgroup$ – pxc3110 Apr 25 '14 at 3:42
4
$\begingroup$

Note that $x^2=(a_1a_2a_3\cdots a_n)(a_1a_2a_3\cdots a_n)=(a_1a_2a_3\cdots a_n)(a_1^{-1}a_2^{-1}a_3^{-1}\cdots a_n^{-1})$ because inversion is a bijection and the group is abelian.

$\endgroup$
  • $\begingroup$ If G is of odd order, what can you say about "x" or the product then please? $\endgroup$ – pxc3110 Apr 25 '14 at 3:01
  • $\begingroup$ @pxc3110, a group of odd order cannot have an element of order 2, because of Lagrange's theorem. Since $x^2=e$, the only way is $x=e$. But that was not part of your question. $\endgroup$ – lhf Apr 25 '14 at 3:02
  • $\begingroup$ @pxc3110, see math.stackexchange.com/questions/9311/…. $\endgroup$ – lhf Apr 25 '14 at 3:06
2
$\begingroup$

What you have defined is not a group.

Hint for your problem: Pair each $a_i$ that you can with its inverse, and multiply to get $1$. Which $a_i$ are left in your product?

$\endgroup$
  • $\begingroup$ Thank you sir. Why is it not group please? I already tried what you said before, but what I concluded was that the product is some element in the group, and its inverse needs not be itself. $\endgroup$ – pxc3110 Apr 25 '14 at 2:57
  • $\begingroup$ you have to define all possible products... and you have to make sure they satisfy associativity, commutativity (for an abelian group) and so on. So the products you have given can't be extended to all possible products in such a way that you get an abelian group. $\endgroup$ – Zarrax Apr 25 '14 at 2:59

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.