91Ó°ÊÓ

A matrix transpose is essentially flipping a matrix over its diagonal, which means you switch the matrix's row and column indices. If you have a matrix \( M \), its transpose is denoted as \( M^T \). In simpler terms, the transpose of a matrix involves switching \( M[i,j] \) with \( M[j,i] \). Transposing is straightforward and has several properties that make it very useful, especially when working with orthogonal matrices.

• Transposing twice returns the original matrix: \( (M^T)^T = M \).
• The transpose of a product of two matrices is the product of their transposes in reverse order: \( (AB)^T = B^T A^T \).
• Scalar multiples and addends can be transposed: \( (cA + B)^T = cA^T + B^T \), where \( c \) is a constant.

In the context of orthogonal matrices, the transpose has an additional property. It is equal to the inverse of the matrix, which is an essential aspect of the solution to our exercise.

The inverse of a matrix is an important concept in linear algebra, analogous to finding a reciprocal for a number. For a square matrix \( M \), its inverse, denoted \( M^{-1} \), satisfies the equation \( M M^{-1} = M^{-1} M = I \), where \( I \) is the identity matrix. Not all matrices have an inverse, but when they do, they are called invertible or non-singular.

• For a matrix to be invertible, it must be square (same number of rows and columns) and have a non-zero determinant.
• The inverse is unique if it exists, meaning there's only one inverse for a matrix.

Orthogonal matrices have a special relationship regarding their inverses. Specifically, for an orthogonal matrix \( Q \), the transpose is its own inverse, i.e., \( Q^{-1} = Q^T \). This property is fundamental in simplifying computations in the given exercise.

The identity matrix, usually denoted by \( I \), is a square matrix with ones on the diagonal and zeros elsewhere. It acts as the neutral element in matrix multiplication, similar to how multiplying a number by one leaves it unchanged. \( I \) satisfies the property that for any square matrix \( A \), the products \( AI \) and \( IA \) return \( A \) itself.

• The size of \( I \) is paramount: it must match the dimensions of the matrix being multiplied for the properties above to hold.
• The identity matrix is crucial in defining the inverse: if \( M M^{-1} = I \), then \( M^{-1} \) is the inverse of \( M \).

In our orthogonal matrix context, the identity matrix is used to validate that a matrix multiplied by its inverse results in identity, further proving properties like orthogonality. The utilization of identity matrices simplifies the verification of mathematical properties, as seen in the exercise solution when assembling \( C^{-1} C = I \).

Matrix multiplication involves taking rows from the first matrix and multiplying them by columns from the second matrix. Given two matrices \( A \) and \( B \), with appropriate dimensions for multiplication, the product \( AB \) is calculated by multiplying corresponding entries of the row of \( A \) and the column of \( B \), and summing them up.

• The product \( AB \) is possible only if the number of columns in \( A \) equals the number of rows in \( B \).
• Matrix multiplication is associative and distributive but not commutative: \( AB eq BA \) in general.
• Orthogonal matrices maintain orthogonality under multiplication if both are orthogonal; this flows from their definition that \( M^T M = I \).

The concept of matrix multiplication is pivotal in the exercise you've seen, particularly in combining the orthogonal matrices and verifying the resultant matrix's properties. Correct computation of \( C^{-1} A C \) depends on adhering to these rules and recognizing simplifications afforded by the matrices' orthogonality.