It is possible to show that if a $ n \times n $ real matrix $ A $ verifies that $ PA $ is diagonalizable for all real invertible matrix $ P $ , then $ A=0 $ , because all the matrices that are equivalent to $ A $ are diagonalizable. I tried it with keeping only orthogonal matrices in the initial hypothesis (instead of simply invertible), and using SVD, it still works : the result is the same. Now, I want to check if it is still true keeping only special orthogonal matrices. When $ n $ is odd, it works because $ \mathcal{O}(n) = \mathcal{SO}(n) \cup (-\mathcal{SO}(n)) $ , but I have no solution for $ n $ even.
2026-03-29 11:00:09.1774782009
Multiply by orthogonal matrices and obtain diagonalizability
38 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in DIAGONALIZATION
- Determining a $4\times4$ matrix knowing $3$ of its $4$ eigenvectors and eigenvalues
- Show that $A^m=I_n$ is diagonalizable
- Simultaneous diagonalization on more than two matrices
- Diagonalization and change of basis
- Is this $3 \times 3$ matrix diagonalizable?
- Matrix $A\in \mathbb{R}^{4\times4}$ has eigenvectors $\bf{u_1,u_2,u_3,u_4}$ satisfying $\bf{Au_1=5u_1,Au_2=9u_2}$ & $\bf{Au_3=20u_3}$. Find $A\bf{w}$.
- Block diagonalizing a Hermitian matrix
- undiagonizable matrix and annhilating polynom claims
- Show that if $\lambda$ is an eigenvalue of matrix $A$ and $B$, then it is an eigenvalue of $B^{-1}AB$
- Is a complex symmetric square matrix with zero diagonal diagonalizable?
Related Questions in ORTHOGONAL-MATRICES
- Minimum of the 2-norm
- Optimization over images of column-orthogonal matrices through rotations and reflections
- Functions on $\mathbb{R}^n$ commuting with orthogonal transformations
- A property of orthogonal matrices
- Rotating a matrix to become symmetric
- Question involving orthogonal matrix and congruent matrices $P^{t}AP=I$
- Finding An Orthogonal Transformation Matrix
- Which statement is false ?(Linear algebra problem)
- Every hyperplane contains an orthogonal matrix
- Show non-singularity of orthogonal matrix
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Consider $n=2$; then $\mathcal{SO}(2)$ is the set of rotations and $\mathcal{O}(2)\setminus\mathcal{SO}(2)$ is the set of reflections. Choose $A$ to be any reflection (eg $\mathrm{diag}(1,-1)$). If $P$ is a rotation then $PA$ is a reflection, which is diagonalizable over $\mathbb R$. Thus the claim fails for $n=2$.
The claim does hold for $n>2$. Indeed write $A=UDV^{-1}$ where $U,V\in\mathcal{SO}(n)$ and $D$ is diagonal. For any $O\in\mathcal{SO}(n)$, we have $VOU^{-1}\in\mathcal{SO}(n)$, so $VOU^{-1}A$ is diagonalizable by assumption. Hence $$ V^{-1}(VOU^{-1}A)V=OD $$ is diagonalizable.
Write $D=\mathrm{diag}(\lambda_1,\ldots,\lambda_n)$. First suppose the rank of $D$ is at least $2$. wlog suppose $\lambda_1,\lambda_2\neq0$. Let $$ O'=\begin{bmatrix} 0&\mathrm{sgn}(\lambda_2)&0\\ -\mathrm{sgn}(\lambda_1)&0&0\\ 0&0&\mathrm{sgn}(\lambda_2)\mathrm{sgn}(\lambda_1) \end{bmatrix}\in\mathcal{SO}(3), $$ $$ O=\begin{bmatrix}O'&0\\0&I_{n-3}\end{bmatrix}\in\mathcal{SO}(n). $$ Then $$ OD=\begin{bmatrix}X&0\\0&*\end{bmatrix} $$ where $$ X=\begin{bmatrix}0&|\lambda_2|\\-|\lambda_1|&0\end{bmatrix}. $$ Now $X$ is not diagonalizable over $\mathbb R$, so neither is $OD$, a contradiction.
Next suppose $D$ has rank $1$. wlog suppose $\lambda_1\neq0$ and $\lambda_i=0$ for $i>1$. Let $$ O'=\begin{bmatrix}0&1\\-1&0\end{bmatrix}\in\mathcal{SO}(2), $$ $$ O=\begin{bmatrix}O'&0\\0&I_{n-2}\end{bmatrix}\in\mathcal{SO}(n). $$ Now $OD$ is nilpotent and nonzero, again contradicting $OD$ being diagonalizable. Hence $D=0$, so $A=0$ as required.