Solution: Day 2, problem 3


We define a map F: Hom(P, Z) to P by assigning to a homomorphism f: P --> Z the sequence (r1, r2, ... ) with rn = f( 0, ... ,0,1,0, ... ) (1 in the nth place). We must show that F is injective and that its image is exactly S. Suppose that F(f) = 0. Then f vanishes on any finite sequence (i.e. on the subgroup S of P). Let x = (x1, x2, ... ) be an arbitrary element of P and define a decomposition x = a + b by writing xn = an + bn with 2n | an, 3n | bn. Then for each positive integer n the sequence a differs by a finite sequence from a sequence divisible by 2n, so f(a) must be divisible by 2n for every n and hence must vanish. Similarly f(b) = 0, so f(x) = f(a) + f(b) also vanishes. This proves that F is injective.

Clearly S is a subset of Im(F), since a sequence (r1, r2, ... ) with almost all rn equal to 0 is the image under F of the homomorphism (a1, a2, ... ) |--> Sigma rnan from P to Z.
To show the reverse inclusion,let f be in Hom(P, Z) and rn = f(0, ... ,0,1,0, ... ) (n >= 1). We must show that almost all rn vanish. Assume not, and define a = (a1,a2, ... ) where each an is of the form +or- 2sn with the sign chosen so that rnan >= 0 and the exponent so that 2sn > 2sn - 1 + 1|rn|. Then the integer f(a) is congruent modulo 2rn + 1 to 2s1|r1| + ... + 2sn |rn|, and the binary expansion (in standard form, with all coefficients 0 or 1) of this is the concatenation of the binary expansions of r1, ... , rn, with 0 interspersed. Taking the 2 - adic limit of this statement as n goes to infinity gives a contradiction, since f(a) is an ordinary integer and hence has a (standard) binary expansion consisting of all 0's or all 1's from some point onwards.


Return to the problems.

Don Zagier 1996