Exercises 31 and 32 concern finite-dimensional vector spaces V and W and a linear transformation \(T:V \to W\).

Let H be a nonzero subspace of V, and suppose T is a one-to-one (linear) mapping ofV and W.Prove that \({\bf{dim}}T\left( H \right) = {\bf{dim}}H\). If T happens to be one-to-one mapping of V onto W, then \({\bf{dim}}V = {\bf{dim}}W\). Isomorphic finite-dimensional vector spaces have the same dimensions.

Short Answer

Expert verified

\(\dim T\left( H \right) = \dim H\)

Step by step solution

01

Write the transformation vector in subspace H

Let the set \(\left\{ {{{\bf{v}}_1},{{\bf{v}}_2},....{{\bf{v}}_p}} \right\}\) be a basis for H,i.e. \(\dim H = p\). For any \({\bf{v}}\) in the subspace H:

\(\begin{array}{c}{\bf{v}} = {c_1}{{\bf{v}}_1} + .... + {c_p}{{\bf{v}}_p}\\T\left( {\bf{v}} \right) = T\left( {{c_1}{{\bf{v}}_1} + .... + {c_p}{{\bf{v}}_p}} \right)\\ = {c_1}T\left( {{{\bf{v}}_1}} \right) + {c_2}T\left( {{{\bf{v}}_2}} \right) + ..... + {c_p}T\left( {{{\bf{v}}_p}} \right)\end{array}\)

02

Solve the equation for v by considering them linearly independent

Consider that the vectors are linearly independent:

\[\begin{array}{c}{c_1}T\left( {{{\bf{v}}_1}} \right) + {c_2}T\left( {{{\bf{v}}_2}} \right) + ..... + {c_p}T\left( {{{\bf{v}}_p}} \right) = 0\\T\left( {{c_1}{{\bf{v}}_1}} \right) + T\left( {{c_2}{{\bf{v}}_2}} \right) + .... + T\left( {{c_p}{{\bf{v}}_p}} \right) = 0\\T\left( {{c_1}{{\bf{v}}_1} + {c_2}{{\bf{v}}_2} + .... + {c_p}{{\bf{v}}_p}} \right) = 0\end{array}\]

03

Consider T as one-to-one

As \(T\left( 0 \right) = 0\) and T is one-to-one, so

\[{c_1}{{\bf{v}}_1} + {c_2}{{\bf{v}}_2} + .... + {c_p}{{\bf{v}}_p} = 0\]

Vectors \({{\bf{v}}_1}\), \({{\bf{v}}_2}\),…., \({{\bf{v}}_p}\) arelinearly independent, which is contrary to the assumed statement.

Therefore, \(\dim T\left( H \right) = \dim H\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

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

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

Suppose \(A\) is \(m \times n\)and \(b\) is in \({\mathbb{R}^m}\). What has to be true about the two numbers rank \(\left[ {A\,\,\,{\rm{b}}} \right]\) and \({\rm{rank}}\,A\) in order for the equation \(Ax = b\) to be consistent?

In Exercise 3, find the vector x determined by the given coordinate vector \({\left( x \right)_{\rm B}}\) and the given basis \({\rm B}\).

3. \({\rm B} = \left\{ {\left( {\begin{array}{*{20}{c}}{\bf{1}}\\{ - {\bf{4}}}\\{\bf{3}}\end{array}} \right),\left( {\begin{array}{*{20}{c}}{\bf{5}}\\{\bf{2}}\\{ - {\bf{2}}}\end{array}} \right),\left( {\begin{array}{*{20}{c}}{\bf{4}}\\{ - {\bf{7}}}\\{\bf{0}}\end{array}} \right)} \right\},{\left( x \right)_{\rm B}} = \left( {\begin{array}{*{20}{c}}{\bf{3}}\\{\bf{0}}\\{ - {\bf{1}}}\end{array}} \right)\)

The null space of a \({\bf{5}} \times {\bf{6}}\) matrix A is 4-dimensional, what is the dimension of the column space of A.

Question: Determine if the matrix pairs in Exercises 19-22 are controllable.

22. (M) \(A = \left( {\begin{array}{*{20}{c}}0&1&0&0\\0&0&1&0\\0&0&0&1\\{ - 1}&{ - 13}&{ - 12.2}&{ - 1.5}\end{array}} \right),B = \left( {\begin{array}{*{20}{c}}1\\0\\0\\{ - 1}\end{array}} \right)\).

Question: Exercises 12-17 develop properties of rank that are sometimes needed in applications. Assume the matrix \(A\) is \(m \times n\).

17. A submatrix of a matrix A is any matrix that results from deleting some (or no) rows and/or columns of A. It can be shown that A has rank \(r\) if and only if A contains an invertible \(r \times r\) submatrix and no longer square submatrix is invertible. Demonstrate part of this statement by explaining (a) why an \(m \times n\) matrix A of rank \(r\) has an \(m \times r\) submatrix \({A_1}\) of rank \(r\), and (b) why \({A_1}\) has an invertible \(r \times r\) submatrix \({A_2}\).

The concept of rank plays an important role in the design of engineering control systems, such as the space shuttle system mentioned in this chapter’s introductory example. A state-space model of a control system includes a difference equation of the form

\({{\mathop{\rm x}\nolimits} _{k + 1}} = A{{\mathop{\rm x}\nolimits} _k} + B{{\mathop{\rm u}\nolimits} _k}\)for \(k = 0,1,....\) (1)

Where \(A\) is \(n \times n\), \(B\) is \(n \times m\), \(\left\{ {{{\mathop{\rm x}\nolimits} _k}} \right\}\) is a sequence of “state vectors” in \({\mathbb{R}^n}\) that describe the state of the system at discrete times, and \(\left\{ {{{\mathop{\rm u}\nolimits} _k}} \right\}\) is a control, or input, sequence. The pair \(\left( {A,B} \right)\) is said to be controllable if

\({\mathop{\rm rank}\nolimits} \left( {\begin{array}{*{20}{c}}B&{AB}&{{A^2}B}& \cdots &{{A^{n - 1}}B}\end{array}} \right) = n\) (2)

The matrix that appears in (2) is called the controllability matrix for the system. If \(\left( {A,B} \right)\) is controllable, then the system can be controlled, or driven from the state 0 to any specified state \({\mathop{\rm v}\nolimits} \) (in \({\mathbb{R}^n}\)) in at most \(n\) steps, simply by choosing an appropriate control sequence in \({\mathbb{R}^m}\). This fact is illustrated in Exercise 18 for \(n = 4\) and \(m = 2\). For a further discussion of controllability, see this text’s website (Case study for Chapter 4).

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