Proofs for the exercises in Sheldon Axler’s Linear Algebra Done Right, 4th edition. All of the proofs are checked by Claude Opus 5.5.

Vector spaces

1C Subspaces

Exercise 1C.1(b)

Proof. Zero vector.

0+2∗0+3∗0≠4, thus 0 is not in the given set, hence it is not a subspace of 𝐅3.

Exercise 1C.1(c)

Needs revising

Proof. Additive identity.

0=(0,0,0). Substituting the corresponding coordinates 0∗0∗0=0; thus the given set includes the additive identity.

Closure under addition.

Let’s take 𝑢=(0,0,1) and 𝑣=(1,1,0) so that 𝑢+𝑣=(0+1,0+1,0+1)=(1,1,1). Since 𝑢,𝑣∈𝑉 but 𝑢+𝑣∉𝑉, it does not satisfy the closure under addition. Thus it is not a subspace of 𝐅3.

Exercise 1C.1(d)

Proof. Let 𝑆={(𝑥1,𝑥2,𝑥3)∈𝐅3:𝑥1=5𝑥3}. 0=(0,0,0), and 0=5⋅0, so the condition holds. Let 𝑢=(𝑢1,𝑢2,𝑢3) and 𝑣=(𝑣1,𝑣2,𝑣3). For 𝑢,𝑣∈𝑆, 𝑢1=5𝑢3 and 𝑣1=5𝑣3 hold; thus 𝑢=(5𝑢3,𝑢2,𝑢3) and 𝑣=(5𝑣3,𝑣2,𝑣3). 𝑢+𝑣=(5𝑢3+5𝑣3,𝑢2+𝑣2,𝑢3+𝑣3). 𝑆 is closed under addition, since 5𝑢3+5𝑣3=5(𝑢3+𝑣3). Let 𝜆∈𝐅. 𝜆𝑢=(𝜆5𝑢3,𝜆𝑢2,𝜆𝑢3). 𝑆 is closed under scalar multiplication, since 𝜆5𝑢3=5(𝜆𝑢3).

Exercise 1C.2(b)

Proof. Let 𝐶([0,1]) denote the set of continuous real-valued functions on the interval [0,1]. 𝐶([0,1]) has the zero function; addition and scalar multiplication yield continuous functions. Thus it is a subspace of 𝐑[0,1].

Exercise 1C.3

Proof. Let 𝐷={𝑓:(−4,4)→𝐑|𝑓is differentiable,𝑓′(−1)=3𝑓(2)}. 𝐷⊆𝐑(−4,4).

Additive identity: let 0 denote the zero function; it is differentiable, since 0′=0. It is also in the 𝐷, since 0′(−1)=3⋅0(2)=0.

Closed under addition. 𝐷≠∅, for at least the zero function is in it. Let 𝑓,𝑔∈𝐷. Let 𝑠(𝑥)=𝑓(𝑥)+𝑔(𝑥). 𝑠′(−1)=𝑓′(−1)+𝑔′(−1), since the derivative of the sums of two differentiable functions equal to the sum of their derivatives. 𝑓′(−1)+𝑔′(−1)=3𝑓(2)+3𝑔(2)=3(𝑓(2)+𝑔(2))=3𝑠(2); thus 𝑠∈𝐷.

Closed under scalar multiplication. Let 𝜆∈𝐑 and 𝑓∈𝐷. (𝜆𝑓)(𝑥)=𝜆𝑓(𝑥). Let 𝑚(𝑥)=𝜆𝑓(𝑥). Then 𝑚′(𝑥)=𝜆𝑓′(𝑥). 𝑚′(−1)=𝜆3𝑓(2)=3𝜆𝑓(2)=3𝑚(2); thus 𝑚∈𝐷.

Hence 𝐷 is a subspace of 𝐑(−4,4).

Exercise 1C.23

Needs revising

Proof. Let 𝑉=𝐅2. Take 𝑈={(𝑥,0)∈𝐅2:𝑥∈𝐅} (which is the x-axis), 𝑉1={(𝑥,𝑥)∈𝐅2:𝑥∈𝐅}, and 𝑉2={(0,𝑦)∈𝐅2:𝑦∈𝐅}, so 𝑉1∩𝑈={0} and 𝑉2∩𝑈={0}. Both 𝑉1⊕𝑈=𝑉2⊕𝑈=𝑉, however, 𝑉1≠𝑉2.

Finite-dimensional vector spaces

2A Span and linear independence

Exercise 2A.2

Proof. 𝑉=span(𝑣1,𝑣2,𝑣3,𝑣4)={𝑎1𝑣1+⋯+𝑎4𝑣4:𝑎1,…,𝑎4∈𝐅}.

𝑆=span(𝑣1−𝑣2,𝑣2−𝑣3,𝑣3−𝑣4,𝑣4)={𝑏1(𝑣1−𝑣2)+𝑏2(𝑣2−𝑣3)+𝑏3(𝑣3−𝑣4)+𝑏4𝑣4:𝑏1,𝑏2,𝑏3,𝑏4∈𝐅}={𝑏1𝑣1−𝑏1𝑣2+𝑏2𝑣2−𝑏2𝑣3+𝑏3𝑣3−𝑏3𝑣4+𝑏4𝑣4:𝑏1,𝑏2,𝑏3,𝑏4∈𝐅}={𝑏1𝑣1+𝑣2(𝑏2−𝑏1)+𝑣3(𝑏3−𝑏2)+𝑣4(𝑏4−𝑏3):𝑏1,𝑏2,𝑏3,𝑏4∈𝐅}

Let 𝑣∈𝑉. Then there exist 𝑣=𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑣4, where 𝑎1,𝑎2,𝑎3,𝑎4∈𝐅. Define 𝑏1=𝑎1, 𝑏2=𝑎1+𝑎2, 𝑏3=𝑎1+𝑎2+𝑎3, and 𝑏4=𝑎1+𝑎2+𝑎3+𝑎4. Then

𝑎1𝑣1+𝑣2((𝑎1+𝑎2)−𝑎1)+𝑣3((𝑎1+𝑎2+𝑎3)−(𝑎1+𝑎2))+𝑣4((𝑎1+𝑎2+𝑎3+𝑎4)−(𝑎1+𝑎2+𝑎3))=𝑣,

so 𝑣∈𝑆. Hence 𝑉⊆𝑆. Conversely, 𝑆⊆𝑉 because 𝑏1,𝑏2−𝑏1,𝑏3−𝑏2,𝑏4−𝑏3∈𝐅 and 𝑉 is closed under scalar multiplication and vector addition. Thus 𝑆=𝑉.

Exercise 2A.4(a)

Proof. Suppose (𝑣) is linearly independent, and suppose 𝑣=0. Then 1⋅𝑣=1⋅0=0. Taking 𝑎=1 gives a nonzero scalar with 𝑎𝑣=0, contradicting the linear independence of (𝑣). Therefore 𝑣≠0.

Conversely, suppose 𝑣≠0, and suppose 𝑎≠0. Then there exists 𝑎−1, such that 𝑎−1𝑎=1. Multiplying both sides of 𝑎𝑣=0 by 𝑎−1, 1𝑣=𝑣=0, hence contradicting 𝑣≠0. Therefore 𝑎=0 if 𝑎𝑣=0 and 𝑣≠0.

Thus (𝑣) is linearly independent if and only if the 𝑣≠0.

Exercise 2A.4(b)

Proof. Let (𝑢,𝑤).

Suppose there exists 𝜆∈𝐅, such that 𝑢=𝜆𝑤. Take 𝑎=1 and 𝑏=−𝜆. Then 𝑎𝑢+𝑏𝑤=1𝑢+(−𝜆)𝑤=𝜆𝑤+(−𝜆)𝑤=0𝑤=0. Since 𝑎=1≠0, (𝑢,𝑤) is dependent. Symmetrically, the same is for 𝑤=𝜆𝑢. Thus if either of the two vectors 𝑢, 𝑤 is a scalar multiple of the other, then (𝑢,𝑤) is dependent.

Suppose (𝑢,𝑤) is dependent. Then there exist 𝑎,𝑏∈𝐹, not both 0, such that 𝑎𝑢+𝑏𝑤=0. Suppose 𝑎≠0. Then there exist 𝑎−1. Multiplying both sides of 𝑎𝑢+𝑏𝑤=0 by 𝑎−1 gives us 𝑎−1(𝑎𝑢)+𝑎−1(𝑏𝑤)=(𝑎−1𝑎)𝑢+(𝑎−1𝑏)𝑤=1𝑢+(𝑎−1𝑏)𝑤=𝑢+(𝑎−1𝑏)𝑤=0; hence 𝑢=−((𝑎−1𝑏)𝑤)=(−𝑎−1𝑏)𝑤. Symmetrically, for 𝑏≠0, 𝑤=(−𝑏−1𝑎)𝑢.

Exercise 2A.6

Needs revising

Proof. Let 𝑣1=(2,3,1), 𝑣2=(1,−1,2), and 𝑣3=(7,3,𝑐).

Suppose the list is linearly dependent. Then there exist 𝑎1,𝑎2,𝑎3∈𝐅, not all 0, such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=0. Suppose 𝑎3=0. Then 𝑎1𝑣1+𝑎2𝑣2=(2𝑎1+𝑎2,3𝑎1−𝑎2,𝑎1−2𝑎2)=(0,0,0). Solving the linear system of equations: 𝑎1=𝑎2=0. 𝑎1=𝑎2=𝑎3=0, hence contradicting the linear dependence. Hence 𝑎3≠0. Solving the linear system of the first two equations in terms of 𝑎3 for 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=(2𝑎1+𝑎2+7𝑎3,3𝑎1−𝑎2+3𝑎3,𝑎1+2𝑎2+𝑐𝑎3)=(0,0,0), we have 𝑎1=−2𝑎3 and 𝑎2=−3𝑎3. Substituting both in the third equation, −2𝑎3−6𝑎3+𝑐𝑎3=−8𝑎3+𝑐𝑎3=(−8+𝑐)𝑎3=0. 𝑎3≠0, so there exists 𝑎3−1. Multiplying both sides of the equation: −8+𝑐=0. Hence 𝑐=8.

Suppose 𝑐=8. Take 𝑎1=2, 𝑎2=3, and 𝑎3=−1. Then 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=(2∗2+3−7,2∗3−3−3,2+6−8)=(0,0,0). Hence there exist 𝑎1,𝑎2,𝑎3, not all 0, such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=0. Therefore the list is linearly dependent.

Thus the list is linearly dependent if and only if 𝑐=8.

Exercise 2A.7(a)

Proof. Let 𝑎,𝑏∈𝐑. Then 𝑎(1+𝑖)+𝑏(1−𝑖)=(𝑎+𝑏)+(𝑎−𝑏)𝑖=0, where 𝑎+𝑏,𝑎−𝑏∈𝐑. Thus 𝑎+𝑏=0 and 𝑎−𝑏=0. Solving the linear system of equations, 𝑎=𝑏=0. Therefore the list 1+𝑖,1−𝑖 is linearly independent.

Exercise 2A.7(b)

Proof. Let 𝛼,𝛽∈𝐂. Take 𝛼=𝑖 and 𝛽=1. Then 𝑖(1+𝑖)+1(1−𝑖)=(−1+1)+(1−1)𝑖=0+0𝑖=0. Thus the list 1+𝑖,1−𝑖 is linearly dependent.

Exercise 2A.10

Needs revising

Proof. Suppose 𝑐1(𝜆𝑣1)+𝑐2(𝜆𝑣2)+⋯+𝑐𝑚(𝜆𝑣𝑚)=0 for some 𝑐1,𝑐2,…,𝑐𝑚∈𝐅. Then 𝜆(𝑐1𝑣1+𝑐2𝑣2+⋯+𝑐𝑚𝑣𝑚)=0. Since 𝜆≠0, multiplying both sides by 𝜆−1 gives 𝑐1𝑣1+𝑐2𝑣2+⋯𝑐𝑚𝑣𝑚=0. Because 𝑣1,𝑣2,…,𝑣𝑚 is linearly independent, 𝑐1=𝑐2=⋯=𝑐𝑚=0. Hence 𝜆𝑣1,𝜆𝑣2,…,𝜆𝑣𝑚 is linearly independent.

Exercise 2A.11

Proof. Take 𝑣1=(1,0), 𝑣2=(0,1), 𝑤1=(0,1), and 𝑤2=(1,0). Then 𝑣1+𝑤1,𝑣2+𝑤2=(1,1),(1,1). Suppose 𝑎1(𝑣1+𝑤1)+𝑎2(𝑣2+𝑤2)=0. Take 𝑎1=1 and 𝑎2=−1, so 1(1,1)+(−1)(1,1)=(0,0)=0. Thus 𝑣1+𝑤1,…,𝑣𝑚+𝑤𝑚 is not linearly independent.

Exercise 2A.13

Proof. Suppose 𝑣1,…,𝑣𝑚,𝑤 is linearly independent, and suppose for contradiction that 𝑤∈span(𝑣1,…,𝑣𝑚). Then 𝑤=𝑐1𝑣1+⋯+𝑐𝑚𝑣𝑚 for some 𝑐1,…,𝑐𝑚∈𝐅. Then 𝑐1𝑣1+⋯+𝑐𝑚𝑣𝑚−𝑤=0, contradicting the linear independence of 𝑣1,…,𝑣𝑚,𝑤.

Suppose 𝑤∉span(𝑣1,…,𝑣𝑚), and suppose for contradiction that 𝑣1,…,𝑣𝑚,𝑤 is linearly dependent. Then there exist 𝑎1,…,𝑎𝑚,𝑎𝑚+1∈𝐅, not all 0, such that 𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚+𝑎𝑚+1𝑤=0. Suppose 𝑎𝑚+1≠0. Multiplying both sides by 𝑎𝑚+1−1 gives 𝑎1𝑎𝑚+1𝑣1+⋯+𝑎𝑚𝑎𝑚+1𝑣𝑚+𝑤=0. Then 𝑤=−𝑎1𝑎𝑚+1𝑣1−⋯−𝑎𝑚𝑎𝑚+1𝑣𝑚, contradicting 𝑤∉span(𝑣1,…,𝑣𝑚). Suppose 𝑎𝑚+1=0. Then there exist 𝑎1,…,𝑎𝑚, not all 0, such that 𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚=0, thus contradicting the linear independence of 𝑣1,…,𝑣𝑚.

Therefore 𝑣1,…,𝑣𝑚,𝑤 is linearly independent ⟺ 𝑤∉span(𝑣1,…,𝑣𝑚).

2B Bases

Exercise 2B.3(a)

Proof. Take 𝑣1=(3,1,0,0,0), 𝑣2=(0,0,7,1,0), and 𝑣3=(0,0,0,0,1). 𝑣1∈𝑈, because 3=3∗1 and 0=7∗0; 𝑣2∈𝑈, because 0=3∗0 and 7=7∗1; 𝑣3∈𝑈, because 0=3∗0 and 0=7∗0. Suppose there exist 𝑎1,𝑎2,𝑎3∈𝐑 such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=(3𝑎1,𝑎1,7𝑎2,𝑎2,𝑎3)=0. The equation forces 𝑎1=𝑎2=𝑎3=0. Therefore the list 𝑣1,𝑣2,𝑣3 is linearly independent. Let 𝑢=(𝑥1,𝑥2,𝑥3,𝑥4,𝑥5)∈𝑈. Then 𝑥1=3𝑥2 and 𝑥3=7𝑥4, so 𝑢=(3𝑥2,𝑥2,7𝑥4,𝑥4,𝑥5). The linear combination of 𝑣1,𝑣2,𝑣3 is 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3. Take 𝑎1=𝑥2, 𝑎2=𝑥4, and 𝑎3=𝑥5. Then 𝑥2(3,1,0,0,0)+𝑥4(0,0,7,1,0)+𝑥5(0,0,0,0,1)=(3𝑥2,𝑥2,7𝑥4,𝑥4,𝑥5)=𝑢. Therefore 𝑣1,𝑣2,𝑣3 spans 𝑈. Thus 𝑣1,𝑣2,𝑣3 is a basis of 𝑈.

Exercise 2B.3(b)

Proof. 𝑈⊆𝐑5, so 𝑣1,𝑣2,𝑣3 is independent in 𝐑5. By 2.32 we can extend 𝑣1,𝑣2,𝑣3 to a basis of 𝐑5. Take 𝑤1=(1,0,0,0,0) and 𝑤2=(0,0,1,0,0) where 𝑤1,𝑤2∈𝐑5. Suppose there exist 𝑎1,𝑎2,𝑎3,𝑎4,𝑎5∈𝐑 such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑤1+𝑎5𝑤2=(3𝑎1+𝑎4,𝑎1,7𝑎2+𝑎5,𝑎2,𝑎3)=0. The equation forces 𝑎1=𝑎2=𝑎3=𝑎4=𝑎5=0. Therefore 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 is independent. Let 𝑢=(𝑎,𝑏,𝑐,𝑑,𝑒)∈𝐑5. Then

𝑏𝑣1+𝑑𝑣2+𝑒𝑣3+(𝑎−3𝑏)𝑤1+(𝑐−7𝑑)𝑤2=(3𝑏+(𝑎−3𝑏),𝑏,7𝑑+(𝑐−7𝑑),𝑑,𝑒)=(𝑎,𝑏,𝑐,𝑑,𝑒)=𝑢.

Therefore 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 spans 𝐑5. Thus 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 is a basis of 𝑅5.

Exercise 2B.3(c)

Needs revising

Proof. Let 𝑊=span(𝑤1,𝑤2)={(𝑥1,𝑥2,𝑥3,𝑥4,𝑥5)∈𝐑5:𝑥2=𝑥4=𝑥5=0}. Suppose 𝑢∈𝐑5. The list 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 spans 𝐑5, so there exist 𝑎1,𝑎2,𝑎3,𝑎4,𝑎5∈𝐑 such that 𝑢=𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑤1+𝑎5𝑤2. We have 𝑢=𝑣+𝑤, where 𝑣∈𝑈 and 𝑤∈𝑊. Thus 𝑢∈𝑈+𝑊, hence 𝐑5=𝑈+𝑊.

Suppose 𝑢∈𝑈∩𝑊. Then there exists 𝑢=𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=𝑎4𝑤1+𝑎5𝑤5. Thus 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3−𝑎4𝑤1−𝑎5𝑤5=0. Because 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 is linearly independent, 𝑎1=𝑎2=𝑎3=𝑎4=𝑎5=0. Thus 𝑢=0, hence 𝑈∩𝑊={0}.

Therefore 𝐑5=𝑈⊕𝑊.

Exercise 2B.4(a)

Proof. Let 𝑢=(𝑧1,𝑧2,𝑧3,𝑧4,𝑧5)∈𝑈. Then 6𝑧1=𝑧2 and 𝑧3+2𝑧4+3𝑧5=0, so 𝑢=(𝑧1,6𝑧1,−2𝑧4−3𝑧5,𝑧4,𝑧5). Splitting that vector into a sum, we have 𝑢=𝑧1(1,6,0,0,0)+𝑧4(0,0,−2,1,0)+𝑧5(0,0,−3,0,1).

Let 𝑣1=(1,6,0,0,0), 𝑣2=(0,0,−2,1,0), and 𝑣3=(0,0,−3,0,1).

𝑣1,𝑣2,𝑣3∈𝑈, because 6⋅1=6 and 0+2⋅0+3⋅0=0; 6⋅0=0 and −2+2⋅1+3⋅0=0; 6⋅0=0 and −3+2⋅0+3⋅1=0. Hence span(𝑣1,𝑣2,𝑣3)⊆𝑈. 𝑢 is a linear combination of 𝑣1,𝑣2,𝑣3, hence 𝑈⊆span(𝑣1,𝑣2,𝑣3). Thus span(𝑣1,𝑣2,𝑣3)=𝑈.

Suppose there exist 𝑎1,𝑎2,𝑎3∈𝐂 such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=0. Then 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=(𝑎1,6𝑎1,−2𝑎2−3𝑎3,𝑎2,𝑎3)=0. The first, fourth, and fifth coordinates give 𝑎1=0, 𝑎2=0, and 𝑎3=0. Hence 𝑎1=𝑎2=𝑎3=0, therefore 𝑣1,𝑣2,𝑣3 is linearly independent.

Exercise 2B.4(b)

Proof. Take 𝑤1=(0,1,0,0,0) and 𝑤2=(0,0,1,0,0) where 𝑤1,𝑤2∈𝐂5.

Suppose there exist 𝑎1,𝑎2,𝑎3,𝑎4,𝑎5∈𝐂 such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑤1+𝑎5𝑤2=(𝑎1,6𝑎1+𝑎4,−2𝑎2−3𝑎3+𝑎5,𝑎2,𝑎3)=0. The first, fourth, and fifth coordinates force 𝑎1=0, 𝑎2=0, and 𝑎3=0. Substituting corresponding values to other coordinates, 6⋅0+𝑎4=𝑎4=0, −2⋅0−3⋅0+𝑎5=𝑎5=0; hence 𝑎4=𝑎5=0. Therefore 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 is linearly independent.

𝑣1,𝑣2,𝑣3,𝑤1,𝑤2∈𝐂5, so span(𝑣1,𝑣2,𝑣3,𝑤1,𝑤2)⊆𝐂5, because span is a subspace, so it is closed under linear combination. Suppose 𝑢=(𝑢1,𝑢2,𝑢3,𝑢4,𝑢5)∈𝐂5. Take 𝑎1=𝑢1, 𝑎2=𝑢4, 𝑎3=𝑢5, 𝑎4=𝑢2−6𝑢1, and 𝑎5=𝑢3+2𝑢4+3𝑢5. Then

𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑤1+𝑎5𝑤2=(𝑎1,6𝑎1+𝑎4,−2𝑎2−3𝑎3+𝑎5,𝑎2,𝑎3)=(𝑢1,6𝑢1+(𝑢2−6𝑢1),−2𝑢4−3𝑢5+𝑢3+2𝑢4+3𝑢5,𝑢4,𝑢5)=(𝑢1,𝑢2,𝑢3,𝑢4,𝑢5)=𝑢.

So 𝐂5⊆span(𝑣1,𝑣2,𝑣3,𝑤1,𝑤2). Hence span(𝑣1,𝑣2,𝑣3,𝑤1,𝑤2)=𝐂5.

Exercise 2B.4(c)

Proof. Let 𝑊=span(𝑤1,𝑤2) and 𝑣∈𝐂5. The list (𝑣1,𝑣2,𝑣3,𝑤1,𝑤2) spans 𝐂5, so there exist 𝑎1,𝑎2,𝑎3,𝑎4,𝑎5∈𝐂 such that 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3+𝑎4𝑤1+𝑎5𝑤2=𝑣 where 𝑣1,𝑣2,𝑣3∈𝑈 and 𝑤1,𝑤2∈𝑊. 𝑣∈𝑈+𝑊, hence 𝐂5⊆𝑈+𝑊. Conversely, 𝑈 and 𝑊 are subspaces of 𝐂5, so 𝑈+𝑊⊆𝐂5.

Suppose 𝑣∈𝑈∩𝑊. Then there exist 𝑎1,𝑎2,𝑎3,𝑎4,𝑎5∈𝐂 such that 𝑣=𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3=𝑎4𝑤1+𝑎5𝑤2. Hence 𝑎1𝑣1+𝑎2𝑣2+𝑎3𝑣3−𝑎4𝑤1−𝑎5𝑤2=0. Since 𝑣1,𝑣2,𝑣3,𝑤1,𝑤2 is linearly independent, so 𝑎1=𝑎2=𝑎3=𝑎4=𝑎5=0. Hence 𝑣=0, thus 𝑈∩𝑊={0}.

Thus 𝑈⊕𝑊=𝐂5.

2C Dimension

Exercise 2C.1

Show that the subspaces of 𝐑2 are precisely {0}, all lines in 𝐑2 containing the origin, and 𝐑2.

Proof. {0} is a subspace of 𝐑2: 0∈{0}; 0+0=0∈{0}; 𝜆0=0∈{0} for every 𝜆∈𝐑. Let 𝐿 be a line in 𝐑2 containing the origin. Then 𝐿={𝑎𝑣:𝑎∈𝐑} for some nonzero 𝑣∈𝐑2. Then 𝐿 is a subspace of 𝐑2: take 𝑎=0, so 0𝑣=0∈𝐿; let 𝑎𝑣,𝑏𝑣∈𝐿, so 𝑎𝑣+𝑏𝑣=(𝑎+𝑏)𝑣∈𝐿 since 𝑎+𝑏∈𝐑; let 𝜆∈𝐑, so 𝜆(𝑎𝑣)=(𝜆𝑎)𝑣, where 𝜆𝑎∈𝐑, by the compatibility of scalar multiplication with field multiplication, hence closed under scalar multiplication. 𝐑2 is a subspace of itself, as expected.

Let 𝑈 be a subspace of 𝐑2.

Case 1. If 𝑈={0}, done.

Case 2. Suppose 𝑈≠{0}. 𝑈 contains some nonzero 𝑣, and so it contains the line {𝑎𝑣:𝑎∈𝐑}. Case 2.1. 𝑈 is exactly that line, done. Case 2.2. Otherwise, 𝑈 contains some nonzero 𝑤 that is not a multiple of 𝑣, i.e., 𝑤≠𝜆𝑣 for all 𝜆∈𝐑 (and vice versa).

Since 𝑈 is a subspace of 𝐑2: for any 𝑎,𝑏∈𝐑, 𝑎𝑣,𝑏𝑤∈𝑈 by closure under scalar multiplication; 𝑎𝑣+𝑏𝑤∈𝑈 by closure under vector addition. Let’s define 𝑊={𝑎𝑣+𝑏𝑤:𝑎,𝑏∈𝐑}, so 𝑊⊆𝑈.

Let’s define 𝐷=𝑣1𝑤2−𝑣2𝑤1. Suppose 𝐷=0. Then 𝑣1𝑤2=𝑣2𝑤1. Suppose 𝑣1≠0, so 𝑤2=𝑤1𝑣1𝑣2. Take 𝜆=𝑤1𝑣1. Then both 𝜆𝑣1=𝑤1 and 𝜆𝑣2=𝑤2 hold. Hence 𝜆𝑣=𝑤, contradicting the assumption that 𝑤 is not a multiple of 𝑣. Suppose 𝑣1=0. Then 𝑣2≠0, because 𝑣 is a nonzero vector, so 𝑤1=𝑤2𝑣2𝑣1. Take 𝜆=𝑤2𝑣2. Then both 𝜆𝑣2=𝑤2 and 𝜆𝑣1=𝑤1 hold. Hence 𝜆𝑣=𝑤, contradicting the assumption that 𝑤 is not a multiple of 𝑣. Thus 𝐷≠0.

Let (𝑥,𝑦)∈𝐑2. Then we have a linear system of equations comprising 𝑥=𝑎𝑣1+𝑏𝑤1 and 𝑦=𝑎𝑣2+𝑏𝑤2. Solving the system we have 𝑎=𝑥𝑤2−𝑦𝑤1𝑣1𝑤2−𝑣2𝑤1 and 𝑏=𝑦𝑣1−𝑥𝑣2𝑣1𝑤2−𝑣2𝑤1. 𝑣1𝑤2−𝑣2𝑤1≠0 (𝐷≠0), so there exist 𝑎,𝑏 such that (𝑥,𝑦)=𝑎𝑣+𝑏𝑤. So (𝑥,𝑦)∈𝑊 and (𝑥,𝑦) was arbitrary, hence 𝐑2⊆𝑊, and because 𝑊⊆𝑈, so 𝐑2⊆𝑈. 𝑈⊆𝐑2, since 𝑈 is a subset of 𝐑2, and 𝐑2⊆𝑈, thus 𝑈=𝐑2.

Exercise 2C.2

Show that the subspaces of 𝐑3 are precisely {0}, all lines in 𝐑3 containing the origin, all planes in 𝐑3 containing the origin, and 𝐑3.

Proof. {0} is a subspace of 𝐑3: 0∈{0}; 0+0∈{0}; let 𝜆∈𝐑, so 𝜆0∈{0}.

We define a line in 𝐑3 containing the origin as 𝐿={𝑎𝑣:𝑎∈𝐑} for some nonzero 𝑣∈𝐑3. Then 𝐿 is a subspace of 𝐑3: take 𝑎=0, so 0𝑣=0∈𝐿; let 𝑎𝑣,𝑏𝑣∈𝐿, so 𝑎𝑣+𝑏𝑣=(𝑎+𝑏)𝑣∈𝐿 where 𝑎+𝑏∈𝐑; let 𝜆∈𝐑, so 𝜆(𝑎𝑣)=(𝜆𝑎)𝑣∈𝐿 where 𝜆𝑎∈𝐑.

We define a plane in 𝐑3 containing the origin as 𝑃={𝑎𝑣+𝑏𝑢:𝑎,𝑏∈𝐑} for some vectors 𝑣,𝑢∈𝐑3 where neither of them is a multiple of the other. Then 𝑃 is a subspace of 𝐑3: take 𝑎=𝑏=0, so 0𝑣+0𝑢=0∈𝑃; let 𝑎𝑣+𝑏𝑢∈𝑃 and 𝑐𝑣+𝑑𝑢∈𝑃, so (𝑎𝑣+𝑏𝑢)+(𝑐𝑣+𝑑𝑢)=(𝑎+𝑐)𝑣+(𝑏+𝑑)𝑢∈𝑃 where 𝑎+𝑐,𝑏+𝑑∈𝐑; let 𝜆∈𝐑, so 𝜆(𝑎𝑣+𝑏𝑢)=𝜆(𝑎𝑣)+𝜆(𝑏𝑢)=(𝜆𝑎)𝑣+(𝜆𝑏)𝑢∈𝑃 where 𝜆𝑎,𝜆𝑏∈𝐑.

𝐑3 is a subspace of 𝐑3: 0∈𝐑3; let 𝑢,𝑣∈𝐑3, so 𝑢+𝑣∈𝐑3; let 𝜆∈𝐑 and 𝑢∈𝐑3, so 𝜆𝑢∈𝐑3.

Let 𝑈 be a subspace of 𝐑3. A subspace of a finite-dimensional 𝐑3 is finite-dimensional with dim𝑈≤dim𝐑3, hence dim𝑈∈{0,1,2,3}.

Case 1. Suppose dim𝑈=0. Then by definition 𝑈 has a basis of length 0, hence span()=𝑈. By definition of a span of an empty list, 𝑈={0}.

Case 2. Suppose dim𝑈=1. Then by definition 𝑈 has a basis of length 1, hence span(𝑣)=𝑈 where (𝑣) is linearly independent, so 𝑣 is some nonzero vector (otherwise it is linearly dependent). By definition of a span, 𝑈={𝑎𝑣:𝑎∈𝐑}, i.e., a line containing the origin.

Case 3. Suppose dim𝑈=2. Then by definition 𝑈 has a basis of length 2, hence span(𝑣,𝑢)=𝑈 where (𝑣,𝑢) is linearly independent. Suppose 𝑣=𝜆𝑢 for some 𝜆∈𝐑. Then 𝑣−𝜆𝑢=0, contradicting the linear independence of (𝑣,𝑢) (coefficient of 𝑣 is 1). Symmetrically, suppose 𝑢=𝜆𝑣. Then 𝑢−𝜆𝑣=−𝜆𝑣+𝑢=0, again, contradicting the linear independence of (𝑣,𝑢) (coefficient of 𝑢 is 1). So 𝑣,𝑢 are vectors where neither is a multiple of the other. Then by definition of a span, 𝑈={𝑎𝑣+𝑏𝑢:𝑎,𝑏∈𝐑}, i.e., a plane containing the origin.

Case 4. Suppose dim𝑈=3. dim𝐑3=3. We have dim𝑈=dim𝐑3=3, so by 2.39 (subspace of full dimension equals the whole space) 𝑈=𝐑3.

Exercise 2C.3

(a) Let 𝑈={𝑝∈𝑃4(𝐅):𝑝(6)=0}. Find a basis of 𝑈.
(b) Extend the basis in (a) to a basis of 𝑃4(𝐅).
(c) Find a subspace 𝑊 of 𝑃4(𝐅) such that 𝑃4(𝐅)=𝑈⊕𝑊.

Proof. (a) dim𝑈≤dim𝒫︀4(𝐅) because 𝒫︀4(𝐅) is finite-dimensional and 𝑈 is a subspace of 𝒫︀4(𝐅) (by 2.37). Take 𝑝(𝑥)=𝑥4 such that 𝑝∈𝒫︀4(𝐅). Then 𝑝∉𝑈 since 𝑝(6)=64=1296≠0. So dim𝑈≠dim𝒫︀4(𝐅)=5, because dim𝑈=5 implies 𝑈=𝒫︀4(𝐅) (by 2.39) which is not the case. Take polynomials 𝑥−6, (𝑥−6)2, (𝑥−6)3, and (𝑥−6)4 where each one is in 𝑈 (6−6=0; (6−6)2=0; (6−6)3=0; (6−6)4=0). Suppose 𝑎,𝑏,𝑐,𝑑∈𝐅 and 𝑎(𝑥−6)+𝑏(𝑥−6)2+𝑐(𝑥−6)3+𝑑(𝑥−6)4=0 We can see that the left side has a 𝑑𝑥4 term. Because the right side has no 𝑥4 term, this implies that 𝑑=0. Because 𝑑=0, we see that the left side has a 𝑐𝑥3 term, which implies that 𝑐=0. Because 𝑐=𝑑=0, we can conclude that 𝑏=0. Because 𝑏=𝑐=𝑑=0, we can also conclude that 𝑎=0. Hence the list 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4 is a linearly independent list in 𝑈. Thus 4≤dim𝑈<5, so dim𝑈=4.

Thus the linearly independent list 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4 has length dim𝑈=4, hence is a basis of 𝑈 (by 2.38).

Proof. (b) Extending the list by 𝑥∈𝒫︀4(𝐅), we have 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4,𝑥. Suppose 𝑎,𝑏,𝑐,𝑑,𝑒∈𝐅 and 𝑎(𝑥−6)+𝑏(𝑥−6)2+𝑐(𝑥−6)3+𝑑(𝑥−6)4+𝑒𝑥=0. We can see that the left side has a 𝑑𝑥4 term. Because the right side has no 𝑥4 term, this implies that 𝑑=0. Because 𝑑=0, we see that the left side has a 𝑐𝑥3 term, which implies that 𝑐=0. Because 𝑐=𝑑=0, we can conclude that 𝑏=0. Because 𝑏=𝑐=𝑑=0 and 6𝑎=0, we can conclude that 𝑎=0. Finally, because 𝑎=𝑏=𝑐=𝑑=0, we can conclude that 𝑒=0. Hence the list 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4,𝑥 is a linearly independent list in 𝒫︀4(𝐅). Since length of 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4,𝑥 is 5, so it equals dim𝒫︀4(𝐅), hence a basis of 𝒫︀4(𝐅) (by 2.38).

Proof. (c) Suppose 𝑊 is a subspace of 𝒫︀4(𝐅) such that 𝑈∩𝑊={0}. Then dim(𝑈∩𝑊)=0. Since dim(𝑈+𝑊)=dim𝑈+dim𝑊−dim(𝑈∩𝑊) (by 2.43), we can conclude that dim𝑊=1, because dim(𝑈∩𝑊)=0, dim𝑈=4 (from (a)), and dim(𝑈+𝑊)=dim𝒫︀4(𝐅)=5.

Let 𝑊=span(𝑥)={𝑎𝑥∈𝒫︀4(𝐅):𝑎∈𝐅}.

Suppose 𝑣∈𝑈∩𝑊. Since 𝑣∈𝑈 and 𝑥−6,…,(𝑥−6)4 is a basis of 𝑈, there exist 𝑎,𝑏,𝑐,𝑑∈𝐅 such that 𝑣=𝑎(𝑥−6)+𝑏(𝑥−6)2+𝑐(𝑥−6)3+𝑑(𝑥−6)4. Since 𝑣∈𝑊 and 𝑥 is a basis of 𝑊, there exists 𝑒∈𝐅 such that 𝑣=𝑒𝑥. Then 𝑎(𝑥−6)+𝑏(𝑥−6)2+𝑐(𝑥−6)3+𝑑(𝑥−6)4=𝑒𝑥, so 𝑎(𝑥−6)+𝑏(𝑥−6)2+𝑐(𝑥−6)3+𝑑(𝑥−6)4−𝑒𝑥=0. Since 𝑥−6,(𝑥−6)2,(𝑥−6)3,(𝑥−6)4,𝑥 is linearly independent, 𝑎=𝑏=𝑐=𝑑=𝑒=0. Hence 𝑣=0, thus 𝑈∩𝑊⊆{0}. {0}⊆𝑈∩𝑊, because 0 is in every subspace. Therefore 𝑈∩𝑊={0}.

dim(𝑈+𝑊)=dim𝑈+dim𝑊−dim(𝑈∩𝑊)=4+1−0=5 (by 2.43). Since dim(𝑈+𝑊)=5=dim𝒫︀4(𝐅), we can conclude that 𝑈+𝑊=𝒫︀4(𝐅), because a subspace of full dimension equals the whole space (by 2.39).

Since 𝑈∩𝑊={0} and 𝑈+𝑊=𝒫︀4(𝐅), we have 𝑈⊕𝑊=𝒫︀4(𝐅).

Exercise 2C.13

Suppose 𝑈 and 𝑊 are both five-dimensional subspaces of 𝐑9. Prove that 𝑈∩𝑊≠{0}.

Proof. We are given dim𝑈=dim𝑊=5. Since 𝑈+𝑊 is a subspace of 𝐑9 (by 1.40), dim(𝑈+𝑊)≤dim𝐑9=9 (by 2.37). By 2.43,

dim(𝑈+𝑊)=dim𝑈+dim𝑊−dim(𝑈∩𝑊)=5+5−dim(𝑈∩𝑊)=10−dim(𝑈∩𝑊)

Suppose 𝑈∩𝑊={0}. Then dim(𝑈∩𝑊)=0 and so dim(𝑈+𝑊)=10, which contradicts dim(𝑈+𝑊)≤9. Therefore 𝑈∩𝑊≠{0}.

Exercise 2C.15

Suppose 𝑉 is finite-dimensional and 𝑉1,𝑉2,𝑉3 are subspaces of 𝑉 with dim𝑉1+dim𝑉2+dim𝑉3>2dim𝑉. Prove that 𝑉1∩𝑉2∩𝑉3≠{0}.

Proof. For any two subspaces 𝑈 and 𝑊 of 𝑉, the following holds by 2.43: dim(𝑈+𝑊)=dim𝑈+dim𝑊−dim(𝑈∩𝑊). Then dim(𝑈∩𝑊)=dim𝑈+dim𝑊−dim(𝑈+𝑊). A subspace of 𝑉 is not greater than 𝑉 (by 2.37), so dim(𝑈+𝑊)≤dim𝑉, where 𝑈+𝑊 is a subspace of 𝑉. So the following inequality holds: dim(𝑈∩𝑊)≥dim𝑈+dim𝑊−dim𝑉. Then dim(𝑉1∩𝑉2)≥dim𝑉1+dim𝑉2−dim𝑉 and so we have the following:

dim((𝑉1∩𝑉2)∩𝑉3)≥dim(𝑉1∩𝑉2)+dim𝑉3−dim𝑉≥dim𝑉1+dim𝑉2−dim𝑉+dim𝑉3−dim𝑉≥dim𝑉1+dim𝑉2+dim𝑉3−2dim𝑉

, where dim𝑉1+dim𝑉2+dim𝑉3>2dim𝑉. Hence dim(𝑉1∩𝑉2∩𝑉3)>2dim𝑉−2dim𝑉=0, thus dim(𝑉1∩𝑉2∩𝑉3)≠0. Therefore, 𝑉1∩𝑉2∩𝑉3≠{0}.

Linear maps

3A Vector space of linear maps

Exercise 3A.3

Needs revising

Suppose that 𝑇∈ℒ︀(𝐅𝑛,𝐅𝑚). Show that there exist scalars 𝐴𝑗,𝑘∈𝐅 for 𝑗=1,…,𝑚 and 𝑘=1,…,𝑛 such tha

𝑇(𝑥1,…,𝑥𝑛)=(𝐴1,1𝑥1+⋯+𝐴1,𝑛𝑥𝑛,…,𝐴𝑚,1𝑥1+⋯+𝐴𝑚,𝑛𝑥𝑛)

for every (𝑥1,…,𝑥𝑛)∈𝐅𝑛.

Proof. Suppose that 𝑇∈ℒ︀(𝐅𝑛,𝐅𝑚). Let (𝑥1,…,𝑥𝑛)∈𝐅𝑛. We can rewrite (𝑥1,…,𝑥𝑛) as a linear combination using the standard basis of 𝐅𝑛. Let 𝑒1,…,𝑒𝑛 such vectors where 𝑒𝑘 has a 1 in k-th slot and 0 everywhere else. Then (𝑥1,…,𝑥𝑛)=𝑥1𝑒1+⋯+𝑥𝑛𝑒𝑛. By additivity and homogeneity of linear maps, 𝑇(𝑥1𝑒1+⋯+𝑥𝑛𝑒𝑛)=𝑇(𝑥1𝑒1)+⋯+𝑇(𝑥𝑛𝑒𝑛)=𝑥1𝑇(𝑒1)+⋯+𝑥𝑛𝑇(𝑒𝑛). Because 𝑇(𝑒𝑘)∈𝐅𝑚, it has 𝑚 coordinates where each is in 𝐅. Let’s denote each k-th m-dimensional vector’s j-th coordinate using 𝐴𝑗,𝑘. Then

𝑇(𝑥1𝑒1+⋯+𝑥𝑛𝑒𝑛)=𝑥1(𝐴1,1,𝐴2,1,…,𝐴𝑚,1)+⋯+𝑥𝑛(𝐴1,𝑛,…,𝐴𝑚,𝑛)=(𝑥1𝐴1,1+⋯+𝑥𝑛𝐴1,𝑛,…,𝑥1𝐴𝑚,1+⋯+𝑥𝑛𝐴𝑚,𝑛)=(𝐴1,1𝑥1+⋯+𝐴1,𝑛𝑥𝑛,…,𝐴𝑚,1𝑥1+⋯+𝐴𝑚,𝑛𝑥𝑛)

Thus there exist scalars 𝐴𝑗,𝑘∈𝐅 for 𝑗=1,…,𝑚 and 𝑘=1,…,𝑛 such that

𝑇(𝑥1,…,𝑥𝑛)=(𝐴1,1𝑥1+⋯+𝐴1,𝑛𝑥𝑛,…,𝐴𝑚,1𝑥1+⋯+𝐴𝑚,𝑛𝑥𝑛).

Since (𝑥1,…,𝑥𝑛) was arbitrary, it is true for every (𝑥1,…,𝑥𝑛)∈𝐅𝑛.

Exercise 3A.7

Show that every linear map from a one-dimensional vector space to itself is multiplication by some scalar. More precisely, prove that if dim𝑉=1 and 𝑇∈ℒ︀(𝑉), then there exist 𝜆∈𝐅 such that 𝑇𝑣=𝜆𝑣 for all 𝑣∈𝑉.

Proof. Suppose dim𝑉=1 and 𝑇∈ℒ︀(𝑉). Since dim𝑉=1, 𝑉≠{0}, so there exists a nonzero 𝑢∈𝑉. The list (𝑢) is linearly independent, because 𝑢≠0; every linearly independent list of length dim𝑉 is a basis of 𝑉; hence (𝑢) of length 1 is a basis of 𝑉. Because every vector in 𝑉 can be written as a linear combination of a basis and 𝑇(𝑢)∈𝑉, there exists 𝜆∈𝐅 such that 𝑇(𝑢)=𝜆𝑢. Suppose 𝑣∈𝑉. Then there exist 𝛼∈𝐅 such that 𝑣=𝛼𝑢. By homogeneity, 𝑇(𝑣)=𝑇(𝛼𝑢)=𝛼𝑇(𝑢). Then 𝑇(𝑣)=𝛼(𝜆𝑢)=(𝛼𝜆)𝑢=(𝜆𝛼)𝑢=𝜆(𝛼𝑢)=𝜆𝑣 by compatibility of field multiplication with scalar multiplication and commutativity in 𝐅.

Exercise 3A.11

Suppose 𝑉 is finite-dimensional and 𝑇∈ℒ︀(𝑉). Prove that 𝑇 is a scalar multiple of the identity if and only if 𝑆𝑇=𝑇𝑆 for every 𝑆∈ℒ︀(𝑉).

Proof. (∃𝜆∈𝐅,𝑇=𝜆𝐼)⟺(∀𝑆∈ℒ︀(𝑉),𝑆𝑇=𝑇𝑆).

Suppose there exists 𝜆∈𝐅 such that 𝑇=𝜆𝐼. Let 𝑆∈ℒ︀(𝑉) and 𝑣∈𝑉. Then

(𝑆𝑇)(𝑣)=(𝑆(𝜆𝐼))(𝑣)=𝑆((𝜆𝐼)(𝑣))=𝑆(𝜆𝐼(𝑣))=𝑆(𝜆𝑣)=𝜆(𝑆(𝑣))by homogeneity of S=𝜆(𝐼(𝑆(𝑣)))=(𝜆𝐼)(𝑆(𝑣))=((𝜆𝐼)𝑆)(𝑣)=(𝑇𝑆)(𝑣)

Since 𝑣 was arbitrary, 𝑆𝑇=𝑇𝑆; since 𝑆 was arbitrary, this holds for every 𝑆∈ℒ︀(𝑉).

Suppose 𝑆𝑇=𝑇𝑆 for every 𝑆∈ℒ︀(𝑉). If 𝑉={0}, then 𝑇=0=𝜆𝐼 for any scalar 𝜆. Otherwise, fix a nonzero 𝑣∈𝑉. We can extend the list 𝑣 to a basis of 𝑉; let 𝑢2,…,𝑢𝑛 be such vectors, so 𝑣,𝑢2,…,𝑢𝑛 is a basis of 𝑉. Define 𝑆(𝑐1𝑣+𝑐2𝑢2+⋯+𝑐𝑛𝑢𝑛)=𝑐1𝑣+𝑐2⋅0+⋯+𝑐𝑛⋅0. Linear map lemma ensures its linearity. Write 𝑇𝑣 in the basis: 𝑇𝑣=𝑎𝑣+𝑏2𝑢2+⋯+𝑏𝑛𝑢𝑛 for some scalars 𝑎,𝑏2,…,𝑏𝑛. Then (𝑆𝑇)(𝑣)=𝑆(𝑇𝑣)=𝑎𝑣. (𝑇𝑆)(𝑣)=𝑇(𝑆𝑣)=𝑇(𝑣), so 𝑇(𝑣)=𝑎𝑣. Since 𝑎 depends on 𝑣, let 𝜆𝑣=𝑎. Let 𝑤∈𝑉 be nonzero. Then there exists scalar 𝜆𝑤 such that 𝑇𝑤=𝜆𝑤𝑤. Since 𝑣 was an arbitrary nonzero vector, every nonzero 𝑢∈𝑉 satisfies 𝑇𝑢=𝜆𝑢𝑢 for some scalar 𝜆𝑢.

Suppose the list 𝑣,𝑤 is linearly independent. If 𝑣+𝑤=0, then 1⋅𝑣+1⋅𝑤=0, contradicting linear independence, so 𝑣+𝑤≠0. Since 𝑣+𝑤∈𝑉, there exists a scalar 𝜆𝑣+𝑤 such that 𝑇(𝑣+𝑤)=𝜆𝑣+𝑤(𝑣+𝑤). Hence, by additivity in linear maps, 𝜆𝑣𝑣+𝜆𝑤𝑤=𝜆𝑣+𝑤(𝑣+𝑤)=𝜆𝑣+𝑤𝑣+𝜆𝑣+𝑤𝑤, thus (𝜆𝑣+𝑤−𝜆𝑣)𝑣+(𝜆𝑣+𝑤−𝜆𝑤)𝑤=0. Then 𝜆𝑣+𝑤−𝜆𝑣=𝜆𝑣+𝑤−𝜆𝑤=0 by linear independence. Thus 𝜆𝑣+𝑤=𝜆𝑣=𝜆𝑤.

Suppose the list 𝑣,𝑤 is linearly dependent. Then there exist scalars 𝑎1,𝑎2, not all 0, such that 𝑎1𝑣+𝑎2𝑤=0. Suppose 𝑎1≠0. Then 𝑎1−1𝑎1𝑣+𝑎1−1𝑎2𝑤=𝑣+𝑎1−1𝑎2𝑤=0, so 𝑣=(−𝑎1−1𝑎2)𝑤, i.e., 𝑣 is a scalar multiple of 𝑤, so 𝑣=𝑎𝑤. Suppose 𝑎=0: then 𝑣=0𝑤=0, contradicting 𝑣≠0, so 𝑎≠0. Then 𝑇𝑣=𝑇(𝑎𝑤). Hence 𝑇𝑣=𝜆𝑣𝑣=𝜆𝑣𝑎𝑤 and 𝑇(𝑎𝑤)=𝑎𝑇𝑤=𝑎𝜆𝑤𝑤, so 𝜆𝑣𝑎𝑤=𝑎𝜆𝑤𝑤. Then (𝜆𝑣𝑎−𝑎𝜆𝑤)𝑤=0. Since 𝑤≠0, 𝑎(𝜆𝑣−𝜆𝑤)=0. Since 𝑎≠0, 𝜆𝑣−𝜆𝑤=0, so 𝜆𝑣=𝜆𝑤. Symmetrically, suppose 𝑎2≠0. Then 𝑤=𝑎𝑣 with 𝑎≠0. Then 𝑇𝑤=𝑇(𝑎𝑣), so 𝑇𝑤=𝜆𝑤𝑎𝑣 and 𝑇(𝑎𝑣)=𝑎𝜆𝑣𝑣. Hence 𝑎(𝜆𝑤−𝜆𝑣)𝑣=0 with 𝑎≠0 and 𝑣≠0, thus 𝜆𝑤−𝜆𝑣=0, so 𝜆𝑤=𝜆𝑣.

Choose a nonzero 𝑣0 and fix 𝜆=𝜆𝑣0. Then for any nonzero 𝑤∈𝑉, the previous cases give 𝜆=𝜆𝑣0=𝜆𝑤, so 𝑇𝑤=𝜆𝑤; 𝑇(0)=0=𝜆⋅0. Hence 𝑇𝑤=𝜆𝑤=(𝜆𝐼)𝑤 for every 𝑤∈𝑉, so 𝑇=𝜆𝐼.

Therefore, 𝑇 is a scalar multiple of the identity if and only if 𝑆𝑇=𝑇𝑆 for every 𝑆∈ℒ︀(𝑉).

Exercise 3A.13

Needs revising

Suppose 𝑉 is finite-dimensional. Prove that every linear map on a subspace of 𝑉 can be extended to a linear map on 𝑉. In other words, show that if 𝑈 is a subspace of 𝑉 and 𝑆∈ℒ︀(𝑈,𝑊), then there exists 𝑇∈ℒ︀(𝑉,𝑊) such that 𝑇𝑢=𝑆𝑢 for all 𝑢∈𝑈.

Proof. Let 𝑛=dim𝑉 and 𝑚=dim𝑈. Let 𝑢1,…,𝑢𝑚 be a basis 𝑈. Let 𝑤𝑖=𝑆𝑢𝑖 for each 𝑖∈{1,…,𝑚}.

We can extend the list 𝑢1,…,𝑢𝑚 to a basis of 𝑉. Let the list 𝑢1,…,𝑢𝑚,𝑥1,…,𝑥𝑛−𝑚 be such a basis.

Let 𝑤̂1,⋯,𝑤̂𝑛−𝑚∈𝑊 be arbitrary. By linear map lemma, there exists a linear map 𝑇:𝑉→𝑊 such that 𝑇(𝑢𝑘)=𝑤𝑘 for each 𝑘∈{1,…,𝑚} and 𝑇(𝑥𝑗)=𝑤̂𝑗 for each 𝑗∈{1,…,𝑛−𝑚}. By additivity and homogeneity,

𝑇(𝑐1𝑢1+⋯+𝑐𝑚𝑢𝑚+𝑐𝑚+1𝑥1+⋯+𝑐𝑛𝑥𝑛−𝑚)=𝑐1𝑤1+⋯+𝑐𝑚𝑤𝑚+𝑐𝑚+1⋅𝑤̂1+⋯+𝑐𝑛⋅𝑤̂𝑛−𝑚,

where 𝑐1,…,𝑐𝑛∈𝐅.

Let 𝑢∈𝑈 be arbitrary. Then there exists 𝑎1,…,𝑎𝑚∈𝐅 such that 𝑢=𝑎1𝑢1+⋯+𝑎𝑚𝑢𝑚. 𝑆𝑢=𝑎1𝑤1+⋯+𝑎𝑚𝑤𝑚 by additivity and homogeneity in 𝑆. We can rewrite 𝑢=𝑎1𝑢1+⋯+𝑎𝑚𝑢𝑚=𝑎1𝑢1+⋯+𝑎𝑚𝑢𝑚+0⋅𝑥1+⋯+0⋅𝑥𝑛−𝑚. Then 𝑇𝑢=𝑎1𝑤1+⋯+𝑎𝑚𝑤𝑚.

Hence 𝑆𝑢=𝑇𝑢. Since 𝑢 was arbitrary, 𝑆𝑢=𝑇𝑢 for all 𝑢∈𝑈.

Exercise 3A.15

Suppose 𝑣1,…,𝑣𝑚 is a linearly dependent list of vectors in 𝑉. Suppose also that 𝑊≠{0}. Prove that there exist 𝑤1,…,𝑤𝑚∈𝑊 such that no 𝑇∈ℒ︀(𝑉,𝑊) satisfies 𝑇𝑣𝑘=𝑤𝑘 for each 𝑘=1,…,𝑚.

Proof. Since 𝑣1,…,𝑣𝑚 is linearly dependent, there exist 𝑎1,…,𝑎𝑚∈𝐅, not all 0, such that 𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚=0. Fix 𝑗 with 𝑎𝑗≠0. Because 𝑊≠{0}, choose a nonzero 𝑤∈𝑊, and define 𝑤𝑗=𝑤 and 𝑤𝑘=0 for 𝑘≠𝑗.

Suppose there exists linear map 𝑇∈ℒ︀(𝑉,𝑊) that satisfies 𝑇𝑣𝑘=𝑤𝑘 for each 𝑘=1,…,𝑚. Then applying 𝑇 to both sides of the equation 𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚=0, we have 𝑇(𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚)=𝑇(0)=0. By linearity, 𝑇(𝑎1𝑣1+⋯+𝑎𝑚𝑣𝑚)=𝑎1𝑇𝑣1+⋯+𝑎𝑚𝑇𝑣𝑚=𝑎1𝑤1+⋯+𝑎𝑚𝑤𝑚=0. Then 𝑎𝑗𝑤𝑗=0. Since 𝑎𝑗≠0, multiplying by 1𝑎𝑗 gives 𝑤𝑗=𝑤=0, a contradiction. Therefore no such 𝑇 exists.

Exercise 3A.16

Suppose 𝑉 is finite-dimensional with dim𝑉>1. Prove that there exist 𝑆,𝑇∈ℒ︀(𝑉) such that 𝑆𝑇≠𝑇𝑆.

Proof. Define 𝑚=dim𝑉. Since 𝑚>1, 𝑉≠{0}. Let 𝑣1,…,𝑣𝑚 be a basis of 𝑉.

Choose 𝑢=𝑣1 and 𝑤=𝑣𝑚, where, by linear independence, both vectors are nonzero and 𝑢 is not multiple of 𝑤 (and vice versa). Hence 𝑢≠𝑤.

Take 𝑆∈ℒ︀(𝑉) such that 𝑆𝑣𝑘=𝑢 and 𝑇∈ℒ︀(𝑉) such that 𝑇𝑣𝑘=𝑤 for all 𝑘=1,…,𝑚. Suppose 𝑆𝑇=𝑇𝑆. 𝑆𝑇𝑣1=𝑆𝑤=𝑢 and 𝑇𝑆𝑣1=𝑇𝑢=𝑤, so 𝑢=𝑤, a contradiction. Hence 𝑆𝑇≠𝑇𝑆.