Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose a linear transformation \(T:{\mathbb{R}^n} \to {\mathbb{R}^n}\) has the property that \(T\left( {\mathop{\rm u}\nolimits} \right) = T\left( {\mathop{\rm v}\nolimits} \right)\) for some pair of distinct vectors u and v in \({\mathbb{R}^n}\). Can Tmap \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\)? Why or why not?

Short Answer

Expert verified

The linear transformation T cannot map \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\).

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

State the standard matrix of T

Let \(T:{\mathbb{R}^n} \to {\mathbb{R}^m}\) be a linear transformation, and Abe the standard matrix for T. Then, according to theorem 12,

  1. Tmaps \({\mathbb{R}^n}\) onto \({\mathbb{R}^m}\) if and only if the columns of Aspan \({\mathbb{R}^m}\);
  2. T is one-to-one if and only if the columns of Aare linearly independent.

Consider Ais the standard matrix of T.

T is not one-to-one mapping according to the hypothesis. Therefore, according to theorem 12, the standard matrix A of Thas linearly dependent columns.

02

Determine whether T   maps \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\)

The columns of A do not span \({\mathbb{R}^n}\) because Ais a square matrix. Therefore, the linear transformation T cannot map \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\).

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

2. Find the inverse of the matrix \(\left( {\begin{aligned}{*{20}{c}}{\bf{3}}&{\bf{2}}\\{\bf{7}}&{\bf{4}}\end{aligned}} \right)\).

Exercises 15 and 16 concern arbitrary matrices A, B, and Cfor which the indicated sums and products are defined. Mark each statement True or False. Justify each answer.

16. a. If A and B are \({\bf{3}} \times {\bf{3}}\) and \(B = \left( {\begin{aligned}{*{20}{c}}{{{\bf{b}}_1}}&{{{\bf{b}}_2}}&{{{\bf{b}}_3}}\end{aligned}} \right)\), then \(AB = \left( {A{{\bf{b}}_1} + A{{\bf{b}}_2} + A{{\bf{b}}_3}} \right)\).

b. The second row of ABis the second row of Amultiplied on the right by B.

c. \(\left( {AB} \right)C = \left( {AC} \right)B\)

d. \({\left( {AB} \right)^T} = {A^T}{B^T}\)

e. The transpose of a sum of matrices equals the sum of their transposes.

In exercises 11 and 12, mark each statement True or False. Justify each answer.

a. The definition of the matrix-vector product \(A{\bf{x}}\) is a special case of block multiplication.

b. If \({A_{\bf{1}}}\), \({A_{\bf{2}}}\), \({B_{\bf{1}}}\), and \({B_{\bf{2}}}\) are \(n \times n\) matrices, \[A = \left[ {\begin{array}{*{20}{c}}{{A_{\bf{1}}}}\\{{A_{\bf{2}}}}\end{array}} \right]\] and \(B = \left[ {\begin{array}{*{20}{c}}{{B_{\bf{1}}}}&{{B_{\bf{2}}}}\end{array}} \right]\), then the product \(BA\) is defined, but \(AB\) is not.

Solve the equation \(AB = BC\) for A, assuming that A, B, and C are square and Bis invertible.

Suppose \({A_{{\bf{11}}}}\) is an invertible matrix. Find matrices Xand Ysuch that the product below has the form indicated. Also,compute \({B_{{\bf{22}}}}\). [Hint:Compute the product on the left, and setit equal to the right side.]

\[\left[ {\begin{array}{*{20}{c}}I&{\bf{0}}&{\bf{0}}\\X&I&{\bf{0}}\\Y&{\bf{0}}&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}{{A_{{\bf{1}}1}}}&{{A_{{\bf{1}}2}}}\\{{A_{{\bf{2}}1}}}&{{A_{{\bf{2}}2}}}\\{{A_{{\bf{3}}1}}}&{{A_{{\bf{3}}2}}}\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}{{B_{11}}}&{{B_{12}}}\\{\bf{0}}&{{B_{22}}}\\{\bf{0}}&{{B_{32}}}\end{array}} \right]\]

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free