0

In $\Bbb Z_3[x]$ let $f(x)=x^3+x^2+x+1$ and let $A=\Bbb Z_3[x]/(f) $ be the quotient ring. I'm asked to find the cardinality of $A $ and whether it is a field.

For the cardinality, I should find that $A $ is in bijection with the set of polynomials with degree smaller than $3$ (and in $\Bbb Z_3[X]$), hence $|A|=3^3$.The thing is, I can't really visualise $A$. I know its elements are the classes of the remainders of Euclidean division by $f$, but how do I get these?

For the other question, the given answer is that $f(x)=(x^2+1)(x+1) $ is reducible in $\Bbb Z_3[X]$, thus $A$ is not a field. Why does this work? Is this a general property of quotient rings of polynomials, i.e. if $a\in A[X]$ is reducible then $A[X]/(a)$ is not a field?

Richard
  • 942

2 Answers2

2

I'm guessing by $\mathbb{Z}_3$ you mean $\mathbb{Z}/3\mathbb{Z}$ and not the $3$-adic integers.

To answer your second question, yes there is a general property of this sort. Namely, a quotient ring $R/I$ is a field if and only if $I$ is a maximal ideal. In your case, $I$ is the principal ideal generated by $f$, so $I$ is maximal iff $f$ is irreducible (prove this yourself!).

Your first question seems more conceptual. A way to "visualize" $A$ could be by using the chinese remainder theorem to write it as the product of a field with 9 elements and a field with 3 elements via the decomposition of $f$ you gave. Have a look at the related questions if you're still confused.

ggg
  • 1,283
  • 9
  • 26
2

$\frac {\mathbb Z_3[x]}{x^3+x^2+x+1}$ gives us a set of polynomials in $\mathbb Z_3[x]$ of degree 2 (or less).

This can be thought of as a 3 dimensional vector space. And there are $3^3$ elements.

Since $(x + 1)(x^2 +1) = 0$ in this ring, it is not a field. In a field $ab = 0$ if and only if $a = 0$ or $b = 0$

Doug M
  • 57,877
  • Why does the quotient give us a set .... of degree 2? I don't know because I don't see how to treat the elements of it. Also, why is that product equal to zero? – Richard Jul 11 '17 at 00:13
  • If you take a polynomial and you divide it by another polynomial, the remainder will always be smaller than the polynomial that is doing the dividing. It is a consequence of the Euclidean algorithm. – Doug M Jul 11 '17 at 00:17
  • Ohhh, right, how could I not see it! Thank you! – Richard Jul 11 '17 at 00:38
  • Ah excuse me, why is $(x+1)(x^2+1)=0$? – Richard Jul 11 '17 at 07:58
  • $(x+1)(x^2+1) = x^3+x^2+x+1$ – Doug M Jul 11 '17 at 16:26
  • I'm sorry, could you please spell it out for me? – Richard Jul 11 '17 at 16:38
  • Do you agree that $(x+1)$, and $(x^2+1)$ are in the quotient ring? i.e. you divide either by $(x^3+x^2+x+1)$ they are still remainders. Now their product... multiply them together $(x+1)(x^2+1),$ divide by $f(x)$ what is the remainder? – Doug M Jul 11 '17 at 16:44
  • $0$ of course, I had lost sight of the set we were in... thanks again – Richard Jul 11 '17 at 16:49