Finding Cosets with H = {0, 3, 6} under Z(9): Understanding the Starting Values

  • Thread starter Thread starter semidevil
  • Start date Start date
  • Tags Tags
    Cosets
semidevil
Messages
156
Reaction score
2
so let H = { 0, 3, 6} under Z(9), and I need to find a + H.

the book shows

0 + H = 3 + H = 6 + H
1 + H = 4 + H = 7 + H
2 + H = 5 + H = 8 + H.

I"m not understanding why they start with 0, 1, 2. what gives that away?
 
Physics news on Phys.org
They find the coset of each element in the nice logical order that comes from the fact that 0<1<2, and that completely enumerates all the cosets. You've got to start somewhere, why not there?
 


The starting values of 0, 1, and 2 are based on the definition of cosets. In this case, the cosets are defined as the set of all elements that can be obtained by adding an element from H to a given element in Z(9). Since H = {0, 3, 6}, the cosets will be of the form a+H, where a is any element in Z(9).

Starting with 0, 1, and 2 allows us to cover all possible elements in Z(9) and ensures that we do not miss any elements in the cosets. For example, if we started with a different set of values, such as 3, 4, and 5, we would not be able to represent the elements 0, 1, and 2 in the cosets.

Additionally, starting with 0, 1, and 2 allows us to easily identify the elements in each coset. For example, in the first coset (0+H), we can see that all elements in this coset will be multiples of 3, since 0+0=0, 0+3=3, and 0+6=6. Similarly, in the second coset (1+H), all elements will be 1 greater than a multiple of 3, and in the third coset (2+H), all elements will be 2 greater than a multiple of 3.

In summary, starting with 0, 1, and 2 allows us to have a systematic approach to finding all the elements in the cosets and ensures that we do not miss any elements.
 
##\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