
#1
Aug2113, 06:07 PM

P: 590

Hello,
I wish to design the matrix P such that it satisfies the following: [tex]P^TQP=Q^T[/tex] where all matrices are NbyN. Is it possible? Thanks 



#2
Aug2213, 08:52 AM

Mentor
P: 10,864

For all Q?
Did you try some simple cases, e.g. Q=[[0,1],[0,0]]? I doubt this is possible in general, so searching for counterexamples looks like a good idea. Edit: And that is a good idea for a counterexample if you combine it with another matrix. 



#3
Aug2213, 11:03 AM

P: 590

Thanks 



#4
Aug2213, 05:21 PM

Mentor
P: 10,864

Is it possible to design this?So in general, this is not possible. 



#5
Aug2813, 08:39 AM

P: 590





#6
Aug2813, 02:41 PM

Mentor
P: 10,864

Did you test some simple cases, as I suggested?
I would not expect that being Hermitian helps, but I don't know. 



#7
Aug2813, 02:53 PM

P: 590





#8
Aug2813, 03:12 PM

Mentor
P: 4,499

The right hand side is a linear operation on the space of nxn matrices (which is a vector space of dimension n^{2}), and the left hand side is a linear operation on the space of nxn matrices picked from a vector space of dimension n^{2}. But the set of all linear transformations on the space of nxn matrices has dimension (n^{2})^{2} = n^{4}. So in general most linear transformations on a set of matrices cannot be represented as conjugation by a matrix like the left hand side of your equation.
This doesn't answer the specific question of whether transposing is a special case, but it does heavily suggest that there will not exist such a matrix P, and as mfb said you should look for counterexamples in small dimensions. There is a general disproof I believe that works for when Q is Hermitian. Plugging in Q the identity matrix we get that P^{t} = P^{1}. Plugging in Q an arbitrary real symmetric matrix, we want to find P that commutes with every Q which is symmetric. Checking Q an arbitrary elementary symmetric matrix (has only a 1 in the (i,j) and (j,i) spots and 0 everywhere else) we find P has to be a scalar multiple of the identity matrix, which because its transpose is its inverse means it has to be the identity matrix or negative the identity matrix. Checking Q basically any non real Hermitian matrix shows that neither of those work. If testing simple cases didn't help, then you should show us what cases you tested and we can show you where you went wrong in missing the counterexample 



#9
Aug2813, 03:59 PM

P: 590

Do you mean it is possible for Hermitian matrices? I tried a matrix [a b; conj(b) a] which is Hermitian and P is a real matrix. But I was wondering since for a Hermitian matrix we have the following eigenvalue decomposition:
[tex]\mathbf{Q}=\mathbf{U}\Sigma\mathbf{U}^H[/tex] where the eigenvalues are real, which implies that: [tex]\mathbf{U}^H\mathbf{Q}\mathbf{U}=\Sigma=\Sigma^T=\mathbf{U}^T\mathbf{Q} ^T\mathbf{U}^*[/tex] if we can use that in a way. 



#10
Aug2813, 04:40 PM

Mentor
P: 4,499




Register to reply 
Related Discussions  
computer design of retaining wall design  Engineering, Comp Sci, & Technology Homework  0  
Op Amp Design Problem Help Needed I am trying design  Electrical Engineering  2  
Design Problems Solar Panel design  Mechanical Engineering  10  
reactor design/systems design  Nuclear Engineering  24  
If Intelligent Design is exactly that, what's with all the design flaws?  Current Events  62 