# Linear map
## Introduction

This page about Linear map can be displayed as Wiki2Reveal slides. Single sections are regarded as slides and modifications on the slides will immediately affect the content of the slides. The following aspects of Linear map are considered in detail:
* (1) Definition of a linear map
* (2) Examples of linear maps
* (3) subtypes of linear maps with additional properties (e.g. endomorphism, epimorphism, monomorphism, ...)

## Learning Prerequisites

This learning resource about Linear map requires a basic understanding of
* mathematical definition of functions
* a more advanced knowledge in tertiary mathematical education to make sense of the provided examples.

### Embedding into Mathematical Domain

In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping $V\to W$ between two vector spaces that preserves the operations of vector addition and scalar multiplication.

### Generalization to Modules

The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism.

### Mapping of Zero Element

A linear map from $V$ to $W$ always maps the origin of $V$ to the origin of $W$. Moreover, it maps linear subspaces in $V$ onto linear subspaces in $W$ (possibly of a lower dimension); for example, it maps a plane through the origin in $V$ to either a plane through the origin in $W$, a line through the origin in $W$, or just the origin in $W$.

### Finite dimensional linear maps and matrices

Linear maps can often be represented as matrices, and simple examples include rotation and reflection linear transformations.

### Category Theory

In the language of category theory, linear maps are the morphisms of vector spaces, and they form a category equivalent to the one of matrices.

## Definition and first consequences

Let $V$ and $W$ be vector spaces over the same field $\mathbb {K}$. A function $f:V\to W$ is said to be a linear map if for any two vectors v$_1$, v$_2$∈V{\textstyle v_{1}, v_{2}\in V} and any scalar $\lambda \in \mathbb {K}$ the following two conditions are satisfied:
* Additivity - f(v$_1$+v$_2$)=f(v$_1$)+f(v$_2$){\textstyle f(v_{1}+v_{2})=f(v_{1})+f(v_{2})} for any two vectors v$_1$, v$_2$∈V{\textstyle v_{1}, v_{2}\in V}
* Homogeneity (of degree 1) f(λ⋅v)=λ⋅f(v){\textstyle f(\lambda \cdot v)=\lambda \cdot f(v)} for any vector v∈V{\textstyle v\in V} and any scalar $\lambda \in \mathbb {K}$

### Remark - Operation Preserving

Thus, a linear map is said to be operation preserving. In other words, it does not matter whether the linear map is applied before (the right hand sides of the above examples) or after (the left hand sides of the examples) the operations of addition and scalar multiplication.

### Remark - Associativity

By the associativity of the addition operation denoted as +, for any vectors u$_1$, …, u$_n$∈V{\textstyle \mathbf {u} _{1}, \ldots , \mathbf {u} _{n}\in V} and scalars c$_1$, …, c$_n$∈K, {\textstyle c_{1}, \ldots , c_{n}\in K, } the following equality holds: $f(c_{1}\mathbf {u} _{1}+\cdots +c_{n}\mathbf {u} _{n})=c_{1}f(\mathbf {u} _{1})+\cdots +c_{n}f(\mathbf {u} _{n}).$ Thus a linear map is one which preserves linear combinations.

### Mapping of Zero Elements

Denoting the zero elements of the vector spaces $V$ and $W$ by 0$_V${\textstyle \mathbf {0} _{V}} and 0$_W${\textstyle \mathbf {0} _{W}} respectively, it follows that f(0$_V$)=0$_W$.{\textstyle f(\mathbf {0} _{V})=\mathbf {0} _{W}.} Let $c=0$ and v∈V{\textstyle \mathbf {v} \in V} in the equation for homogeneity of degree 1: $f(\mathbf {0} _{V})=f(0\mathbf {v} )=0f(\mathbf {v} )=\mathbf {0} _{W}.$

### Linear Map in one-dimensional Vector Spaces

A linear map $V\to K$ with $K$ viewed as a one-dimensional vector space over itself is called a linear functional.

### Generalization to Rings

These statements generalize to any left-module $_R$M{\textstyle_{R}M} over a ring $R$ without modification, and to any right-module upon reversing of the scalar multiplication.

## Linear Maps with additional Properties

* Bijection - Isomorphism
* Domain and range equal $V=W$- Endomorphism or Linear Operator

### Isomorphism

If a linear map is a bijection then it is called a linear isomorphism.

### Endomorphism - Linear Operator

In the case where $V=W$, a linear map is called a linear endomorphism. Sometimes the term linear operator refers to this case,
Sometimes the term linear function has the same meaning as linear map, while in analysis it does not.

## Examples

The examples range from simple linear maps introduced in secondary schools and differentiation and integrals as linear maps.

### Linear Map with one-dimensional origin and range

A prototypical example that gives linear maps their name is a function $f:\mathbb {R} \to \mathbb {R} :x\mapsto cx$, of which the graph is a line through the origin.

### Homothety - Stretch a vector in a vector space

More generally, any homothety v↦cv{\textstyle \mathbf {v} \mapsto c\mathbf {v} } centered in the origin of a vector space is a linear map (here $c$ is a scalar).

### Zero Map

The zero map x↦0{\textstyle \mathbf {x} \mapsto \mathbf {0} } between two vector spaces (over the same field) is linear.

### Identity Map - Isomorphism

The identity map $f:V\to V$ is isomorphism for any vector space and on any module is a linear operator.

### Matrices and Linear Maps

If $A$ is a $m\times n$ real matrix, then $A$ defines a linear map from $\mathbb {R} ^{n}$ to $\mathbb {R} ^{m}$ by sending a column vector $\mathbf {x} \in \mathbb {R} ^{n}$ to the column vector $A\mathbf {x} \in \mathbb {R} ^{m}$. Conversely, any linear map between finite-dimensional vector spaces can be represented in this manner; see the § Matrices, below.

### Differentiation as linear Map

Differentiation defines a linear map from the space of all differentiable functions to the space of all functions. It also defines a linear operator on the space of all smooth functions (a linear operator is a linear endomorphism, that is, a linear map with the same domain and codomain). Indeed, ${\frac {d}{dx}}\left(\lambda _{1}\cdot f(x)+\lambda _{2}g(x)\right)=\lambda _{1}\cdot {\frac {df(x)}{dx}}+\lambda _{2}\cdot {\frac {dg(x)}{dx}}.$

### Definite Integral as linear Map

A definite integral over some interval $[a,b]$ is a linear map from the space of all real-valued integrable functions on $[a,b]$ to $\mathbb {R}$. Indeed, $\int _{u}^{v}\left(\lambda _{1}\cdot f(x)+\lambda _{2}\cdot g(x)\right)dx=\lambda _{1}\cdot \int _{u}^{v}f(x)dx+\lambda _{2}\cdot \int _{u}^{v}g(x)dx.$

### Indefinite Integral as linear Map

An indefinite integral (or antiderivative) with a fixed integration starting point defines a linear map from the space of all real-valued integrable functions on $\mathbb {R}$ to the space of all real-valued, differentiable functions on $\mathbb {R}$. Without a fixed starting point, the antiderivative maps to the quotient space of the differentiable functions by the linear space of constant functions.

### Matrices as linear Maps

If $V$ and $W$ are finite-dimensional vector spaces over a field $F$, of respective dimensions $m$ and $n$, then the function that maps linear maps f:V→W{\textstyle f:V\to W} to $n\times m$ matrices in the way described in § Matrices (below) is a linear map, and even a linear isomorphism.

### Expected Value in Probability Theory

The expected value of a random variable (which is in fact a function, and as such an element of a vector space) is linear, as for random variables $X$ and $Y$ we have $E[X+Y]=E[X]+E[Y]$ and $E[aX]=aE[X]$, but the variance of a random variable is not linear.

## Examples - not linear

* For real numbers, the map x↦x$^2${\textstyle x\mapsto x^{2}} is not linear.
* For real numbers, the map x↦x+1{\textstyle x\mapsto x+1} is not linear (but is an affine transformation).

## Isometry and Normed Spaces

If f:V→W{\textstyle f:V\to W} is an isometry between real normed spaces such that f(0)=0{\textstyle f(0)=0} then $f$ is a linear map. This result is not necessarily true for complex normed space.
* The function f:R$^2$→R$^2${\textstyle f:\mathbb {R} ^{2}\to \mathbb {R} ^{2}} with f(x, y)=(2x, y){\textstyle f(x, y)=(2x, y)} is a linear map. This function scales the x{\textstyle x} component of a vector by the factor 2{\textstyle 2}.
* The function f(x, y)=(2x, y){\textstyle f(x, y)=(2x, y)} is additive: It does not matter whether vectors are first added and then mapped or whether they are mapped and finally added: f(a+b)=f(a)+f(b){\textstyle f(\mathbf {a} +\mathbf {b} )=f(\mathbf {a} )+f(\mathbf {b} )}
* The function f(x, y)=(2x, y){\textstyle f(x, y)=(2x, y)} is homogeneous: It does not matter whether a vector is first scaled and then mapped or first mapped and then scaled: f(λa)=λf(a){\textstyle f(\lambda \mathbf {a} )=\lambda f(\mathbf {a} )}

### Linear extensions

Often, a linear map is constructed by defining it on a subset of a vector space and then extending by linearity to the linear span of the domain. Suppose $X$ and $Y$ are vector spaces and $f:S\to Y$ is a function defined on some subset $S\subseteq X.$ Then a linear extension of $f$ to $X,$ if it exists, is a linear map $F:X\to Y$ defined on $X$ that extends $f$

### Extensions

One map $F$ is said to extend another map $f$ if when $f$ is defined at a point $s,$ then so is $F$ and $F(s)=f(s).$ (meaning that $F(s)=f(s)$ for all $s\in S$) and takes its values from the codomain of $f.$ When the subset $S$ is a vector subspace of $X$ then a ($Y$-valued) linear extension of $f$ to all of $X$ is guaranteed to exist if (and only if) $f:S\to Y$ is a linear map. In particular, if $f$ has a linear extension to $\operatorname {span} S,$ then it has a linear extension to all of $X.$
The map $f:S\to Y$ can be extended to a linear map $F:\operatorname {span} S\to Y$ if and only if whenever $n>0$ is an integer, $c_{1},\ldots ,c_{n}$ are scalars, and $s_{1},\ldots ,s_{n}\in S$ are vectors such that $0=c_{1}s_{1}+\cdots +c_{n}s_{n},$ then necessarily $0=c_{1}f\left(s_{1}\right)+\cdots +c_{n}f\left(s_{n}\right).$ If a linear extension of $f:S\to Y$ exists then the linear extension $F:\operatorname {span} S\to Y$ is unique and $F\left(c_{1}s_{1}+\cdots c_{n}s_{n}\right)=c_{1}f\left(s_{1}\right)+\cdots +c_{n}f\left(s_{n}\right)$ holds for all $n,c_{1},\ldots ,c_{n},$ and $s_{1},\ldots ,s_{n}$ as above. If $S$ is linearly independent then every function $f:S\to Y$ into any vector space has a linear extension to a (linear) map $\;\operatorname {span} S\to Y$ (the converse is also true).
For example, if $X=\mathbb {R} ^{2}$ and $Y=\mathbb {R}$ then the assignment $(1,0)\to -1$ and $(0,1)\to 2$ can be linearly extended from the linearly independent set of vectors $S:=\{(1,0),(0,1)\}$ to a linear map on $\operatorname {span} \{(1,0),(0,1)\}=\mathbb {R} ^{2}.$ The unique linear extension $F:\mathbb {R} ^{2}\to \mathbb {R}$ is the map that sends $(x,y)=x(1,0)+y(0,1)\in \mathbb {R} ^{2}$ to $F(x,y)=x(-1)+y(2)=-x+2y.$
Every (scalar-valued) linear functional $f$ defined on a vector subspace of a real or complex vector space $X$ has a linear extension to all of $X.$ Indeed, the Hahn–Banach dominated extension theorem even guarantees that when this linear functional $f$ is dominated by some given seminorm $p:X\to \mathbb {R}$ (meaning that $|f(m)|\leq p(m)$ holds for all $m$ in the domain of $f$) then there exists a linear extension to $X$ that is also dominated by $p.$

## Matrices

If $V$ and $W$ are finite-dimensional vector spaces and a basis is defined for each vector space, then every linear map from $V$ to $W$ can be represented by a matrix. This is useful because it allows concrete calculations. Matrices yield examples of linear maps: if $A$ is a real $m\times n$ matrix, then $f(\mathbf {x} )=A\mathbf {x}$ describes a linear map $\mathbb {R} ^{n}\to \mathbb {R} ^{m}$ (see Euclidean space).
Let $\{\mathbf {v} _{1},\ldots ,\mathbf {v} _{n}\}$ be a basis for $V$. Then every vector $\mathbf {v} \in V$ is uniquely determined by the coefficients $c_{1},\ldots ,c_{n}$ in the field $\mathbb {R}$: $\mathbf {v} =c_{1}\mathbf {v} _{1}+\cdots +c_{n}\mathbf {v} _{n}.$
If f:V→W{\textstyle f:V\to W} is a linear map, $f(\mathbf {v} )=f(c_{1}\mathbf {v} _{1}+\cdots +c_{n}\mathbf {v} _{n})=c_{1}f(\mathbf {v} _{1})+\cdots +c_{n}f\left(\mathbf {v} _{n}\right),$
which implies that the function f is entirely determined by the vectors $f(\mathbf {v} _{1}),\ldots ,f(\mathbf {v} _{n})$. Now let $\{\mathbf {w} _{1},\ldots ,\mathbf {w} _{m}\}$ be a basis for $W$. Then we can represent each vector $f(\mathbf {v} _{j})$ as $f\left(\mathbf {v} _{j}\right)=a_{1j}\mathbf {w} _{1}+\cdots +a_{mj}\mathbf {w} _{m}.$
Thus, the function $f$ is entirely determined by the values of $a_{ij}$. If we put these values into an $m\times n$ matrix $M$, then we can conveniently use it to compute the vector output of $f$ for any vector in $V$. To get $M$, every column $j$ of $M$ is a vector ${\begin{pmatrix}a_{1j}\\\vdots \\a_{mj}\end{pmatrix}}$ corresponding to $f(\mathbf {v} _{j})$ as defined above. To define it more clearly, for some column $j$ that corresponds to the mapping $f(\mathbf {v} _{j})$, $\mathbf {M} ={\begin{pmatrix}\ \cdots &a_{1j}&\cdots \ \\&\vdots &\\&a_{mj}&\end{pmatrix}}$ where $M$ is the matrix of $f$. In other words, every column $j=1,\ldots ,n$ has a corresponding vector $f(\mathbf {v} _{j})$ whose coordinates $a_{1j},\cdots ,a_{mj}$ are the elements of column $j$. A single linear map may be represented by many matrices. This is because the values of the elements of a matrix depend on the bases chosen.
The matrices of a linear transformation can be represented visually:
* Matrix for T{\textstyle T} relative to B{\textstyle B}: A{\textstyle A}
* Matrix for T{\textstyle T} relative to B$^′${\textstyle B'}: A$^′${\textstyle A'}
* Transition matrix from B$^′${\textstyle B'} to B{\textstyle B}: P{\textstyle P}
* Transition matrix from B{\textstyle B} to B$^′${\textstyle B'}: P$^{−1}${\textstyle P^{-1}}
Such that starting in the bottom left corner [v]$_{B′}${\textstyle \left[\mathbf {v} \right]_{B'}} and looking for the bottom right corner [T(v)]$_{B′}${\textstyle \left[T\left(\mathbf {v} \right)\right]_{B'}}, one would left-multiply—that is, A$^′$[v]$_{B′}$=[T(v)]$_{B′}${\textstyle A'\left[\mathbf {v} \right]_{B'}=\left[T\left(\mathbf {v} \right)\right]_{B'}}. The equivalent method would be the "longer" method going clockwise from the same point such that [v]$_{B′}${\textstyle \left[\mathbf {v} \right]_{B'}} is left-multiplied with P$^{−1}$AP{\textstyle P^{-1}AP}, or P$^{−1}$AP[v]$_{B′}$=[T(v)]$_{B′}${\textstyle P^{-1}AP\left[\mathbf {v} \right]_{B'}=\left[T\left(\mathbf {v} \right)\right]_{B'}}.

### Examples in two dimensions

In two-dimensional space R$^2$ linear maps are described by 2 × 2 matrices. These are some examples:
* rotation
** by 90 degrees counterclockwise: $\mathbf {A} ={\begin{pmatrix}0&-1\\1&0\end{pmatrix}}$
** by an angle θ counterclockwise: $\mathbf {A} ={\begin{pmatrix}\cos \theta &-\sin \theta \\\sin \theta &\cos \theta \end{pmatrix}}$
* reflection
** through the x axis: $\mathbf {A} ={\begin{pmatrix}1&0\\0&-1\end{pmatrix}}$
** through the y axis: $\mathbf {A} ={\begin{pmatrix}-1&0\\0&1\end{pmatrix}}$
** through a line making an angle θ with the origin: $\mathbf {A} ={\begin{pmatrix}\cos 2\theta &\sin 2\theta \\\sin 2\theta &-\cos 2\theta \end{pmatrix}}$
* scaling by 2 in all directions: $\mathbf {A} ={\begin{pmatrix}2&0\\0&2\end{pmatrix}}=2\mathbf {I}$
* horizontal shear mapping: $\mathbf {A} ={\begin{pmatrix}1&m\\0&1\end{pmatrix}}$
* skew of the y axis by an angle θ: $\mathbf {A} ={\begin{pmatrix}1&-\sin \theta \\0&\cos \theta \end{pmatrix}}$
* squeeze mapping: $\mathbf {A} ={\begin{pmatrix}k&0\\0&{\frac {1}{k}}\end{pmatrix}}$
* projection onto the y axis: $\mathbf {A} ={\begin{pmatrix}0&0\\0&1\end{pmatrix}}.$
If a linear map is only composed of rotation, reflection, and/or uniform scaling, then the linear map is a conformal linear transformation.

## Vector space of linear maps

The composition of linear maps is linear: if $f:V\to W$ and g:W→Z{\textstyle g:W\to Z} are linear, then so is their composition g∘f:V→Z{\textstyle g\circ f:V\to Z}. It follows from this that the class of all vector spaces over a given field K, together with K-linear maps as morphisms, forms a category.
The inverse of a linear map, when defined, is again a linear map.
If f$_1$:V→W{\textstyle f_{1}:V\to W} and f$_2$:V→W{\textstyle f_{2}:V\to W} are linear, then so is their pointwise sum $f_{1}+f_{2}$, which is defined by $(f_{1}+f_{2})(\mathbf {x} )=f_{1}(\mathbf {x} )+f_{2}(\mathbf {x} )$.
If f:V→W{\textstyle f:V\to W} is linear and α{\textstyle \alpha } is an element of the ground field K{\textstyle K}, then the map αf{\textstyle \alpha f}, defined by (αf)(x)=α(f(x)){\textstyle (\alpha f)(\mathbf {x} )=\alpha (f(\mathbf {x} ))}, is also linear.
Thus the set L(V, W){\textstyle {\mathcal {L}}(V, W)} of linear maps from V{\textstyle V} to W{\textstyle W} itself forms a vector space over K{\textstyle K}, sometimes denoted Hom⁡(V, W){\textstyle \operatorname {Hom} (V, W)}. Furthermore, in the case that V=W{\textstyle V=W}, this vector space, denoted End⁡(V){\textstyle \operatorname {End} (V)}, is an associative algebra under composition of maps, since the composition of two linear maps is again a linear map, and the composition of maps is always associative. This case is discussed in more detail below.
Given again the finite-dimensional case, if bases have been chosen, then the composition of linear maps corresponds to the matrix multiplication, the addition of linear maps corresponds to the matrix addition, and the multiplication of linear maps with scalars corresponds to the multiplication of matrices with scalars.

### Endomorphisms and automorphisms

A linear transformation f:V→V{\textstyle f:V\to V} is an endomorphism of V{\textstyle V}; the set of all such endomorphisms End⁡(V){\textstyle \operatorname {End} (V)} together with addition, composition and scalar multiplication as defined above forms an associative algebra with identity element over the field K{\textstyle K} (and in particular a ring). The multiplicative identity element of this algebra is the identity map id:V→V{\textstyle \operatorname {id} :V\to V}.
An endomorphism of V{\textstyle V} that is also an isomorphism is called an automorphism of V{\textstyle V}. The composition of two automorphisms is again an automorphism, and the set of all automorphisms of V{\textstyle V} forms a group, the automorphism group of V{\textstyle V} which is denoted by Aut⁡(V){\textstyle \operatorname {Aut} (V)} or GL⁡(V){\textstyle \operatorname {GL} (V)}. Since the automorphisms are precisely those endomorphisms which possess inverses under composition, Aut⁡(V){\textstyle \operatorname {Aut} (V)} is the group of units in the ring End⁡(V){\textstyle \operatorname {End} (V)}.
If V{\textstyle V} has finite dimension n{\textstyle n}, then End⁡(V){\textstyle \operatorname {End} (V)} is isomorphic to the associative algebra of all n×n{\textstyle n\times n} matrices with entries in K{\textstyle K}. The automorphism group of V{\textstyle V} is isomorphic to the general linear group GL⁡(n, K){\textstyle \operatorname {GL} (n, K)} of all n×n{\textstyle n\times n} invertible matrices with entries in K{\textstyle K}.

## Kernel, image and the rank–nullity theorem

If f:V→W{\textstyle f:V\to W} is linear, we define the kernel and the image or range of f{\textstyle f} by ${\begin{aligned}\ker(f)&=\{\,\mathbf {x} \in V:f(\mathbf {x} )=\mathbf {0} \,\}\\\operatorname {im} (f)&=\{\,\mathbf {w} \in W:\mathbf {w} =f(\mathbf {x} ),\mathbf {x} \in V\,\}\end{aligned}}$
ker⁡(f){\textstyle \ker(f)} is a subspace of V{\textstyle V} and im⁡(f){\textstyle \operatorname {im} (f)} is a subspace of W{\textstyle W}. The following dimension formula is known as the rank–nullity theorem: $\dim(\ker(f))+\dim(\operatorname {im} (f))=\dim(V).$
The number dim⁡(im⁡(f)){\textstyle \dim(\operatorname {im} (f))} is also called the rank of f{\textstyle f} and written as rank⁡(f){\textstyle \operatorname {rank} (f)}, or sometimes, ρ(f){\textstyle \rho (f)}; the number dim⁡(ker⁡(f)){\textstyle \dim(\ker(f))} is called the nullity of f{\textstyle f} and written as null⁡(f){\textstyle \operatorname {null} (f)} or ν(f){\textstyle \nu (f)}. If V{\textstyle V} and W{\textstyle W} are finite-dimensional, bases have been chosen and f{\textstyle f} is represented by the matrix A{\textstyle A}, then the rank and nullity of f{\textstyle f} are equal to the rank and nullity of the matrix A{\textstyle A}, respectively.
See also main resources about Kernel (linear algebra), Image (mathematics), Rank of a matrix.

## Cokernel

A subtler invariant of a linear transformation f:V→W{\textstyle f:V\to W} is the cokernel, which is defined as $\operatorname {coker} (f):=W/f(V)=W/\operatorname {im} (f).$
This is the dual notion to the kernel: just as the kernel is a subspace of the domain, the co-kernel is a quotient space of the target. Formally, one has the exact sequence $0\to \ker(f)\to V\to W\to \operatorname {coker} (f)\to 0.$
These can be interpreted thus: given a linear equation f(v) = w to solve,
* the kernel is the space of solutions to the homogeneous equation f(v) = 0, and its dimension is the number of degrees of freedom in the space of solutions, if it is not empty;
* the co-kernel is the space of constraints that the solutions must satisfy, and its dimension is the maximal number of independent constraints.
The dimension of the co-kernel and the dimension of the image (the rank) add up to the dimension of the target space. For finite dimensions, this means that the dimension of the quotient space W/f(V) is the dimension of the target space minus the dimension of the image.
As a simple example, consider the map f: R$^2$ → R$^2$, given by f(x, y) = (0, y). Then for an equation f(x, y) = (a, b) to have a solution, we must have a = 0 (one constraint), and in that case the solution space is (x, b) or equivalently stated, (0, b) + (x, 0), (one degree of freedom). The kernel may be expressed as the subspace (x, 0) < V: the value of x is the freedom in a solution – while the cokernel may be expressed via the map W → R, (a, b)↦(a){\textstyle (a, b)\mapsto (a)}: given a vector (a, b), the value of a is the obstruction to there being a solution.
An example illustrating the infinite-dimensional case is afforded by the map f: R$^∞$ → R$^∞$, {a$_n$}↦{b$_n$}{\textstyle \left\{a_{n}\right\}\mapsto \left\{b_{n}\right\}} with b$_1$ = 0 and b$_{n+1}$ = a$_n$ for n > 0. Its image consists of all sequences with first element 0, and thus its cokernel consists of the classes of sequences with identical first element. Thus, whereas its kernel has dimension 0 (it maps only the zero sequence to the zero sequence), its co-kernel has dimension 1. Since the domain and the target space are the same, the rank and the dimension of the kernel add up to the same sum as the rank and the dimension of the co-kernel (ℵ$_0$+0=ℵ$_0$+1{\textstyle \aleph _{0}+0=\aleph _{0}+1}), but in the infinite-dimensional case it cannot be inferred that the kernel and the co-kernel of an endomorphism have the same dimension (0 ≠ 1). The reverse situation obtains for the map h: R$^∞$ → R$^∞$, {a$_n$}↦{c$_n$}{\textstyle \left\{a_{n}\right\}\mapsto \left\{c_{n}\right\}} with c$_n$ = a$_{n+1}$. Its image is the entire target space, and hence its co-kernel has dimension 0, but since it maps all sequences in which only the first element is non-zero to the zero sequence, its kernel has dimension 1.

### Index

For a linear operator with finite-dimensional kernel and co-kernel, one may define index as: $\operatorname {ind} (f):=\dim(\ker(f))-\dim(\operatorname {coker} (f)),$ namely the degrees of freedom minus the number of constraints.
For a transformation between finite-dimensional vector spaces, this is just the difference dim(V) − dim(W), by rank–nullity. This gives an indication of how many solutions or how many constraints one has: if mapping from a larger space to a smaller one, the map may be onto, and thus will have degrees of freedom even without constraints. Conversely, if mapping from a smaller space to a larger one, the map cannot be onto, and thus one will have constraints even without degrees of freedom.
The index of an operator is precisely the Euler characteristic of the 2-term complex 0 → V → W → 0. In operator theory, the index of Fredholm operators is an object of study, with a major result being the Atiyah–Singer index theorem.

## Algebraic classifications of linear transformations

No classification of linear maps could be exhaustive. The following incomplete list enumerates some important classifications that do not require any additional structure on the vector space.
Let $V$ and $W$ denote vector spaces over a field $F$ and let $T:V\to W$ be a linear map.

### Monomorphism

$T$ is said to be injective or a monomorphism if any of the following equivalent conditions are true:
* $T$ is one-to-one as a map of sets.
* ker T = {0$_V$}
* $1=dim(kerT)=0$
* $T$ is monic or left-cancellable, which is to say, for any vector space $U$ and any pair of linear maps $R:U\to V$ and $S:U\to V$, the equation $1=TR=TS$ implies $1=R=S$.
* $T$ is left-invertible, which is to say there exists a linear map $S:W\to V$ such that $ST$ is the identity map on $V$.

### Epimorphism

$T$ is said to be surjective or an epimorphism if any of the following equivalent conditions are true:
* $T$ is onto as a map of sets.
* coker T = {0$_W$}
* $T$ is epic or right-cancellable, which is to say, for any vector space $U$ and any pair of linear maps $R:W\to U$ and $S:W\to U$, the equation $1=RT=ST$ implies $1=R=S$.
* $T$ is right-invertible, which is to say there exists a linear map $S:W\to V$ such that $TS$ is the identity map on $W$.

### Isomorphism

$T$ is said to be an isomorphism if it is both left- and right-invertible. This is equivalent to $T$ being both one-to-one and onto (a bijection of sets) or also to $T$ being both epic and monic, and so being a bimorphism.
If $T:V\to V$ is an endomorphism, then:
* If, for some positive integer $n$, the $n$-th iterate of $T$, $T<sup>n</sup>$, is identically zero, then $T$ is said to be nilpotent.
* If $1=T_{2}=T$, then $T$ is said to be idempotent
* If $1=T=kI$, where $k$ is some scalar, then $T$ is said to be a scaling transformation or scalar multiplication map; see scalar matrix.

## Change of basis

Given a linear map which is an endomorphism whose matrix is A, in the basis B of the space it transforms vector coordinates [u] as [v] = A[u]. As vectors change with the inverse of B (vectors coordinates are contravariant) its inverse transformation is [v] = B[v'].
Substituting this in the first expression $B\left[v'\right]=AB\left[u'\right]$ hence $\left[v'\right]=B^{-1}AB\left[u'\right]=A'\left[u'\right].$
Therefore, the matrix in the new basis is A′ = B$^{−1}$AB, being B the matrix of the given basis.
Therefore, linear maps are said to be 1-co- 1-contra-variant objects, or type (1, 1) tensors.

## Continuity

A linear transformation between topological vector spaces, for example normed spaces, may be continuous. If its domain and codomain are the same, it will then be a continuous linear operator. A linear operator on a normed linear space is continuous if and only if it is bounded, for example, when the domain is finite-dimensional. An infinite-dimensional domain may have discontinuous linear operators.
An example of an unbounded, hence discontinuous, linear transformation is differentiation on the space of smooth functions equipped with the supremum norm (a function with small values can have a derivative with large values, while the derivative of 0 is 0). For a specific example, $sin(nx)/n$ converges to 0, but its derivative $cos(nx)$ does not, so differentiation is not continuous at 0 (and by a variation of this argument, it is not continuous anywhere).

## Applications

A specific application of linear maps is for geometric transformations, such as those performed in computer graphics, where the translation, rotation and scaling of 2D or 3D objects is performed by the use of a transformation matrix. Linear mappings also are used as a mechanism for describing change: for example in calculus correspond to derivatives; or in relativity, used as a device to keep track of the local transformations of reference frames.
Another application of these transformations is in compiler optimizations of nested-loop code, and in parallelizing compiler techniques.