5
$\begingroup$

Let $A$ be a commutative ring. I am trying to show that if $f(x_1,x_2,\ldots, x_r) \in A[x_1,x_2,\ldots, x_r]$ is a zero divisor then there exists $a$ in $A-\{0\}$ such that $af=0$ in $A[x_1,x_2,\ldots, x_r]$.

What I have tried so far as following.
I am using induction on $r$ (not fixing the ring). The base case is for $r=1$ which I did assuming the minimal degree of $g$ for which $fg=0$ holds. So my induction assumption is for $r \geq 2$ whenever $f$ is in $A[x_1,x_2,\ldots x_r]$, $n<r$ is a zero divisor there is $a$ in $A-\{0\}$ such that $af=0$. So for the final step I take $f(x_1,x_2,\ldots, x_r) \in A[x_1,x_2,\ldots, x_r]$ is a zero divisor. Now since $A[x_1,x_2,\ldots, x_r]=A[x_1][x_2,x_3,\ldots, x_r]$ by induction hypothesis there is $g$ in $A[x_1]-\{0\}$ such that $fg=0$.

I cannot proceed further. Am I correct so far? Please help me. Thank you.

$\endgroup$
  • 5
    $\begingroup$ 15 days in the site: you should really make an effort to learn the easy instructions to properly write mathematics in this site. $\endgroup$ – Timbuc Sep 27 '14 at 10:38
  • $\begingroup$ I don't know why it is not comming..Sorry $\endgroup$ – Via Sep 27 '14 at 10:39
  • 1
    $\begingroup$ Well, you could begin by editing this post...Observe you can enter in "edit" in any question/answer in the site and learn how things are typed there to learn. $\endgroup$ – Timbuc Sep 27 '14 at 10:44
  • 1
    $\begingroup$ While thinking about this problem, I found that $f$ is killed at least by some homoegeneous polynomial $\neq 0$. See math.stackexchange.com/questions/83121 $\endgroup$ – Martin Brandenburg Sep 27 '14 at 14:03
  • 1
    $\begingroup$ Use the lexicographical order on monomials. (Btw, you could have asked for more details under my answer before starting a bounty.) $\endgroup$ – user26857 Sep 30 '14 at 14:11
6
$\begingroup$

From your reasoning it follows that $g(x_1)$ annihilates the (non-zero) coefficients of $f$ in $A[x_1]$. All you have to do now is to prove the following extension of the case $r=1$:

Let $f_1,\dots,f_t\in A[X]$ be non-zero polynomials. If there is $g\in A[X]$, $g\ne 0$, such that $gf_1=\cdots=gf_t=0$, then there is $a\in A$, $a\ne 0$, such that $af_1=\cdots=af_t=0$.

We show by induction on $d=\max_{1\le i\le t}\deg f_i$ that there is an element $a$ as before which moreover belongs to the ideal generated by the coefficients of $g$.

If $d=0$ there is nothing to prove. For $d\ge 1$ let's write the polynomials $f_i(X)=\sum_{j=0}^{n_i}a_{ij}X^j$ with $n_i=\deg f_i$, $\max\{n_1,\dots,n_t\}=d$, and $g(x)=\sum_{j=0}^nb_jX^j$, where $n=\deg g$. Suppose that $n\ge 1$. Then $b_na_{in_i}=0$ for $i=1,\dots,t$. Now consider two cases:
(1) If $a_{1n_1}g=\cdots=a_{tn_t}g=0$, then set $f_i'=f_i-a_{in_i}X^{n_i}$. Since $gf_i'=0$ for $i=1,\dots,t$ and $\max_{1\le i\le t}\deg f_i'<d$ we can apply the induction hypothesis and find an element $a\ne 0$ in the ideal generated by the coefficients of $g$ such that $af_1'=\cdots=af_t'=0$. This leads to $af_1=\cdots=af_t=0$.
(2) If there is $1\le i\le t$ such that $a_{in_i}g\ne 0$, then $(a_{in_i}g)f_1=\cdots=(a_{in_i}g)f_t=0$ and $\deg (a_{in_i}g)<\deg g$. An induction argument on $\deg g$ shows that there is $a\ne 0$ in the ideal generated by the coefficients of $a_{in_i}g$ such that $af_1=\cdots=af_t=0$.

$\endgroup$
  • $\begingroup$ We started with induction on d,bt in case (2) we induct on deg g..it is not clear $\endgroup$ – Via Oct 1 '14 at 15:03
  • $\begingroup$ @Via What happens in case (2) if $\deg g=0$? $\endgroup$ – user26857 Oct 1 '14 at 15:55
  • $\begingroup$ deg g =0 implies we get a non zero element in A annihilating all the f-is $\endgroup$ – Via Oct 1 '14 at 15:58
  • $\begingroup$ @Via Then use induction on $\deg g$ for case (2). $\endgroup$ – user26857 Oct 1 '14 at 15:59
  • $\begingroup$ So we are using on both the variables d and n $\endgroup$ – Via Oct 1 '14 at 16:00

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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