Prove Free Abelian Group \mathbb{Z}_{p^r}[p] is Isomorphic to \mathbb{Z}_p

  • Thread starter Thread starter ehrenfest
  • Start date Start date
  • Tags Tags
    Groups
Click For Summary

Homework Help Overview

The problem involves demonstrating that the group \(\mathbb{Z}_{p^r}[p]\) is isomorphic to \(\mathbb{Z}_p\) for any integer \(r \geq 1\) and prime \(p\). The subgroup \(\mathbb{Z}_{p^r}[p]\) is defined as the set of elements in \(\mathbb{Z}_{p^r}\) such that \(px = 0\).

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the nature of the subgroup and question the completeness of the original poster's identification of its elements. There is an exploration of the subgroup generated by certain elements and the implications of subgroup properties.

Discussion Status

Participants are actively engaging with the problem, questioning assumptions about the subgroup's elements and exploring the necessary conditions for isomorphism. Some guidance has been offered regarding the subgroup's structure and the need to verify the absence of additional elements.

Contextual Notes

There is an indication that the original poster may be uncertain about the subgroup's properties and the implications of the congruence relation \(px = 0\) in the context of number theory.

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


Show that \mathbb{Z}_{p^r}[p] is isomorphic to \mathbb{Z}_p for any r \geq 1 and prime p.

\mathbb{Z}_{p^r}[p] is defined as the subgroup \{x \in \mathbb{Z}_{p^r} | px = 0 \}

Homework Equations


The Attempt at a Solution



I don't think I should need to use Sylow's Theorems for this since it is in a different section. I can only think of two elements in that subgroup p^{r-1} and 0 and am not really sure how to find the rest or figure out their subalgebra. Actually I guess I just need to prove that the group has p elements and then the only possibility will be Z_p. But how to do that?
 
Last edited:
Physics news on Phys.org
First of all, they call the set a subgroup, and you should try to see why it is one. Assuming it is, you can't have found all the elements since what you have isn't a subgroup. What is the smallest subgroup containing those elements (also known as the subgroup generated by them)?
 
StatusX said:
First of all, they call the set a subgroup, and you should try to see why it is one. Assuming it is, you can't have found all the elements since what you have isn't a subgroup. What is the smallest subgroup containing those elements (also known as the subgroup generated by them)?

Um--but how do I know that the subgroup generated by p^{r-1} is the same as \mathbb{Z}_{p^r}[p]?
 
You don't, but now that you have the right number of elements, it suffices to prove there's nothing else.
 
It is really easy to calculate the subgroup generated by p^{r-1}:

It is {0, p^{r-1},2p^{r-1},...,(p-1)p^{r-1}}.

Now I need to show that there are no other solutions to px = 0 (mod p^r). Seems like a number theory problem. That congruence implies x = 0 (mod p^{r-1}) and I just listed all the multiples of p^(r-1) that are less than p^r.
Is that right?
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
15
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K