Show G(p) of Order p^t when G is an Abelian Group of Order (p^t)m

Thorn
Messages
22
Reaction score
0
If G is an abelian group of order (p^t)m, and (p,m)=1, show that G(p) has order p^t

and G(p) = {a e G| |a|=p^m where m is a natural number}

any suggestions?
 
Physics news on Phys.org
What do you have to work with? This problem is trivial if you've developed enough tools.

You can also do this with your "bare hands" if you want to. What have you tried so far?
 
Last edited:
Geez...I have no idea where to start...

Ok, I was looking at a lemma...

"Let G be an abelian group and a \in G and is an element of finite order. Then a = a1+a2+...+ak, with ai an element of G(pi), where p1,...,pk are the distinct positive primes that divide the order of a"

... now G(p) is only the set of all elements whose order is some power of p... I was thinking you could use that lemma to show that G(p) has power pt ...seems like that could help somehow.. but it seems I need to use the fact that (p,m)=1 ...this surely means that (pt,m)=1 which means you can write 1=pt*u + m*v...for some numbers u,v... and I have no idea where to go...
 
Well...Actually, I could use Cauchy's theorem for Abelian Groups...

"If G is a finite abelian group and p is a prime that divides |G|, prove that G contains an element of order p...

we know that p divides |G|...and p2 divides the order of G...and so on and so on until we have pt divides the order of G...so all these elements exist in G(p)..then use the (p,m)=1 to show that each one of these elements is uniquely the product of m with some interger...I think that is it...
 
Does Cauchy's theorem imply that if p^m divides |G|, then G contains an element of order p^m?

The fact that G is abelian is vital here. First note that G(p) is a subgroup of G. Next note that G(p) has order a power of p, by Cauchy. If |G(p)| isn't p^t, then we can consider the group G/G(p). G/G(p) is still abelian, and p divides |G/G(p)|. Apply Cauchy's theorem again to get an element g+G(p) of order p. Now what?
 
you might start by trying to prove there is an element of order p, if t>0.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top