Z[x]/(1-x)/(x^{p-1}+ +x+1) = Z/pZ ?

  • Thread starter Thread starter rukawakaede
  • Start date Start date
rukawakaede
Messages
58
Reaction score
0
Hi, could anyone solve my confusion?

Let p be a prime and let x=\zeta_p to be a primitive pth root of unity.

How could we conclude

\frac{\mathbf{Z}[x]/(1-x)}{(x^{p-1}+\cdots+x+1)}=\mathbf{Z}/p\mathbf{Z}=\mathbb{F}_p ?

This should be obvious but it seems that I missed something. Could anyone help?Am I correct to infer that if we want to force 1-x = 0, i.e. x = 1 and hence \mathbf{Z}[x]/(1-x)=\mathbf{Z}. So \frac{\mathbf{Z}[x]/(1-x)}{(x^{p-1}+\cdots+x+1)}=Z/(p) and therefore gives the result?
 
Last edited:
Physics news on Phys.org
Are you sure the problem reads Z[x]/(1-x)(x^{p-1}+...+x+1) = Z/pZ and
not Z[x]/(1-x)/(x^{p-2}+...+x+1) = Z/pZ ?
 
Eynstone said:
Are you sure the problem reads Z[x]/(1-x)(x^{p-1}+...+x+1) = Z/pZ and
not Z[x]/(1-x)/(x^{p-2}+...+x+1) = Z/pZ ?

I am pretty sure it is Z[x]/(1-x)(x^{p-1}+...+x+1) = Z/pZ

it would be good that you write out why you think it is not the case.
 
##\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