Let C be an \(n \times n\) consumption matrix whose column sums are less than 1. Let x be the production vector that satisfies a final demand d, and let \[\Delta {\mathop{\rm x}\nolimits} \] be a production vector that satisfies a different final demand \[\Delta {\mathop{\rm d}\nolimits} \].

a. Show that if the final demand changes from d to \[{\mathop{\rm d}\nolimits} + \Delta {\mathop{\rm d}\nolimits} \], then the new production level must be \[{\mathop{\rm x}\nolimits} + \Delta {\mathop{\rm x}\nolimits} \]. Thus \[\Delta {\mathop{\rm x}\nolimits} \] gives the amounts by which production must change in order to accommodate the change \[\Delta {\mathop{\rm d}\nolimits} \] in demand.

b. Let \[\Delta {\mathop{\rm d}\nolimits} \] be the vector in \({\mathbb{R}^n}\) with as the first entry and 0’s elsewhere. Explain why the corresponding production \[\Delta {\mathop{\rm x}\nolimits} \] is the first column of \({\left( {I - C} \right)^{ - 1}}\). This shows that the first column of \({\left( {I - C} \right)^{ - 1}}\) gives the amounts the various sectors must produce to satisfy an increase of 1 unit in the final demand for output from sector 1.

Short Answer

Expert verified
  1. It is proved that \({\mathop{\rm x}\nolimits} + \Delta {\mathop{\rm x}\nolimits} \) is the new production level that corresponds to the final demand of \({\mathop{\rm d}\nolimits} + \Delta {\mathop{\rm d}\nolimits} \).
  2. It is proved that the production vector \[\Delta {\mathop{\rm x}\nolimits} \] is the first column of \({\left( {I - C} \right)^{ - 1}}\).

Step by step solution

01

Show that the new production level must be \[{\mathop{\rm x}\nolimits}  + \Delta {\mathop{\rm x}\nolimits} \]

Let x be a production vector that satisfies the final demand d, and \[\Delta {\mathop{\rm x}\nolimits} \] be a production vector that satisfies a different final demand \(\Delta {\mathop{\rm d}\nolimits} \).

It is given that \(\left( {I - C} \right){\mathop{\rm x}\nolimits} = {\mathop{\rm d}\nolimits} \) and \(\left( {I - C} \right)\Delta {\mathop{\rm x}\nolimits} = \Delta {\mathop{\rm d}\nolimits} \).

The new production level of \({\mathop{\rm x}\nolimits} + \Delta {\mathop{\rm x}\nolimits} \) is shown below:

\(\begin{array}{c}\left( {I - C} \right)\left( {{\mathop{\rm x}\nolimits} + \Delta {\mathop{\rm x}\nolimits} } \right) = \left( {I - C} \right){\mathop{\rm x}\nolimits} + \left( {I - C} \right)\Delta {\mathop{\rm x}\nolimits} \\ = {\mathop{\rm d}\nolimits} + \Delta {\mathop{\rm d}\nolimits} \end{array}\)

Thus, it is proved that \({\mathop{\rm x}\nolimits} + \Delta {\mathop{\rm x}\nolimits} \) is the new production level that corresponds to a final demand of \({\mathop{\rm d}\nolimits} + \Delta {\mathop{\rm d}\nolimits} \).

02

Explain that the production vector \(\Delta {\mathop{\rm x}\nolimits} \) is the first column of \({\left( {I - C} \right)^{ - 1}}\)

Theorem 11states that C is the consumption matrix for an economy. Let d be the final demand. If C and d have non-negative entries and each column sum of C is less than 1, then \({\left( {I - C} \right)^{ - 1}}\) exists. Also, the production vector \(x = {\left( {I - C} \right)^{ - 1}}{\mathop{\rm d}\nolimits} \) has non-negative entries and is the unique solution of \(x = Cx + {\mathop{\rm d}\nolimits} \).

Let \[\Delta {\mathop{\rm d}\nolimits} \] be the vector in \({\mathbb{R}^n}\) as the first entry and as zero elsewhere.

\[\Delta {\mathop{\rm d}\nolimits} \]is the first column of I. So, the production vector \[\Delta {\mathop{\rm x}\nolimits} \] is the first column of \({\left( {I - C} \right)^{ - 1}}\) because \(\Delta {\mathop{\rm x}\nolimits} = {\left( {I - C} \right)^{ - 1}}\Delta {\mathop{\rm d}\nolimits} \).

Thus, it is proved that the production vector \[\Delta {\mathop{\rm x}\nolimits} \] is the first column of \({\left( {I - C} \right)^{ - 1}}\).

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

In the rest of this exercise set and in those to follow, you should assume that each matrix expression is defined. That is, the sizes of the matrices (and vectors) involved match appropriately.

Compute \(A - {\bf{5}}{I_{\bf{3}}}\) and \(\left( {{\bf{5}}{I_{\bf{3}}}} \right)A\)

\(A = \left( {\begin{aligned}{*{20}{c}}{\bf{9}}&{ - {\bf{1}}}&{\bf{3}}\\{ - {\bf{8}}}&{\bf{7}}&{ - {\bf{6}}}\\{ - {\bf{4}}}&{\bf{1}}&{\bf{8}}\end{aligned}} \right)\)

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.

Use partitioned matrices to prove by induction that for \(n = 2,3,...\), the \(n \times n\) matrices \(A\) shown below is invertible and \(B\) is its inverse.

\[A = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\1&1&0&{}&0\\1&1&1&{}&0\\ \vdots &{}&{}& \ddots &{}\\1&1&1& \ldots &1\end{array}} \right]\]

\[B = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\{ - 1}&1&0&{}&0\\0&{ - 1}&1&{}&0\\ \vdots &{}& \ddots & \ddots &{}\\0&{}& \ldots &{ - 1}&1\end{array}} \right]\]

For the induction step, assume A and Bare \(\left( {k + 1} \right) \times \left( {k + 1} \right)\) matrices, and partition Aand B in a form similar to that displayed in Exercises 23.

A useful way to test new ideas in matrix algebra, or to make conjectures, is to make calculations with matrices selected at random. Checking a property for a few matrices does not prove that the property holds in general, but it makes the property more believable. Also, if the property is actually false, you may discover this when you make a few calculations.

38. Use at least three pairs of random \(4 \times 4\) matrices Aand Bto test the equalities \({\left( {A + B} \right)^T} = {A^T} + {B^T}\) and \({\left( {AB} \right)^T} = {A^T}{B^T}\). (See Exercise 37.) Report your conclusions. (Note:Most matrix programs use \(A'\) for \({A^{\bf{T}}}\).

In the rest of this exercise set and in those to follow, you should assume that each matrix expression is defined. That is, the sizes of the matrices (and vectors) involved match appropriately.

Let \(A = \left( {\begin{aligned}{*{20}{c}}{\bf{4}}&{ - {\bf{1}}}\\{\bf{5}}&{ - {\bf{2}}}\end{aligned}} \right)\). Compute \({\bf{3}}{I_{\bf{2}}} - A\) and \(\left( {{\bf{3}}{I_{\bf{2}}}} \right)A\).

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