Definition: A linear transformation (or linear map) is a function \(T: V \to W\) between vector spaces over the same field that preserves vector addition and scalar multiplication:
- Additivity: \(T(\mathbf{u} + \mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v})\) for all \(\mathbf{u}, \mathbf{v} \in V\)
- Homogeneity: \(T(c\mathbf{v}) = cT(\mathbf{v})\) for all \(\mathbf{v} \in V\) and scalars \(c\)
These two conditions can be combined into a single property:
\[T(c_1\mathbf{v}_1 + c_2\mathbf{v}_2) = c_1 T(\mathbf{v}_1) + c_2 T(\mathbf{v}_2)\]
Key consequences:
- \(T(\mathbf{0}) = \mathbf{0}\) (the zero vector always maps to the zero vector)
- \(T\) is completely determined by its action on a basis of \(V\)
Example: The map \(T: \mathbb{R}^2 \to \mathbb{R}^2\) defined by \(T(x,y) = (2x, x+y)\) is linear. Check: \(T((x_1,y_1)+(x_2,y_2)) = T(x_1+x_2, y_1+y_2) = (2(x_1+x_2), (x_1+x_2)+(y_1+y_2)) = (2x_1, x_1+y_1) + (2x_2, x_2+y_2) = T(x_1,y_1) + T(x_2,y_2)\).
See in the graph Search below
Parents2More general nodes this one belongs to
Children3939 nodes that explain it further
39 attached graphs from other writers shown.
- Eigenvalues and eigenvectors
- Terminology
- Geometric properties of linear transformations
- Matrices as linear transformations
- Basic properties of linear transformations
- Description of a spanning set for the null space of a matrix from the reduced row-echelon form.
- Description of a basis for the null space of a matrix from the reduced row-echelon form.
- The nonzero rows of an echelon form of a matrix are linearly independent.
- Subspaces associated to a matrix
- Rank and nullity
- Examples
- Composition
- The preimage of a vector is a translation of the kernel of the linear transformation
- The image of a linearly independent set under an injective linear transformation is linearly independent.
- The dimension of the domain of an injective linear transformation is at most the dimension of the codomain.
- The dimension of the domain of a surjective linear transformation is at least the dimension of the codomain.
- A linear transformation is surjective if and only if the rank equals the dimension of the codomain.
- The range of a linear transformation is a subspace
- The the image of a spanning set is a spanning set for the range space
- A linear transformation is surjective if and only if the image of a basis is a spanning set
- Definition of generalized range space of a linear transformation
- A linear transformation is injective on its generalized range space.
- Definition of diagonalizable linear transformation
- A linear transformation is diagonalizable if there is a basis such that each element is an eigenvector of the transformation.
- Subspaces associated to a linear transformation
- The rank plus the nullity of a linear transformation equals the dimension of the domain.
- The image of a linearly dependent set under a linear transformation is linearly dependent.
- A linear transformation is onto if and only if its rank equals the number of rows in any matrix representation.
- A linear transformation is invertible if and only if it is injective and surjective
- Definition of matrix representation of a linear transformation with respect to bases of the spaces
- A linear transformation is given by multiplying by its matrix representation with respect to bases of the spaces
- Definition of matrix representation of a linear transformation from a vector space to itself
- The matrix representation of a scalar multiple of linear transformations is the scalar multiple of the matrix.
- The matrix representation of a sum of linear transformations is the sum of the matrices.
- The matrix representation of a composition of linear transformations is the product of the matrices.
- The matrix representation of the inverse of linear transformations is the inverse of the matricix.
- A linear transformation has the same eigenvalues and eigenvectors as any matrix representation.
- A linear transformation has a representation as an upper triangular matrix.
- Equivalence theorems for injective transformations
