C10 Group, 10th roots unity with complex number multiplication

basketweaving
Messages
1
Reaction score
0
This is for 10th root unity with complex number multiplication. I am working on closure. I have multiplied 2 elements of my set and I have so far that cos[(n+k)360/10] + isin[(n+k)360/10]. Thus I know that if n+k<=9 then there is an element in the set. Now I need to show for if n+k>9 and if n+k<0. If someone could please help me, I would appreciate it. Thanks.
 
Last edited:
Physics news on Phys.org
If n+ k> 9, then n+ k= 10a+ b where a and b are positive integers and b\le 9. In that case, cos[(n+k)360/10]= cos[(10a+b)360/10]= cos[360a+ b(360/10)]. Now use the fact that cosine is periodic with period 360 (degrees).

If n+ k< 0, then thre exist an integer a such that 10a> -(n+k) so 10a+ n+ k> 0. Again, (10a)(360/10)= 360a, a multiple of 360 degrees.

Is there any specific reason for working in degrees? For problems like this it is almost always standard to work in radians- that is, use 2\pi rather than 360.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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