True or false :
Let G and H be finite abelian groups, and assume that they have the following property. For each positive integer m , G and H have the same number of elements of order m . Then, G and H are isomorphic.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice problem, Comrade @Chinmay Sangawadekar ... simple but interesting! . I actually misread it while I was still half asleep, and I got it wrong ;) Once I woke up, I did it this way:
It suffices to show the claim for p -groups since any finite Abelian group is the product of its p -subgroups. (For a fixed prime number p , the p − subgroup consists of all elements whose order is a power of p .)
If G and H are two p -groups satisfying the given order condition, let p n be the maximal order of its elements. Then we can write G = C × G ′ and H = C × H ′ where C is the cyclic group of order p n . Now G ′ and H ′ satisfy the given order condition , so that they are isomorphic by induction.
Log in to reply
Thank you sir glad you liked the problem... @Otto Bretscher
Sir can you suggest me some books on Advanced Number theory and calculus ? @Otto Bretscher
Log in to reply
This basic stuff you can find in any introductory (abstract) algebra text, like Herstein's "Topics in Algebra". Any such text would have (at least) a chapter on groups, including a discussion of the structure of finite Abelian groups. Good algebra texts are "Modern Algebra" by van der Waerden (my first algebra teacher), "Basic Algebra" by Jacobson, "Algebra" by Serge Lang and "Algebra" by Michael Artin, a more "modern" treatment. I think one should first have an understanding of basic algebra before moving on to number theory.
Oops... I missed the word "Abelian". Yes, nice job!
Log in to reply
Yhanl you sir ! glad you liked the problem... @Arjen Vreugdenhil
Problem Loading...
Note Loading...
Set Loading...
The structure theorem for finite Abelian groups (we shall not consider finitely generated infinite Abelian groups here) states that every finite Abelian group can be written as the direct sum of finite cyclic groups of prime power order G ≡ Z p 1 a 1 ⊕ Z p 2 a 2 ⊕ ⋯ ⊕ Z p N a N where p , p 2 , … , p n are prime and a 1 , a 2 , … , a N are positive integers. Moreover, the prime powers p 1 a 1 , p 2 a 2 , … , p N a N are uniquely determined by G to within ordering, and so determine G to within isomorphism.
For a given finite Abelian group G , let us tidy up this decomposition, sorting the cyclic groups into the different prime powers, and write G ≡ p ⨁ n = 1 ⨁ A ( p ) Z p a ( p ) n so that G is constructed from A ( p ) cyclic groups whose orders are powers of p (for each prime p ). Obviously, only a finite number of primes p will actually contribute to this sum.
Let X G ( p n ) be the number of elements of G with order p n , and let Y G ( p n ) be the number of elements of G with order dividing p n , so that Y G ( p n ) = ∑ m = 0 n X G ( p m ) .
A cyclic group C of order p k has 1 element of order 1 , p − 1 elements of order p , p 2 − p elements of order p 2 , p 3 − p 2 elements of order p 3 , ..., p k − p k − 1 elements of order p k , so that Y C ( p m ) = p m i n ( m , k ) m ≥ 0 . Returning to our original group G and its decomposition, we see that Y G ( p m ) = n = 1 ∏ A ( p ) p m i n ( m , a ( p ) n ) = p ∑ n = 1 A ( p ) m i n ( m , a ( p ) n ) m ≥ 0 .
Thus, if we know the numbers of elements of each order in the group G , we know all the numbers Y G ( p m ) , and hence we know all the numbers Z p , m = n = 1 ∑ A ( p ) m i n ( m , a ( p ) n ) , p p r i m e , m ≥ 0 . But Z p , 1 Z p , 2 − Z p , 1 Z p , 3 − Z p , 2 = = = n : a ( p ) n ≥ 1 ∑ a ( p ) n n : a ( p ) n ≥ 2 ∑ a ( p ) n n : a ( p ) n ≥ 3 ∑ a ( p ) n and so on. In other words, if we know all the numbers Z p , m , then we know (for each p ) how many of the a ( p ) n are equal to 1 , how many are equal to 2 , how many are equal to 3 , and so on. In other words, we know all the values of the a ( p ) n (to within ordering). But this means that we know the group G to within isomorphism.
In summary, if we know how many elements of each order a finite Abelian group possesses (from the above, it is sufficient to know the number of elements of each prime power order), then the group is determined to within isomorphism. If two finite Abelian groups possess the same numbers of elements of each order, then the groups are isomorphic.