Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

For any commutative ring $R$ let $R[x]$ denote the ring of polynomials with coefficients in $R$. Any polynomial $p \in R[x]$ naturally induces a function $\hat{p} :R \rightarrow R$. In some cases, a nonzero polynomial will induce the zero function. For example, with $R=\mathbb{Z}_6$, the polynomials $x^5 +3x^2+2x$, $3x^4 + 5x^3 + 4x$, and $x^4 - x^3 - x^2 + x$ all induce the zero function. Some things that I already know:

  • If $R$ is finite, $R = \{r_1, r_2, ... r_n\}$, then $(x-r_1)(x-r_2)...(x-r_n)$ induces the zero function.
  • If $R=\mathbb{Z}/p\mathbb{Z}$ then the ideal $I$ of polynomials inducing the zero function is generated by $x^p - x$ (and in fact this coincides with the polynomial given above).
  • If $R$ is an infinite integral domain, then no nonzero polynomial induces the zero function.
  • If $R$ is infinite but not an integral domain, then there may or may not be nonzero polynomials that induce the zero function. (I have examples of each.)

It's this last point that brings me here. I would like to know if there are necessary and sufficient conditions on $R$ that ensure that $\hat{p}=0$ only for $p=0$. Such conditions would have to be stronger than "infinite" but weaker than "infinite integral domain". Does anybody know what those conditions are?

share|improve this question
1  
In rings that are Cartesian products of integral domains $\hat p=0$ implies $p=0$. (We can argue component-wise). Interesting question. –  P Vanchinathan Mar 21 at 4:55
1  
I don't think so! I think you need them all to be infinite. For example every element in a Cartesian product of $\mathbb{Z}/2\mathbb{Z}$s satisfies $x^2-x=0$. And if you allow non-monic polynomials (whose coefficients are only non-zero in one component) then much worse things can happen. I think the question is "wild" and there will be no reasonable classification. –  eric Mar 21 at 7:03
2  
From the case of domains we get: If $\mathfrak{p}$ is a prime ideal with $|R/\mathfrak{p}| = \infty$, then all coefficients of a "bad" polynomial are in $\mathfrak{p}$. So e.g. a reduced ring with $|R/\mathfrak{p}| = \infty$ for all minimal primes qualifies. -- A notational request: Could you please write $\mathbb{Z}/p$ instead of what I see as $p$-adics in the second point (or just remove it, as it is really just a special case of the first)? –  Torsten Schoeneberg Mar 21 at 10:54
3  
In a Cartesian product $R=\prod_i R_i$ of rings, $\hat{p}=0$ implies $p=0$ iff all $R_i$'s have the same property. Has anybody an example of an infinite, indecomposable ring (i.e., no idempotents except $0$, $1$) such that $\hat{p}=0$ for some $p\neq 0$? –  Frieder Ladisch Mar 21 at 13:47
1  
@FriederLadisch, great question. Consider $R = \mathbb{Z}/(2) [x_1, x_2, \dots]/(x_1, x_2, \dots)^2$. This is a local algebra over the field with two element whose maximal ideal has square zero, and which is isomorphic to $\mathbb{Z}/(2)$ modulo that maximal ideal. Thus $p(x) = x^2(1-x)$ satisfies $\hat{p} = 0$ for this ring. –  Manny Reyes Mar 21 at 13:54

2 Answers 2

up vote 10 down vote accepted

$R$ has a nonzero polynomial that induces the zero function if and only if there are ideals $I$, $J$ such that $I$ is nontrivial, $IJ=0$, and $R/J$ is a ring satisfying the following condition:

There exists $n$ such that, for any $n$ elements $x_1, \dots x_n \in R/J$, the discriminant $\prod_{i<j} (x_i-x_j)=0$.

So $R$ is glued together out of an arbitrary ring and a ring that satisfies a specific polynomial identity.


Proof of only if: Let $I$ be the ideal generated by the coefficients of the nonzero polynomial and let $J$ be the ideal of zero divisors of $I$. We will show that for all $n$ elements $x_1,\dots x_n \in R$, $I\prod_{i<j} (x_i-x_j)=0$, so that $R/J$ satisfies this identity. To see this, take any $n$ elements $x_1,\dots,x_n\in R$ and take the Vandermonde matrix. Multiplying this by the vector of coefficients of the nonzero polynomial gives $0$. So multiplying on the other side by the adjugate matrix we still get $0$, but a matrix times its adjugate is just the identity times the determinant, so the determinant time each coefficient of the polynomial is $0$. The determinant of the Vandermonde matrix is just the discriminant $\prod_{i<j} (x_i-x_j)$.

Proof of if: Let $a$ be a nonzero element of $I$, let $n$ be the smallest $n$ such that $a\prod_{i<j} (x_i-x_j)=0$ for all $x_1,\dots,x_n \in R$, so that we have some $y_1,\dots y_{n-1}\in R$ that satisfy $a\prod_{i<j} (y_i-y_j)\neq0$ . Then all $x$ satisfy:

$$a\prod_{i<j} (y_i-y_j) \prod_{i=1}^{n-1} (x-y_i)=0$$

and the leading coefficient of that polynomial is nonzero.


Since $R/I$ is arbitrary, I think we should study rings satisfying $\prod_{i<j} (x_i-x_j)=0$. Such rings have all residue fields bounded in size by $n$, so all prime ideals are maximal and their spectra are totally disconnected topological spaces. Since the geometry of this kind of space is not very easy to classify, we might want to restrict our attention to the local rings:

If $R$ is a local ring with maximal ideal $m$, there is some $n$ such that, for all $x_1,\dots x_n \in R$, $\prod_{i<j} (x_i-x_j)=0$ if and only if $R/m$ finite and there is some $N$ such that every element $x\in m$ satisfies $x^N=0$.


Proof of only if: If $R/m$ is infinite, take $x_1,\dots x_n$ to be lifts of distinct elements in $R/m$. Set $N=\frac{n^3-n}{6}$. For all $x \in m$ we can take $x_i= x^i$ for $1\leq i \leq n$. Then

$$0=\prod_{i<j} (x_i-x_j) = \prod_{i<j} x^i (1-x^{j-i})$$

which is $x^{\frac{n^3-n}{6}}$, times a unit, so $x^N=0$.

Proof of if: If $a_1,\dots,a_m$ are lifts of all the elements of the residue field, $\prod_{i=1}^m (x-a_i)^N$ is monic and vanishes for all $x$, so the bottom row of the Vandermonde matrix of any $x_1,\dots, x_{mN}$ is a weighted sum of the previous rows, and so the determinant of the Vandermonde vanishes.


I don't think one can improve the classification much beyond this. Consider the examples $\mathbb Z[a,b]/(a^2,ab,2a)$, which is just slightly off from a nice infinite integral domain, but every element satisfies the identity $a x(x-1)=0$, and $\mathbb F_2[a_1,a_2,\dots]/(a_1^2,a_2^2,\dots)$, which is an extension of Manny Reyes's example where every element satisfies the identity $x^2(x-1)^2=0$. But I would be excited to see any further insights.

share|improve this answer

As I am not allowed to write comments, I write this as an answer, although it is only a partial answer.

  1. If $(R,\mathfrak{m})$ is local with $R/\mathfrak{m}$ finite and $\mathfrak{m}^n=0$ for some $n$, then there is a bad polynomial for $R$. It is obtained as in Manny Reyes comment. In this case one can choose a bad monic polynomial $P$ for $R/\mathfrak{m}$ (as in the question) and hence $P^n$ is not $0$.
  2. The assumption that $\mathfrak{m}^n=0$ for some $n$ is necessary here. As the following example shows: $$R=\mathbb{F}_p[t,t^{1/p},t^{1/p^2},t^{1/p^3},\dots]/(t^p)$$ is a local ring with maximal ideal $\mathfrak{m}=(t,t^{1/p},t^{1/p^2},t^{1/p^3},\dots)$ and every element in $\mathfrak{m}$ is nilpotent. But for every polynomial $P(x)\in R[x]$ there is some $t^q$ such that $P(t^q)\ne 0$.
share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.