A **linear transformation**, often referred to as a **homomorphism** in the context of abstract algebra, is a mapping between two vector spaces that preserves the underlying algebraic structure. Specifically, for a map **T** from a vector space **V** to a vector space **W** over a field **F**, the transformation must satisfy two conditions: **additivity** and **homogeneity**. These conditions ensure that the image of a linear combination of vectors is the same as the linear combination of their images.
### Fundamental Subspaces
To analyze a linear transformation, we examine two critical subspaces:
- **Kernel (Null Space):** The set of all vectors in the domain **V** that map to the zero vector in the codomain **W**. It provides insight into whether the transformation is injective (one-to-one).
- **Image (Range):** The set of all vectors in **W** that are reached by applying **T** to elements of **V**. It indicates whether the transformation is surjective (onto).
### The Rank-Nullity Theorem
The **Rank-Nullity Theorem** is a fundamental result in linear algebra that establishes a rigid relationship between the dimensions of the domain and these two subspaces. For a finite-dimensional vector space **V**, the theorem states that the dimension of the domain is equal to the sum of the **nullity** (the dimension of the kernel) and the **rank** (the dimension of the image).
This theorem serves as a powerful tool for determining the existence and uniqueness of solutions to linear systems. It implies that if the rank is known, the size of the kernel is constrained, which fundamentally dictates the behavior of the mapping.
### Coordinate Representation of Maps
While linear transformations are abstract operators, they are most frequently computed using **coordinate representations**. By choosing a basis for the domain **V** and a basis for the codomain **W**, every linear transformation can be uniquely represented as a **matrix**.
1. **Basis Selection:** The specific matrix representation is entirely dependent on the choice of bases. Changing the basis results in a different matrix representing the same underlying transformation.
2. **Matrix Multiplication:** Once a basis is fixed, applying the transformation to a vector is equivalent to multiplying the matrix by the coordinate vector of that element.
3. **Change of Basis:** Understanding how these matrices transform under different bases leads to the concept of **similarity** and **conjugacy**, which are essential for advanced topics such as diagonalization and the Jordan Canonical Form.
At a graduate level, the study of linear transformations transitions from solving systems of equations to understanding the intrinsic properties of the maps themselves, such as their spectrum, invariant subspaces, and their role in functional analysis.