# Linear independence in vector spaces of infinite dimension [closed]

Let $V$ be a vector space which has a countable basis. Any set with an uncountable number of elements will hence have to be linearly dependent.

I don't know how to prove the statement above. It is true that if $V$ were finite dimensional, say of dimension $n$, any set of $n+1$ elements would be linearly dependant. How can we prove an analogous statement for vector spaces of infinite dimensions?

## closed as off-topic by Andrés E. Caicedo, user91500, user99914, Claude Leibovici, user26857Jan 22 '16 at 22:02

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Andrés E. Caicedo, user91500, Community, Claude Leibovici, user26857
If this question can be reworded to fit the rules in the help center, please edit the question.

• Every linearly independent set extends to a basis. This is true for vector spaces of any dimension. – Qiaochu Yuan Jan 18 '16 at 5:47
• When you say "I don't understand the statement above" do you mean not understand the meaning or not see how to prove? It seems unclear right now. – Milo Brandt Jan 18 '16 at 5:47
• I believe he's asking how to prove that in a vector space with a countably infinite basis, that an uncountable set of vectors is linearly dependent. – Brandon Thomas Van Over Jan 18 '16 at 5:49
• @MiloBrandt- I don't know how to prove it. – fierydemon Jan 18 '16 at 5:55
• A related question which is sufficient for a proof was asked and answered on MSE here and probably elsewhere on MSE. – André Nicolas Jan 18 '16 at 5:58

Let $B$ be a countable basis of $V$. Let $S$ be an uncountable subset of $V$. Suppose $S$ is linearly independent. Then there exists a basis $C$ of $V$ such that $S \subset C$. Since every basis of a vector space has the same cardinal number (see any textbook on abstract algebra that deals with infinite-dimensional vector spaces), $C$ is countable. This is a contradiction.

Let $\Sigma = \{ S \subset \mathbb{N} | S \text{ is finite} \}$ and note that $\Sigma$ is countable.

Let $\{b_k\}$ be the countable basis.

Suppose $U$ is the uncountable set and $x \in U$. Suppose $x = \sum_{k \in I} \alpha_k b_k$, with $\alpha_k \neq 0$ for all $k \in I$. Define $\phi:U \to \Sigma$ by $\phi(x) = I$, that is, the indices of the support of $x$ in the basis $\{b_k\}$.

Since $U$ is uncountable, there must be some $I \in \Sigma$ such that $\phi^{-1}(I)$ is uncountable. Then any collection of $|I|+1$ elements of $\phi^{-1}(I)$ will be linearly dependent.

To be formal, if $V$ is countable, then there exists a map $f:V \to A$ such that $A \subseteq \Bbb N$ and $f$ is surjective. In order for this "set" (lets call it $B$) to be uncountable(a finite set has finite power set or set of all subsets), $V$ must have infinite cardinality and $B \subseteq \mathcal PV$ where $\mathcal PV$ denotes the power set of $V$. Also I am assuming the set $\{\{ v,\{v,m\}\}| v,m \in V\}$ is an acceptable element of $B$.

We see really we have just one infinite countable $V$ to worry about, that is $\Bbb Q$ and the set of elements of $\Bbb Q$ used to construct any real number (infinite basis are Cauchy sequences or rationals). Between any two integers we know there is an uncountable number of real numbers. So here we have an example of a infinite basis witch is countable, yet yields an uncountable infinite vector space.

Additionally we see that the real numbers as an infinite vector space are not linearly independent. They are spanned by the rationals and $dim\text{ }\Bbb Q = dim\text{ }\Bbb R$ when viewed as vector spaces, though the cardinality is certainly not the same.