What a basis does in linear algebra

Primary Tool

Math Workspace (CAS)

A basis is easiest to believe once you actually solve for coordinates. CAS makes that explicit: build a vector from the basis, then recover the coefficients and see that there is only one answer.

Two jobs, not one

A basis must span the whole space and it must be linearly independent. Spanning alone is not enough, because a spanning list can still contain redundant vectors.

Independence alone is not enough either, because an independent list might be too small to reach every vector. A basis is exactly the point where those two requirements meet.

Why coordinates are possible

Once you have a basis ${b_{1}, \dots, b_{n}}$ , every vector $v$ can be written as $v = c_{1} b_{1} + \dots + c_{n} b_{n}$ . The coefficients $c_{1}, \dots, c_{n}$ are the coordinates of $v$ in that basis.

Those coordinates are unique because the basis vectors are independent. If two different coefficient lists gave the same vector, subtracting them would produce a nontrivial relation, which a basis cannot have.

Why bases matter later

A well-chosen basis can make a hard problem look simple. In the right coordinates, a messy matrix can collapse into a much cleaner form.

That is why eigenvectors matter so much. When there are enough of them, they give a basis built around the transformation instead of around the standard axes.

Common Pitfall

A basis is not required to be the standard basis. Many different lists can be valid bases for the same space as long as they span and stay independent.

Try a Variation

Take $b_{1} = [11]$ and $b_{2} = [22]$ . The list fails to be a basis. Which of the two basis conditions breaks, and why?

Keep moving through the cluster

Back to Learn Math →

ExplanationLinear AlgebraMath Workspace (CAS)

What linear independence means geometrically

Linear independence is the condition that nothing in the list is wasted. Geometrically, each new vector must add a new direction instead of repeating one you already had.

Open explanation →

Worked ExampleLinear AlgebraMath Workspace (CAS)

Diagonalize a $2 \times 2$ matrix and compute $A^{n}$

Diagonalization is one of the first places students see why eigenvalues matter computationally. Once $A = P D P^{- 1}$ , powers of $A$ become powers of a diagonal matrix.

Open worked example →

Worked ExampleLinear AlgebraEigenvalue & Eigenvector Calculator

Compute eigenvalues and eigenvectors of a $3 \times 3$ matrix

A first serious 3 by 3 eigenproblem should show new structure without burying the point in arithmetic. This one does that: you see the characteristic polynomial, the eigenspaces, and the diagonalization test in one pass.