Coordinate Transformation Matrix

Relevant parts to questions...

  • Using (forward) and (inverse).
  • Using to read off entries from two bases.
  • Using orthogonality to cancel pairs of s into a Kronecker Delta.
  • Using and to sanity-check .

The Coordinate Transformation Matrix (or rotation matrix) encodes a rigid rotation between two orthonormal bases and . Its entries are defined as the dot products of new and old basis vectors:

Equivalently, is the cosine of the angle between and . Because every coordinate is just a dot product of the position vector with a basis vector (), the same matrix transforms coordinates:

In 2D, rotating the axes by an angle gives the familiar form:

Properties

Because represents a rotation, it has the following tightly-linked properties:

  • Orthogonal::, so ; in suffix form, .
  • Unit determinant:: (a rigid rotation neither scales nor reflects).
  • Inverse is a rotation by ::the new-to-old transform is just the transpose, i.e., .
  • Each expands as ::the rows of are the coefficients of the new basis in terms of the old.

Applications

  1. Transforming coordinates, using forward and backward.
  2. Transforming vectors, via (the defining property of a vector).
  3. Transforming higher-rank objects, with one factor of per free index; e.g., for a rank-2 Tensor Transformation Rule.
  4. Deriving the Jacobian:: and , which bridges index calculus and rotations.

Example

Given the orthonormal basis and a new basis , , rotated about by , read off to get . The point transforms to .

Rotation matrix in, tensor transformation out.