Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Permutation of eigenvalues

  1. Dec 8, 2007 #1
    [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).
     
    Last edited: Dec 8, 2007
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you help with the solution or looking for help too?
Draft saved Draft deleted



Similar Discussions: Permutation of eigenvalues
  1. Permutation mapping (Replies: 4)

  2. Multiplying permutations (Replies: 10)

  3. Permutation Group (Replies: 29)

Loading...