Definition and Properties of the Image and Kernel of a Linear Transformation

Introduction

In linear algebra, a linear transformation is a function between two vector spaces that preserves vector addition and scalar multiplication. Such transformations are fundamental in understanding the structure of vector spaces and their relationships. The image of a linear transformation, often denoted as $ \text{Im}(T) $, is the set of all output vectors generated by applying the transformation to elements of the domain. Conversely, the kernel (or null space) of a linear transformation, denoted $ \ker(T) $, consists of all vectors in the domain that are mapped to the zero vector. These concepts are critical for analyzing the behavior of linear transformations, determining their invertibility, and understanding their geometric interpretations.

Definition of the Image

The image of a linear transformation $ T: V \rightarrow W $ is defined as the set of all vectors $ w \in W $ such that $ w = T(v) $ for some $ v \in V $. Formally,
$$ \text{Im}(T) = { T(v) \mid v \in V }. $$
This set is a subspace of $ W $, as it is closed under vector addition and scalar multiplication. The image is also referred to as the range of $ T $, and its dimension is called the rank of $ T $. For example, consider the transformation $ T: \mathbb{R}^2 \rightarrow \mathbb{R}^2 $ defined by
$$ T\begin{pmatrix} x \ y \end{pmatrix} = \begin{pmatrix} 2x + 3y \ 4x - y \end{pmatrix}. $$
The image of $ T $ is the entire space $ \mathbb{R}^2 $, indicating that $ T $ is surjective.

Definition of the Kernel

The kernel of a linear transformation $ T: V \rightarrow W $ is the set of all vectors $ v \in V $ such that $ T(v) = 0 $. Formally,
$$ \ker(T) = { v \in V \mid T(v) = 0 }. $$
The kernel is a subspace of $ V $, and its dimension is denoted $ \dim(\ker(T)) $. A transformation $ T $ is said to be invertible if and only if its kernel is trivial (i.e., contains only the zero vector), which implies that $ \ker(T) = {0} $.

Properties of the Image

A key property of the image is its subspace nature: if $ T $ is linear, then $ \text{Im}(T) $ is a subspace of $ W $. This follows from the linearity of $ T $, as the image is closed under addition and scalar multiplication. Additionally, the rank-nullity theorem relates the dimensions of the image and kernel to the dimensions of the domain and codomain:
$$ \dim(\ker(T)) + \dim(\text{Im}(T)) = \dim(V). $$
This theorem provides a powerful tool for analyzing the structure of linear transformations. For instance, if $ \dim(\ker(T)) = 0 $, then $ \dim(\text{Im}(T)) = \dim(V) $, indicating that $ T $ is surjective. Conversely, if $ \dim(\text{Im}(T)) < \dim(V) $, the kernel must be non-trivial.

Properties of the Kernel

The kernel's properties are closely tied to the invertibility of a linear transformation. A transformation $ T $ is injective (one-to-one) if and only if $ \ker(T) = {0} $. Injectivity ensures that distinct vectors in the domain are mapped to distinct vectors in the codomain, preserving uniqueness. However, injectivity does not necessarily imply surjectivity, as the domain and codomain may have different dimensions.

The kernel's dimension is also influenced by the transformation's structure. For example, consider a linear transformation $ T: \mathbb{R}^3 \rightarrow \mathbb{R}^2 $ with $ \dim(\ker(T)) = 1 $. This implies that $ \dim(\text{Im}(T)) = 2 $, as $ \dim(\mathbb{R}^3) = 3 $, and $ 1 + 2 = 3 $. Such transformations are called sinks in the context of linear systems, as they represent vectors that are "absorbed" by the transformation.

Rank-Nullity Theorem

The rank-nullity theorem is a cornerstone of linear algebra, encapsulating the relationship between the dimensions of the image, kernel, and domain of a linear transformation. It states that for a linear transformation $ T: V \rightarrow W $, the following holds:
$$ \dim(\ker(T)) + \dim(\text{Im}(T)) = \dim(V). $$
This theorem is instrumental in determining the behavior of linear transformations. For instance, if $ \dim(\ker(T)) = 0 $, the transformation is injective and surjective, making it invertible. Conversely, if $ \dim(\ker(T)) > 0 $, the transformation is not injective, and its image is a proper subspace of $ W $.

Applications and Examples

The image and kernel of linear transformations find applications in various areas of mathematics and engineering. In systems theory, the kernel of a transformation represents the set of inputs that produce the zero output, while the image captures the outputs of all possible inputs. In data science, linear transformations are used to model relationships between variables, with the image representing the range of possible outputs and the kernel capturing the dependencies among inputs.

Consider the transformation $ T: \mathbb{R}^2 \rightarrow \mathbb{R}^2 $ defined by
$$ T\begin{pmatrix} x \ y \end{pmatrix} = \begin{pmatrix} x + 2y \ 3x - y \end{pmatrix}. $$
Here, the kernel is the set of solutions to the system $ x + 2y = 0 $ and $ 3x - y = 0 $, which simplifies to $ x = -2y $. Thus, the kernel is one-dimensional, and the image is two-dimensional, confirming the rank-nullity theorem. This example illustrates how the kernel and image interact to determine the transformation's properties.

Conclusion

The image and kernel of a linear transformation are foundational concepts in linear algebra, providing insights into the structure and behavior of transformations. The image, being a subspace of the codomain, reflects the range of possible outputs, while the kernel captures the set of inputs that map to the zero vector. The rank-nullity theorem elegantly connects the dimensions of these subspaces to the domain's dimension, offering a powerful framework for analyzing invertibility and surjectivity. Understanding these concepts is essential for advanced studies in linear algebra, differential equations, and computational mathematics. By examining specific examples and applying the theorem, mathematicians can gain a comprehensive understanding of how linear transformations operate within vector