Subgroup of Index ##n## for every ##n \in \Bbb{N}##.

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Index Subgroup
Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


A nonzero free abelian group has a subgroup of index ##n## for every positive integer ##n##

Homework Equations

The Attempt at a Solution



If ##F## is a nonzero free abelian group, then ##F## is isomorphic to the direct sum ##G= \sum_{i \in I} \Bbb{Z}##, where ##I \neq \emptyset##. Since ##I## is not empty, it contains at least one element ##k##. Now define ##H_k = n \Bbb{Z}##, and define ##H_i = \Bbb{Z}## for all ##i \neq k##. Then clearly ##H := \sum_{i \in I} \Bbb{Z}## is a subgroup of ##G##. Since ##G## is abelian, ##H## is trivially normal and therefore ##G/H \simeq \sum_{i \in I} \Bbb{Z}/H_i \simeq \Bbb{Z}_n##, which has order cardinality ##n##. Hence, ##H## is a subgroup of index ##n##, and since ##G## is isomorphic to ##F##, it too must have a subgroup of index ##n##.

How does this sound?
 
Physics news on Phys.org
Sounds good. I don't know why you mentioned normality, but I can't see any wrongs.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top