Basis and Dimension

←Back to Tech Tree

inventorycoverage

Basis and Dimension #

Linear AlgebraDifficulty: ★★☆☆☆Depth: 4Unlocks: 10

Minimal spanning set. Number of vectors in a basis.

Interactive Visualization #

⏮◀◀▶▶STEP0.25x1xZOOM

t=0s

Core Concepts #

Key Symbols & Notation #

span(S) - denotes the set of all linear combinations of S (the span of S)dim(V) - denotes the dimension, the number of vectors in any basis of V

Essential Relationships #

Prerequisites (1) #

Linear Independence5 atoms

Unlocks (1) #

Orthogonalitylvl 3

Advanced Learning Details

Graph Position #

34

Depth Cost

10

Fan-Out (ROI)

2

Bottleneck Score

4

Chain Length

Cognitive Load #

6

Atomic Elements

21

Total Elements

L0

Percentile Level

L4

Atomic Level

All Concepts (7) #

Teaching Strategy #

Deep-dive lesson - accessible entry point but dense material. Use worked examples and spaced repetition.

If linear independence tells you “no redundancy,” then a basis answers the next question: “What’s the smallest set of directions I need to build everything in this space?” Dimension is the count of those directions.

TL;DR:

A set S spans a vector space V if every vector in V can be written as a linear combination of vectors in S. A basis is a set that is both spanning and linearly independent (equivalently: a minimal spanning set or a maximal independent set). In a finite-dimensional space, every basis has the same number of vectors; that number is dim(V).

What Is Basis and Dimension? #

Why we care #

When you work with vectors, you often want a coordinate system: a way to describe any vector using a list of numbers. A basis is exactly the information needed to create such a coordinate system—no more, no less.

These two desires correspond to:

A basis is the sweet spot that satisfies both.

Spanning set (span) #

Let S = {v₁, v₂, …, vₖ} be a set of vectors in a vector space V.

The span of S, written span(S), is the set of all linear combinations:

span(S) = { a₁v₁ + a₂v₂ + … + aₖvₖ : a₁, …, aₖ are scalars }

If span(S) = V, then S is a spanning set of V.

Intuition: you can “mix” the vectors in S (by scaling and adding) to reach any vector in V.

Basis #

A set B ⊂ V is a basis of V if:

  1. B spans V, and

  2. B is linearly independent.

There are two equivalent ways to think about a basis that are often more practical:

These equivalences are not just “nice facts”—they explain why a basis is the “just right” set.

Dimension #

If V has a finite basis, then V is finite-dimensional.

The dimension of V, written dim(V), is the number of vectors in any basis of V.

A crucial theorem (we’ll use it as a guiding rule):

In a finite-dimensional vector space, every basis has the same number of vectors.

So dim(V) is well-defined.

Examples you already know intuitively:

But bases are not unique: ℝ² has infinitely many different bases, all with exactly 2 vectors.

Core Mechanic 1: Spanning Sets and the Meaning of span(S) #

Why spanning matters before the formalism #

Linear independence tells you whether vectors are redundant. But you can have a set with no redundancy that still doesn’t reach the whole space.

For example, in ℝ², the single vector (1, 0) is linearly independent (a single nonzero vector always is), but it cannot reach (0, 1). So it does not span ℝ².

Spanning is about coverage.

What does it mean to span? #

Let V be a vector space and S = {v₁, …, vₖ} ⊂ V.

To say w ∈ span(S) means:

∃ scalars a₁, …, aₖ such that

w = a₁v₁ + a₂v₂ + … + aₖvₖ

So proving span(S) = V usually means:

A geometric picture (in ℝ² and ℝ³) #

In ℝ²:

In ℝ³:

This suggests a key theme:

Adding independent vectors tends to increase the “reach” of the span.

Spanning and solving linear systems #

Suppose S = {v₁, …, vₖ} in ℝⁿ. Put them as columns of a matrix:

A = [ v₁ v₂ … vₖ ]

Then asking whether a vector w is in span(S) is the same as asking whether the linear system has a solution:

Ax = w

And asking whether S spans ℝⁿ is the same as asking:

For every w ∈ ℝⁿ, does Ax = w have a solution?

In ℝⁿ, this is equivalent to A having a pivot in every row (i.e., rank(A) = n). You don’t need full rank theory yet, but it’s useful to recognize the workflow: spanning is a “can we solve for coefficients?” question.

Minimal spanning idea (preview) #

If a spanning set has extra vectors, some are unnecessary. For example, in ℝ²:

S = {(1, 0), (0, 1), (1, 1)}

This spans ℝ², but it is not minimal: (1, 1) = (1, 0) + (0, 1), so removing it doesn’t break spanning.

This naturally motivates the definition of a basis as a minimal spanning set.

Core Mechanic 2: Basis = Spanning + Independence (and Why Dimension Is a Count) #

Why independence must join spanning #

A spanning set can be too large.

A linearly independent set can be too small.

A basis avoids both problems.

Let B = {b₁, …, bₖ}.

Coordinates are unique in a basis #

Suppose B is a basis of V and

v = a₁b₁ + … + aₖbₖ

and also

v = c₁b₁ + … + cₖbₖ

Subtract the two equations:

0 = (a₁ − c₁)b₁ + … + (aₖ − cₖ)bₖ

Because B is linearly independent, the only linear combination giving 0 is the trivial one:

(a₁ − c₁) = 0, …, (aₖ − cₖ) = 0

So aᵢ = cᵢ for all i.

Conclusion: the representation of v in a basis is unique.

This is the practical reason bases matter: they give a stable coordinate system.

Basis as minimal spanning set (why equivalent) #

Assume B spans V and is linearly independent.

Take any bⱼ ∈ B. If you remove it and still span V, then bⱼ would be a linear combination of the remaining vectors (because the remaining vectors could build every vector, including bⱼ). That would contradict independence.

So removing any vector breaks spanning.

Hence:

Spanning + independence ⇒ minimal spanning.

Conversely, if a set spans V and is minimal (removing anything breaks spanning), then it must be independent. Otherwise one vector would be a linear combination of the others, and removing it would not change the span—contradiction.

So:

Basis ⇔ minimal spanning set.

Dimension: why it’s consistent #

Dimension is defined as:

dim(V) = number of vectors in any basis of V.

But why does this not depend on which basis you pick?

The key fact is:

In a finite-dimensional vector space, all bases have the same number of vectors.

A useful intuition (not a full proof):

More generally, there is an important relationship:

In a finite-dimensional vector space V, every linearly independent set has size ≤ any spanning set.

So if B and C are both bases, then:

Therefore |B| = |C|.

That shared size is dim(V).

Quick dimension facts you’ll use constantly #

We’ll use these in examples and exercises.

Application/Connection: How Basis and Dimension Power Other Ideas #

Choosing a basis is choosing a coordinate system #

Once you pick a basis B = {b₁, …, bₖ}, every vector v has unique coordinates (a₁, …, aₖ) such that:

v = ∑ᵢ aᵢ bᵢ

Those coordinates depend on the basis, but the vector v does not.

This viewpoint becomes essential when you:

Why dimension shows up everywhere #

Dimension controls what is possible:

It also tells you when redundancy must exist:

This becomes the backbone of many later tools.

Bridge to orthogonality (what you unlock next) #

An orthonormal basis is a basis whose vectors are mutually perpendicular (orthogonal) and have length 1.

Why is that special?

But orthogonality only makes sense once you understand what a basis is and why dimension fixes how many basis vectors you need.

So this node sets up the question for the next one:

“Can we choose a basis with extra geometric structure (perpendicular, unit length) to make computations simpler?”

That is exactly what Orthogonality addresses.

Worked Examples (3) #

Find span(S) and decide if S is a basis of ℝ² #

Let S = { v₁, v₂ } with v₁ = (1, 2) and v₂ = (2, 4) in ℝ². Determine span(S). Is S a basis of ℝ²?

  1. Observe that v₂ is a multiple of v₁:

    v₂ = (2, 4) = 2(1, 2) = 2v₁.

  2. So any linear combination of v₁ and v₂ looks like:

    av₁ + bv₂ = av₁ + b(2v₁)

    = (a + 2b)v₁.

  3. Therefore span(S) = span({v₁}). Geometrically, this is a line through the origin in direction (1, 2).

  4. Because S is linearly dependent (one vector is a multiple of the other), it cannot be a basis.

  5. Also, span(S) is only a line, not all of ℝ², so S does not span ℝ² either.

Insight: Two vectors in ℝ² only form a basis if they are not scalar multiples. Dependence collapses the span to a lower-dimensional subspace.

Show a set spans ℝ³ by solving for coefficients #

Let B = { b₁, b₂, b₃ } in ℝ³ where b₁ = (1, 0, 1), b₂ = (0, 1, 1), b₃ = (1, 1, 0). Show B spans ℝ³ by expressing an arbitrary w = (x, y, z) as a linear combination of B.

  1. We want scalars a, b, c such that:

    ab₁ + bb₂ + cb₃ = (x, y, z).

  2. Write the linear combination component-wise:

    a(1,0,1) + b(0,1,1) + c(1,1,0)

    = (a + c, b + c, a + b).

  3. Set equal to (x, y, z) to get the system:

    a + c = x

    b + c = y

    a + b = z

  4. Solve step-by-step.

    From a + c = x ⇒ a = x − c.

    From b + c = y ⇒ b = y − c.

  5. Plug into a + b = z:

    (x − c) + (y − c) = z

    x + y − 2c = z

    −2c = z − x − y

    c = (x + y − z)/2.

  6. Back-substitute:

    a = x − (x + y − z)/2 = (2x − x − y + z)/2 = (x − y + z)/2

    b = y − (x + y − z)/2 = (2y − x − y + z)/2 = (−x + y + z)/2.

  7. We found a, b, c for an arbitrary (x, y, z). Therefore every vector in ℝ³ lies in span(B), so span(B) = ℝ³.

Insight: To prove a set spans, take an arbitrary vector and solve for coefficients. If you can always solve (with no restrictions on x, y, z), the set spans the whole space.

Use dimension shortcuts in a subspace of ℝ³ #

Let V = { (x, y, z) ∈ ℝ³ : x + y + z = 0 }. Consider u₁ = (1, −1, 0) and u₂ = (1, 0, −1). Show {u₁, u₂} is a basis of V and find dim(V).

  1. First check u₁ and u₂ lie in V:

    For u₁: 1 + (−1) + 0 = 0 ⇒ u₁ ∈ V.

    For u₂: 1 + 0 + (−1) = 0 ⇒ u₂ ∈ V.

  2. Check linear independence:

    Suppose au₁ + bu₂ = 0.

    Then a(1, −1, 0) + b(1, 0, −1) = (0,0,0).

  3. Compute components:

    (a + b, −a, −b) = (0, 0, 0).

  4. So −a = 0 ⇒ a = 0, and −b = 0 ⇒ b = 0. Therefore {u₁, u₂} is linearly independent.

  5. Now show they span V:

    Take an arbitrary (x, y, z) ∈ V, so x + y + z = 0.

    We want a, b such that au₁ + bu₂ = (x, y, z).

  6. Solve:

    (a + b, −a, −b) = (x, y, z).

    From −a = y ⇒ a = −y.

    From −b = z ⇒ b = −z.

    Then a + b = −y − z.

  7. But since x + y + z = 0, we have x = −y − z.

    So a + b = x is automatically satisfied.

  8. Thus every vector in V can be expressed as a combination of u₁ and u₂, so they span V.

  9. Therefore {u₁, u₂} is a basis of V, and dim(V) = 2.

Insight: Subspaces defined by one linear equation in ℝ³ often have dimension 2 (a plane through the origin). A basis gives you a concrete coordinate system on that plane.

Key Takeaways #

Common Mistakes #

Practice #

easy

In ℝ², let S = { (1, 1), (1, −1) }. (a) Does S span ℝ²? (b) Is S a basis of ℝ²?

Hint: Try to solve a(1,1) + b(1,−1) = (x,y) for arbitrary x,y. Or check whether the vectors are scalar multiples.

Show solution

Solve a(1,1) + b(1,−1) = (x,y).

Component-wise: (a + b, a − b) = (x, y).

Add equations: (a + b) + (a − b) = x + y ⇒ 2a = x + y ⇒ a = (x + y)/2.

Subtract: (a + b) − (a − b) = x − y ⇒ 2b = x − y ⇒ b = (x − y)/2.

A solution exists for all x,y, so S spans ℝ². The two vectors are not multiples, so they are independent. Therefore S is a basis.

medium

Let V be the subspace of ℝ³ given by V = { (x, y, z) : z = 0 }. Find a basis for V and determine dim(V).

Hint: Vectors in V look like (x, y, 0). Try to express (x, y, 0) using two simple vectors.

Show solution

Any (x, y, 0) can be written as x(1,0,0) + y(0,1,0). So { (1,0,0), (0,1,0) } spans V. These two vectors are linearly independent, hence they form a basis. Therefore dim(V) = 2.

hard

Let S = { (1,0,0), (0,1,0), (1,1,0) } in ℝ³. (a) Find span(S). (b) Is S a basis of span(S)? (c) Find a basis of span(S) with fewer vectors.

Hint: All vectors have z = 0. Also, check whether (1,1,0) is a linear combination of the first two vectors.

Show solution

(a) Every linear combination of S has the form a(1,0,0) + b(0,1,0) + c(1,1,0) = (a + c, b + c, 0). This is any vector (x,y,0), so span(S) = { (x,y,0) } (the z=0 plane).

(b) S is not a basis of span(S) because it is linearly dependent: (1,1,0) = (1,0,0) + (0,1,0).

(c) A basis with fewer vectors is { (1,0,0), (0,1,0) }. It spans the same set and is independent.

Connections #

Next, you’ll use bases with special geometric structure: Orthogonality. Related foundations include linear independence (prerequisite) and upcoming ideas like change of basis and matrix representations of linear maps (future nodes).

Quality: B (4.1/5)

← back to treebrowse all →