Linear Algebra, Basis

Definition 1.1

A basis for a vector space is a sequence of vectors that form a set that is linearly independent and that spans the space.

We denote a basis with angle brackets ⟨ \overset{→}{{β}_{1}} , \overset{→}{{β}_{2}} , … ⟩ to signify that this collection is a sequence[1] — the order of the elements is significant. (The requirement that a basis be ordered will be needed, for instance, in Definition 1.13.)

Example 1.2

This is a basis for {ℝ}^{2} .

⟨ ( \begin{matrix}2 \\ 4\end{matrix} ) , ( \begin{matrix}1 \\ 1\end{matrix} ) ⟩

It is linearly independent

{c}_{1} ( \begin{matrix}2 \\ 4\end{matrix} ) + {c}_{2} ( \begin{matrix}1 \\ 1\end{matrix} ) = ( \begin{matrix}0 \\ 0\end{matrix} ) \ \ ⟹ \ \ \begin{matrix}2 {c}_{1} & + & 1 {c}_{2} & = & 0 \\ 4 {c}_{1} & + & 1 {c}_{2} & = & 0\end{matrix} \ \ ⟹ \ \ {c}_{1} = {c}_{2} = 0

and it spans {ℝ}^{2} .

\begin{matrix}2 {c}_{1} & + & 1 {c}_{2} & = & x \\ 4 {c}_{1} & + & 1 {c}_{2} & = & y\end{matrix} \ \ ⟹ \ \ {c}_{2} = 2 x − y \text{ and } {c}_{1} = \frac{y − x}{2}

Example 1.3

This basis for {ℝ}^{2}

⟨ ( \begin{matrix}1 \\ 1\end{matrix} ) , ( \begin{matrix}2 \\ 4\end{matrix} ) ⟩

differs from the prior one because the vectors are in a different order. The verification that it is a basis is just as in the prior example.

Example 1.4

The space {ℝ}^{2} has many bases. Another one is this.

⟨ ( \begin{matrix}1 \\ 0\end{matrix} ) , ( \begin{matrix}0 \\ 1\end{matrix} ) ⟩

The verification is easy.

Definition 1.5

For any {ℝ}^{n} ,

{ℰ}_{n} = ⟨ ( \begin{matrix}1 \\ 0 \\ ⋮ \\ 0\end{matrix} ) , ( \begin{matrix}0 \\ 1 \\ ⋮ \\ 0\end{matrix} ) , … , \ ( \begin{matrix}0 \\ 0 \\ ⋮ \\ 1\end{matrix} ) ⟩

is the standard (or natural) basis. We denote these vectors by \overset{→}{{e}_{1}} , … , \overset{→}{{e}_{n}} .

(Calculus books refer to {ℝ}^{2}'s standard basis vectors \overset{→}{ı} and \overset{→}{ȷ} instead of {\overset{→}{e}}_{1} and {\overset{→}{e}}_{2}, and they refer to {ℝ}^{3}'s standard basis vectors \overset{→}{ı}, \overset{→}{ȷ}, and \overset{→}{k} instead of {\overset{→}{e}}_{1}, {\overset{→}{e}}_{2}, and {\overset{→}{e}}_{3}.) Note that the symbol "{\overset{→}{e}}_{1}" means something different in a discussion of {ℝ}^{3} than it means in a discussion of {ℝ}^{2}.

Example 1.6

Consider the space \{ a ⋅ cos ⁡ θ + b ⋅ sin ⁡ θ \ | \ a , b ∈ ℝ \} of functions of the real variable θ.

⟨ 1 ⋅ cos ⁡ θ + 0 ⋅ sin ⁡ θ , 0 ⋅ cos ⁡ θ + 1 ⋅ sin ⁡ θ ⟩ = ⟨ cos ⁡ θ , sin ⁡ θ ⟩

Another basis is ⟨ cos ⁡ θ − sin ⁡ θ , 2 cos ⁡ θ + 3 sin ⁡ θ ⟩. Verification that these two are bases is Problem 7.

Example 1.7

A natural for the vector space of cubic polynomials {𝒫}_{3} is ⟨ 1 , x , {x}^{2} , {x}^{3} ⟩. Two other bases for this space are ⟨ {x}^{3} , 3 {x}^{2} , 6 x , 6 ⟩ and ⟨ 1 , 1 + x , 1 + x + {x}^{2} , 1 + x + {x}^{2} + {x}^{3} ⟩. Checking that these are linearly independent and span the space is easy.

Example 1.8

The trivial space \{ \overset{→}{0} \} has only one basis, the empty one ⟨ ⟩.

Example 1.9

The space of finite-degree polynomials has a basis with infinitely many elements ⟨ 1 , x , {x}^{2} , … ⟩.

Example 1.10

We have seen bases before. In the first chapter we described the solution set of homogeneous systems such as this one

\begin{matrix}x & + & y & & & − & w & = & 0 \\ & & & & z & + & w & = & 0\end{matrix}

by parametrizing.

\{ ( \begin{matrix}− 1 \\ 1 \\ 0 \\ 0\end{matrix} ) y + ( \begin{matrix}1 \\ 0 \\ − 1 \\ 1\end{matrix} ) w \ | \ y , w ∈ ℝ \}

That is, we described the vector space of solutions as the span of a two-element set. We can easily check that this two-vector set is also linearly independent. Thus the solution set is a subspace of {ℝ}^{4} with a two-element basis.

Example 1.11

Parameterization helps find bases for other vector spaces, not just for solution sets of homogeneous systems. To find a basis for this subspace of {ℳ}_{2 \ × \ 2}

\{ ( \begin{matrix}a & b \\ c & 0\end{matrix} ) \ | \ a + b − 2 c = 0 \}

we rewrite the condition as a = − b + 2 c.

\{ ( \begin{matrix}− b + 2 c & b \\ c & 0\end{matrix} ) \ | \ b , c ∈ ℝ \} = \{ b ( \begin{matrix}− 1 & 1 \\ 0 & 0\end{matrix} ) + c ( \begin{matrix}2 & 0 \\ 1 & 0\end{matrix} ) \ | \ b , c ∈ ℝ \}

Thus, this is a good candidate for a basis.

⟨ ( \begin{matrix}− 1 & 1 \\ 0 & 0\end{matrix} ) , ( \begin{matrix}2 & 0 \\ 1 & 0\end{matrix} ) ⟩

The above work shows that it spans the space. To show that it is linearly independent is routine.

Consider again Example 1.2. It involves two verifications.

In the first, to check that the set is linearly independent we looked at linear combinations of the set's members that total to the zero vector {c}_{1} {\overset{→}{β}}_{1} + {c}_{2} {\overset{→}{β}}_{2} = ( \frac{0}{0} ). The resulting calculation shows that such a combination is unique, that {c}_{1} must be 0 and {c}_{2} must be 0.

The second verification, that the set spans the space, looks at linear combinations that total to any member of the space {c}_{1} {\overset{→}{β}}_{1} + {c}_{2} {\overset{→}{β}}_{2} = ( \frac{x}{y} ). In Example 1.2 we noted only that the resulting calculation shows that such a combination exists, that for each x , y there is a {c}_{1} , {c}_{2}. However, in fact the calculation also shows that the combination is unique: {c}_{1} must be ( y − x ) / 2 and {c}_{2} must be {}2 x − y.

That is, the first calculation is a special case of the second. The next result says that this holds in general for a spanning set: the combination totaling to the zero vector is unique if and only if the combination totaling to any vector is unique.

Theorem 1.12

In any vector space, a subset is a basis if and only if each vector in the space can be expressed as a linear combination of elements of the subset in a unique way.

We consider combinations to be the same if they differ only in the order of summands or in the addition or deletion of terms of the form "{}0 ⋅ \overset{→}{β}".

Proof

By definition, a sequence is a basis if and only if its vectors form both a spanning set and a linearly independent set. A subset is a spanning set if and only if each vector in the space is a linear combination of elements of that subset in at least one way.

Thus, to finish we need only show that a subset is linearly independent if and only if every vector in the space is a linear combination of elements from the subset in at most one way. Consider two expressions of a vector as a linear combination of the members of the basis. We can rearrange the two sums, and if necessary add some {}0 {\overset{→}{β}}_{i} terms, so that the two sums combine the same \overset{→}{β}'s in the same order: \overset{→}{v} = {c}_{1} {\overset{→}{β}}_{1} + {c}_{2} {\overset{→}{β}}_{2} + ⋯ + {c}_{n} {\overset{→}{β}}_{n} and \overset{→}{v} = {d}_{1} {\overset{→}{β}}_{1} + {d}_{2} {\overset{→}{β}}_{2} + ⋯ + {d}_{n} {\overset{→}{β}}_{n}. Now

{c}_{1} {\overset{→}{β}}_{1} + {c}_{2} {\overset{→}{β}}_{2} + ⋯ + {c}_{n} {\overset{→}{β}}_{n} = {d}_{1} {\overset{→}{β}}_{1} + {d}_{2} {\overset{→}{β}}_{2} + ⋯ + {d}_{n} {\overset{→}{β}}_{n}

holds if and only if

( {c}_{1} − {d}_{1} ) {\overset{→}{β}}_{1} + … + ( {c}_{n} − {d}_{n} ) {\overset{→}{β}}_{n} = \overset{→}{0}

holds, and so asserting that each coefficient in the lower equation is zero is the same thing as asserting that {c}_{i} = {d}_{i} for each i.

Definition 1.13

In a vector space with basis B the
representation of \overset{→}{v} with respect to B
is the column vector of the coefficients used to express \overset{→}{v} as a
linear combination of the basis vectors:

{R e p}_{B} ( \overset{→}{v} ) = ( \begin{matrix}{c}_{1} \\ {c}_{2} \\ ⋮ \\ {c}_{n}\end{matrix} )

where B = ⟨ {\overset{→}{β}}_{1} , … , {\overset{→}{β}}_{n} ⟩ and \overset{→}{v} = {c}_{1} {\overset{→}{β}}_{1} + {c}_{2} {\overset{→}{β}}_{2} + ⋯ + {c}_{n} {\overset{→}{β}}_{n}. The c's are the
coordinates of \overset{→}{v} with respect to B

We will later do representations in contexts that involve more than one basis. To help with the bookkeeping, we shall often attach a subscript B to the column vector.

Example 1.14

In {𝒫}_{3}, with respect to the basis B = ⟨ 1 , 2 x , 2 {x}^{2} , 2 {x}^{3} ⟩, the representation of x + {x}^{2} is

{R e p}_{B} ( x + {x}^{2} ) = {( \begin{matrix}0 \\ 1 / 2 \\ 1 / 2 \\ 0\end{matrix} )}_{B}

(note that the coordinates are scalars, not vectors). With respect to a different basis D = ⟨ 1 + x , 1 − x , x + {x}^{2} , x + {x}^{3} ⟩, the representation

{R e p}_{D} ( x + {x}^{2} ) = {( \begin{matrix}0 \\ 0 \\ 1 \\ 0\end{matrix} )}_{D}

is different.

Remark 1.15

This use of column notation and the term "coordinates" has both a down side and an up side.

The down side is that representations look like vectors from {ℝ}^{n}, which can be confusing when the vector space we are working with is {ℝ}^{n}, especially since we sometimes omit the subscript base. We must then infer the intent from the context. For example, the phrase "in {ℝ}^{2}, where \overset{→}{v} = ( \frac{3}{2} )" refers to the plane vector that, when in canonical position, ends at ( 3 , 2 ). To find the coordinates of that vector with respect to the basis

B = ⟨ ( \begin{matrix}1 \\ 1\end{matrix} ) , ( \begin{matrix}0 \\ 2\end{matrix} ) ⟩

we solve

{c}_{1} ( \begin{matrix}1 \\ 1\end{matrix} ) + {c}_{2} ( \begin{matrix}0 \\ 2\end{matrix} ) = ( \begin{matrix}3 \\ 2\end{matrix} )

to get that {c}_{1} = 3 and {c}_{2} = − 1 / 2.
Then we have this.

{R e p}_{B} ( \overset{→}{v} ) = ( \begin{matrix}3 \\ − 1 / 2\end{matrix} )

Here, although we've ommited the subscript B from the column, the fact that the right side is a representation is clear from the context.

The up side of the notation and the term "coordinates" is that they generalize the use that we are familiar with:~in {ℝ}^{n} and with respect to the standard basis {ℰ}_{n}, the vector starting at the origin and ending at ( {v}_{1} , … , {v}_{n} ) has this representation.

{R e p}_{{ℰ}_{n}} ( ( \begin{matrix}{v}_{1} \\ ⋮ \\ {v}_{n}\end{matrix} ) ) = {( \begin{matrix}{v}_{1} \\ ⋮ \\ {v}_{n}\end{matrix} )}_{{ℰ}_{n}}

Our main use of representations will come in the third chapter. The definition appears here because the fact that every vector is a linear combination of basis vectors in a unique way is a crucial property of bases, and also to help make two points. First, we fix an order for the elements of a basis so that coordinates can be stated in that order. Second, for calculation of coordinates, among other things, we shall restrict our attention to spaces with bases having only finitely many elements. We will see that in the next subsection.

Exercises

This exercise is recommended for all readers.

Problem 1

Decide if each is a basis for {ℝ}^{3}.

• ⟨ ( \begin{matrix}1 \\ 2 \\ 3\end{matrix} ) , ( \begin{matrix}3 \\ 2 \\ 1\end{matrix} ) , ( \begin{matrix}0 \\ 0 \\ 1\end{matrix} ) ⟩
• ⟨ ( \begin{matrix}1 \\ 2 \\ 3\end{matrix} ) , ( \begin{matrix}3 \\ 2 \\ 1\end{matrix} ) ⟩
• ⟨ ( \begin{matrix}0 \\ 2 \\ − 1\end{matrix} ) , ( \begin{matrix}1 \\ 1 \\ 1\end{matrix} ) , ( \begin{matrix}2 \\ 5 \\ 0\end{matrix} ) ⟩
• ⟨ ( \begin{matrix}0 \\ 2 \\ − 1\end{matrix} ) , ( \begin{matrix}1 \\ 1 \\ 1\end{matrix} ) , ( \begin{matrix}1 \\ 3 \\ 0\end{matrix} ) ⟩

This exercise is recommended for all readers.

Problem 2

Represent the vector with respect to the basis.

• ( \begin{matrix}1 \\ 2\end{matrix} ),
  B = ⟨ ( \begin{matrix}1 \\ 1\end{matrix} ) , ( \begin{matrix}− 1 \\ 1\end{matrix} ) ⟩ ⊆ {ℝ}^{2}
• {x}^{2} + {x}^{3},

D = ⟨ 1 , 1 + x , 1 + x + {x}^{2} , 1 + x + {x}^{2} + {x}^{3} ⟩ ⊆ {𝒫}_{3}

• ( \begin{matrix}0 \\ − 1 \\ 0 \\ 1\end{matrix} ),
  {ℰ}_{4} ⊆ {ℝ}^{4}

Problem 3

Find a basis for {𝒫}_{2}, the space of all quadratic polynomials. Must any such basis contain a polynomial of each degree:~degree zero, degree one, and degree two?

Problem 4

Find a basis for the solution set of this system.

\begin{matrix}{x}_{1} & − & 4 {x}_{2} & + & 3 {x}_{3} & − & {x}_{4} & = & 0 \\ 2 {x}_{1} & − & 8 {x}_{2} & + & 6 {x}_{3} & − & 2 {x}_{4} & = & 0\end{matrix}

This exercise is recommended for all readers.

Problem 5

Find a basis for {ℳ}_{2 \ × \ 2}, the space of {}2 \ × \ 2 matrices.

This exercise is recommended for all readers.

Problem 6

Find a basis for each.

• The subspace \{ {a}_{2} {x}^{2} + {a}_{1} x + {a}_{0} \ | \ {a}_{2} − 2 {a}_{1} = {a}_{0} \} of {𝒫}_{2}
• The space of three-wide row vectors whose first and second components add to zero
• This subspace of the {}2 \ × \ 2 matrices

\{ ( \begin{matrix}a & b \\ 0 & c\end{matrix} ) \ | \ c − 2 b = 0 \}

Problem 7

Check Example 1.6.

This exercise is recommended for all readers.

Problem 8

Find the span of each set and then find a basis for that span.

• \{ 1 + x , 1 + 2 x \} in {𝒫}_{2}
• \{ 2 − 2 x , 3 + 4 {x}^{2} \} in {𝒫}_{2}

This exercise is recommended for all readers.

Problem 9

Find a basis for each of these subspaces of the space {𝒫}_{3} of cubic polynomials.

• The subspace of cubic polynomials p ( x )
  such that p ( 7 ) = 0
• The subspace of polynomials p ( x ) such

that p ( 7 ) = 0 and p ( 5 ) = 0

• The subspace of polynomials p ( x ) such
  that p ( 7 ) = 0, p ( 5 ) = 0, and~p ( 3 ) = 0
• The space of polynomials p ( x ) such

that p ( 7 ) = 0, p ( 5 ) = 0, p ( 3 ) = 0, and~p ( 1 ) = 0

Problem 10

We've seen that it is possible for a basis to remain a basis when it is reordered. Must it always remain a basis?

Problem 11

Can a basis contain a zero vector?

This exercise is recommended for all readers.

Problem 12

Let ⟨ {\overset{→}{β}}_{1} , {\overset{→}{β}}_{2} , {\overset{→}{β}}_{3} ⟩ be a basis for a vector space.

• Show that ⟨ {c}_{1} {\overset{→}{β}}_{1} , {c}_{2} {\overset{→}{β}}_{2} , {c}_{3} {\overset{→}{β}}_{3} ⟩ is a basis when {c}_{1} , {c}_{2} , {c}_{3} ≠ 0. What happens when at least one {c}_{i} is 0?
• Prove that ⟨ {\overset{→}{α}}_{1} , {\overset{→}{α}}_{2} , {\overset{→}{α}}_{3} ⟩ is a basis where {\overset{→}{α}}_{i} = {\overset{→}{β}}_{1} + {\overset{→}{β}}_{i}.

Problem 13

Find one vector \overset{→}{v} that will make each into a basis for the space.

• ⟨ ( \begin{matrix}1 \\ 1\end{matrix} ) , \overset{→}{v} ⟩ in {ℝ}^{2}
• ⟨ ( \begin{matrix}1 \\ 1 \\ 0\end{matrix} ) , ( \begin{matrix}0 \\ 1 \\ 0\end{matrix} ) , \overset{→}{v} ⟩ in {ℝ}^{3}
• ⟨ x , 1 + {x}^{2} , \overset{→}{v} ⟩ in {𝒫}_{2}

This exercise is recommended for all readers.

Problem 14

Where ⟨ {\overset{→}{β}}_{1} , … , {\overset{→}{β}}_{n} ⟩ is a basis, show that in this equation

{c}_{1} {\overset{→}{β}}_{1} + … + {c}_{k} {\overset{→}{β}}_{k} = {c}_{k + 1} {\overset{→}{β}}_{k + 1} + … + {c}_{n} {\overset{→}{β}}_{n}

each of the {c}_{i}'s is zero. Generalize.

Problem 15

A basis contains some of the vectors from a vector space; can it contain them all?

Problem 16

Theorem 1.12 shows that, with respect to a basis, every linear combination is unique. If a subset is not a basis, can linear combinations be not unique? If so, must they be?

This exercise is recommended for all readers.

Problem 17

A square matrix is symmetric if for all indices i and j, entry i , j equals entry
j , i.

• Find a basis for the vector space of symmetric {}2 \ × \ 2 matrices.
• Find a basis for the space of symmetric {}3 \ × \ 3 matrices.
• Find a basis for the space of symmetric n \ × \ n matrices.

This exercise is recommended for all readers.

Problem 18

We can show that every basis for {ℝ}^{3} contains the same number of vectors.

• Show that no linearly independent subset of {ℝ}^{3} contains more than three vectors.
• Show that no spanning subset of {ℝ}^{3} contains fewer than three vectors. (Hint. Recall how to calculate the span of a set and show that this method, when applied to two vectors, cannot yield all of {ℝ}^{3}.)

Problem 19

One of the exercises in the Subspaces subsection shows that the set

\{ ( \begin{matrix}x \\ y \\ z\end{matrix} ) \ | \ x + y + z = 1 \}

is a vector space under these operations.

( \begin{matrix}{x}_{1} \\ {y}_{1} \\ {z}_{1}\end{matrix} ) + ( \begin{matrix}{x}_{2} \\ {y}_{2} \\ {z}_{2}\end{matrix} ) = ( \begin{matrix}{x}_{1} + {x}_{2} − 1 \\ {y}_{1} + {y}_{2} \\ {z}_{1} + {z}_{2}\end{matrix} ) \ r ( \begin{matrix}x \\ y \\ z\end{matrix} ) = ( \begin{matrix}r x − r + 1 \\ r y \\ r z\end{matrix} )

Find a basis.

Solutions

Footnotes

• ↑ More information on sequences is in the appendix.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.