How Many Left Cosets of <a^4> in <a> Are There?

  • Thread starter Thread starter semidevil
  • Start date Start date
  • Tags Tags
    Cosets Formula
semidevil
Messages
156
Reaction score
2
so let's say |a| = 30. How many left cosets of <a^4> in <a> are there?

ok, so |a| = 30. and think I need to find the order of <a^4> also. I thought the order of it is

<a^4> = e, a^4, a^8, a^12, a^16, a^20, a^24, a^28. so it has order of 8. but my book said the order of it is 15...

is there a formula they used to figure this out?
 
Physics news on Phys.org
<a^4> can't have an order of 8 - that would violate Lagrange's theorem.

You've simply forgotten some elements, for example, (a^4)^8 = a^(32) = a^2 is in <a^4>.
 
Last edited:
Muzza said:
<a^4> can't have an order of 8 - that would violate Lagrange's theorem.

You simply forgotten some elements, for example, (a^4)^8 = a^(32) = a^2 is in <a^4>.


ok. I still don't really know and can't find the answer. Is there a formula or theorm that states the order of a^n?
 
Why can't you find the answer? Just continue like you did, but instead of stopping listing elements when you reach (a^4)^7, continue. It will eventuelly start to repeat.

It's relatively easy to see that the order of a^4 is 15, since (a^4)^k = e <=> a^(4k) = e is equivalent to "|a| divides 4k", i.e. "30 divides 4k" (and the smallest solution to that is k = 15).
 
Muzza said:
Why can't you find the answer? Just continue like you did, but instead of stopping listing elements when you reach (a^4)^7, continue. It will eventuelly start to repeat.

It's relatively easy to see that the order of a^4 is 15, since (a^4)^k = e <=> a^(4k) = e is equivalent to "|a| divides 4k", i.e. "30 divides 4k" (and the smallest solution to that is k = 15).

ah...ok, I get what you mean now...thanx..
 
##\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