Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 4: Q9SE (page 191)

Let \(T:{\mathbb{R}^n} \to {\mathbb{R}^m}\) be a linear transformation.

a. What is the dimension of range of T if T is one-to-one mapping? Explain.

b. What is the dimension of the kernel of T (see section 4.2) if T maps \({\mathbb{R}^n}\) onto \({\mathbb{R}^m}\)? Explain.

Short Answer

Expert verified

a. The range of T is n.

b. The dimension of the kernel of T is \(n - m\).

Step by step solution

01

Find the dimension of Null A

As T is a one-to-one transformation, the columns of A are linearly independent. So,

\(\dim \,\;{\rm{Nul}}\,A = 0\).

02

Find the dimension of Column space A

Using the rank theorem,

\(\begin{aligned} \dim \left( {{\rm{col}}\,A} \right) + \dim \,{\rm{Nul}}\,A &= n\\\dim \left( {{\rm{col}}\,A} \right) + 0 &= n\\\dim \left( {{\rm{col}}\,A} \right) &= n\end{aligned}\).

The dimension of range of T is n.

03

Find the dimension of Null A for onto mapping

If T maps \({\mathbb{R}^n}\) to \({\mathbb{R}^m}\), then the columns of A span \({\mathbb{R}^m}\). By the rank theorem,

\(\begin{aligned} \dim \left( {{\rm{col}}\,A} \right) + \dim \,{\rm{Nul}}\,\,A &= n\\m + \dim \,{\rm{Nul}}\,\,A &= n\\\dim \,{\rm{Nul}}\,\,A &= n - m\end{aligned}\).

04

Find the dimension of Kernel of T

The kernel of T is a null space of A. So, the dimension of the kernel of T is \(n - m\) and \(n - m\) must be nonnegative, i.e., \(n \ge m\).

Since H is a subspace of V and B is also in V, B is a linearly independent set in V. So, B must also be a basis for V. Hence, Hand V are the same.

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.

Start your free trial

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

Consider the polynomials \({p_{\bf{1}}}\left( t \right) = {\bf{1}} + {t^{\bf{2}}},{p_{\bf{2}}}\left( t \right) = {\bf{1}} - {t^{\bf{2}}}\). Is \(\left\{ {{p_{\bf{1}}},{p_{\bf{2}}}} \right\}\) a linearly independent set in \({{\bf{P}}_{\bf{3}}}\)? Why or why not?

Suppose \({{\bf{p}}_{\bf{1}}}\), \({{\bf{p}}_{\bf{2}}}\), \({{\bf{p}}_{\bf{3}}}\), and \({{\bf{p}}_{\bf{4}}}\) are specific polynomials that span a two-dimensional subspace H of \({P_{\bf{5}}}\). Describe how one can find a basis for H by examining the four polynomials and making almost no computations.

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).

Question 11: Let \(S\) be a finite minimal spanning set of a vector space \(V\). That is, \(S\) has the property that if a vector is removed from \(S\), then the new set will no longer span \(V\). Prove that \(S\) must be a basis for \(V\).

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

20. \(A = \left( {\begin{array}{*{20}{c}}{.8}&{ - .3}&0\\{.2}&{.5}&1\\0&0&{ - .5}\end{array}} \right),B = \left( {\begin{array}{*{20}{c}}1\\1\\0\end{array}} \right)\).
See all solutions

Recommended explanations on Math Textbooks

Statistics

Read Explanation

Pure Maths

Read Explanation

Applied Mathematics

Read Explanation

Discrete Mathematics

Read Explanation

Calculus

Read Explanation

Logic and Functions

Read Explanation
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