2

I am studying free modules. The definition of a free module given by our instructor is as follows $:$

An $R$-module $F$ is said to be free on a set $S \subset F$ if every element $x \in F$ can be written as the finite sum $x=\sum_i a_ix_i$ where $x_i \in S$ for all $i$. In this case $S$ is said to be a basis for the free module $F$.

If $S$ is a finite set of $n$ elements then it has been proved in the lecture note that

$$F \simeq R^n.$$

Also if $S$ is countably infinite then

$$F \simeq \underset {\alpha \in \Bbb N} {\bigoplus} R_{\alpha}.$$

where $R_{\alpha} = R$ for each $\alpha$. But no comment is given when a basis $S$ for the free module $F$ contains uncountably infinite number of elements. I can't also find any online source which describes this fact clearly. So a question naturally came into my mind which is - "Can a basis of a free module ever contain uncountably many elements?" If the answer to this question is affirmative one then in this case what is the direct sum to which $F$ is isomorphic as $R$-modules?

Please help me in understanding this concept.

Thank you in advance.

2 Answers2

2

An example of such a module: consider a commutative ring $R$ and the ring of polynomials in indeterminates indexed by a non-countable set, for instance: $$R[X_r]_{r\in\mathbf R}. $$

Bernard
  • 175,478
1

Sure. Take $S$ to be an uncountable set and define the free $R-$module $M$ on $S$ by the set of finite $R-$linear combinations of elements of $S$. For example, if $x_1,\ldots, x_n$ are elements of $S$ and $a_1,\ldots, a_n$ are elements of $R$, elements of $M$ look like $$ \sum_{i=1}^n a_ix_i.$$ The "length" of the linear combination can be as large as you want, so long as it's finite. Infinite combinations don't make sense here because we don't know what it means to take a limit in the absence of some extra structure.