group problem
- From: "Li Yi" <liyi.cn@xxxxxxxxx>
- Date: 30 May 2005 17:38:17 -0700
Let G be an abelian group and suppose that G has elements of orders
m and n, respectively. Prove that G has an element whose order is
the least common mutiple of m and n.
The following proof is presented in 'problems from herstein'.
=====================
Proof. Let o(a) = m and o(b) = n. If (m, n) = 1, then let c = ab.
Clearly, c^[m,n] = c^mn = a^mn b^mn = e. If o(c) = r, we have a^r =
b^(-r). Thus, e = a^mr = b^(-mr). But then n|mr. Since (m, n) = 1,
n|r. Similarly, m|r. This implies that [m, n] = mn|r and thus mn = r.
If (m, n) = d > 1, then o(a^d) = m/d and o(b^d) = n/d and (m/d, n/d) =
1. Thus (ab)^d has order mn/d^2 by previous case and thus ab has order
[m, n] = mn/d.
=====================
I wonder the last step. Why does ab have order mn/d if (ab)^d has the
order of mn/d^2?
If o(a^2)=5, o(a) is not necessary to be 10. It can be 5, too.
.
- Follow-Ups:
- Re: group problem
- From: Arturo Magidin
- Re: group problem
- From: Pawel Gladki
- Re: group problem
- From: Michiel de Bondt
- Re: group problem
- Prev by Date: Re: programs
- Next by Date: Re: programs
- Previous by thread: programs
- Next by thread: Re: group problem
- Index(es):
Relevant Pages
|
|