Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 4: Q10E (page 191)

Question 10: Determine if \(P = \left[ {\begin{array}{*{20}{c}}1&{.2}\\0&{.8}\end{array}} \right]\) is a regular stochastic matrix.

Short Answer

Expert verified

\(P\)is not a regular stochastic matrix.

Step by step solution

01

Define a regular stochastic matrix

The stochastic matrix isregular if some matrix power \({p^k}\) contains only positive entries.

02

 Step 2: Determine whether the matrix is regular stochastic

Compute the matrix \({P^2}\) as shown below:

\(\begin{aligned}{}{P^2} &= \left( {\begin{aligned}{{}}1&{.2}\\0&{.8}\end{aligned}} \right)\left( {\begin{aligned}{{}}1&{.2}\\0&{.8}\end{aligned}} \right)\\ &= \left( {\begin{aligned}{{}}{1 + 0}&{0.2 + 0.16}\\{0 + 0}&{0 + 0.64}\end{aligned}} \right)\\ &= \left( {\begin{aligned}{{}}1&{.36}\\0&{.64}\end{aligned}} \right)\end{aligned}\)

\({P^k} = \left( {\begin{aligned}{{}}1&{1 - {8^k}}\\0&{{{.8}^k}}\end{aligned}} \right)\)haszero as its \(\left( {2,1} \right)\) entry for all \(k\).

Thus, \(P\) is not a regular stochastic matrix.

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

[M] Let \(A = \left[ {\begin{array}{*{20}{c}}7&{ - 9}&{ - 4}&5&3&{ - 3}&{ - 7}\\{ - 4}&6&7&{ - 2}&{ - 6}&{ - 5}&5\\5&{ - 7}&{ - 6}&5&{ - 6}&2&8\\{ - 3}&5&8&{ - 1}&{ - 7}&{ - 4}&8\\6&{ - 8}&{ - 5}&4&4&9&3\end{array}} \right]\).

  1. Construct matrices \(C\) and \(N\) whose columns are bases for \({\mathop{\rm Col}\nolimits} A\) and \({\mathop{\rm Nul}\nolimits} A\), respectively, and construct a matrix \(R\) whose rows form a basis for Row\(A\).
  2. Construct a matrix \(M\) whose columns form a basis for \({\mathop{\rm Nul}\nolimits} {A^T}\), form the matrices \(S = \left[ {\begin{array}{*{20}{c}}{{R^T}}&N\end{array}} \right]\) and \(T = \left[ {\begin{array}{*{20}{c}}C&M\end{array}} \right]\), and explain why \(S\) and \(T\) should be square. Verify that both \(S\) and \(T\) are invertible.

Justify the following equalities:

a.\({\rm{dim Row }}A{\rm{ + dim Nul }}A = n{\rm{ }}\)

b.\({\rm{dim Col }}A{\rm{ + dim Nul }}{A^T} = m\)

Is it possible for a nonhomogeneous system of seven equations in six unknowns to have a unique solution for some right-hand side of constants? Is it possible for such a system to have a unique solution for every right-hand side? Explain.

If the null space of a\({\bf{5}} \times {\bf{6}}\)matrix A is 4-dimensional, what is the dimension of the row space of A?

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

Calculus

Read Explanation

Discrete Mathematics

Read Explanation

Probability and Statistics

Read Explanation

Mechanics Maths

Read Explanation

Statistics

Read Explanation

Theoretical and Mathematical Physics

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