For primes $p,$ are there uncountably many subrings of $\mathbb Z/p\mathbb Z[x]?$
In this question, my answer shows that the set of subrings of $\mathbb Z[x]$ is uncountable.
Indeed, we showed that if $R$ is a commutative ring (with identity) with an ideal $I$ with $I^2\neq I,$ then there are uncountably many subrings of $R[x].$
Also, if $R$ is a commutative ring with uncountably many subrings of $R[x]$ then:
- If $i:R\to R’$ is a ring inclusion, then $R’[x]$ has uncountably many subrings.
- If $p:R’\to R$ is an onto homomorphism, then $R’[x]$ has uncountably many subrings.
Let $n$ be the additive order of $1$ in $R.$
If $n=\infty,$ $R$ contains a subring isomorphic to $\mathbb Z,$ so $R[x]$ has uncountably many subrings.
If $n<\infty,$ then $R$ contains $\mathbb Z/n\mathbb Z.$
If $n$ is not square-free, then $\mathbb Z/n\mathbb Z$ contains a non-zero ideal $I$ such that $I^2=0,$ so again we get an uncountable set of subrings.
We’d get uncountably many subrings of $R[x]$ for any non-trivial commutative ring $R,$ if and only if we could answer “yes” to this question. But I can’t see a way to extend the argument in the original question, and I do not see any reason for it to be true.
Note: All rings here are commutative with identity, and subrings of a ring must contain the identity of the parent ring. In particular, $R_0\times\{0\}$ is not considered a subring of $R_0\times R_1$ for rings $R_0,R_1.$
Added:
Solving the prime cases also solves the square-free cases. If $\gcd(m,n)=1,$ then $\mathbb Z/(mn)\mathbb Z[x]\equiv \mathbb Z/m[x]\times \mathbb Z/n[x],$ and Chinese remainder theorem shows the subrings are all of the form $S_m\times S_n.$
For example, when $m=2,n=3,$ any $S$ gives $S_2\cong 3S\subseteq \mathbb Z/2[x]\times\{0\}$ and $S_3\cong 4S\subseteq \{0\}\times Z/ 3[x].$