A basis gives a vector space a compact, useful description: its vectors are linearly independent, yet they span the whole space. Learn how these two ideas work together, why every vector can be written as a linear combination of basis vectors, and how a basis supports clear calculations in linear algebra.

Multiple Choice

What does a spanning set of linearly independent vectors form?

A spanning set of linearly independent vectors forms a basis for a vector space. In linear algebra, a basis is defined as a set of vectors that is both linearly independent and spans the entire vector space. When vectors are linearly independent, no vector in the set can be expressed as a linear combination of the others, which means they contribute uniquely to the span. Since they also span the space, this means any vector in that vector space can be expressed as a linear combination of the vectors in the basis. Therefore, a set of linearly independent vectors that spans a space satisfies both criteria for being a basis. This concept is fundamental in linear algebra as it allows us to describe a vector space in terms of a minimal set of vectors, facilitating understanding and computation within that space. The other options do not fulfill the criteria required to define a basis: subsets of vectors do not necessarily span or maintain independence, null spaces refer to the set of vectors that map to zero under a linear transformation, and linear transformations describe functions between vector spaces rather than sets of vectors.

A basis is a small set of vectors that can describe an entire vector space without repeating what another vector already contributes. That idea combines two key features: the vectors must be linearly independent, and they must span the space. Together, those conditions give linear algebra a compact way to describe everything from points in the plane to solutions of systems of equations.

The word basis may sound abstract, but the basic idea is familiar. A map uses a few reference points to locate places across a much larger area. A basis does something similar: it provides reference directions for building every vector in a space. The difference is that the “locations” here are created by adding and scaling vectors.

Two conditions, one useful set

First, a set of vectors spans a vector space if every vector in that space can be written as a linear combination of the set. A linear combination is made by multiplying vectors by numbers, called scalars, and then adding the results.

For example, in the ordinary coordinate plane, the vectors

[

\begin{bmatrix}1\0\end{bmatrix}

\quad\text{and}\quad

\begin{bmatrix}0\1\end{bmatrix}

]

span (\mathbb{R}^2). Any point ((x,y)) can be written as

[

x\begin{bmatrix}1\0\end{bmatrix}

+y\begin{bmatrix}0\1\end{bmatrix}

=

\begin{bmatrix}x\y\end{bmatrix}.

]

The first vector gives a horizontal direction; the second gives a vertical one. By changing the two coefficients, we can reach every point in the plane.

Second, vectors are linearly independent if none of them can be made from the others. More formally, a set is linearly independent when the only way to combine its vectors and get the zero vector is to use zero as every coefficient. If one vector can be built from the rest, the set contains redundancy.

A basis has both qualities. It spans the space, so it can build every vector there. It is independent, so none of its vectors is unnecessary. That balance is what makes a basis more than just a collection of vectors.

Why independence matters

Consider these three vectors in (\mathbb{R}^2):

[

\begin{bmatrix}1\0\end{bmatrix},\qquad

\begin{bmatrix}0\1\end{bmatrix},\qquad

\begin{bmatrix}1\1\end{bmatrix}.

]

They span the plane, since the first two already do. But the set is not linearly independent: the third vector is the sum of the first two. It adds no new direction.

This is a useful distinction. A set can span a space and still fail to be a basis because it contains extra vectors. A set can also be independent without spanning the whole space. For instance, the single vector (\begin{bmatrix}1\0\end{bmatrix}) is independent, but it only generates the horizontal axis—not all of (\mathbb{R}^2).

So neither condition can be dropped. Think of spanning as having enough ingredients to make every result, and independence as avoiding duplicate ingredients. A basis gets both right.

A quick way to check a set

For a finite set of vectors, place the vectors into a matrix, often as columns. Row reduction can then reveal whether they are independent and whether they span the space in question.

For example, the two standard vectors in (\mathbb{R}^2) form the identity matrix:

[

\begin{bmatrix}

1&0\

0&1

\end{bmatrix}.

]

Each column has a pivot, so the columns are independent. There are also pivots in every row, which means the columns span (\mathbb{R}^2). They therefore form a basis.

For square matrices, the same idea connects to the determinant. If a square matrix has a nonzero determinant, its columns are independent and span the whole space of the appropriate dimension. If its determinant is zero, the columns are dependent and fail to span that full space. Row reduction is often more flexible, especially when a matrix isn’t square, but the determinant offers a neat shortcut in the square case.

Bases aren’t limited to arrows

Vectors in a vector space don’t always look like arrows or columns of numbers. They can also be polynomials, matrices, or functions, as long as the objects follow the rules of a vector space.

Take the space of polynomials of degree at most two. Its members look like

[

a+bx+cx^2,

]

where (a), (b), and (c) are scalars. The set ({1,x,x^2}) is a basis for this space. Every polynomial of degree at most two can be built from those three polynomials, and none can be made from the other two.

The same idea applies to (2\times2) matrices. One possible basis is

[

\begin{bmatrix}1&0\0&0\end{bmatrix},\quad

\begin{bmatrix}0&1\0&0\end{bmatrix},\quad

\begin{bmatrix}0&0\1&0\end{bmatrix},\quad

\begin{bmatrix}0&0\0&1\end{bmatrix}.

]

Each entry gets its own basic matrix. Any (2\times2) matrix can be formed by scaling these four matrices and adding them. The objects look different from geometric vectors, but the logic stays the same.

The hidden payoff: coordinates and dimension

Once a basis is chosen, every vector in the space has a unique set of coordinates relative to that basis. With the standard basis in (\mathbb{R}^2), the vector (\begin{bmatrix}3\-2\end{bmatrix}) has coordinates (3) and (-2). Those numbers tell us how much of each basis vector to use.

Uniqueness depends on independence. If the basis had redundant vectors, the same vector might have several descriptions. Independence removes that ambiguity, much like a well-designed address system gives one clear route to a location.

A basis also tells us the dimension of a finite-dimensional vector space: the number of vectors in any basis for that space. The plane has dimension two, while the space of polynomials of degree at most two has dimension three. Different bases can describe the same space, but they always contain the same number of vectors.

That fact is powerful. It lets us compare spaces and understand how much information their vectors can carry, without needing to inspect every possible vector one by one.

One idea with many uses

Bases show up whenever a large collection of possibilities needs a clear, compact description. In computer graphics, coordinate systems help represent positions and directions. In data analysis, a change of basis can reveal simpler patterns in a dataset. In differential equations, choosing a useful basis can turn a difficult problem into a more manageable one.

The central definition remains steady across all these settings: a basis is a linearly independent set that spans its vector space. Independence says each vector brings something distinct. Spanning says the set reaches the whole space. When both conditions hold, the vectors work together as a complete, nonredundant language for describing that space.