# injective $R$-module homomorphism vs. injective ring homomorphism

The following question has been lingering in my mind for months.

Let $R$ be a non-zero commutative ring with $1$. Consider $\phi : R^n \rightarrow R^m$,

1) as an injective $R$-module homomorphism.

2) as an injective ring homomorphism. (by definition $\phi(1)=1$.)

In which of the above cases, we can deduce that $n \leq m$? and why?

-

Do you have a particular $\phi$ in mind?  If so, which one? – Pete L. Clark Apr 2 '11 at 18:38
No, I don't. I'm just trying to find the complete solution for the first case. – Ehsan M. Kermani Apr 3 '11 at 18:07

## 2 Answers

Let $R = \mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z} \times \ldots \times \mathbb{Z}/2\mathbb{Z}$ (infinitely many times). Then as a ring $R^m = R^n = R$ $\forall m, n \in \mathbb{N}$. So the answer is negative in the case 2. But in the first case the answer is YES. But proof for general commutative ring is complicated. Here I am giving an easy proof assuming $R$ is commutative noetherian ring. After localizing at a minimal prime ideal we may assume that $R$ is a zero dimensional local ring ie artinian ring and $\phi : R^n \rightarrow R^m$ is an injective $R$ module homomorphism. Now length of $R$ as a $R$ module is finite and is equal to $l$ (say). Then comparing the length of both sides we have $ln \leq lm$. This means that $n \leq m$

-

Interesting. I always assumed you needed $R$ to be an integral domain or something for case 1. – Matt Mar 31 '11 at 16:53
No. I donot need $R$ to be an integral domain. Localization preserves exactness. So first I have simplified the problem. Then comparison of length has done job. – Anjan Gupta Mar 31 '11 at 17:08
Thanks. I appreciate it. It is a nice and important special case, but do you know the outline of the proof for the general case? – Ehsan M. Kermani Apr 2 '11 at 8:19
Give me some time. I have to search my old notes for the solution. – Anjan Gupta Apr 2 '11 at 18:25

## Did you find this question interesting? Try our newsletter

Sign up for our newsletter and get our top new questions delivered to your inbox (see an example).

email address

Let $S$ be your favorite non-zero commutative ring with $1$ and let $R$ be the product of countably many copies of $S$. Then $R^n$ is the product of countably many copies of $S$ for any $n\in\mathbb{N}$, since the union of finitely many countable sets of countable. Therefore $R^n$ and $R^m$ are isomorphic as rings for all $m,n\in\mathbb{N}$, so without further assumptions we cannot deduce $n\leq m$ in case $(2)$.

EDIT: I had originally written that this argument also applies in case $(1)$, but it does not; see the comments below.

-

– Noah Stein Mar 31 '11 at 12:09
Concerning the IBN question (which is about $R$-modules): you need to look at $(S^\infty)^n$ as a module over $S^\infty$ -- not just over $S$. – Rasmus Mar 31 '11 at 12:34
@Rasmus: Ah, thanks.  Shall I go ahead and delete the answer, then? – Noah Stein Mar 31 '11 at 13:01
Well, as Anjan Gupta notes, your reasoning is correct for question (ii). For question (i) it's nice to have your link to the relevant wikipedia article. – Rasmus Mar 31 '11 at 16:04
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 39, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9359968304634094, "perplexity_flag": "head"}