A = 9 1 ⎣ ⎡ − 1 8 4 8 − 1 4 4 4 − 7 ⎦ ⎤
What kind of a transformation of R 3 does A represent?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A transformation with eigenvalues 1 , − 1 , − 1 is not necessarily a reflection about a line.
Log in to reply
even if it's orthogonal.
Log in to reply
Yes indeed, the matrix needs to be orthogonal.
Finding the eigenvalues is tedious... is there a quicker way?
Log in to reply
@Otto Bretscher – Not that tedious.
Let A be the matrix and I the identity matrix
Solution 1 d e t ( A − λ ∗ I ) = − λ 3 − λ 2 + λ + 1 = − ( λ + 1 ) 2 ( λ − 1 )
Solution 2 d e t ( A ) = 1 a n d A ∗ A = I
so the eigenvalues are either 1 or -1, with the product of 1.
the solution 1, 1, 1 imply A = I
We are left with 1, -1, -1
Log in to reply
@Abdelhamid Saadi – I like Solution 2!
It's worth pointing out that matrix A is symmetric ; any matrix that is both orthogonal and symmetric represents a reflection.
@Otto Bretscher – Can someone pls explain what R^3 means here??
Log in to reply
@Milind Blaze – R 3 is the set of all triples of real numbers, written as column vectors, ⎣ ⎡ x y z ⎦ ⎤
solution 2 is very brilliant if you add A is symmetric, nevertheless solution 1 is not a solution. One matrix A is able to have to d e t ( A − λ ∗ I ) = − ( λ + 1 ) 2 ( λ − 1 ) and it has not to be a diagonalizable matrix and much less to be a reflection about a line nor an orthogonal matrix. Solution 2 is very brilliant,and I'm going to say you why. Since A 2 − I = 0 it implies that its minimum polynomial p m ( x ) is ( x − 1 ) or ( x + 1 ) or ( x − 1 ) ( x + 1 ) . The two first cases doesn't work for A , so p m ( x ) = ( x − 1 ) ( x + 1 ) ⇒ the matrix A is diagonalizable with eigenvalues 1, -1 due to the theorem: One square matrix is diagonalizable if and only if its minimum polynomial can be descomposed as one product of linear factors not repeated and because every eigenvalue is a root of the p m ( x ) ,and due to d e t ( A ) = 1 the only possibility is a reflection about a line because the eigenvalues will be 1, -1 and -1 and because A is symmetric and therefore in this case A is an orthogonal matrix.
Log in to reply
Yes! (+1) I added a brief solution also.
you are right we must state that A is symmetric. And by Weierstrass, it is diagonalizable by orthonormal transformation.
Then the two solutions stand.
I'll update the solutions.
Being both orthogonal and symmetric, A must be a reflection as it is orthogonally diagonalizable with eigenvalues 1 and − 1 . Since the trace of A is − 1 , the eigenvalues are 1 , − 1 , − 1 , so that we have a reflection about a line.
Problem Loading...
Note Loading...
Set Loading...
Let A be the matrix and I the identity matrix
A is symmetric, so it is diagonalisable by orthonormal transformation.
Solution 1 d e t ( A − λ ∗ I ) = − λ 3 − λ 2 + λ + 1 = − ( λ + 1 ) 2 ( λ − 1 )
Solution 2 d e t ( A ) = 1 a n d A ∗ A = I
so the eigenvalues are either 1 or -1, with the product of 1.
the solution 1, 1, 1 imply A = I
We are left with 1, -1, -1