Reflect And Transform

Geometry Level 4

A = 1 9 [ 1 8 4 8 1 4 4 4 7 ] A=\frac{1}{9}\begin{bmatrix}-1 & 8 &4\\8 & -1 & 4\\4 & 4 & -7\end{bmatrix}

What kind of a transformation of R 3 \mathbb{R}^3 does A A represent?

None of the others Orthogonal Projection onto a plane Reflection about a line Reflection about a plane Rotation through an angle 0 < θ < π 0<\theta<\pi

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.

2 solutions

Abdelhamid Saadi
Mar 17, 2016

Let A A be the matrix and I I the identity matrix

A A is symmetric, so it is diagonalisable by orthonormal transformation.

Solution 1 d e t ( A λ I ) = λ 3 λ 2 + λ + 1 = ( λ + 1 ) 2 ( λ 1 ) det(A - \lambda *I) =- \lambda^3 - \lambda^2 + \lambda + 1 = -( \lambda + 1)^2( \lambda -1)

Solution 2 d e t ( A ) = 1 a n d A A = I det(A) = 1 \quad and \quad A*A = I

so the eigenvalues are either 1 or -1, with the product of 1.

the solution 1, 1, 1 imply A = I A = I

We are left with 1, -1, -1

A transformation with eigenvalues 1 , 1 , 1 1,-1,-1 is not necessarily a reflection about a line.

Otto Bretscher - 5 years, 2 months ago

Log in to reply

even if it's orthogonal.

Abdelhamid Saadi - 5 years, 2 months ago

Log in to reply

Yes indeed, the matrix needs to be orthogonal.

Finding the eigenvalues is tedious... is there a quicker way?

Otto Bretscher - 5 years, 2 months ago

Log in to reply

@Otto Bretscher Not that tedious.

Let A A be the matrix and I I the identity matrix

Solution 1 d e t ( A λ I ) = λ 3 λ 2 + λ + 1 = ( λ + 1 ) 2 ( λ 1 ) det(A - \lambda *I) =- \lambda^3 - \lambda^2 + \lambda + 1 = -( \lambda + 1)^2( \lambda -1)

Solution 2 d e t ( A ) = 1 a n d A A = I det(A) = 1 \quad and \quad A*A = I

so the eigenvalues are either 1 or -1, with the product of 1.

the solution 1, 1, 1 imply A = I A = I

We are left with 1, -1, -1

Abdelhamid Saadi - 5 years, 2 months ago

Log in to reply

@Abdelhamid Saadi I like Solution 2!

It's worth pointing out that matrix A A is symmetric ; any matrix that is both orthogonal and symmetric represents a reflection.

Otto Bretscher - 5 years, 2 months ago

@Otto Bretscher Can someone pls explain what R^3 means here??

Milind Blaze - 5 years, 2 months ago

Log in to reply

@Milind Blaze R 3 \mathbb{R}^3 is the set of all triples of real numbers, written as column vectors, [ x y z ] \begin{bmatrix} x \\ y \\ z \end{bmatrix}

Otto Bretscher - 5 years, 2 months ago

Log in to reply

@Otto Bretscher Ok... thanks!

Milind Blaze - 5 years, 2 months ago

solution 2 is very brilliant if you add A A is symmetric, nevertheless solution 1 is not a solution. One matrix A A is able to have to d e t ( A λ I ) = ( λ + 1 ) 2 ( λ 1 ) det(A - \lambda * I) = - (\lambda + 1)^2(\lambda - 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 A^2 - I = 0 it implies that its minimum polynomial p m ( x ) is ( x 1 ) or ( x + 1 ) or ( x 1 ) ( x + 1 ) p_m (x) \text{ is } (x - 1) \text{ or } (x + 1) \text { or } (x -1)(x + 1) . The two first cases doesn't work for A A , so p m ( x ) = ( x 1 ) ( x + 1 ) p_m (x) = (x - 1)(x + 1) \Rightarrow the matrix A 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 ) p_m (x) ,and due to d e t ( A ) = 1 det(A) = 1 the only possibility is a reflection about a line because the eigenvalues will be 1, -1 and -1 and because A A is symmetric and therefore in this case A A is an orthogonal matrix.

Guillermo Templado - 5 years, 2 months ago

Log in to reply

Yes! (+1) I added a brief solution also.

Otto Bretscher - 5 years, 2 months ago

you are right we must state that A A is symmetric. And by Weierstrass, it is diagonalizable by orthonormal transformation.

Then the two solutions stand.

I'll update the solutions.

Abdelhamid Saadi - 5 years, 2 months ago
Otto Bretscher
Mar 25, 2016

Being both orthogonal and symmetric, A A must be a reflection as it is orthogonally diagonalizable with eigenvalues 1 and 1 -1 . Since the trace of A A is 1 -1 , the eigenvalues are 1 , 1 , 1 1,-1,-1 , so that we have a reflection about a line.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...