Euler's theorem (rotation): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Paul Wormer
imported>Paul Wormer
Line 16: Line 16:
The matrix with positive determinant is a proper rotation and with a negative determinant  an improper rotation (is equal to a reflection times a proper rotation).
The matrix with positive determinant is a proper rotation and with a negative determinant  an improper rotation (is equal to a reflection times a proper rotation).


Observe that a rotation matrix '''R''' has at least one invariant vector '''n''', i.e., '''R''' '''n''' = '''n'''. If '''R''' has more than one invariant vector then '''R''' = '''E'''  and ''any'' vector is an invariant vector. Note that this is equivalent to stating that the vector '''n''' is an [[eigenvector]] of the matrix '''R'''  with  eigenvalue λ = 1.  
It will now be shown  that a rotation matrix '''R''' has at least one invariant vector '''n''', i.e., '''R''' '''n''' = '''n'''. If '''R''' has more than one invariant vector then '''R''' = '''E'''  and ''any'' vector is an invariant vector. Note that this is equivalent to stating that the vector '''n''' is an [[eigenvector]] of the matrix '''R'''  with  eigenvalue λ = 1.  


It is easy to show that the proper rotation matrix '''R''' has unit eigenvalue. Using
A proper rotation matrix '''R''' has at least one unit eigenvalue. Using
:<math>
:<math>
\det(-\mathbf{R}) = (-1)^3 \det(\mathbf{R}) = - \det(\mathbf{R})
\det(-\mathbf{R}) = (-1)^3 \det(\mathbf{R}) = - \det(\mathbf{R})
Line 33: Line 33:
\end{align}
\end{align}
</math>
</math>
From this follows that &lambda;=1 is a solution of the [[secular equation]], that is,
From this follows that &lambda; = 1 is a solution of the [[secular equation]], that is,
:<math>
:<math>
\det(\mathbf{R}  - \lambda \mathbf{E}) = 0\quad \hbox{for}\quad \lambda=1.
\det(\mathbf{R}  - \lambda \mathbf{E}) = 0\quad \hbox{for}\quad \lambda=1.
</math>
</math>
 
In other words, the matrix '''R''' &minus; '''E''' is singular and has a non-zero [[kernel]], that is, there is at least one non-zero vector, say '''n''', for which
In [[linear algebra]]  the general result is proved that an ''m''&times;''m'' matrix '''A''' has ''m'' orthogonal eigenvectors if and only if it is normal, that is, if '''A'''<sup>T</sup>'''A''' = <b>A</b>'''A'''<sup>T</sup>.  Clearly, a rotation matrix being normal, the  solution &lambda; = 1 belongs to an eigenvector that is a member of an orthogonal set of order three. Call the eigenvector '''n''', then '''R''' '''n''' = '''n'''. The line &mu;<b>n</b> for real &mu; is invariant under '''R''', i.e, &mu;<b>n</b>  is a rotation axis. This proves Euler's theorem.
:<math>
(\mathbf{R} - \mathbf{E}) \mathbf{n} = \mathbf{0} \quad \Longleftrightarrow \quad \mathbf{R}\mathbf{n} =  \mathbf{n}
</math>
<!--
In [[linear algebra]]  the general result is proved that an ''m''&times;''m'' matrix '''A''' has ''m'' orthogonal eigenvectors if and only if it is normal, that is, if '''A'''<sup>T</sup>'''A''' = <b>A</b>'''A'''<sup>T</sup>.  Clearly, a rotation matrix being normal, the  solution &lambda; = 1 belongs to an eigenvector that is a member of an orthogonal set of order three. Call the eigenvector '''n''', then '''R''' '''n''' = '''n'''.
-->
The line &mu;<b>n</b> for real &mu; is invariant under '''R''', i.e, &mu;<b>n</b>  is a rotation axis. This proves Euler's theorem.

Revision as of 04:53, 13 May 2009

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In mathematics, Euler's theorem for rotations states that a rotation of a three-dimensional rigid body (a motion of the rigid body that leaves at least one point of the body in place) is around an axis, the rotation axis. This means that all points of the body that lie on the axis are invariant under rotation, i.e., do not move.

Proof

Leonhard Euler gave a geometric proof that rests on the fact that a rotation can be described as two consecutive reflections in two intersecting mirror planes. Points in a mirror plane are invariant under reflection and hence the points on the intersection (a line) of the two planes are invariant under the two consecutive reflections and hence under rotation.

An algebraic proof starts from the fact that a rotation is a linear map in one-to-one correspondence with a 3×3 orthogonal matrix R, i.e, a matrix for which

where E is the 3×3 identity matrix and superscript T indicates the transposed matrix. Clearly an orthogonal matrix has determinant ±1, for invoking some properties of determinants, one can prove

The matrix with positive determinant is a proper rotation and with a negative determinant an improper rotation (is equal to a reflection times a proper rotation).

It will now be shown that a rotation matrix R has at least one invariant vector n, i.e., R n = n. If R has more than one invariant vector then R = E and any vector is an invariant vector. Note that this is equivalent to stating that the vector n is an eigenvector of the matrix R with eigenvalue λ = 1.

A proper rotation matrix R has at least one unit eigenvalue. Using

we find

From this follows that λ = 1 is a solution of the secular equation, that is,

In other words, the matrix RE is singular and has a non-zero kernel, that is, there is at least one non-zero vector, say n, for which

The line μn for real μ is invariant under R, i.e, μn is a rotation axis. This proves Euler's theorem.