2.3 Matrices and Linear Transformations

Matrices and linear transformations are key concepts in linear algebra, crucial for understanding coding theory. They provide a powerful framework for representing and manipulating data, allowing us to solve complex problems efficiently.

Eigenvalues and eigenvectors are essential tools for analyzing matrices and their properties. They help us understand how matrices transform space and are widely used in various applications, including data compression and error correction in coding theory.

Matrix Fundamentals

Matrix Basics

• A matrix is a rectangular array of numbers arranged in rows and columns
  • Denoted by a capital letter such as $A$ or $B$
  • Elements of a matrix are denoted by lowercase letters with subscripts indicating their position ($a_{ij}$ represents the element in the $i$-th row and $j$-th column)
  • The size of a matrix is described by the number of rows and columns it contains ($m \times n$ matrix has $m$ rows and $n$ columns)
• The main diagonal of a square matrix consists of elements where the row and column indices are equal ($a_{11}, a_{22}, \ldots, a_{nn}$)
• A matrix is symmetric if it is equal to its transpose ($A = A^T$)
  • The transpose of a matrix is obtained by interchanging its rows and columns

Matrix Operations

• Matrix multiplication is a binary operation that produces a matrix from two matrices
  • For matrices $A$ and $B$ to be multiplied, the number of columns in $A$ must equal the number of rows in $B$
  • The resulting matrix $C = AB$ has the same number of rows as $A$ and the same number of columns as $B$
  • Each element $c_{ij}$ of the product matrix is calculated by multiplying the elements of the $i$-th row of $A$ with the corresponding elements of the $j$-th column of $B$ and summing the results
• The inverse of a square matrix $A$ is denoted as $A^{-1}$ and satisfies the property $AA^{-1} = A^{-1}A = I$, where $I$ is the identity matrix
  • Not all matrices have an inverse; matrices without an inverse are called singular or degenerate
  • The inverse of a 2x2 matrix $\begin{pmatrix} a & b \\ c & d \end{pmatrix}$ is given by $\frac{1}{ad-bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}$, provided that $ad-bc \neq 0$
• The determinant of a square matrix is a scalar value that provides information about the matrix's properties
  • Denoted as $\det(A)$ or $|A|$
  • For a 2x2 matrix $\begin{pmatrix} a & b \\ c & d \end{pmatrix}$, the determinant is calculated as $ad-bc$
  • A matrix is invertible if and only if its determinant is non-zero

Linear Transformations

Basics of Linear Transformations

• A linear transformation is a function $T: V \to W$ between two vector spaces $V$ and $W$ that satisfies the following properties:
  • Additivity: $T(u + v) = T(u) + T(v)$ for all $u, v \in V$
  • Homogeneity: $T(cu) = cT(u)$ for all $u \in V$ and scalar $c$
• Linear transformations preserve the vector space structure and can be represented by matrices
  • For a linear transformation $T: \mathbb{R}^n \to \mathbb{R}^m$, there exists an $m \times n$ matrix $A$ such that $T(x) = Ax$ for all $x \in \mathbb{R}^n$
• The kernel (or null space) of a linear transformation $T$ is the set of all vectors $x$ in the domain such that $T(x) = 0$
  • $\ker(T) = \{x \in V : T(x) = 0\}$

Rank and Nullity

• The rank of a matrix $A$ is the dimension of the vector space spanned by its columns (column space)
  • Denoted as $\rank(A)$
  • The rank is equal to the maximum number of linearly independent columns or rows in the matrix
• The nullity of a matrix $A$ is the dimension of its null space (kernel)
  • Denoted as $\nullity(A)$
  • The nullity is equal to the number of free variables in the solution of the homogeneous system $Ax = 0$
• The rank-nullity theorem states that for a linear transformation $T: V \to W$, the dimension of the domain $V$ is equal to the sum of the rank and nullity of $T$
  • $\dim(V) = \rank(T) + \nullity(T)$

Eigenvalues and Eigenvectors

Eigenvalue Basics

• An eigenvalue of a square matrix $A$ is a scalar $\lambda$ such that there exists a non-zero vector $v$ satisfying $Av = \lambda v$
  • The vector $v$ is called an eigenvector corresponding to the eigenvalue $\lambda$
  • Eigenvalues are the roots of the characteristic polynomial $p(\lambda) = \det(A - \lambda I)$
• To find the eigenvalues of a matrix $A$, solve the characteristic equation $\det(A - \lambda I) = 0$
  • For a 2x2 matrix $\begin{pmatrix} a & b \\ c & d \end{pmatrix}$, the characteristic equation is $(\lambda - a)(\lambda - d) - bc = 0$
• The set of all eigenvalues of a matrix is called its spectrum

Eigenvector Basics

• An eigenvector of a square matrix $A$ corresponding to an eigenvalue $\lambda$ is a non-zero vector $v$ that satisfies $Av = \lambda v$
  • Eigenvectors are only defined up to a scalar multiple; if $v$ is an eigenvector, then so is $cv$ for any non-zero scalar $c$
• To find the eigenvectors corresponding to an eigenvalue $\lambda$, solve the equation $(A - \lambda I)v = 0$
  • The solution set of this equation is the eigenspace corresponding to $\lambda$
  • The dimension of the eigenspace is called the geometric multiplicity of the eigenvalue
• Eigenvectors corresponding to distinct eigenvalues are linearly independent
• A matrix is diagonalizable if it has a full set of linearly independent eigenvectors
  • A diagonalizable matrix $A$ can be written as $A = PDP^{-1}$, where $D$ is a diagonal matrix with the eigenvalues on its diagonal, and $P$ is a matrix whose columns are the corresponding eigenvectors