Equivalent conditions for hermitian matrix

twoflower
Messages
363
Reaction score
0
Let's have hermitian matrix A. Then these three conditions are equivalent:

1) A is positively definite

<br /> \forall x \in \mathbb{C}^{n} \ {0} : x^{H}Ax &gt; 0<br />

2) All eigenvalues of A are positive
3) There exists regular matrix U such that

<br /> A = U^{H}U<br />

Proof:

<br /> 2) \Rightarrow 3)<br />

A is hermitian => \exists unitary matrix R such that

<br /> A = R^{H}DR<br />
where D is diagonal matrix.

This is what I don't understand - we know that if A is hermitian, there exists R unitary such that

<br /> R^{-1}AR = D \mbox{ diagonal \\}<br />

<br /> AR = RD<br />

<br /> A = RDR^{-1}<br />

And because R is unitary

<br /> R^{-1} = R^{H}<br />

<br /> A = RDR^{H}<br />

This isn't imho equivalent to

<br /> A = R^{H}DR<br />

is it?

Thank you.
 
Last edited:
Physics news on Phys.org
I can't quite figure out the best answer, but it as along the general lines of "so what?" Are you claiming R is unique and that it must be written as AR=RD? what is wrong with saying there is a unitary S such that SA=DS? they are equivalent.

but i can't tell what your problem is; indeed RDR^H and R^HDR are almost always different, but so what?
 
matt grime said:
I can't quite figure out the best answer, but it as along the general lines of "so what?" Are you claiming R is unique and that it must be written as AR=RD?

I'm not sure whether R is unique. Anyway, I have theorem (the one I wrote into another post):

A is hermitian => there exists R unitary such that

<br /> R^{-1}AR\mbox{ is diagonal matrix}<br />

From this I can get:

<br /> R^{-1}AR = D<br />

<br /> AR = RD<br />

<br /> A = RDR^{-1} = RDR^{H}<br />

But, the proof of the theorem about equivalent conditions for hermitian matrix says, that

A is hermitian => there exists R unitary such that

<br /> A = R^{H}DR<br />


How can I achieve this? I can't see that..




matt grime said:
what is wrong with saying there is a unitary S such that SA=DS? they are equivalent.

Well, that's the point. Why are they equivalent? I just want to use the theorem

A is hermitian => there exists R unitary such that

<br /> R^{-1}AR\mbox{ is diagonal matrix}<br />

which I know is true.
 
You are assuming that the R's in both those theorems are the same; they are not and there is no reason to be. rename the R as S in the first part and we know

A is hermitian if there is a unitary S such that

S*AS=E (using * for the H operation)

where E is diagonal with real entries

Ie A=SES*

right?

now the therem you wnat to prove states as a acondition that there is a unitary R and a diagoanl real D such that A=R*DR

well, they are equivalent if I let D=E and R=S*

there is nothing that states the diagonaliztaion of a hermitian matrix is unique (it isn't; reorder the basis).

you at least see they are equivalent? why must those two R's be the same? Or for that matter, the D?
 
matt grime said:
You are assuming that the R's in both those theorems are the same; they are not and there is no reason to be. rename the R as S in the first part and we know

A is hermitian if there is a unitary S such that

S*AS=E (using * for the H operation)

where E is diagonal with real entries

Ie A=SES*

right?

now the therem you wnat to prove states as a acondition that there is a unitary R and a diagoanl real D such that A=R*DR

well, they are equivalent if I let D=E and R=S*

there is nothing that states the diagonaliztaion of a hermitian matrix is unique (it isn't; reorder the basis).

you at least see they are equivalent? why must those two R's be the same? Or for that matter, the D?

Thank you very much Matt, now I'm completely clear about that matter. My fault that I was interpreting the theorem too literally and the substitution R = S* didn't come to my mind. Your answers teach me more that studying from lecture notes :redface:
 
if soemthing states "there is an R" for example, note it is just a label; labelling two things with the same letter here was exactly the problem. lectuer notes won't teach you that since they assume that you won't do that.
 
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