HW 2 - Finite Dimensional Vector Spaces

2.A

#1

Theorem

Suppose v1,...,v4 spans V. Then the list:

v1−v2,v2−v3,v3−v4,v4

also spans V.

\begin{proof}
We're given that span(v1,...,v4)=V, so then:

V={a1v1+⋯+a4v4:ai∈F,v1,...,v4∈V}

We just need to show that all v1,...,v4 can be expressed in terms of each of v1−v2,v2−v3,v3−v4,v4. Notice that clearly:

v1=1(v1−v2)+1(v2−v3)+1(v3−v4)+1(v4)

So v1∈span(v1,...,v4). Similarly:

v2=1(v2−v3)+1(v3−v4)+1(v4)v3=1(v3−v4)+1(v4)v4=1(v4)

So then all v1,...,v4∈span of our new list, so then by definition then span(v1,...,v4)=span(v1−v2,...,v4), so our new list spans V.
\end{proof}

#2

We verify each assertion below.

a: A list of one vector v∈V is LI iff v≠0→.

Consider the → direction. Consider some {v}, where we know the list is LI. Then the only way to write:

αv=0→

is α=0. Notice that by contradiction if v=0→ then a possible α≠0 to choose is:

αv=1v=1⋅0→=0→

which contradicts the list being LI. So then v≠0→.

Consider the ← direction. Say v≠0→. Assume for contradiction that there's some nonzero α∈F such that αv=0→. Then since α≠0 we can divide both sides by α to get:

v=1α0→=0→

Which contradicts v≠0→, so then the only choice we have is that α=0, so then by definition then the the only choice of alpha for αv=0→ is α=0, so the list {v} is LI.

b: A list of two vectors in V is LI iff neither vector is a scalar multiple of the other

Consider the → direction. Consider {v1,v2} where v1,v2∈V. Say the list is LI, so then the only a1,a2∈F where:

a1v1+a2v2=0→

is both a1,a2=0. Assume for contradiction that one vector is a scalar multiple of the other (which one it is doesn't matter here). So then let's say that v1=αv2 for some non-zero scalar α∈F.

First, we should show that both v1,v2≠0→. Notice if one of them was the zero vector, let's say v1, then the linear combination:

a1v1+a2v2=a10→+a2v2=0→

wouldn't require that a1,a2=0 as the choice a1=1 and a2=0 would work. This contradicts the list being LI. As such, then v1,v2≠0→. Thus, since we are considering v1=αv2 then α≠0 as if α=0 then v1=0v2=0→ which is another contradiction. Thus, α≠0.

But notice that:

1v1=αv2⇒1v1−αv2=0→

but we know from above that a1=1 and −α≠0 so then we've found non-zero scalar that linearly combine v1,v2 to make the zero-vector, suggesting the list was LD the whole time. This is a contradiction, so then clearly v1=αv2 is false, so each vector isn't a scalar multiple of the other.

Now, consider the ← direction, so suppose neither vector of v1,v2 is a scalar multiple of the other, so no v1=αv2 nor v2=βv1 for any α,β∈F. Again, we can show that neither v1,v2 can be the zero vector. If one of them was, say v1=0→, then notice that v1=0v2 which contradicts v1 not being a scalar multiple of v2. WLOG, then v2≠0→ as well.

So we know v1,v2≠0→. Notice then that their linear combination:

a1v1+a2v2=0→

for what values of a1,a2∈F? Assume for contradiction that one a1,a2≠0. Then notice then that:

a1v1=−a2v2

WLOG, let's say that a1 is non-zero. Then we can divide it and see that:

v1=−a2a1v2

but this contradicts v1 not being a scalar multiple of v2, so then clearly a1=0. WLOG, then a2=0 too. Thus, both a1,a2=0, showing that the list of {v1,v2} is LI.

c: (1,0,0,0),(0,1,0,0),(0,0,1,0) is LI in F4.

Let the first vector be v1 the second v2 and the third v3. Consider choices of a1,a2,a3∈F to make:

a1v1+a2v2+a3v3=0→=(0,0,0,0)

This requires, by expanding, that:

a1(1,0,0,0)+a2(0,1,0,0)+a3(0,0,1,0)=(a1,a2,a3,0)=(0,0,0,0)

Creating 4 equations:

a1=0,a2=0,a3=0,0=0

Thus, all a1,a2,a3=0, so the list is LI.

d: The list 1,...,zm is LI in P(F) for each non-negative integer m∈N.

Let v1=1,v2=z,...,vm+1=zm. Then consider when:

a1v1+⋯+am+1vm+1=0→=0+0z+⋯+0zm

We can substitute our values in:

a1⋅z0+a2z+⋯+am+1zm=0z0+0z+⋯+0zm

equating coefficients yields:

a1=0,a2=0,...,am+1=0

So all ai∈F are actually 0, so then the list of vectors above is LI.

#3

We'll find some number t such that:

(3,1,4),(2,−3,5),(5,9,t)

is NOT LI in R3. We can actually solve for this number by trying to take LC's of the other two vectors to make the new vector:

a1(3,1,4)+a2(2,−3,5)=(5,9,t)

giving the equations:

3a1+2a2=5,a1−3a2=9,4a1+5a2=t

Ignore the third equation for now. We can solve the a1,a2 using matrix algebra:

[321−3][a1a2]=[59]

Notice det(A)≠0 so we can solve for A−1:

A−1=1det(A)[−3−2−13]=−111[−3−2−13]

so multiply b→ by our A−1 to give:

a→=−111[−3−2−13][59]=−111[−3322]=[3−2]

So then we have a1=3,a2=−2, so then:

t=4a1+5a2=4⋅3+5⋅−2=2

Thus choose t=2, then notice that:

3(3,1,4)−2(2,−3,5)−1(5,9,2)=0→

so by definition then these vectors aren't LI.

#6

Theorem

Suppose the list v1,...,v4 is LI in V. Then the list:

v1−v2,v2−v3,v3−v4,v4

is also LI.

\begin{proof}
We need to show that the only values ai∈F that make:

a1(v1−v2)+a2(v2−v3)+a3(v3−v4)+a4v4=0→

is that all ai=0. We know that since v1,...,v4 is LI, then:

b1v1+b2v2+b3v3+b4v4=0→

only when all bi=0. Notice in our first equation that we can rewrite it to make:

a1v1+(a2−a1)v2+(a3−a2)v3+(a4−a3)v4=0→

But via our second equation, since each ai−aj∈F then each also is 0, ie all ai−aj=0⇒ai=aj. Thus, we have:

a1=0,a2−a1=0⇒a2=a1,a3−a2=0⇒a3=a2,a4−a3=0⇒a4=a3

But notice then that 0=a1=a2=a3=a4, so then that shows that our initial list must be LI!
\end{proof}

#7

Theorem

Given that v1,...,vm is a LI list of vectors in V, then 5v1−4v2,v2,...,vm is also LI.

\begin{proof}
Again, we need to show that:

a1(5v1−4v2)+a2v2+⋯+amvm=0→

Forces all ai=0. We are given that since v1,...,vm is LI then:

b1v1+⋯+bmvm=0→

only when all bj=0. Taking our first equation, notice that we can rewrite it into:

5a1v1+(−4a1+a2)v2+⋯+amvm=0→

but by equation (2), then all of the constants in front of each vi is 0, namely:

5a1=0,−4a1+a2=0,…,am=0

Notice then that a1=0 from the first equation we got. Thus, −4a1+a2=0+a2=0⇒a2=0. The remaining aj=0, so then by definition our original list must be LI.
\end{proof}

#9

Proposition

Suppose that v1,...,vm and w1,...,wm are LI lists of vectors from V. Then v1+w1,...,vm+wm is LI.

This a false proposition. Consider {v1,v2}={(1,0),(0,1)} and {w1,w2}={(−1,0),(0,−1)} are LI lists whose contents span R2. Notice then that:

v1+w1=(0,0)=v2+w2

But notice that {v1+w1,v2+w2}={(0,0)} is linearly dependent since we can choose:

1(0,0)=0→

is a valid linear combination of vectors in the set that makes the zero-vector.

#10

Theorem

Suppose v1,...,vm is LI in V, and w∈V. Then if v1+w,...,vm+w is LD, then w∈span(v1,...,vm).

\begin{proof}
Suppose v1,...,vm is LI in V, and w∈V. Suppose v1+w,...,vm+w is LD, so there are some ai not all 0 such that:

a1(v1+w)+⋯+am(vm+w)=0→

Rearranging:

a1v1+⋯+amvm+a1w+⋯+amw=0→

If a1+⋯+am=0 then that would imply that a1v1+⋯+amvm=0→ for some non-zero ai which is a contradiction. Hence, a1+⋯+am≠0. Therefore:

w=−1a1+⋯+am(a1v1+⋯+amvm)

So w∈span(v1,...,vn).

\end{proof}

# 11

Theorem

Suppose v1,...,vm is LI in V, and w∈V. Then v1,...,vm,w is LI iff w∉span(v1,...,vm).

\begin{proof}
Suppose v1,...,vm is LI in V, and w∈V. So then:

b1v1+⋯+bmvm=0→

only when all bi=0. For this proof, we need to prove both directions.

For (→) suppose v1,...,vm,w is LI. Now, assume for contradiction that w∈span(v1,...,vm), so then there exists at least one non-zero constant ci such that:

c1v1+⋯+cmvm=w

But notice that we can move the w over to create:

c1v1+⋯+cmvm+(−1)w=0→

But look! At least one ci isn't 0, and with the −1 constant being added to the w vector, it's clear that this implies that v1,...,vm,w is not LI, which contradicts our supposition that it is. Therefore, then we must have it that w∈span(v1,...,vm).

Now, consider (←), so then suppose that w∉span(v1,...,vm). Assume for contradiction that instead v1,...,vm,w is LD. Then there exist at least one non-zero constant ei such that:

e1v1+⋯+emvm+em+1w=0→

But look! Consider the cases where em+1 is or isn't 0. If em+1=0 then we have:

e1v1+⋯+emvm=0→

But since v1,...,vm is LI then all ei=0 which contradicts us having at least one-non zero constant ei as v1,...,vm,w is LD. Now instead consider when em+1≠0. Then notice that we can solve for w:

−1em+1(e1v1+⋯+emvm)=w

But this would contradict w∉span(v1,...,vm) as this is a valid linear combination of constants to get w.

Therefore, no matter what, we have a contradiction, so then we must have it that v1,...,vm,w is instead LI.
\end{proof}

#12

We know that there's not a list of 6 polynomials that are linearly independent in P4(F) since we can make a spanning list that only uses 5 polynomials, so by the lemma that the length of a LI list is ≤ the length of the spanning list, then at most any LI list of polynomials from this space must have 5 or less vectors.

Now for constructing this spanning list. I chose {1,x,x2,x3,x4}. Notice that these are LI since if we consider:

a1+a2x+a3x2+a4x3+a5x4=0+0x+0x2+0x3+0x4

then the only solution is all ai=0, so then the list is LI. Furthermore, it is a valid spanning list, since given any arbitrary p(x)=a+bx+cx2+dx3+ex4∈P4(F) we can choose the constants:

av1+bv2+cv3+dv4+ev5=p(x)

to span this polynomial.

#13

Refer to the LI spanning list for P4(F). We made a list of 5 items long, so again via the same lemma that the length of a LI list is ≤ the length of a spanning list, then via our example then any spanning list must be ≥ to our LI list which was 5 items long. Thus, it is impossible for a 4 item list to exist that spans our space in question.

#14

Theorem

V is infinite-dimensional (ie: not finite-dimensional) iff there is an infinite sequence v1,v2,... of vectors in V such that v1,...,vm is LI for every positive integer m∈N.

\begin{proof}
We need to prove both directions.

First the (→) direction. Suppose that V is infinite-dimensional. Thus, there exists no finite list v1,...,vm of vectors from V such that v1,...,vm spans the space V.

We need to show that given some infinite sequence of vectors v1,... all in V, that cutting off v1,...,vm gives a LI list for any positive integer m∈N. Consider the base case of just v1, which is clearly LI by proxy. Let our inductive hypothesis suggest that for all k∈(1,...,m) that v1,...,vk is LI. Consider v1,...,vk+1. Since V is infinite-dimensional, then v1,...,vk cannot span some new vector vk+1∈V, so therefore adding it in gives us a LI list of v1,...,vk+1, completing the inductive step.

For the (←) direction, suppose that there is an infinite sequence v1,v2,... of vectors in V such that v1,...,vm is LI for every positive integer m∈N. Notice that via contradiction, if we assumed that V had a finite dimension, then we could make a new sequence v1,...,vn,vn+1 whereby our supposition, that new list would be LI, and since a spanning list length is ≥ a LI list length, then any vectors spanned by v1,...,vn clearly missed a vector from span(v1,...,vn,vn+1), so then n isn't the dimension of V so V isn't finite dimensional.
\end{proof}

#17

Theorem

Suppose p0,...,pm are polynomials in Pm(F), such that pj(2)=0 for each j. Then p0,...,pm is not LI (so it is LD) in Pm(F).

\begin{proof}
We'll try to prove this via induction over m.

As a base case, consider when m=0. The we have p0 such that p0(2)=0. Notice that since we are working in P0(R), we are only working with constant functions. As such, since p0(2)=0=c then p0(x)=0, so the list p0 is LD.

Now let's do the inductive step. Let k∈N be arbitrary. Our inductive hypothesis is that for polynomials p0,...,pk in Pk(F) where all pj(2)=0 then p0,...,pk is LD. Consider the k+1 case, where we have the list p0,...,pk,pk+1 where the new pk+1(2)=0. Consider trying to add the polynomials such as to add to the zero polynomial:

a0p0+⋯+akpk+ak+1pk+1=0→

for all aj∈F. Now, if pk+1 is the zero function then we are done as we would have the equation that:

a0p0+⋯+akpk=0→

where since p0,...,pk is LD via our inductive hypothesis, then we can choose all our constants a0,...,ak such that we have at least one non-zero aj, and for ak+1 we can set that to any value, even 0. Thus, our new equation would contain non-zero linear combinations of our vectors to get the zero vector, so then we have shown that p0,...,pk+1 is LD.

Now for the other case, suppose that pk isn't the zero function. We still can just choose ak+1=0 so then we'd get:

a0p0+⋯+akpk=0→

where again via our inductive hypothesis, then there will be at least one non-zero coefficient aj to show that our whole a0,...,ak+1 contains at least one non-zero choice. As such, then the whole p0,...,pk+1 must be LD.

This completes the proof via mathematical induction.
\end{proof}

2.B

#2

We'll verify all the assertions from Example 2.28:

a: The list (1,0,...,0),(0,1,0,...,0),...,(0,...,0,1) is a basis of Fn, called the standard basis of Fn.

Notice that clearly the list spans Fn as any x∈Fn, say x=(x1,...,xn) can be represented via:

x1(1,...,0)+⋯+xn(0,...,1)=x

Now, for LI, consider when:

a1v1+⋯+anvn=0→=(0,...,0)

giving the equations:

a1=0,....,an=0

thus then this list of vectors is LI.

b: The list (1,2),(3,5) is a basis for F2

Again, we can see that LI is made by considering:

a1(1,2)+a2(3,5)=(0,0)→a1+3a2=0,2a1+5a2=0

solving for a1 gives that a1=−3a2, so substituting into (2) gives −6a2+5a2=0⇒a2=0 so then a1=0. Thus, the list is LI.

Now for span. Consider an arbitrary vector x∈F2, ie: x=(x1,x2). Then:

(−5x1+3x2)(1,2)+(2x1−x2)(3,5)=(x1,x2)

is an optimal choice, so then clearly it's spanned.

c: The list (1,2,−4),(7,−5,6) is LI in F3 but isn't a basis for it since it doesn't span it

Note we can show LI by noticing that:

a1v1+a2v2=(0,0,0)

only when a1+7a2=0 and 2a1−5a2=0. Notice that a1=−7a2 so then substituting into (2) then −14a2−5a2=−19a2=0⇒a2=0 so then a1=0, showing LI.

Now for lacking span, notice that I can choose the vector (1,0,0)∈F3 but it's not in the span since then:

a1v1+a2v2=(1,0,0)

implying that a1+7a2=1, 2a1−5a2=0, and −4a1+6a2=0. From (1) we have a1=1−7a2 so then putting it into (2) gives:

2(1−7a2)−5a2=0⇒−19a2=−2⇒a2=219

thus then a1=519, but plugging into (3) gives:

−4a1+6a2=−2019+1219=819≠0

thus there's no ai's that allow for the vector (1,0,0) to be spanned by our list of vectors.

d: The list (1,2),(3,5),(4,13) spans F2 but isn't a basis since it isn't LI

Look at HW 2 - Finite Dimensional Vector Spaces#b A list of two vectors in V is LI iff neither vector is a scalar multiple of the other for a reason why at least the first two vectors span the list. The addition of the third vector doesn't change the span.

For LI, consider:

a1(1,2)+a2(3,5)+a3(4,13)=(0,0)

I claim that (a1,a2,a3)=(−19,5,1) since:

−19(1,2)+5(3,5)+1(4,13)=(0,0)

thus the list isn't LI.

e: The list (1,1,0),(0,0,1) is a basis for {(x,x,y):x,y∈F}

For span, denote x∈S as arbitrary, so then x=(i,i,j) for i,j∈F. Notice that:

i(1,1,0)+j(0,0,1)=x

thus since x was arbitrary then these vectors span the set.

For LI, consider:

a1(1,1,0)+a2(0,0,1)=(0,0,0)

implying that a1=0,a1=0,a2=0, showing LI.

f: The list (1,−1,0),(1,0,−1) is a basis for {(x,y,z)∈F3:x+y+z=0}

First let's talk span. Consider x∈S, so then x=(a,b,c) such that a+b+c=0. Now, notice that:

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

since a=−b−c, so then since x was arbitrary, then the vectors span the space.

Now for LI. Consider when:

a1(1,−1,0)+a2(1,0,−1)=(0,0,0)

we have it that a1+a2=0, −a1=0 and −a2=0, so then a1=a2=0 thus the vectors are LI.

g: The list 1,...,zm is a basis for Pm(F)

Consider span. Let x∈Pm(F) be arbitrary, so x=x1+x2z+...+xm+1zm. Then notice that:

x1(1)+x2(z)+⋯+xm+1(zm)=x

thus since x was arbitrary the vectors span our space.

For LI, consider when:

a1(1)+a2(z)+⋯+am+1(zm)=0+0z+⋯+0zm

equating coefficients yeilds that all ai=0 showing LI.

#3

a

Let U be a subspace of R5 defined by:

U={(x1,...,x5):x1=3x2,x3=7x4}

a valid basis for U is:

(3,1,0,0,0),(0,0,7,1,0),(0,0,0,0,1)

which we'll show. First, for span, let x∈U be arbitrary, so then x=(3x2,x2,7x4,x4,x5). Then notice that:

x2v1+x4v2+x5v3=x

where v1 is the first vector mentioned before, and so on. Since x was arbitrary it follows that the vectors span U.

For LI, consider when:

a1v1+a2v2+a3v3=0→=(0,0,0,0,0)

Expanding gives us the equation that 3a1=0,a1=0,7a2=0,a2=0,a3=0, which are only satisfied when a1,a2,a3=0 showing LI.

b

A valid basis for R5 using our previous basis would be:

(3,1,0,0,0),(0,1,0,0,0),(0,0,7,1,0),(0,0,0,1,0),(0,0,0,0,1)

where v1 is the first vector, v2 is the second vector, and so on. First, we show that some x∈R5 is spanned by these vectors. Then x=(x1,x2,x3,x4,x5). Notice though that:

x=(x1,x2,x3,x4,x5)=13x1v1+(x2−x13)v2+17x3v3+(x4−x37)v4+x5v5

is a linear combination of vectors from our basis to compose x, so it definitely spans it.

For LI, consider:

a1v1+a2v2+⋯+a5v5=(0,0,0,0,0)

Then notice that 3a1=0,a1+a2=0,7a3=0,a3+a4=0,a5=0. Notice then that a1,a3,a5=0, so then 0+a2=0⇒a2=0 and similarly a4=0. Thus, the list is LI. This is a valid basis for R5.

c

Let W=span(v2,v4) from the previous problem, so it's the vectors spanned by v2=(0,1,0,0,0) and v4=(0,0,0,1,0).

First, notice that U+W are the vectors spanned by span(v1,...,v5) which we saw in the (b) that that spanned all of R5 as it's a basis. So R5=U+W.

Now, to show it's a direct sum, we'll show that U∩W={0→}. Let x∈U∩W be arbitrary. Then both x∈U and x∈W. Thus, x is represented as some:

x=(3x2,x2,7x4,x4,x5)=x2v1+x4v3+x5v5

Furthermore, we know that x can be represented as some:

x=(0,x1,0,x3,0)=x1v2+x3v4

But equating terms says that:

3x2=0,x2=x1,7x4=0,x4=x3,x5=0

Solving shows that all xi=0, so in reality then x=0→ all along, completing the proof.

#5

Theorem

There exists some basis p0,p1,p2,p3∈P3(F) such that none of the polynomials have degree 2.

\begin{proof}
Consider p0=1, p1=x, p2=x3+x2, p3=−x3. Notice that none of these have a degree of 2.

To show they're LI, notice that if we consider:

a0p0+⋯+a3p3=0+0x+⋯+0x3

clearly a0,a1=0. We also notice that a2−a3=0⇒a2=a3, and a2=0 equating the x2 terms, so then a3=0 in suit. Thus, this list is LI.

Now for span. Let p=a+bx+cx2+dx3 be arbitrary. Then notice that:

p=ap0+bp1+cp2+(c−d)p3

so p is in the span of our new list. Thus the new list is a basis of P3(F) while not having any polynomials of degree 2.
\end{proof}

#6

Theorem

Suppose v1,...,v4 is a basis of V. Then:

v1+v2,v2+v3,v3+v4,v4

is also a basis of V.

\begin{proof}
Suppose v1,...,v4 is a basis of V. First, we show that the new list is LI.

Consider what constants make:

a1(v1+v2)+a2(v2+v3)+a3(v3+v4)+a4v4=0→

true. But notice that we can reorder them to make:

(a1v1+a2v2+a3v3+a4v4)+(a1v2+a2v3+a3v4)=0→

and then further rewritten into:

a1v1+(a2+a1)v2+(a3+a2)v3+(a4+a3)v4=0→

where since v1,...,v4 is LI (being a basis), then it follows that all our a1=0,a2+a1=0⇒a2=0,....,a4=0, making this new list also LI.

Now for span. Let x∈V be arbitrary. Since v1,...,v4 is a basis, x∈span(v1,...,v4), so then:

x=b1v1+b2v2+b3v3+b4v4

But notice we can rewrite this to see that:

x=b1(v1+v2)+(b2−b1)(v2+v3)+(b3−b2+b1)(v3+v4)+(b4−b3+b2−b1)v4

So clearly x is in the span of the new list.
\end{proof}

#7

Proposition

If v1,...,v4 is a basis of V and U is a subspace of V such that v1,v2∈U but v3,v4∉U then v1,v2 is a basis of U.

This is false by the following counterexample. Say V=R4, where v1=(1,0,0,0),v2=(0,1,0,0),v3=(0,0,1,1),v4=(0,0,0,1). Then let U={((a,b,c,0):a,b,c∈R}. Then clearly v1,v2∈U and v3,v4∉U but v1,v2 isn't a basis for U.

#8

Theorem

Suppose U,W are subspaces of V, where V=U⊕W. Suppose that u1,...,um is a basis of U and w1,...,wn is a basis of W. Then:

u1,...,um,w1,...,wn

is a basis of V.

\begin{proof}
We need to show that u1,...,um,w1,...,wn is both LI and spans V.

First, span. Notice by definition that:

V=U⊕W={∑ui+∑wi:ui∈U,wi∈W}

so given any v∈V, then there's some representation via:

v=a1u1+⋯+amum+am+1w1+⋯+am+nwn

so clearly v is in the span of the new list.

Now for LI. Consider when we have:

a1u1+⋯+amum+am+1w1+⋯+am+nwn=0→

Notice that we can group elements together:

(a1u1+⋯+amum)+(am+1w1+⋯+am+nwn)=0→

Let u=a1u1+⋯+amum and likewise w=am+1w1+⋯+am+nwn. Then:

u+w=0→

But that implies that u=−w, so then U+W wouldn't be a direct sum as any element u∈U would be in V as well (it is a subspace after all), and thus since V=U⊕W then there would be two representations of u∈V (u and −w), violating the direct sum rules.

As such, then we must have it that u=w=0→ as only zero-vectors are allowed to follow that while still adhering to the direct sum rules. Hence, since u1,...,um and w1,...,wn are bases, then all ai=0 from before, showing LI.
\end{proof}

2.C

#1

Theorem

Suppose V is finite-dimensional and U is a subspace of V such that dim(U)=dim(V). Then U=V.

\begin{proof}
We know dim(U)=dim(V)=m for some m∈N. Then there's some basis u1,...,um and a basis v1,...,vm. But since U is a subspace of V, then U⊆V, so then since each ui∈U then each ui∈V. as such, it's clear that u1,...,um is a basis for V as well. As such, then the span of u1,...,um equates to the span of v1,...,vm, and since span(u1,...,um)=U then U=V.
\end{proof}

#4

a

Let U={p=P4(F):p(6)=0}. A possible basis for U is:

{x−6,x2−6x,x3−6x2,x4−6x3}

First, we can show that this list is a valid basis for U.

First for LI. Consider:

a1(x−6)+a2(x2−6x)+a3(x3−6x2)+a4(x4−6x3)=0→

Distributing and equating coefficients shows that:

−6a1=0,a1−6a2=0,a2−6a3=0,a3−6a4=0

solving the system gives that a1=0⇒a2=0⇒a3=0⇒a4=0 so the list is LI.

Now for span. Let p∈U be arbitrary, so it's of the form:

p(x)=(x−6)(a+bx+cx2+dx3)=−6a+(a−6b)x+(b−6c)x2+(c−6d)x3

which can be rewritten into:

p(x)=a(x−6)+b(x2−6x)+c(x3−6x2)+d(x4−6x3)

thus clearly our vectors span the space U as p was arbitrary.

b

We can extend the vector:

p′=1

to the list, giving:

{1,x−6,x2−6x,x3−6x2,x4−6x3}

We know that a basis for P4(F) needs 5 vectors as dim(P4(F))=5. As such, we can just show LI.

Consider:

a1(1)+a2(x−6)+a3(x2−6x)+a4(x3−6x2)+a5(x4−6x3)=0→

as such, we have:

a1−6a2=0,a2−6a3=0,...,a5=0

we thus know that a1=6a2,a2=6a3,a3=6a4,a4=6a5,a5=0, so then a4=0⇒a3=0⇒...a1=0 so all ai=0 as needed for LI.

Thus we have a valid basis for our vector space.

c

We can just choose the subspace that we added our vector, as, so then W=span(p′)={p∈P4(F):p=c,c∈F}, namely W is the set of all constant polynomials.

Notice that clearly dim(U)=4 and dim(W)=1. Furthermore, as we saw in (b) that U+W=P4(F) and are both subspaces of our vector space, so then:

dim(U+W)=dim(P4(F))=5=dim(U)+dim(W)−dim(U∩W)=5−dim(U∩W)

so then dim(U∩W) showing that U∩W={0→}, showing that U+W is a direct sum.

#8

a

Let U={p∈P4(R):∫−11p=0}. Notice that for some p∈P4(R) generically we have:

p=a+bx+cx2+dx3+ex4

so then:

∫−11p(x)dx=ax+b2x2+c3x3+d4x4+e5x5|−11=2a+23c+25e=0

so then we have it that 15a+5c+3e=0, so let's choose a simple basis that satisfies that. Notice that if we plug a=−13c−15e then we get:

p=(−13c−15e)+bx+cx2+dx3+ex4

we can rewrite our terms into:

p=b(x)+c(x2−13)+dx3+(x4−15)

Which are our vectors. For not having to deal with fractions, I'll use the following basis. Consider {x,3x2−1,x3,5x4−1}. We'll prove this is a basis for U.

For LI, consider when:

a1(x)+a2(3x2−1)+a3x3+a4(5x4−1)=0→

Equating coefficients gives that:

−a2−a4=0,a1=0,3a2=0,a3=0,5a4=0

Clearly for the RHS we have a1,...,a4=0, so then we have LI.

Now for span. Let p∈U be arbitrary. Then ∫−11p=0 and p∈P4(R). Doing the analysis before, we see that we have 15a+5c+3e=0. But notice that:

p=a+bx+cx2+dx3+ex4=(−13c−15e)+bx+cx2+dx3+ex4

So then:

p=b(x)+13c(3x2−1)+dx3+15e(5x4−1)

showing that p∈span of our vectors.

b

Extend the vector 1 to our basis.

We know we are looking for a set of 5 vectors as dim(P4(R))=5. Hence, we just show that our total basis is LI.

Consider {1,x,3x2−1,x3,5x4−1}:

a1(1)+a2(x)+a3(3x2−1)+a4x3+a5(5x4−1)=0→

Equating coefficients gives:

a1−a3−a5=0,a2=0,3a3=0,a4=0,5a5=0⇒ai=0

so it's LI, and thus a basis.

c

Let W=span({1}). We'll show that U⊕W=P4(R).

First, clearly P4(R)=U+W as if we take LC's from both then we get any vector from P4(R), as we'll show. Let p∈P4(R) be arbitrary:

p=a+bx+cx2+dx3+ex4

Then notice that:

p=(a+13c+15e)(1)⏟u∈U+b(x)+13c(3x2−1)+dx3+15e(5x4−1)⏟w∈W

Thus p∈U+W so then U+W=P4(R).

Now we can show a direct sum via U∩W={0→}. Notice that 0→∈U∩W, so let v∈U∩W be a non-zero vector (for contradiction).

Then v=b(x)+13c(3x2−1)+dx3+15e(5x4−1)=a(1), equating both definitions of v. But then that means that b,c,d,e=0 to equate the xn terms on both sides. As such, then a=−13c−15e=0, so then v=0→ which is a contradiction. Hence U∩W={0→} so then U⊕W=P4(R).

#11

Theorem

Suppose U,W are subspaces of R8 such that dim(U)=3 and dim(W)=5 and U+W=R8. Then R8=U⊕W.

\begin{proof}
Notice that:

dim(U+W)=dim(U)+dim(W)−dim(U∩W)⇒8=5+3−dim(U∩W)⇒dim(U∩W)=0

So then U∩W={0→}, and since U+W=R8 then U⊕W=R8.
\end{proof}

#12

Theorem

Suppose U,W are 5-dimensional subspaces of R9. Then U∩W≠{0→}.

\begin{proof}
We know that:

dim(U+W)=dim(U)+dim(W)−dim(U∩W)

So then since dim(R9)≥dim(U+W):

9≥5+5−dim(U∩W)⇒dim(U∩W)≥1

Thus there must be some non-zero vector v∈U∩W, so then U∩W≠{0→}.
\end{proof}

#14

Theorem

Suppose U1,...,Um are finite-dimensional subspaces of V. Then U1+⋯+Um is finite dimensional and:

dim(U1+⋯+Um)≤dim(U1)+⋯+dim(Um)

\begin{proof}
We prove this via induction. Let m∈N be arbitrary.

For the base case, consider when m=2. Then clearly dim(U1+U2)=dim(U1)+dim(U2)−dim(U1∩U2)≤dim(U1)+dim(U2) which satisfies the theorem in m=2.

For the inductive hypothesis, suppose the theorem holds for all m∈(1,...,k). Now consider the k+1 case. Notice that:

U1+⋯+Uk+Uk+1=(U1+⋯+Uk)+Uk+1

and since the left set is m∈k and the right set is m=1 then via the inductive hypothesis then their entire sum is finite-dimensional. Furthermore, we can use the same principle to say that:

dim((U1+⋯+Uk)+Uk+1)≤dim(U1+⋯+Uk)+dim(Uk+1)=dim(U1)+⋯+dim(Uk)+dim(Uk+1)

\end{proof}

#15

Theorem

Suppose V is finite-dimensional, with dim(V)=n≥1. Then there are 1-dimensional subspaces U1,...,Un of V such that V=U1⊕⋯⊕Un.

\begin{proof}
We know that V, being finite-dimensional, has a basis v1,...,vn. Choose each Ui=span(vi).

Notice that since v1,...,vn is a basis for V, then for any v∈V:

v=a1v1+⋯+anvn=u1+⋯+un

where each ui∈Ui. Thus then clearly v∈U1+⋯+Un, so since it was arbitrary then V=U1+⋯+Un.

Now we'll show it's a direct sum via U1∩⋯∩Un={0→}. Let v be in this set. Then v∈span(vi) for all i. So then we can represent v as some combination of those vectors:

v=a1v1+⋯+anvn

Move everything to one side:

v−a1v1+⋯+anvn

But since v∈V then there's also some combination of basis vectors to compose v:

(b1v1+⋯+bnvn)−(a1v1+⋯+anvn)=0→

and then:

(b1−a1)v1+⋯+(bn−an)vn=0→

but since V is a basis then all bi−ai=0⇒bi=ai, so then clearly v∈span(v1,...,vk), so then since v1,...,vk is a basis, then all ai=0, showing that v=0→. Thus, U1∩⋯∩Un={0→}, showing the direct sum.
\end{proof}

#16

Theorem

Suppose U1...,Um are finite-dimensional subspaces of V such that U1+⋯+Um is a direct sum. Then U1⊕⋯⊕Um is finite dimensional as:

dim(U1⊕⋯⊕Um)=dim(U1)+⋯+dim(Um)

\begin{proof}
Let's use induction similar to (14), of which this problem is very similar and already have the ≤ version:

Let m=2. Since we have a direct sum then U1∩U2={0→} so then dim(U1∩U2)=0, so then:

dim(U1⊕U2)=dim(U1+U2)=dim(U1)+dim(U2)−dim(U1∩U2)=dim(U1)+dim(U2)

Which satisfies the theorem.

Now for our inductive hypothesis. Let k∈(1,...,m) be arbitrary, and say that that the theorem holds for such a k.

Consider k+1. Notice that U1⊕Uk is a valid set and Uk+1 would also be a valid set, of size ≤k, whose overall parts are clearly a direct sum. Thus we can use our inductive hypothesis:

dim(U1⊕⋯⊕Uk+1)=dim((U1⊕⋯⊕Uk)⊕Uk+1)=(dim(U1)+⋯+dim(Uk))+dim(Uk+1)

which completes the proof.
\end{proof}