Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We want to show that if $a,b\in G$ where $G$ is a finite Abelian group, we have $\operatorname{LCM}(|a|,|b|) = |ab|$ given that $ab \neq e$.

How I approached this question was by saying let $\operatorname{LCM}(|a|,|b|) = L$. Then if we show that $L$ divides $|ab|$ and $|ab|$ divides $L$ then $|ab| = L$. Showing that $|ab|$ divides $L$ was fine. But then I am having trouble with the second part that is showing $L$ divides $|ab|$. For this, so far I have:

Consider $(ab)^{|ab|} = e = a^{|ab|}b^{|ab|} $ since we know $a \neq b^{-1}$ by assumption then we can conclude that $|a|$ divides $|ab|$ and $|b|$ divides $|ab|$. We know that $L = \frac{|a||b|}{\operatorname{gcd}(|a|,|b|)}$ from here can we conclude that $L$ divides $|ab|$?

share|improve this question
    
This first part was fine, I understand that |ab| divides L, I wanted to know if I approached the second part of trying to show that L divides |ab| was correct. –  user77404 Jun 19 '13 at 1:21
    
This is very likely to be a duplicate, though I can't find one at the moment. –  Zev Chonoles Jun 19 '13 at 1:24
    
How exactly did you get that |a| and |b| divide |ab|? –  anon Jun 19 '13 at 1:46
1  
@Zev I think this might be a duplicate It's close, but it talks about the existence of an element of order lcm(|a|, |b|), in an abelian group with elements $a$, $b$, not specifically that $|ab| = \operatorname{lcm}(|a|, |b|)$ –  amWhy Jun 19 '13 at 1:46
    
oops, that's not quite right, it is in fact a duplicate! –  amWhy Jun 19 '13 at 1:53

2 Answers 2

up vote 5 down vote accepted

But then I am having trouble with the second part that is showing |ab| divides L.

Recall that if $g\in G$ and $g^n=e$, then this implies implies $|g|$ divides $n.$ So $(ab)^L = e \implies |ab|$ divides $L.$

Edit: If you are trying to show that $L$ divides $|ab|$, then with respect to your last question, the work you have, knowing that $$L = \frac{|a||b|}{\gcd(|a|,|b|)}$$ tells you $L$ divides $|a||b|$. If you can show it follows that $$L = \frac{|ab|}{\gcd(|a||b|)}$$ then you have shown that $L$ indeed divides $|ab|$.

share|improve this answer
1  
No, in general |a||b| does not divide |ab|. –  anon Jun 19 '13 at 1:36
1  
We don't know that $|a||b|$ divides $|ab|$. –  amWhy Jun 19 '13 at 1:39
1  
You've made some good progress. I did find a "duplicate sort" of question, take a look at this post for a nudge to completion! Recall, What you want is to conclude lcm(|a|,|b|) = |ab|, and for this part of the problem, that $L$ divides |ab|, so don't take on more than you need to! –  amWhy Jun 19 '13 at 1:54
1  
@amWhy , i think there is intuitive proof as follows , we can show easily that if $g\in G$ and if $g^n= 1$ then $|g|$ \ $n$ , i think every one will accept that ! " it's easy to prove it also".now , let $L.C.M(|g|,|h|)=L$ first , it's easy to prove that $(gh)^L=1$ using the fact that $(gh)^k=g^k * h^k$ as $G$ is abelian so $|gh|$ \ $L$ , now , if $L$ is not the order of $gh$ then there is some $r <L$ and $(gh)^r =1$ so $r$ must be a multiple of $|g|$ and $|h|$ so $r\geqslant L$ contradiction since $L<r$ so $|gh|=L=L.C.M(|g|,|h|)$ ,it needs some details to be done,but i think it works –  Maths Lover Jun 19 '13 at 9:50
1  
@MathsLover I really like your idea, I think I will go with that thank you. Another approach I discovered is to consider cases. We can show that if |a|,|b| are relatively prime (gcd(|a|,|b|)=1) then lcm(|a|,|b|)=|a||b| = |ab| this is not to hard to show. If |a| = |b|, then also lcm(|a|,|b|)=|a|=|b| = |ab|. However, I wasn't sure about the case where gcd(a,b) = k > 1. But your approach fixes the last part of my proof, thanks. –  user77404 Jun 19 '13 at 15:47

The stated result is wrong

In the (additively written) cyclic group $\Bbb Z/6\Bbb Z$ of order$~6$, the elements $a=1$ and $b=2$ respectively have orders $|a|=6$ and $|b|=3$. Then $L=\operatorname{lcm}(6,3)=6$, but that is not the order of $a+b=3$, since that element has order$~2$. So the statement fails.

This also shows that your argument that $|a|$ and $|b|$ both divide $|ab|$ cannot work. You seem to think that since $a,b$ are not inverses of each other, $a^m$ and $b^m$ are not inverses of each other either, with $m=|ab|$. But in the example $m=2$, and here it is the case that $a^2$ and $b^2$ are inverses of each other (additively written these elements are $2a=2$ and $2b=4$). When you say "by assumption then we can conclude that $|a|$ divides $|ab|$" it is not clear what assumption you are referring to, but your conclusion is wrong.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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