2
$\begingroup$

A commutative ring is local if it has a single maximal ideal. If the ring is finite, this implies that all elements are either units or nilpotents. Further, all finite local rings have prime power order.

Given a prime power $p^k$ and a positive integer $n < p^k$, under what conditions on $p, k, n$ does there exist a local ring $R$ with $|R| = p^k$ and $n$ nilpotents?

$\endgroup$
6
  • $\begingroup$ what partial results have you found or worked out thus far? $\endgroup$
    – Yemon Choi
    Jul 11, 2010 at 21:09
  • $\begingroup$ Well, certainly we need $n = p^a$ for $0 \leq a < k$. The cases $a = 0$ and $a = k-1$ are easy: take $R = \mathbb{F}_{p^a}$ and $R = \mathbb{Z}/p^k \mathbb{Z}$. This brings me to YC's comment: maybe you can just get every possibility by writing down a natural family of examples: to what extent have you tried this? $\endgroup$ Jul 11, 2010 at 21:13
  • $\begingroup$ Interpolating between finite fields ${\mathbf F}_{p^k}$ and ${\mathbf Z}/p^k{\mathbf Z}$, consider the length $m$ Witt vectors over ${\mathbf F}_{p^r}$, $W_{m-1}({\mathbf F}_{p^r})$. (By length $m$ I mean $m$ coordinates: $(a_0,\dots,a_{m-1})$.) This is a local ring of size $p^{rm}$ and its units have nonzero $a_0$, so there are $p^{r(m-1)}$ nilpotents. If you want this to have size $p^k$ and $p^a$ nilpotents then set $rm = k$ and $r(m-1) = a$, so $r = k-a$ and $k-a$ has to divide $a$. OK, so if $0 \leq a < k$ and $k-a$ divides $a$, write $a = (k-a)d$ and use $W_d({\mathbf F}_{p^{k-a}})$. $\endgroup$
    – KConrad
    Jul 11, 2010 at 21:58
  • $\begingroup$ @KConrad: In fact that exhausts all possibities. The residue field of our ring is $\mathbb{F}_{p^{k-a}}$, and the ring must have the same cardinality as $R/\mathfrak{m}\oplus\mathfrak{m}/\mathfrak{m^2}\oplus\ldots$, which has cardinality a power of $p^{k-a}$, so $k-a|k$. $\endgroup$ Jul 11, 2010 at 23:41
  • 2
    $\begingroup$ Also, $\mathbb{F}_{p^{k-a}}[x]/x^{d+1}$ works. $\endgroup$ Jul 11, 2010 at 23:47

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.