Loading [MathJax]/jax/output/HTML-CSS/jax.js

Thursday, June 6, 2013

Direct Products of Free Modules Need Not be Free (10.3.24)

Dummit and Foote Abstract Algebra, section 10.3, exercise 24:

For each iZ+ let Mi=Z be free and let M=iZ+Mi. Let N be the restricted direct product of M considered as a submodule of M by componentwise multiplication by Z. Assume M is free with basis B.

(a) Prove N is countable.
(b) Prove there exists countable B1B such that NN1=RB1. Prove N1 is countable.
(c) Prove ¯M=M/N1 is free. Deduce that for any nonzero ¯x¯M there are only a finite number of integers k such that ¯x=k¯m for some ¯m¯M.
(d) Let S={(b1,...) | bi=±i!}, and prove S is uncountable. Deduce there exists sS with sN1.
(e) Prove there exists sS with sN1 such that for every positive integer k there exists ¯m¯M such that ¯s=k¯m, a contradiction by (c).

Proof: (a) Recall that countable unions of countable sets are countable. We haveN=iZ+Niwhere Ni={x | xNlast(x)=i} for last(x) being the position of the last nonzero coordinate of x, is a countable union, so that it suffices to show Ni is countable. We haveNi=jZ++{0}Ni,jwhere Ni,j={x | xNiyx|y|=j} is also a countable union, so we must prove Ni,j is countable; in fact, since for every yxNi,j we must have jyj implying |Ni,j|<(2j+1)i is finite, and as such is countable.

In general, this implies that any restricted direct product of copies of Z will be countable.

(b) LetB1=xNVxwhere Vx is the set of elements from B involved in the nonzero terms of the unique sum representation of x. Since each Vx is finite and N is countable, B1 is countable and clearly NN1=RB1. Since N1 has B1={a1,...} as a free basis (uniqueness of sums by the freeness of M), we have N1Ra1... by n=z1a1+...(z1,...) and in this fashion N1 is the restricted direct product of a number of copies of Z and by the note at the end of (a) N1 is thus countable.

(c) We claim ¯BB1 is a free basis for ¯M. We have ¯B generates ¯M, and the terms involving elements from B1 may be removed as they are within N1, so that ¯BB1 generates ¯M. Further, if ¯z1c1+...+zkck=¯z1c1+...+zkck as sums with ciBB1, then for some nN1 we have z1c1+...+zkck+n=z1c1+...+zkck+z1a1+...+znan=z1c1+...+zkck and now z1c1+...+zkckz1c1...zkck=z1a1+...+znan. Since the terms ai and ci don't coincide, by the freeness of M we can conclude z1c1+...+zkck=z1c1+...+zkck and again by freeness that zi=zi.

Since such k manifest as the common divisors of the coefficients in Z of the elements from ¯BB1, and there are only a finite number of divisors for any integer, we have there are only a finite number of k per ¯x.

(d) Since there are two choices per coordinate of an element of bi, this is equivalent to proving {0,1} is uncountable, which is standard by Cantor's diagonal argument. Since S is now uncountable, SN1 would allow a natural surjection ZS by the countability of N1; therefore, such sS and sN1 exists.

(e) Let s=(b1,...) be as in (d) and choose arbitrary kZ. We have¯(b1,...)=¯(0,...,bk,...)+(b1,...,bk1,0,...)=¯(0,...,bk,...)=k¯(0,...,bk,...)as kbi=±i! for all ik. 

No comments:

Post a Comment