91Ó°ÊÓ

Coordinate transformation is a fundamental concept in mathematics, particularly in linear algebra, involving changing vector expressions from one basis to another. In our context, we are given two different bases, \( \mathcal{B} \) and \( \mathcal{C} \), for the vector space \( \mathbb{R}^2 \). The goal is to express any vector that is originally defined in terms of the basis \( \mathcal{B} \) in terms of the basis \( \mathcal{C} \).

This is done by constructing a change-of-coordinates matrix, which essentially acts as a bridge between two different perspectives of looking at the vector space. The process involves:

• Finding how each basis vector in \( \mathcal{B} \) can be written as a linear combination of the basis vectors in \( \mathcal{C} \).
• Setting up systems of linear equations derived from these linear combinations.
• Solving these systems to find the coefficients which form the columns of the change-of-coordinates matrix.

By successfully transforming coordinates, you can effectively manipulate vectors for various applications, such as in physics for transforming between different reference frames.

Linear transformations are functions between vector spaces that preserve vector addition and scalar multiplication. In the context of changing coordinates from one basis to another, a linear transformation handles the translation of vectors in such a way that the structural properties of the vector space remain intact.

When expressing vectors in a new basis, each basis transformation can be viewed as a linear transformation. If you have a matrix \( P_{\mathcal{C} \leftarrow \mathcal{B}} \) that describes this transition, applying this matrix to any vector from the original basis \( \mathcal{B} \) will give you the coordinates of this vector in the new basis \( \mathcal{C} \).

Some key properties of linear transformations include:

• Preservation of the origin – the zero vector maps to the zero vector.
• Preservation of linear structures – lines remain lines, and planes remain planes.
• Continuity – small changes in the input lead to small changes in the output.

Understanding linear transformations is crucial for managing complex systems that involve rotations, reflection, or scaling of entire coordinate systems, often found in computer graphics and engineering.

Matrix inversion is a mathematical operation that finds another matrix which, when multiplied with the original matrix, results in the identity matrix. This concept is critical when dealing with change-of-basis problems because once you have a change-of-coordinates matrix, you can calculate its inverse to switch back to the original basis.

To find the inverse of a matrix, several methods can be used, including:

• Gauss-Jordan elimination – transforming the matrix into an identity matrix using row operations.
• Using determinants – applicable for 2x2 matrices, where the inverse of a matrix \( \begin{bmatrix} a & b \ c & d \end{bmatrix} \) is \( \frac{1}{ad-bc} \begin{bmatrix} d & -b \ -c & a \end{bmatrix} \) if \( ad-bc eq 0 \).
• Matrix adjugate and determinant method – calculating the inverse based on cofactor matrices and determinants.

Determining the inverse matrix effectively allows the conversion back and forth between bases, providing full flexibility in coordinate transformations.