Help simplify the matrix equation

  • Thread starter Thread starter tom08
  • Start date Start date
  • Tags Tags
    Matrix Simplify
tom08
Messages
19
Reaction score
0
I encounter a problem when simplifying the following equation, can anyone give a hint:)

Let A denote an orthonormal matrix, X be a symmetric matrix.

diag(A) is an operator that creates a diagonal matrix of A.

Then, my problem is how to simplify the equation:

A^{-1} \cdot diag(A \cdot X \cdot A^{-1}) \cdot A
 
Last edited:
Physics news on Phys.org
"diag(A) is an operator that creates a diagonal matrix of A."

That doesn't tell us enough. There are many ways to make a diagonal matrix out of A, for example, just setting all non-diagonal values equal to 0. Do you mean "diag(A) is a diagonal matrix similar to A"? In that case, are we to assume that A is diagonalizable?
 
HallsofIvy said:
"diag(A) is an operator that creates a diagonal matrix of A."

That doesn't tell us enough. There are many ways to make a diagonal matrix out of A, for example, just setting all non-diagonal values equal to 0. Do you mean "diag(A) is a diagonal matrix similar to A"? In that case, are we to assume that A is diagonalizable?

Sorry, I'll clarify the defitioon of diag (A).

diag(A) is a square matrix in which the entries outside the diagonal are all zero, and its diagonal entries are the diagonal of A.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top