Linear transformation definition, properties, and operational rules

Introduction

Linear transformations are fundamental constructs in linear algebra, providing a way to describe how vectors in a vector space are transformed under certain operations. These transformations preserve the structure of vector spaces, including addition and scalar multiplication, making them essential tools in the study of linear systems, geometry, and applied mathematics. A linear transformation can be represented by a matrix, which allows for the analysis of its behavior through matrix operations. This article explores the formal definition of linear transformations, their key properties, and the operational rules governing their composition and application.

Definition of Linear Transformation

A linear transformation is a function $ T: V \rightarrow W $ between two vector spaces $ V $ and $ W $ over the same field $ \mathbb{F} $ that satisfies the following two properties:

Additivity: For all vectors $ \mathbf{u}, \mathbf{v} \in V $, $ T(\mathbf{u} + \mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v}) $.
Homogeneity: For all scalars $ \alpha \in \mathbb{F} $ and all vectors $ \mathbf{u} \in V $, $ T(\alpha \mathbf{u}) = \alpha T(\mathbf{u}) $.

These properties ensure that linear transformations preserve the linear structure of vector spaces, allowing for the study of transformations that map one space to another while maintaining linearity. The matrix representation of a linear transformation is constructed by assigning a basis to $ V $ and $ W $, and the transformation is expressed as a matrix $ A \in \mathbb{F}^{m \times n} $, where $ m $ and $ n $ are the dimensions of $ W $ and $ V $, respectively.

Key Properties of Linear Transformations

Linear transformations possess several critical properties that govern their behavior and utility:

1. Linearity

As defined above, linear transformations are inherently linear, meaning they preserve both vector addition and scalar multiplication. This property ensures that the transformation's effect on vectors is consistent with the underlying vector space structure.

2. Bilinearity and Invariance

While linear transformations are not inherently bilinear, they maintain invariance under certain operations. For example, the transformation of a sum of vectors is the sum of their transformations, and the transformation of a scalar multiple of a vector is the scalar multiple of the transformed vector.

3. Invertibility

A linear transformation $ T: V \rightarrow W $ is invertible if and only if it is bijective (both injective and surjective). This is equivalent to the determinant of the matrix representing $ T $ being non-zero. Invertibility ensures that the transformation has a unique inverse, which is crucial in solving systems of linear equations and analyzing the structure of vector spaces.

4. Eigenvalues and Eigenvectors

Linear transformations can be analyzed through eigenvalues and eigenvectors, which describe the behavior of the transformation in its own right. An eigenvalue $ \lambda \in \mathbb{F} $ and corresponding eigenvector $ \mathbf{v} \in V $ satisfy $ T(\mathbf{v}) = \lambda \mathbf{v} $. These concepts are pivotal in understanding the diagonalizability of matrices and the stability of linear systems.

5. Kernel and Image

The kernel of a linear transformation $ T $, denoted $ \ker(T) $, is the set of all vectors $ \mathbf{v} \in V $ such that $ T(\mathbf{v}) = \mathbf{0} $. The image of $ T $, denoted $ \text{im}(T) $, is the set of all vectors $ \mathbf{w} \in W $ such that $ \mathbf{w} = T(\mathbf{v}) $ for some $ \mathbf{v} \in V $. The kernel and image are closely related to the rank-nullity theorem, which states that $ \dim(\ker(T)) + \dim(\text{im}(T)) = \dim(V) $.

6. Transpose and Adjoint

The transpose of a linear transformation $ T $, denoted $ T^T $, is a transformation that maps $ W $ to $ V $ and satisfies $ T^T(\mathbf{w}) = \mathbf{v} $ if $ T(\mathbf{v}) = \mathbf{w} $. The adjoint of $ T $, denoted $ T^* $, is a more complex concept that involves inner product spaces and is essential in the study of self-adjoint operators.

Operational Rules of Linear Transformations

Linear transformations are often composed through matrix multiplication, and their operational rules are governed by the following principles:

1. Composition of Transformations

If $ T: V \rightarrow W $ and $ S: W \rightarrow U $ are linear transformations, their composition $ S \circ T: V \rightarrow U $ is also a linear transformation. The matrix representation of $ S \circ T $ is the product of the matrices representing $ S $ and $ T $ in the respective bases.

2. Matrix Multiplication

Given a linear transformation $ T: \mathbb{R}^n \rightarrow \mathbb{R}^m $ represented by the matrix $ A \in \mathbb{R}^{m \times n} $, the transformation of a vector $ \mathbf{x} \in \mathbb{R}^n $ is given by $ T(\mathbf{x}) = A\mathbf{x} $. Matrix multiplication is associative, and the identity matrix $ I $ acts as the multiplicative identity for matrices.

3. Scalar Multiplication

A linear transformation $ T $ can be scaled by a scalar $ \alpha \in \mathbb{F} $ to produce a new transformation $ \alpha T $, which maps $ V $ to $ W $ and satisfies $ \alpha T(\mathbf{v}) = \alpha