Rotations in 
Consider a real 3×3 matrix R with columns
r1, r2, r3,
i.e.,
.
The matrix R is orthogonal if

The matrix R is a proper rotation matrix, if it is
orthogonal and if r1, r2,
r3 form a right-handed set, i.e.,

Here the symbol × indicates a
cross product and
is the
antisymmetric Levi-Civita symbol,

and
if two or more indices are equal.
The matrix R is an improper rotation matrix if
its column vectors form a left-handed set, i.e.,

The last two equations can be condensed into one equation

by virtue of the the fact that
the determinant of a proper rotation matrix is 1 and of an improper
rotation −1. This can be proved as follows:
The determinant of a 3×3 matrix with column vectors a,
b, and c can be written as
.
Remember that for a proper rotation
the columns of R are orthonormal and satisfy,

Likewise the determinant is −1 for an improper rotation, which ends the
proof.
Theorem
A proper rotation matrix R can be
factorized thus

which is referred to as the z-y-x parametrization,
or also as

the z-y-z Euler parametrization.
Here

Proof
First the z-y-x-parametrization will be proved by describing an
algorithm for the factorization of R.
Consider to that end

Note that the multiplication by
Rx(ω1) on the right
does not affect the first column, so that r1 =
a1.
Solve
and
from the first column of
R,

This is possible. First solve
for
from

Then solve
for
from

This determines the vectors a2 and
a3.
Since a1, a2 and
a3 are the columns of a
proper rotation matrix they form an orthonormal
right-handed
system. The plane spanned by a2 and
a3 is orthogonal to
and hence contains
and
. Thus,

Since
are
known unit vectors we can compute

These equations give
with
.
Augment the matrix to
, then

This concludes the proof of the z-y-x parametrization.