Log In Start studying!

Select your language

Suggested languages for you:
Answers without the blur. Sign up and see all textbooks for free! Illustration

Q45E

Expert-verified
Linear Algebra With Applications
Found in: Page 393
Linear Algebra With Applications

Linear Algebra With Applications

Book edition 5th
Author(s) Otto Bretscher
Pages 442 pages
ISBN 9780321796974

Answers without the blur.

Just sign up for free and you're in.

Illustration

Short Answer

We say that an n×n matrix A is triangulizable if is similar to an upper triangular n×n matrix B.

a. Give an example of a matrix with real entries that fails to be triangulizable over R .

b. Show that any n×n matrix with complex entries is triangulizable over C . Hint: Give a proof by induction analogous to the proof of Theorem 8.1.1.

a) The triangulizable matrix over R since it complex eigen values are

λ1=-i×6+1 and λ1=i×6+1

b) R-1λv0BR=S-1AS

we can conclude that matrix with complex entries is triangulizable over C

See the step by step solution

Step by Step Solution

Step 1: DefineTriangularizable matric:

Triangularizable matrices are those that are similar to triangular matrices. In a nutshell, this is the same as stabilising a flag: upper triangular matrices are the ones that keep the standard flag, which is determined by the standard ordered basis.

Step 2: Matrix with real entries fails to be triangulizable and complex entries:

Consider an A is triangulizable matrix is identical to and upper triangular matrix . If S-1AS is an upper triangular matrix then the first column of S is an eigen vector of A. Hence any matrix without real eigen vectors fails to be triangulizable vector over R .Consider the matrix as

12-31

With real entries. To find the eigen values are as follows

det12-31-λ00λ=01-λ2-31-λ=0λ2-2λ+7=0λ+(i×6-1)×λ-(i×6+1)=0λ1=-i×6+1 and λ2=i×6+1

The triangulizable matrix over R since it complex eigen values are

λ1=-i×6+1 and λ2=i×6+1

Consider the given problem for any n×n matrix with complex entries is triangulizable over C .True value for (n-1) .A real eigen value of λ for A and eigen vector of length 1 for λ .For every A there exists a complex invertible matrix P whose first column is an eigen vector of A .It can be represented as below

P-1AP=λV0B

Hypothesis of induction if B is triangulizable matrix such that there exists (n-1)×(n-1) matrix Q that satisfies

Q-1BQ=T

Consider

R=100Q

To evaluate

R-1=λV0BR=100Q-1λV0B100Q =λvQ0Q-1BQ R-1λV0BR=λVQ0T

Hence R-1λV0BR is upper triangular matrix

Consider as R-1λV0BR

R-1λV0BR=R-1P-1APR=PR)-1APR(S=PR)R-1λV0BR=S-1AS

Hence, we can conclude that matrix with complex entries is triangulizable over C

Recommended explanations on Math Textbooks

94% of StudySmarter users get better grades.

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