• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Deutsch (DE)
Deutsch (UK)
Deutsch (US)

Americas

Europe

Answers without the blur. Sign up and see all textbooks for free! → Illustration

Q17E

Expert-verified
Linear Algebra and its Applications
Found in: Page 191
Linear Algebra and its Applications

Linear Algebra and its Applications

Book edition 5th
Author(s) David C. Lay, Steven R. Lay and Judi J. McDonald
Pages 483 pages
ISBN 978-03219822384

Answers without the blur.

Just sign up for free and you're in.

Register for Free I’ll do it later
Illustration

Short Answer

In Exercise 17, A is an \(m \times n\] matrix. Mark each statement True or False. Justify each answer.

17. a. The row space of A is the same as the column space of \({A^T}\].

b. If B is any echelon form of A, and if B has three nonzero rows, then the first three rows of A form a basis for Row A.

c. The dimensions of the row space and the column space of A are the same, even if A is not square.

d. The sum of the dimensions of the row space and the null space of A equals the number of rows in A.

e. On a computer, row operations can change the apparent rank of a matrix.

  1. The statement is true.
  2. The statement is false.
  3. The statement is true.
  4. The statement is false.
  5. The statement is true.
See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :
TABLE OF CONTENTS

Step 1: Use the fact of the transpose matrix 

(a)

Since the rows of A are identified with the columns of \({A^T}\], you can write \({\rm{Col }}{A^T}\] in place of Row A.

Hence, the given statement is true.

Step 2: Use the properties of a basis

(b)

Although the first three rows of B are linearly independent, it is wrong to conclude that the first three rows of A are linearly independent. The row operations may change the linear dependence relations among the rows of a matrix.

Hence, the given statement is false.

Step 3: Use the rank theorem

(c)

By the rank theorem, the dimensions of the column space and the row space of an \(m \times n\] matrix A are equal.

Hence, the given statement is true.

(d)

By the rank theorem, the sum of the dimensions of the row space and the null space of A equals the number of pivot positions in A. The number of pivot positions need not be equal to the number of rows of A.

Hence, the given statement is false.

Step 4: Use the numerical note before the practice problem

(e)

On a computer, the exact arithmetic is performed on a matrix whose entries are specified, but the row operations can change the apparent rank of a matrix.

Hence, the given statement is true.

Most popular questions for Math Textbooks

Explain what is wrong with the following discussion: Let \({\bf{f}}\left( t \right) = {\bf{3}} + t\) and \({\bf{g}}\left( t \right) = {\bf{3}}t + {t^{\bf{2}}}\), and note that \({\bf{g}}\left( t \right) = t{\bf{f}}\left( t \right)\). Then, \(\left\{ {{\bf{f}},{\bf{g}}} \right\}\) is linearly dependent because g is a multiple of f.

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

(calculus required) Define \(T:C\left( {0,1} \right) \to C\left( {0,1} \right)\) as follows: For f in \(C\left( {0,1} \right)\), let \(T\left( t \right)\) be the antiderivative \({\mathop{\rm F}\nolimits} \) of \({\mathop{\rm f}\nolimits} \) such that \({\mathop{\rm F}\nolimits} \left( 0 \right) = 0\). Show that \(T\) is a linear transformation, and describe the kernel of \(T\). (See the notation in Exercise 20 of Section 4.1.)

Question 18: Suppose A is a \(4 \times 4\) matrix and B is a \(4 \times 2\) matrix, and let \({{\mathop{\rm u}\nolimits} _0},...,{{\mathop{\rm u}\nolimits} _3}\) represent a sequence of input vectors in \({\mathbb{R}^2}\).

  1. Set \({{\mathop{\rm x}\nolimits} _0} = 0\), compute \({{\mathop{\rm x}\nolimits} _1},...,{{\mathop{\rm x}\nolimits} _4}\) from equation (1), and write a formula for \({{\mathop{\rm x}\nolimits} _4}\) involving the controllability matrix \(M\) appearing in equation (2). (Note: The matrix \(M\) is constructed as a partitioned matrix. Its overall size here is \(4 \times 8\).)
  2. Suppose \(\left( {A,B} \right)\) is controllable and v is any vector in \({\mathbb{R}^4}\). Explain why there exists a control sequence \({{\mathop{\rm u}\nolimits} _0},...,{{\mathop{\rm u}\nolimits} _3}\) in \({\mathbb{R}^2}\) such that \({{\mathop{\rm x}\nolimits} _4} = {\mathop{\rm v}\nolimits} \).

Find a basis for the set of vectors in \({\mathbb{R}^{\bf{3}}}\) in the plane \(x + {\bf{2}}y + z = {\bf{0}}\). (Hint: Think of the equation as a “system” of homogeneous equations.)
Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

Decision Maths

Read explanation

Calculus

Read explanation

Probability and Statistics

Read explanation

Statistics

Read explanation

Mechanics Maths

Read explanation

Geometry

Read explanation

Pure Maths

Read explanation

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.