8) Diagonalization and the Spectral Theorem Flashcards

1
Q

What is a similar matrix

A

A matrix A ∈ Mn(K) is similar to B ∈ Mn(K) if there is an invertible
matrix P ∈ Mn(K) such that B = P AP^ −1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What properties do similar matrices share

A
  • Rank
  • Trace
  • Determinant
  • Eigenvalues
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How can we calculate high powers of a matrix using diagonable matrices

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

In regards to the basis and eignevalues of a matrix, when is a matrix diagonalizable

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In regards to the algebraic and geometric multiplicitices of a matrix, when is a matrix diagonalizable

A

The matrix A ∈ Mn(K) is diagonalizable if and only if the algebraic
and geometric multiplicities of each of its eigenvalues coincide

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

When is a matrix orthogonal

A

A matrix P ∈ Mn(R) is orthogonal if and only if its columns form an orthonormal basis for R^n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does it mean for two matrices to be orthogonally similar

A

Let A, B ∈ Mn(R). If there exists an orthogonal matrix P ∈ Mn(R) such that P^TAP = B, then we say that A and B are orthogonally similar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When is a matrix orthogonally diagonalizable

A

If it is orthogonally similar to a diagonal matrix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Is an orthogonally diagonalizable matrix symmetric

A

If A ∈ Mn(R) is orthogonally diagonalizable then A is symmetric

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe the proof that an orthogonally diagonalizable matrix is symmetric

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Whats is a unitary matrix

A

If the columns of a matrix U ∈ Mn(C) form an orthonormal basis for
Cn , then U is called unitary.
(This is the complex analogue of an orthogonal matrix)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What does it mean for two matrices to be unitarily similar

A

If there exists a unitary matrix U such that U^∗AU = B, then we say that A and B are unitarily similar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does it mean for a matrix to be Hermitian

A

A matrix A ∈ Mn(C) is Hermitian if A^∗ = A.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does it mean about the eigenvalues of a matrix if it is a Hermitian matrix

A

Then all the eigenvalues of A are real

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

If A is a Hermitian matrix, then if λ1 and λ2 are distinct eigenvalues
with corresponding eigenvectors v1 and v2 respectively what can we say about v1 and v2

A

Then v1 and v2 are orthogonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What does it mean for a matrix to be normal

A
16
Q

What is Schur’s Theorem

A

If A ∈ Mn(C), then A is unitarily similar to an upper triangular matrix T. Moreover, the diagonal entries of T are the eigenvalues of A.

17
Q

What is Schur decomposition of a matrix

A

A = UT U^∗

18
Q

What is The Spectral Theorem for Hermitian matrices

A
19
Q

What is a spectral decomposition of a amtrix

A
20
Q

What is a Singular Value Decomposition

A