(a) Prove N is countable.
(b) Prove there exists countable B1⊆B such that N⊆N1=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 s∈S with s∉N1.
(e) Prove there exists s∈S with s∉N1 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=⋃i∈Z+N′iwhere N′i={x | x∈N∧last(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 N′i is countable. We haveN′i=⋃j∈Z++{0}N″i,jwhere N″i,j={x | x∈N″i∧∑y∈x|y|=j} is also a countable union, so we must prove N″i,j is countable; in fact, since for every y∈x∈N″i,j we must have −j≤y≤j implying |N″i,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=⋃x∈NVxwhere 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 N⊆N1=RB1. Since N1 has B1={a1,...} as a free basis (uniqueness of sums by the freeness of M), we have N1≅Ra1⊕... 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 ¯B∖B1 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 ¯B∖B1 generates ¯M. Further, if ¯z1c1+...+zkck=¯z′1c1+...+z′kck as sums with ci∈B∖B1, then for some n∈N−1 we have z1c1+...+zkck+n=z1c1+...+zkck+z″1a1+...+z″nan=z′1c1+...+z′kck and now z′1c1+...+z′kck−z1c1−...−zkck=z″1a1+...+z″nan. Since the terms ai and ci don't coincide, by the freeness of M we can conclude z1c1+...+zkck=z′1c1+...+z′kck and again by freeness that zi=z′i.
Since such k manifest as the common divisors of the coefficients in Z of the elements from ¯B∖B1, 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, S⊆N1 would allow a natural surjection Z→S by the countability of N1; therefore, such s∈S and s∉N1 exists.
(e) Let s=(b1,...) be as in (d) and choose arbitrary k∈Z. We have¯(b1,...)=¯(0,...,bk,...)+(b1,...,bk−1,0,...)=¯(0,...,bk,...)=k¯(0,...,b′k,...)as k∣bi=±i! for all i≥k. ◻
No comments:
Post a Comment