When we have a symmetric matrix, a change of basis keeps symmetry iff it is done by an orthogonal matrix, in which case:
The general result from eigendecomposition of a matrix:becomes:where is an orthogonal matrix, and therefore has .
The orthogonal group is the group of all invertible matrices where the inverse is equal to the transpose Updated 2025-01-01 +Created 1970-01-01
Let's show that this definition is equivalent to the orthogonal group is the group of all matrices that preserve the dot product.
Note that:and for that to be true for all possible and then we must have:i.e. the matrix inverse is equal to the transpose.
These matricese are called the orthogonal matrices.
TODO is there any more intuitive way to think about this?
Complex analogue of orthogonal matrix.
Applications:
- in quantum computers programming basically comes down to creating one big unitary matrix as explained at: quantum computing is just matrix multiplication