Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Is it true that, in the category of $\mathbb{Z}$-modules, $Hom_{\mathbb{Z}}(\mathbb{Z}[x],\mathbb{Z})\cong\mathbb{Z}[[x]]$ and $Hom_{\mathbb{Z}}(\mathbb{Z}[[x]],\mathbb{Z})\cong\mathbb{Z}[x]$?

The first isomorphism is easy since any such homomorphism assigns an integer to $x^i, \forall\ {i>0}$ which defines a power series. For the second one might think similarly that if $S$ is the set of all power series with non-zero constant term then $\mathbb{Z}[[x]]=0\oplus{S}\oplus{x}S\oplus{x^2}S\dots$, but it doesn't quite work since it is not clear how to map $S$.

share|improve this question
    
Yes; I was assigned this as an exercise once, but I never solved it. –  Qiaochu Yuan Dec 31 '09 at 6:43
    
Also, S is not a subgroup. –  Qiaochu Yuan Dec 31 '09 at 7:56
    
The way you write it suggests that you are interested in Z-algebra homomorphisms, but what you really mean are Z-module homomorphisms. I suggest you change the statement of the question to make this clear. –  Pete L. Clark Dec 31 '09 at 8:51
    
@Pete: that's why I used prod_n Z and sum_n Z in my answer. –  Kevin Buzzard Dec 31 '09 at 9:00
    
Does the product generally have a right adjoint in Ab? –  Harry Gindi Dec 31 '09 at 16:49

3 Answers 3

up vote 20 down vote accepted

Yes: this is an old chestnut. Let me write $\oplus_n\mathbf{Z}$ for what you call $\mathbf{Z}[x]$ and $\prod_n\mathbf{Z}$ for what you call $\mathbf{Z}[[x]]$ (all products and sums being over the set {$0,1,2,\ldots$}). Clearly the homs from the product to $\mathbf{Z}$ contain the sum; the issue is checking that equality holds. So say I have $f:\prod_n\mathbf{Z}\to\mathbf{Z}$ and let me prove $f$ is in the sum.

Let $e_n$ ($n\geq0$) be the $n$th basis element in the product (so, what you called $x^n$). First I claim that $f(e_n)=0$ for all $n$ sufficiently large. Let's prove this by contradiction. If it were false then I would have infinitely many $n$ with $f(e_n)\not=0$, so by throwing away the $e_n$ such that $f(e_n)=0$ (this is just for simplicity of notation; otherwise I would have to let this infinite set of $n$ be called $n_0$, $n_1\ldots$ and introduce another subscript) we may as well assume that $f(e_n)=c_n\not=0$ for all $n=0,1,2,\ldots$. Now choose any old integers $d_i$ such that $\tau:=\sum_{i\geq0}2^id_ic_i$, a 2-adic integer, is not in $\mathbf{Z}$ (this can easily be done: infinitely many $d_i$ are "the last to change a binary digit of $\tau$" and hence one can recursively rule out all elements of $\mathbf{Z}$), and consider the integer $t:=f(\sum_{i\geq0}2^id_ie_i)\in\mathbf{Z}$. The point is that $\sum_{i\geq N}2^id_ie_i$ is a multiple of $2^N$ in the product, and hence its image under $f$ must be a multiple of $2^N$ in $\mathbf{Z}$. So one checks easily that $t-\tau$ is congruent to zero mod $2^N$ for all $N\geq1$ and hence $t=\tau$, a contradiction.

[Remark: in my first "answer" to this question, I stopped here. Thanks to Qiaochu for pointing out that my answer wasn't yet complete.]

We deduce that $f$ agrees with an element $P$ of the sum on the subgroup $\oplus_n\mathbf{Z}$ of $\prod_n\mathbf{Z}$. So now let's consider $f-P$; this is a map from the product to $\mathbf{Z}$ which is zero on the sum, and our job is to show that it is zero. So far I have used the fact that $\mathbf{Z}$ has one prime but now I need to use the fact that it has two. Firstly, any map $(\prod_n\mathbf{Z})/(\oplus_n\mathbf{Z})\to\mathbf{Z}$ is clearly going to vanish on the infinitely $p$-divisible elements of the left hand size for any prime $p$ (because there are no infinitely $p$-divisible elements of $\mathbf{Z}$ other than $0$). In particular it will vanish on elements of $\prod_n\mathbf{Z}$ of the form $(c_0,c_1,c_2,\ldots,c_n,\ldots)$ with the property that $c_n$ tends to zero $p$-adically. Call such a sequence a "$p$-adically convergent sequence". But using the Chinese Remainder Theorem it is trivial to check that every element of $\prod_n\mathbf{Z}$ is the difference of a 2-adically convergent sequence and a 3-adically convergent sequence, and so now we are done.

Remark: I might be making a meal of this. My memory of what Kaplansky writes is that he uses the second half of my argument but does something a bit simpler for the first half.

share|improve this answer
    
NB to justify the "old chestnut" tag: if I remember correctly this proof (or some variant of it, possibly not mentioning p-adic numbers but morally doing the same thing) is in Kaplansky's "infinite abelian groups", so dates back to at least the 60s. Imre Leader told me this question when I was an undergrad. –  Kevin Buzzard Dec 31 '09 at 8:43
    
Not that I'm not convinced, but why is the step where you pick d_i necessary? –  Qiaochu Yuan Dec 31 '09 at 8:51
    
Because if all the c_i are 1 then sum_i 2^ic_i=-1 in Z_2, so f(1,2,4,8,...)=-1 would not be a contradiction. –  Kevin Buzzard Dec 31 '09 at 8:58
    
You don't seem to have excluded the possibility that f(e_n) = 0 for all n but f is not the zero homomorphism; in other words, you don't seem to have shown that there are no nontrivial homomorphisms (prod Z)/(sum Z) -> Z. –  Qiaochu Yuan Dec 31 '09 at 9:39
    
OK, fixed. Thanks Qiaochu for pointing that out! –  Kevin Buzzard Dec 31 '09 at 11:52

I think so. Let $f$ be a homomorphism from $\mathbb Z[[x]] $ to $\mathbb Z$. WRONG: Let $f(x^i)=a_i$. Then since $f(1+x+x^2...) \in \mathbb Z$, we must have $a_i=0$ for $i\gg 0$. So each map can be identified with an element in $\mathbb Z[x]$.

An attempt at redemption: I actually found a reference on when the dual of direct product of a ring is direct sum:

www-users.mat.uni.torun.pl/~gregbob/seminars/2008.11.07b.pdf

share|improve this answer
2  
f being a homomorphism does not imply that f preserves infinite sums. –  Qiaochu Yuan Dec 31 '09 at 6:54
4  
Hailong made a mistake and gracefully acknowledged it. I think this is no reason to vote him down. –  Georges Elencwajg Dec 31 '09 at 9:34
12  
Voting Hailong down is not even contemplated. Voting a wrong answer down is. He should not take it personally, I think. –  Gerald Edgar Dec 31 '09 at 15:26
1  
Thanks for the comments. Please feel free to vote it down! –  Hailong Dao Dec 31 '09 at 18:19
1  
That's an interesting generalisation in your link! I didn't expect that $Z$ not being local had anything to do with the question. –  Maharana Jan 9 '10 at 9:00

I give this problem each year in a problem-solving seminar. Here is the solution that I wrote up. I am using $f$ instead of $\varphi$ and $e_n$ instead of $x^n$.

Let $x=(x_1,x_2,\dots)$. Since $2^n$ and $3^n$ are relatively prime, there are integers $a_n$ and $b_n$ for which $x_n=a_n2^n+b_n3^n$. Hence $f(x)=f(y)+f(z)$, where $y = (2a_1, 4a_2, 8a_3,\dots)$ and $z=(3b_1,9b_2,27b_3,\dots)$. Now for any $k\geq 1$ we have $$ f(y) = f(2a_1,4a_2,\dots,2^{k-1}a_{k-1},0,0, \dots) $$ $$ \qquad + f(0,0,\dots,0,2^ka_k,2^{k+1}a_{k+1},\dots) $$
$$ \qquad= 0+2^kf(0,0,\dots,0,a_k,2a_{k+1},4a_{k+2},\dots). $$
Hence $f(y)$ is divisible by $2^k$ for all $k\geq 1$, so $f(y)=0$. Similarly $f(z)$ is divisible by $3^k$ for all $k\geq 1$, so $f(z)=0$. Hence $f(x)=0$.

Now let $a_i=f(e_i)$. Define integers $0< n_1 < n_2 <\cdots$ such that for all $k\geq 1$, $$ \sum_{i=1}^k|a_i|2^{n_i} < \frac 12 2^{n_{k+1}}. $$ (Clearly this is possible --- once $n_1,\dots,n_k$ have been chosen, simply choose $n_{k+1}$ sufficiently large.) Consider $x=(2^{n_1}, 2^{n_2}, \dots)$. Then $$ f(x) = f(a_1e_1 + \cdots + a_k e_k +2^{n_{k+1}} (e_{k+1}+2^{n_{k+2}-n_{k+1}}e_{k+2}+\cdots))$$ $$ \qquad= \sum_{i=1}^ka_i 2^{n_i}+2^{n_{k+1}}b_k, $$ where $b_k=f(e_{k+1}+2^{n_{k+2}-n_{k+1}}e_{k+2}+\cdots)$. Thus by the triangle inequality, $$\left| 2^{n_{k+1}}b_k\right| < \left| \sum_{i=1}^k a_i 2^{n_i}\right| + |f(x)| $$ $$ \qquad < \frac 12 2^{n_{k+1}} + |f(x)|. $$ Thus for sufficiently large $k$ we have $b_k=0$ [why?]. Since $$ b_j - 2^{n_{j+2}-n_{j+1}}b_{j+1}=f(e_{j+1})\ \ \mbox{[why?]}, $$ we have $f(e_k)=0$ for $k$ sufficiently large.}

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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