91Ó°ÊÓ

The transpose of a matrix is an important concept in linear algebra. It involves flipping a matrix over its diagonal, effectively swapping its rows with its columns. For a given matrix \(A\), the transpose is denoted as \(A^T\). This means that the element in the i-th row and j-th column of \(A\) becomes the element in the j-th row and i-th column of \(A^T\).

For example, let's take a 2x3 matrix:

• Original Matrix: \( A = \begin{bmatrix} 1 & 2 & 3 \ 4 & 5 & 6 \end{bmatrix} \)
• Transpose: \( A^T = \begin{bmatrix} 1 & 4 \ 2 & 5 \ 3 & 6 \end{bmatrix} \)

A key property is that transposing twice returns the matrix to its original form: \((A^T)^T = A\). Transpose operations are fundamental in many calculations and proofs, such as demonstrating properties of orthogonal matrices.

The inverse of a matrix is akin to a reciprocal for numbers. For a square matrix \( A \), its inverse, denoted \( A^{-1} \), is such that the product \( AA^{-1} = A^{-1}A = I \), where \( I \) is the identity matrix. Not every matrix has an inverse; a matrix must be square and non-singular (determinant not zero) to possess one.

Calculating the inverse involves more complex computations, often including row operations or the use of determinants and adjugates. Matrix inverses are critical in solving systems of linear equations, especially when using methods like the matrix equation \( AX = B \), where \( X = A^{-1}B \).

To illustrate, if \( A = \begin{bmatrix} a & b \ c & d \end{bmatrix} \), then its inverse \( A^{-1} \) can be expressed as:

• \( A^{-1} = \frac{1}{ad-bc} \begin{bmatrix} d & -b \ -c & a \end{bmatrix} \)

This computation is only possible when \( ad-bc eq 0 \). Understanding inverses is crucial for grasping the nature of orthogonal matrices, as their transpose is their inverse.

An identity matrix is a special type of square matrix that serves as the multiplicative identity in matrix algebra. This means that for any matrix \( A \) of appropriate dimensions, multiplying by the identity matrix \( I \) results in \( A \) itself: \( AI = IA = A \). The identity matrix is denoted by \( I \) and is characterized by having ones on the diagonal and zeros elsewhere.

For example, a 3x3 identity matrix looks like this:

• \( I = \begin{bmatrix} 1 & 0 & 0 \ 0 & 1 & 0 \ 0 & 0 & 1 \end{bmatrix} \)

The identity matrix plays a vital role in various matrix operations, including verifying the orthogonality of matrices. Specifically, for an orthogonal matrix \( A \), the property \( A^TA = I \) is essential, as it relates the transpose to the identity matrix, demonstrating that \( A^T \) is the inverse of \( A \).

Matrix multiplication is a process that pairs rows of the first matrix with columns of the second. If matrix \( A \) is of size \( m \times n \) and matrix \( B \) is \( n \times p \), the resulting matrix, \( AB \), is \( m \times p \).

The multiplication is performed by taking the dot product of rows of \( A \) with the columns of \( B \). For example, if \( A \) and \( B \) are such that:

• \(A = \begin{bmatrix} a & b \ c & d \end{bmatrix} \)
• \(B = \begin{bmatrix} e & f \ g & h \end{bmatrix} \)

Then, \( AB = \begin{bmatrix} ae + bg & af + bh \ ce + dg & cf + dh \end{bmatrix} \)

Matrix multiplication is not commutative, meaning that in general, \(AB eq BA\). However, for orthogonal matrices, the property \( A^TA = I \) shows a special type of multiplication where the result is the identity matrix. This underlines the significance of matrix multiplication in proving matrix properties and solutions.