Section 7.4

Linear Transformations

[33/91%]
Show
LaTeX
Problem 7.4.1

Let EE and FF be vector spaces over a field KK, and let S:E→FS : E \to F be a linear map.

?
(1)

Show that if A⊂EA \subset E is a subspace of EE, then S(A)={S(x)∣x∈A}S(A) = \left\{ S(x) \mid x \in A\right\} is a subspace of FF.

(2)

Show that SS is injective if and only if for every x,y∈Ex, y \in E with x≠yx \neq y we have S(x)≠S(y)S(x) \neq S(y).

(3)

Assume that SS is injective. Show that the map S−1:S(E)→ES^{-1} : S(E) \to E is well defined and linear.

Problem 7.4.2

Let VV be a finite-dimensional vector space and T:V→VT : V \to V a linear transformation with kernel of dimension kk. Show that there is a basis α1,…,αn\alpha_{1}, \ldots , \alpha_{n} of VV such that Tαk+1,…,TαnT\alpha_{k+1}, \ldots , T\alpha_{n} is a basis for the range of TT.

?
Problem 7.4.3

Let VV and WW be finite-dimensional vector spaces over a field, and T:V→WT : V \to W a linear transformation. Let XX be a subspace of WW. Prove that

dim⁡T−1(X)≥dim⁡V−dim⁡W+dim⁡X. \dim T^{-1}(X) \geq \dim V-\dim W+\dim X.
?
Problem 7.4.4

Let VV be a finite-dimensional vector space, and let AA and BB be linear operators on VV. Prove that

dim⁡ker⁡(AB)≤dim⁡ker⁡A+dim⁡ker⁡B. \dim \ker (AB) \leq \dim \ker A+\dim \ker B.
?
Problem 7.4.5

Let AA and BB be linear transformations of a finite-dimensional vector space VV into a vector space WW over a field F\mathbf{F}, such that

?
(1)

Av=0Av = 0 implies Bv=0Bv = 0 for v∈Vv \in V, and

(2)

for every vv in VV, either Av≠0Av \neq 0 or Bv≠0Bv \neq 0, there exists a scalar α∈F\alpha \in \mathbf{F} (depending on vv) such that Bv=αAvBv = \alpha Av.

Prove that there exists α0∈F\alpha_{0} \in \mathbf{F} such that Bv=α0AvBv = \alpha_{0}Av for all vv in VV.

Problem 7.4.6

Let LL be a linear operator on a finite-dimensional vector space VV over a field F\mathbf{F}, and let W⊂VW \subset V be an LL-invariant subspace. Let LWL_{W} denote the restriction of LL to WW. Prove that the characteristic polynomial of LWL_{W} divides the characteristic polynomial of LL.

?
Problem 7.4.7

Let VV be a finite-dimensional vector space over a field, WW a subspace, and ff an endomorphism of VV such that f(V)⊂W⊂Vf(V) \subset W \subset V. Prove that the trace of ff equals the trace of f∣Wf|_{W}, the restriction of ff to WW.

?
Problem 7.4.8

Let VV be an nn-dimensional vector space over a field F\mathbf{F}, and let T:V→VT : V \to V be a linear transformation. Prove that TT has a nonzero invariant subspace of dimension, at most, kk if and only if the characteristic polynomial of TT has a factor of degree kk in F[t]\mathbf{F}[t].

?
Problem 7.4.9

Let TT be a linear transformation of Rn\mathbb {R}^{n} into itself, and suppose n>1n > 1. Prove that Rn\mathbb {R}^{n} has a TT-invariant subspace MM of dimension 22 (that is, TM⊂MTM \subset M).

?
Problem 7.4.10

Let VV be a finite-dimensional vector space over a field F\mathbf{F}, and let L:V→VL : V \to V be a linear transformation with characteristic polynomial χ(t)\chi (t). Suppose χ(t)=χ1(t)χ2(t)\chi (t) = \chi_{1}(t)\chi_{2}(t), where χ1(t)\chi_{1}(t) and χ2(t)\chi_{2}(t) are relatively prime elements of F[t]\mathbf{F}[t]. Let Vi={v∈V∣χi(L)(v)=0}V_{i} = \left\{ v \in V \mid \chi_{i}(L)(v) = 0\right\}, for i=1,2i = 1, 2. Show that VV is the direct sum of V1V_{1} and V2V_{2}.

?
Problem 7.4.11

Let TT be the linear transformation of Q3\mathbb {Q}^{3} into itself given by

T(x,y,z)=(y,z,x+y). T(x,y,z) = (y,z,x+y).

Show that if xx is any nonzero vector in Q3\mathbb {Q}^{3}, then xx, y=Txy = Tx, and z=Tyz = Ty are linearly independent, and, thus, form a basis of Q3\mathbb {Q}^{3}.

?
Problem 7.4.12

Let AA and BB be linear transformations of a finite-dimensional real vector space VV such that A2=AA^{2} = A and B2=BB^{2} = B. Suppose, in addition, that 11 is not an eigenvalue of ABAB. Prove that 11 is not an eigenvalue of A+BA+B.

?
Problem 7.4.13

Let VV be a finite-dimensional real vector space, B:V×V→RB : V \times V \to \mathbb {R} a nondegenerate bilinear form, and T:V→VT : V \to V a linear map. Define T∗T^{*} by B(Tv,w)=B(v,T∗w)B(Tv,w) = B(v,T^{*}w) for all v,w∈Vv, w \in V. Show that TT and T∗T^{*} have the same eigenvalues.

?
Problem 7.4.14

Let f1,…,fnf_{1}, \ldots , f_{n} be linear functionals on the finite dimensional real vector space Rm\mathbb {R}^{m}, and suppose that f=(f1,…,fn):Rm→Rnf = (f_{1}, \ldots , f_{n}) : \mathbb {R}^{m} \to \mathbb {R}^{n} has rank n−1n-1. Show that there is a nonzero point v∈Rmv \in \mathbb {R}^{m} satisfying: for all ii, either fi(v)=0f_{i}(v) = 0 or there is a j≠ij \neq i such that fi(v)f_{i}(v) and fj(v)f_{j}(v) have opposite (nonzero) signs.

?
Problem 7.4.15

Let SS be a finite subset of Rn\mathbb {R}^{n} containing 00 and let d(s,t)d(s,t) denote the usual Euclidean distance between points s,t∈Rns, t \in \mathbb {R}^{n}. Suppose φ:S→Rn\varphi : S \to \mathbb {R}^{n} satisfies d(φ(s),φ(t))=d(s,t)d(\varphi (s),\varphi (t)) = d(s,t) for all s,t∈Ss, t \in S and φ(0)=0\varphi (0) = 0. Prove that φ\varphi extends to a linear transformation of Rn\mathbb {R}^{n} into itself.

?
Problem 7.4.16

Let T:R2→R2T : \mathbb {R}^{2} \to \mathbb {R}^{2} be an isometry (that is, ∥T(x)−T(y)∥=∥x−y∥\left\| T(x)-T(y)\right\| = \left\| x-y\right\| for all x,y∈R2x, y \in \mathbb {R}^{2}). Prove that T(x)=T(0)+U(x)T(x) = T(0)+U(x), where UU is an orthogonal linear transformation.

?
Problem 7.4.17

Let VV be an nn-dimensional vector space of real-valued functions on a set XX. Prove that there exist points x1,…,xnx_{1}, \ldots , x_{n} in XX and functions f1,…,fnf_{1}, \ldots , f_{n} in VV such that det⁡((fi(xj)))≠0\operatorname {det}\left((f_{i}(x_{j}))\right) \neq 0.

?
Problem 7.4.18

Let XX be a set. Prove that for every finite-dimensional subspace VV of the vector space of continuous real valued functions on XX, there exists a basis f1,…,fnf_{1}, \ldots , f_{n} for VV and points x1,…,xnx_{1}, \ldots , x_{n} in XX such that fi(xj)=δijf_{i}(x_{j}) = \delta_{ij}.

?
Problem 7.4.19

Prove that for each positive integer nn there exist real numbers c−n,c−n+1,…,cn−1,cnc_{-n}, c_{-n+1}, \ldots , c_{n-1}, c_{n} such that

∫−11p(x) dx=∑k=−nnckp(k) \int _{-1}^{1} p(x)\, dx = \sum _{k=-n}^{n} c_{k}p(k)

for every real polynomial p(x)p(x) of degree, at most, 2n2n.

?
Problem 7.4.20

Let TT be a linear operator on a finite-dimensional real vector space VV. Suppose TT has nn distinct real eigenvalues λ1,…,λn\lambda_{1}, \ldots , \lambda_{n}, where n=dim⁡Vn = \dim V. Show that there is a basis of VV with respect to which the matrix of TT is upper-triangular.

?
Problem 7.4.21

Let F\mathbf{F} be a finite field. Let VV be a finite-dimensional vector space over F\mathbf{F}. Prove that if P:V→VP : V \to V is an invertible linear transformation, then there is an integer n≥1n \geq 1 such that Pn=IP^{n} = I, where II denotes the identity transformation.

?
Problem 7.4.22

Let AA be a real n×nn \times n matrix such that A3=0A^{3} = 0. Prove that I+AI+A is invertible, and give a formula for its inverse.

?
Problem 7.4.23

Let TT be a linear operator on a 33-dimensional real vector space VV.

?
(1)

Prove that there is a 11-dimensional subspace of VV that is invariant under TT.

(2)

Prove that there is a 22-dimensional subspace of VV that is invariant under TT.

Problem 7.4.24

Let AA be a real symmetric orthogonal n×nn \times n matrix. Describe AA geometrically if n=3n = 3.

?
Problem 7.4.25

Let RR and SS be rotations in R3\mathbb {R}^{3} about two axes through the origin. Show that the composition T=SRT = SR is a rotation.

?
Remark.
?

Recall that a rotation about the axis given by the unit vector uu is a linear map that fixes uu and rotates the plane perpendicular to uu through some angle θ\theta; a rotation is called nontrivial if it is not the identity.

Problem 7.4.26

Let e=(a,b,c)e = (a,b,c) be a unit vector in R3\mathbb {R}^{3}. Let TT be the linear transformation which reflects each vector across the line through the origin in the direction ee. Find the matrix, in terms of aa, bb, and cc, that represents TT with respect to the standard basis of R3\mathbb {R}^{3}.

?
Problem 7.4.27

Let TT be a linear transformation on R3\mathbb {R}^{3} whose matrix, with respect to the standard basis, is orthogonal and has determinant 11. Assume TT is not the identity transformation, but T(1,1,1)=(1,1,1)T(1,1,1) = (1,1,1). Given that the eigenvalues of TT are 1010, ii, −i-i, and that the minimal polynomial of TT has degree 33, calculate the matrix of TT with respect to the standard basis.

?
Problem 7.4.28

Let AA be a 3×33 \times 3 real orthogonal matrix with det⁡A=1\det A = 1. (Such a matrix represents a rotation of R3\mathbb {R}^{3}.) Prove that 11 is an eigenvalue of AA. (This shows that every rotation of R3\mathbb {R}^{3} has an axis; i.e., a line which is left fixed.)

?
Problem 7.4.29

Let PP be the vector space of all polynomials in one variable with real coefficients. Let E:P→PE : P \to P be the linear operator "differentiate and then multiply by xx," i.e., E(p)=xp′E(p) = xp'. Prove that EE is not invertible.

?
Problem 7.4.30

Let DD be the derivative operator on the vector space PP of all polynomials in one variable with real coefficients. Given a polynomial π(x)\pi (x), we obtain an operator π(D)\pi (D) on PP. Show that if π(x)\pi (x) is a nonconstant polynomial and aa is a root of π(x)\pi (x), then (x−a)k(x-a)^{k} divides π(x)\pi (x), where kk is minimal such that the operator π(D)\pi (D) annihilates all polynomials of degree, at most, kk.

?
Problem 7.4.31

Let DD denote the differentiation operator d/dxd/dx on the (real) vector space VV of all polynomials of degree, at most, 1010 in the variable xx.

?
(1)

Find the trace of DD.

(2)

Find all eigenvectors of DD.

(3)

Find all eigenvectors of eDe^{D} (the linear map I+D+12!D2+⋯+110!D10I+D+\frac{1}{2!}D^{2}+\cdots +\frac{1}{10!}D^{10}).

Problem 7.4.32

Let x0,x1,…,xnx_{0}, x_{1}, \ldots , x_{n} be distinct real numbers. Show that there exist real numbers a0,a1,…,ana_{0}, a_{1}, \ldots , a_{n} such that

∫01p(t) dt=∑j=0najp(xj) \int _{0}^{1} p(t)\, dt = \sum _{j=0}^{n} a_{j}p(x_{j})

for every polynomial p(t)p(t) of degree, at most, nn.

?
Problem 7.4.33

Let I1,…,InI_{1}, \ldots , I_{n} be disjoint closed nonempty subintervals of R\mathbb {R}.

?
(1)

Prove that if pp is a real polynomial of degree less than nn such that

∫Ijp(x) dx=0,j=1,…,n \int _{I_{j}} p(x)\, dx = 0, \qquad j = 1, \ldots , n

then p=0p = 0.

(2)

Prove that there is a nonzero real polynomial pp of degree nn that satisfies all the above equations.