/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 18 Let \(A\) be a \(2 \times 2\) ma... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Let \(A\) be a \(2 \times 2\) matrix with Schur decomposition \(U T U^{H}\) and suppose that \(t_{12} \neq 0 .\) Show that (a) the eigenvalues of \(A\) are \(\lambda_{1}=t_{11}\) and \(\lambda_{2}=t_{22}\) (b) \(\mathbf{u}_{1}\) is an eigenvector of \(A\) belonging to \(\lambda_{1}=t_{11}\) (c) \(\mathbf{u}_{2}\) is not an eigenvector of \(A\) belonging to \(\lambda_{2}=t_{22}\)

Short Answer

Expert verified
In summary, we have shown that a 2x2 matrix A with Schur decomposition \(U T U^{H}\) and \(t_{12} \neq 0\) has eigenvalues \(\lambda_1 = t_{11}\) and \(\lambda_2 = t_{22}\). The eigenvector corresponding to \(\lambda_1\) is \(\mathbf{u}_1\), which is the first column of U, while the second column of U, \(\mathbf{u}_2\), is not an eigenvector corresponding to \(\lambda_2\).

Step by step solution

01

Schur decomposition of A and its properties

The given matrix A has a Schur decomposition, which means it can be written as: \[ A = U T U^{H} \] where U is a unitary matrix and T is an upper triangular matrix. Since A is a 2x2 matrix, we have: \[ T = \begin{pmatrix} t_{11} & t_{12} \\ 0 & t_{22} \end{pmatrix}\] Additionally, we know that \(t_{12} \neq 0\).
02

Calculate the eigenvalues of A

To find the eigenvalues of A, we look at the characteristic equation. For a general 2x2 matrix: \[ A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}\] The characteristic equation is given by: \[ det(A - \lambda I) = 0 \] In our case, we have: \[ det(T - \lambda I) = \begin{vmatrix} t_{11} - \lambda & t_{12} \\ 0 & t_{22} - \lambda \end{vmatrix} = (t_{11} - \lambda)(t_{22} - \lambda) = 0\] Thus, the eigenvalues of A are: \[ \lambda_1 = t_{11} \text{ and } \lambda_2 = t_{22} \]
03

Eigenvectors corresponding to eigenvalues

We now show that \(\mathbf{u}_1\) is an eigenvector of A belonging to \(\lambda_1=t_{11}\) and \(\mathbf{u}_2\) is not an eigenvector of A belonging to \(\lambda_2=t_{22}\). (a) Since U is unitary, its columns are orthonormal, and we can denote the first column as \(\mathbf{u}_1\). For A to have an eigenvector corresponding to \(\lambda_1=t_{11}\), we must have: \[ A \mathbf{u}_1 = \lambda_1 \mathbf{u}_1 \] Using the Schur decomposition of A, we get: \[ U T U^{H} \mathbf{u}_1 = t_{11} \mathbf{u}_1 \] Since \(\mathbf{u}_1\) is the first column of U, we have \(U^{H} \mathbf{u}_1 = \mathbf{e}_1\), where \(\mathbf{e}_1\) is the first standard basis vector. Therefore, \[ U T \mathbf{e}_1 = t_{11} \mathbf{u}_1 \] Because T is an upper triangular matrix, we have \(T \mathbf{e}_1 = \begin{pmatrix} t_{11} \\ 0 \end{pmatrix}\), so: \[ U \begin{pmatrix} t_{11} \\ 0 \end{pmatrix} = t_{11} \mathbf{u}_1 \] Since the first entry of \(\mathbf{u}_1\) is non-zero (otherwise U wouldn't be unitary), this equation implies that \(\mathbf{u}_1\) is indeed an eigenvector of A belonging to \(\lambda_1=t_{11}\). (b) Now, let's check if \(\mathbf{u}_2\) is an eigenvector of A belonging to \(\lambda_2=t_{22}\). We can start with: \[ A \mathbf{u}_2 = \lambda_2 \mathbf{u}_2 \] Following a similar process as before: \[ U T U^{H} \mathbf{u}_2 = t_{22} \mathbf{u}_2 \] Since \(\mathbf{u}_2\) is the second column of U, we have \(U^{H} \mathbf{u}_2 = \mathbf{e}_2\), where \(\mathbf{e}_2\) is the second standard basis vector. Therefore, \[ U T \mathbf{e}_2 = t_{22} \mathbf{u}_2 \] Because T is an upper triangular matrix, we have \(T \mathbf{e}_2 = \begin{pmatrix} t_{12} \\ t_{22} \end{pmatrix}\), so: \[ U \begin{pmatrix} t_{12} \\ t_{22} \end{pmatrix} = t_{22} \mathbf{u}_2 \] Since \(t_{12} \neq 0\), this equation implies that \(\mathbf{u}_2\) indeed is not an eigenvector of A belonging to \(\lambda_2=t_{22}\). In conclusion, we have shown that the eigenvalues of A are \(\lambda_1 = t_{11}\) and \(\lambda_2 = t_{22}\), with \(\mathbf{u}_1\) being an eigenvector corresponding to \(\lambda_1\) and \(\mathbf{u}_2\) not being an eigenvector corresponding to \(\lambda_2\).

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 91Ó°ÊÓ!

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

Show that \(e^{A}\) is nonsingular for any diagonalizable matrix \(A\)

Let \(T\) be an upper triangular matrix with distinct diagonal entries (i.e., \(t_{i i} \neq t_{j j}\) whenever \(i \neq j\) ). Show that there is an upper triangular matrix \(R\) that diagonalizes \(T\)

It follows from Exercise 14 that, for a diagonalizable matrix, the number of nonzero eigenvalues (counted according to multiplicity) equals the rank of the matrix. Give an example of a defective matrix whose rank is not equal to the number of nonzero eigenvalues.

The transition matrix in Example 5 has the property that both its rows and its columns add up to \(1 .\) In general, a matrix \(A\) is said to be doubly stochastic if both \(A\) and \(A^{T}\) are stochastic. Let \(A\) be an \(n \times n\) doubly stochastic matrix whose eigenvalues satisfy \\[ \lambda_{1}=1 \quad \text { and } \quad\left|\lambda_{j}\right|<1 \quad \text { for } j=2,3, \dots, n \\] Show that if \(\mathbf{e}\) is the vector in \(\mathbb{R}^{n}\) whose entries are all equal to 1 , then the Markov chain will converge to the steady-state vector \(\mathbf{x}=\frac{1}{n} \mathbf{e}\) for any starting vector \(\mathbf{x}_{0} .\) Thus, for a doubly stochastic transition matrix, the steady-state vector will assign equal probabilities to all possible outcomes.

Let \(A\) be a symmetric \(n \times n\) matrix with eigenvalues \(\lambda_{1}, \ldots, \lambda_{n} .\) Show that there exists an orthonormal set of vectors \(\left\\{\mathbf{x}_{1}, \ldots, \mathbf{x}_{n}\right\\}\) such that \\[ \mathbf{x}^{T} A \mathbf{x}=\sum_{i=1}^{n} \lambda_{i}\left(\mathbf{x}^{T} \mathbf{x}_{i}\right)^{2} \\] for each \(\mathbf{x} \in \mathbb{R}^{n}\)

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.