Abhijeet Mulgund's Personal Webpage

Search

Search IconIcon to open search

Spanning Set Size bound Linearly Independent Set Size

Last updated Nov 1, 2022

# Statement

Let $V$ be a Vector Space over Field $F$ that is spanned by $R \subset V$ and denote $|R| = \infty \in \bar{\mathbb{N}}$ if $R$ is an Infinite Set. Then if $S$ is Linearly Independent in $V$, $|S| \leq |R|$.

# Proof

First note that if $|R| = \infty$, then this is trivially true since all $S \subset V$ are such that $|S| \leq \infty$. $\checkmark$

Now suppose $|R| = n \in \mathbb{N}$. Suppose $m \in \mathbb{N}$ so that $m > n$ and let $S \subset V$ be s.t. $|S| \geq m$. We will show that $S$ must be Linearly Dependent. We write $S’ = {\mathbf{a}{1}, \dots, \mathbf{a}{m}} \subset S$ for distinct $\mathbf{a}{1}, \dots, \mathbf{a}{m}$. Suppose $c_{1}, \dots, c_{m} \in F$ so that $$c_{1} \mathbf{a}{1} + \cdots + c{m} \mathbf{a}{m} = \mathbf{0}.$$ Since $\mathbf{b}{1}, \dots, \mathbf{b}{n}$ span $V$, there must exist $(d{ij} \in F){i \in [n], j \in [m]}$ so that $$\mathbf{a}{j} = \sum\limits_{i=1}^{n} d_{ij} \mathbf{b}{i}$$ Thus, we get $$\begin{align*} \mathbf{0} &= \sum\limits{j=1}^{m} \sum\limits_{i=1}^{n} c_{j} d_{ij} \mathbf{b}{i} \\ &= \mathbf{b}{1} \sum\limits_{j=1}^{m} c_{j} d_{1j} + \cdots + \mathbf{b}{n} \sum\limits{j=1}^{m} c_{j} d_{nj} \tag{1} \end{align*} $$ Now note that, if we were to have that $$\sum\limits_{j=1}^{m} c_{j} d_{ij} = 0 \text{ } \forall i \in [n] \tag{2}$$ then (1) will hold. We show that non-trivial $c_{1}, \dots, c_{m} \in F$ exist. Rewriting the Equation System as $$D \mathbf{c} = \mathbf{0}$$ where $D \in F^{n \times m}$ is defined as $D_{ij} = d_{ij}$ for $i \in [n], j \in [m]$, and $\mathbf{c} \in F^{m}$ is defined as $\mathbf{c}{j} = c{j}$ for $j \in [m]$. This is a homogenous Matrix Equation System. Since $n < m$, we know there exists a nontrivial solution $\mathbf{c}^{*}$. Therefore $S’$ is Linearly Dependent, making $S$ Linearly Dependent.

By Contraposition, we have that any Linearly Independent $S \subset V$ is s.t. $|S| \leq n$. $\checkmark$ $\blacksquare$

# Remarks

  1. I wonder if there is a way to do this without invoking Matrix Equation Systems. We already have the relationships

    but these do not relate the size of one spanning set to all linearly independent sets.

# Other Outlinks