Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that if \(U\) is an orthogonal matrix, then any real eigenvalue of \(U\) must be \( \pm 1\).

Short Answer

Expert verified

It is proved that any real eigenvalues of \(U\) is \( \pm 1\).

Step by step solution

01

Statement in Theorem 7

Theorem 7states that consider that \(U\) as an \(m \times n\) matrix with orthonormal columns and assume that x and y are in \({\mathbb{R}^n}\). Then;

  1. \(\left\| {U{\bf{x}}} \right\| = \left\| {\bf{x}} \right\|\)
  2. \(\left( {U{\bf{x}}} \right) \cdot \left( {U{\bf{y}}} \right) = {\bf{x}} \cdot {\bf{y}}\)
  3. \(\left( {U{\bf{x}}} \right) \cdot \left( {U{\bf{y}}} \right) = 0\)such that if \({\bf{x}} \cdot {\bf{y}} = 0\).
02

Show that real eigenvalues of \(U\) must be \( \pm 1\) 

When \(U{\bf{x}} = \lambda {\bf{x}}\) for some \({\bf{x}} \ne 0\), then according to Theorem 7 and by a property of the norm:

\(\begin{array}{c}\left\| {\bf{x}} \right\| = \left\| {U{\bf{x}}} \right\|\\ = \left\| {\lambda {\bf{x}}} \right\|\\ = \left| \lambda \right|\left\| {\bf{x}} \right\|\end{array}\)

This demonstrates that \(\left| \lambda \right| = 1\), since \({\bf{x}} \ne 0\).

Thus, it is proved that any real eigenvalues of \(U\) is \( \pm 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 Exercises 1-4, find a least-sqaures solution of \(A{\bf{x}} = {\bf{b}}\) by (a) constructing a normal equations for \({\bf{\hat x}}\) and (b) solving for \({\bf{\hat x}}\).

1. \(A = \left[ {\begin{aligned}{{}{}}{ - {\bf{1}}}&{\bf{2}}\\{\bf{2}}&{ - {\bf{3}}}\\{ - {\bf{1}}}&{\bf{3}}\end{aligned}} \right]\), \({\bf{b}} = \left[ {\begin{aligned}{{}{}}{\bf{4}}\\{\bf{1}}\\{\bf{2}}\end{aligned}} \right]\)

In Exercises 1-6, the given set is a basis for a subspace W. Use the Gram-Schmidt process to produce an orthogonal basis for W.

  1. \(\left( {\begin{aligned}{{}{}}3\\0\\{ - 1}\end{aligned}} \right),\left( {\begin{aligned}{{}{}}8\\5\\{ - 6}\end{aligned}} \right)\)

In Exercises 11 and 12, find the closest point to\[{\bf{y}}\]in the subspace\[W\]spanned by\[{{\bf{v}}_1}\], and\[{{\bf{v}}_2}\].

11.\[y = \left[ {\begin{aligned}3\\1\\5\\1\end{aligned}} \right]\],\[{{\bf{v}}_1} = \left[ {\begin{aligned}3\\1\\{ - 1}\\1\end{aligned}} \right]\],\[{{\bf{v}}_2} = \left[ {\begin{aligned}1\\{ - 1}\\1\\{ - 1}\end{aligned}} \right]\]

Given \(A = QR\) as in Theorem 12, describe how to find an orthogonal\(m \times m\)(square) matrix \({Q_1}\) and an invertible \(n \times n\) upper triangular matrix \(R\) such that

\(A = {Q_1}\left[ {\begin{aligned}{{}{}}R\\0\end{aligned}} \right]\)

The MATLAB qr command supplies this “full” QR factorization

when rank \(A = n\).

In Exercises 7–10, let\[W\]be the subspace spanned by the\[{\bf{u}}\]’s, and write y as the sum of a vector in\[W\]and a vector orthogonal to\[W\].

9.\[y = \left[ {\begin{aligned}4\\3\\3\\{ - 1}\end{aligned}} \right]\],\[{{\bf{u}}_1} = \left[ {\begin{aligned}1\\1\\0\\1\end{aligned}} \right]\],\[{{\bf{u}}_2} = \left[ {\begin{aligned}{ - 1}\\3\\1\\{ - 2}\end{aligned}} \right]\],\[{{\bf{u}}_2} = \left[ {\begin{aligned}{ - 1}\\0\\1\\1\end{aligned}} \right]\]

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