Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $V$ be a vector space of dimension $dimV =n$, over a field F. $S$ is a linearly independent set. Suppose I am equipped with the fact that the size of any linearly independent set must be $\le$ the size of any spanning set, and with the fact that a basis is a minimal spanning set(with a proof akin to this one). Then, how can I prove that $\#S \le n$, and that if $\#S=n$ then $S$ is a basis? I wouldn't use any other theorems that aren't absolutely elementary beyond the two I am equipped with.

share|cite|improve this question
  1. Let $S$ be a linearly independent set, and let $\mathscr{S}$ be the set of all spanning sets in $V$. One the one hand, $$ \forall T \in \mathscr{S}, \; |S| \leq |T|, $$ and on the other hand, $$ n := \dim V = \min_{T \in \mathscr{S}} |T|. $$ So, what can you conclude?

  2. Suppose that $|S| = n$. Assume by contradiction that $S$ is not a basis, i.e., not spanning, so that there exists some non-zero $x \in V$ such that $x \notin \operatorname{span}S$. Is $S^\prime := S \cup \{x\}$ linearly independent? Moreover, what is $\left|S^\prime\right|$?

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.