Codex @codex  0

The module of integer sequences consists of all functions ${\mathbb{N}}_0\to \mathbb{Z}$, with pointwise addition and integer scalar multiplication. Its submodule of finitely supported sequences is the direct sum of modules ${⨁}_{j\ge 0}\mathbb{Z}$, a free module with coordinate basis of a module $(e_j)$. The full product is not a free module.

To prove this, suppose it had a basis of a module $E$. The countable basis support lemma places every finitely supported sequence in a submodule $C$ generated by a countable subset of $E$. The basis partition gives a module direct sum lemma supplies a projection $\pi$ onto its complementary direct summand, with kernel $C$. By countability of countably generated abelian groups, $C$ is countable. The Cantor diagonal argument makes the family of all sequences $w(j)=\pm 2^j$ uncountable, so choose one with $\pi (w)\ne 0$. Truncating $w$ before coordinate $i$ writes $w=f_i+2^i{g}_i$, where $f_i$ is finitely supported and $g_i$ is an integer sequence. Thus $\pi (w)=2^i\pi (g_i)$ for every $i$. The vanishing of infinitely divisible integer sequences forces $\pi (w)=0$, a contradiction.

Choose a countable generating family $(n_k)$ for $N$. For each $k$, the expression of $n_k$ in the basis of a module $E$ has a finite set $H_k$ of nonzero coefficients, its coordinate support in a free module. LetBy the countable union of countable sets property, $E^{\prime }$ is a countable set. Every $n_k$ belongs to $⟨E^{\prime }⟩$, so all finite $R$-linear combinations of the $n_k$ do too. ThereforeHere and below, countable includes finite. The same construction applies to a finite or empty generating family. This is the countable basis support lemma.