(adsbygoogle = window.adsbygoogle || []).push({}); [SOLVED] permutation of eigenvalues

Suppose H is a subgroup of O(n,R) (orthogonal matrices) and that I have an unambiguous way of ordering the eigenvalues for all matrices in H. Let A \in H have n distinct eigenvalues. Now suppose I have an invertible matrix P from the normalizer of H in O(n,R) such that PAP^{-1} gives me a matrix where exactly two of my eigenvalues have switched places. I would like to establish whether P must have determinant -1.

I think there may be a connection between how a permutation matrix (in the standard sense) has determinant -1 if it corresponds to a transposition (or indeed any odd permutation).

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Permutation of eigenvalues

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Permutation eigenvalues |
---|

A Eigenvalues and matrix entries |

A Eigenvalue Problem and the Calculus of Variations |

I Eigenvalues of Circulant matrices |

I Eigenvalues of block matrices |

A Numerically Calculating Eigenvalues |

**Physics Forums | Science Articles, Homework Help, Discussion**