JustCurious's question at Yahoo Answers (Diagonalization)

In summary, this conversation is about diagonalization of matrices with mutually orthogonal eigenvectors. The problem is to show that the matrix A is equal to its transpose, and the suggestion is to replace U^-1 with U^T in the diagonalization formula and compare. In the literature, A is referred to as symmetric and U is called orthogonal.
  • #1
Fernando Revilla
Gold Member
MHB
631
0
Here is the question:

his problem is about diagonalization of matrices A which have n mutually orthogonal eigenvectors, each of which has length one. It is customary to write U for the matrix with columns constructed from the eigenvectors. The problem is straightforward, but requires you to follow a given suggestion. Here is the problem, followed by the suggestion.
Suppose A = UDU^-1;
where D is diagonal and U is given as above. The entries of D; U are real numbers. Show that A is equal to its transpose matrix.
Suggestion: In the diagonalization formula for A, replace U^-1 by U^T (this is valid for such matrices) and then take the transpose of both sides. Compare.
In the literature, A is called symmetric, and U is called orthogonal.

Here is a link to the question:

Diagnalization with matrices? - Yahoo! Answers


I have posted a link there to this topic so the OP can find my response.
 
Mathematics news on Phys.org
  • #2
Hello JustCurious,

We have $U^{-1}=U^T$, hence $A=UDU^T$. Then, using well kown properties of transposition $$A^T=(UDU^T)^T=(U^T)^TD^TU^T=UDU^T=A$$
 

Related to JustCurious's question at Yahoo Answers (Diagonalization)

1. What is diagonalization and how is it used in mathematics?

Diagonalization is a mathematical process used to find a diagonal matrix (a matrix with non-zero entries only along the main diagonal) that is similar to a given matrix. It is often used to simplify calculations or to find certain properties of a matrix.

2. How does diagonalization work?

To diagonalize a matrix, we first find its eigenvalues (the values that, when multiplied by the identity matrix and subtracted from the original matrix, result in a zero matrix). Then, we find the corresponding eigenvectors (the vectors that, when multiplied by the original matrix, result in a scalar multiple of the eigenvector). Finally, we use these eigenvectors to form a matrix that is similar to the original matrix, but is diagonal.

3. What is the significance of diagonalization?

Diagonalization allows us to simplify calculations involving matrices, as operations with diagonal matrices are often easier to perform. It also helps us to find certain properties of a matrix, such as its determinant and trace, and is often used in applications such as solving systems of differential equations.

4. Can all matrices be diagonalized?

No, not all matrices can be diagonalized. A matrix can be diagonalized if and only if it has n linearly independent eigenvectors, where n is the size of the matrix. If a matrix does not have n linearly independent eigenvectors, it is said to be defective and cannot be diagonalized.

5. What are some real-world applications of diagonalization?

Diagonalization has many real-world applications, including in physics, engineering, and computer science. For example, it can be used to model the behavior of systems in physics, such as the movement of particles or waves. In engineering, it can be used to analyze circuits and electrical networks. In computer science, it is used in data compression and signal processing algorithms.

Similar threads

Replies
1
Views
822
  • Calculus and Beyond Homework Help
Replies
8
Views
1K
Replies
1
Views
1K
Replies
4
Views
3K
Replies
1
Views
1K
Replies
1
Views
2K
  • General Math
Replies
1
Views
2K
Replies
5
Views
938
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
11
Views
3K
Back
Top