Problem 1

Show that the subspaces of are precisely , all lines in containing the origin, and .

A subspace of can have a basis of length 0, 1, 2.

  • 0: The only basis of length 0 is .
  • 1: Any basis of length 1 contains a single . Note that , and hence bases of length are lines through the origin.
  • 2: Any basis of length 2 is simply a basis of and hence generates all with its span.

Problem 2

Show that the subspaces of are precisely , all lines in containing the origin, all planes in containing the origin, and .

A subspace of can have a basis of length 0, 1, 2, 3.

  • 0: The only basis of length 0 is .
  • 1: Any basis of length 1 contains a single . Note that , and hence bases of length are lines through the origin.
  • 2: Any basis of length 2 contains two linearly independent . Notice , hence bases of length 2 generate planes through the origin.
  • 3: Any basis of length 3 is simply a basis of and hence generates all with its span.

Problem 3

  • (a) Let . Find a basis of .
  • (b) Extend the basis in (a) to a basis of .
  • (c) Find the subspace of such that .

(a) The set consists of polynomials in such that . This gives a single constraint, so our basis needs 4 elements. A basis would be

which are linearly independent. Any linear combination of these would still be a member of . Note that .

(b) We can simply add one element , since we just need (linearly independent list of the right length is a basis). We can add , so that we have

(c) We need and . Based on (b) above, we can let , then by the previous part.

Problem 4

  • (a) Let . Find a basis of .
  • (b) Extend the basis in (a) to a basis of .
  • (c) Find the subspace of such that .

(a) The set consists of degree-4 polynomials such that .

Since , we can write

This means that any has the form

which gives us a basis of

(b) We just need to find an element of to that is not in already, because we already have . We can simply add , since . This gives us

(c) We can use .

Problem 5

  • (a) Let . Find a basis of .
  • (b) Extend the basis in (a) to a basis of .
  • (c) Find the subspace of such that .

(a) We can write and and equate them to each other:

This gives a constraint on the coefficients. We can solve the constraint explicitly for one variable:

Then we can re-write the original polynomial as:

which means that any has the form

This results in a basis of:

(b) We can add

(c) We can have .

Problem 6

  • (a) Let . Find a basis of .
  • (b) Extend the basis in (a) to a basis of .
  • (c) Find the subspace of such that .

(a) The condition means that any polynomial must have the form

where is some polynomial of at most degree 1, since and the degree of is already 3. This means that:

where . The basis is thus

(b) The dimension of is 5, and the basis of in part (a) only had 2 elements. Thus, we need three additional linearly independent polynomials. A simple choice is

Thus, the extended basis is

(c) .

Problem 7

  • (a) Let . Find a basis of .
  • (b) Extend the basis in (a) to a basis of .
  • (c) Find the subspace of such that .

(a) We can write . The integral is then

so for , we have

which gives

Thus, the basis for is

(b) We have and , so we need to find one more linearly independent vector.

(c) We have .

Problem 8

Suppose is linearly independent in and . Prove that

The span is

Since are linearly independent, their span has dimension . Adding changes the span, depending on whether is in the span of .

If , then . In this case, .

If , then adds an additional dimension, and the dimension becomes .

Thus, in both cases, the minimum dimension is .

Alternatively, we can note that

it follows that . Similarly, for all .

The list is linearly independent since is linearly independent in . Thus, we have .

Problem 9

Suppose is a positive integer and are such that each has degree . Prove that is a basis of .

To prove that is a basis, they must span and they must be linearly independent.

Any polynomial can be written as a linear combination of polynomials of degree . Since the list contains a polynomial from each of these degrees, their span must cover .

By constructions, the list is linearly independent since each of them is a polynomial with a different degree. We can also think of this recursively (the highest degree polynomial has a term that doesn’t exist in any other ‘s), so for , must be zero, and then we can work backward to see that all coefficients must be zero.

Problem 10

Suppose is a positive integer. For , let

Show that is a basis of .

We need to show that they span and they are linearly independent.

For linear independence, we need

where are constants. Substituting , this becomes

Each term is a polynomial of degree . These polynomials are linearly independent because they involve distinct contributions of powers of and , which cannot cancel each other out unless all coefficients .

Since the list contains linearly independent polynomials and , it suffices to show linear independence. Thus, the list is a basis because linearly independent list of the right length is a basis.

Problem 11

Suppose and are both four-dimensional subspaces of . Prove that there exist two vectors in such that neither of these vectors is a scalar multiple of the other.

We treat as a vector space over . We have

and thus . Then we have

Since is a subspace of and , we must have . Since , we have

and hence

Thus, has a basis of length at least two. Since vectors in a basis are linearly independent from each other, there exist two vectors in such that neither is a scalar multiple of the other.

Problem 12

Suppose and are both five-dimensional subspaces of , such that , , and . Prove that .

We have

and since with and , we have

and hence we must have . Therefore, we must have . By the condition for direct sum of two subspaces, we have .

Problem 13

Suppose and are both five-dimensional subspaces of . Prove that .

Since and are subspaces of , their sum is also a subspace (sums and scalar multiples of elements from remain in ). Thus, we must have:

We can write as

which gives us

which means . This means that , as this would give .

Problem 14

Suppose is a ten-dimensional vector space and are subspaces of with . Prove that .

We must have

Since , we must have . This implies that

Now we can consider the intersection . Let , and observe that

Since and we now have

Because , the intersection is non-trivial, so .

Problem 15

Suppose is finite-dimensional and are subspaces of with . Prove that .

Let . We have .

We have

Then, we have

Since , we have . Thus:

Re-arranging:

but

because ).

From the assumption that , this implies

Problem 16

Suppose is finite-dimensional and is a subspace of with . Let and . Prove that there exist subspaces of , each of dimension , whose intersection equals .

We aim to construct subspaces , each of dimension , such that

Since is a subspace of , we can extend a basis of to a basis of . That is, the basis

can be extended to a basis of by adding additional vectors:

The additional generate the complement of in .

For each in , we can define a subspace of as follows:

Intuitively, is the hyperplane of orthogonal to .

Each has dimension , since imposing a single linear constraint reduced the dimension of . We also have , because elements of are linear combinations of , which are independent of , so . Thus, .

Now, consider the intersection . Each imposes a constraint orthogonal to one of the , ensuring that any satisfies for all .

The subspace of vectors orthogonal to all is precisely , because spans the complement of . Enforcing orthogonality to the complement leaves us with exactly . Thus:

With this, we have constructed subspaces , each of dimension , such that their intersection is .

Problem 17

Suppose are finite-dimensional subspaces of . Prove that is finite-dimensional and

For each , choose a basis for . Combine these bases to form a single list of vectors in . This list clearly spans by construction.

Hence, is finite-dimensional, and has a dimension less than or equal to the number of vectors in the list we constructed. Notice that the number of vectors in the list is equal to , since the list is just combined bases for each . That is,

as desired.

Problem 18

Suppose is finite-dimensional with . Prove that there exist one-dimensional subspaces of such that

Since , there exists a basis of . Let for , so that each has dimension . Clearly,

so we need to show that this sum is direct.

For some , there exist , such that

But since is a basis, this representation of as a linear combination of is unique, and thus the sum is direct.

Problem 19

Explain why you might guess, motivated by some analogy with the formula for the number of elements in the union of three finite sets, that if are subspaces of finite-dimensional vector space, then

\begin{align} \dim (V_{1}+ & V_{2}+V_{3}) \\ & = \dim V_{1}+\dim V_{2}+\dim V_{3}\\ & \quad - \dim (V_{1}\cap V_{2})-\dim (V_{1}\cap V_{3})-\dim (V_{2}\cap V_{3}) \\ & \quad +\dim (V_{1}\cap V_{2}\cap V_{3})

\end{align}

The statement is false. Consider

We have

and therefore

Problem 20

Prove that if , and are subspaces of finite-dimensional vector space, then

This can be shown by successively applying the dimension formula for sums of subspaces, .

We can treat as a single subspace, and add . We have

We can apply this symmetrically for the other two ways to group and sum the subspaces

and

All three expressions are valid and symmetric. We take the average of these three expressions:

Substituting gives us: