Take $\mathbb{R}$ as a vector space over $\mathbb{Q}$, then a basis for $\mathbb{R}$, then $|B|=2^{\aleph_0}$

Solution 1:

The general idea is on the right track, but it’s not quite right, because $|B|<2^{\aleph_0}$ does not imply that $B$ is countable, and because you should be looking only at finite linear combinations.

Suppose that $B$ is a basis for $\Bbb R$ over $\Bbb Q$; then for each $x\in\Bbb R$ there are a finite set $\{b_1^{(x)},\ldots,b_{n_x}^{(x)}\}\subseteq B$ and a finite set $\{q_1^{(x)},\ldots,q_{n_x}^{(x)}\}\subseteq\Bbb Q$ such that

$$x=q_1^{(x)}b_1^{(x)}+\ldots+q_{n_x}^{(x)}b_{n_x}^{(x)}\;.$$

Let $\mathscr{F}$ be the family of finite subsets of $B$; clearly $B$ is infinite, so $|\mathscr{F}|=|B|$. For each $F=\{b_1,\ldots,b_n\}\in\mathscr{F}$ there are $|\Bbb Q^n|=\aleph_0^n=\aleph_0$ linear combinations $q_1b_1+\ldots+q_nb_n$ with each $q_k\in\Bbb Q$, so

$$2^{\aleph_0}=|\Bbb R|=|\operatorname{span}(B)|\le|\mathscr{F}|\cdot\aleph_0=|B|\cdot\aleph_0=|B|\;.$$

Since $|B|$ is obviously at most $2^{\aleph_0}$, this shows that $|B|=2^{\aleph_0}$.

Solution 2:

HINT:

If $V$ is a vector space over $K$, and $B$ is a basis for $V$, then $|V|=|K\times B|^{<\omega}$. If either $K$ or $B$ is infinite, then this is just $|K\times B|$.