Skip to main content
4 of 5
added 15 characters in body
Neil Epstein
  • 1.8k
  • 1
  • 11
  • 18

To complement Mohan's answer, it is worth noting that there are counterexamples when $R$ contains a field $k$ of prime characteristic $p$. Indeed, when $p\geq 3$, let $R=k[\![X,Y]\!]/(X^p, Y^p)$, and denote the images of $X$, $Y$ in $R$ by $x$, $y$ respectively. Then I claim that $t=p$ but $e\geq 2p-2>p$. To see this, note that any element of $f\in\mathfrak m$ is of the form $f=xg+yh$, and then by Freshman's Dream, $f^p = x^p g^p + y^p h^p = 0$, whereas clearly $x^{p-1} \neq 0$, showing that $t=p$. On the other hand, $0 \neq x^{p-1} y^{p-1} \in {\mathfrak m}^{2p-2}$.

A characteristic 2 counterexample is given by $k[\![X,Y]\!]/(X^4, Y^4)$ ($k$ any field of char 2), in which case $t=4$ but $e\geq 6$.

To summarize, your question of equality has a 'yes' answer if you are willing to assume the ring contains $\mathbb Q$, but can be 'no' if $R$ contains a field of any other characteristic. I don't know what happens in mixed characteristic.

EDIT: Equality fails in any mixed characteristic $(p^c, p)$. To see this, let $A := {\mathbb Z}/(p^c)$ and $R := A[X,Y]/(X^p, Y^p)$. First note that $0\neq p^{c-1} (xy)^{p-1} \in {\mathfrak m}^{c+2p-3}$, whence $e>c+2p-3$. However, I claim that $t \leq c+2p-3$. To see this, note that any element of $\mathfrak m$ has the form $pf+xg+yh$. We have $(xg+yh)^{2p-1}=0$ since every term in the expansion is divisible by $x^p$ or $y^p$, and by a similar computation we have $$ (xg+yh)^{2p-2} = {2p-2 \choose p-1} (xygh)^{p-1}. $$ We have $$ (pf+xg+yh)^{c+2p-3} = \sum_{i=0}^{c+2p-3} {c+2p-3 \choose i} (pf)^i (xg+yh)^{c+2p-3-i}, $$ and by the above considerations, the only term that potentially survives is the term where $i=c-1$. That is, $$ (pf+xg+yh)^{c+2p-3} = {c+2p-3 \choose c-1} (pf)^{c-1} (xg+yh)^{2p-2} = {c+2p-3 \choose c-1} (pf)^{c-1} {2p-2 \choose p-1} (xygh)^{p-1}. $$ But it is elementary to check that $p \divides {2p-2 \choose p-1}$, whence $p^c$ divides the displayed term, which is then $0$ in $R$.

Neil Epstein
  • 1.8k
  • 1
  • 11
  • 18