Skip to content

Linear Map

Definition

Let F\mathbb{F} be a field, and let VV and WW be vector spaces over F\mathbb{F}. A linear map A ⁣:V→W\boldsymbol{A}\colon V\to W is a function satisfying additivity A(u+v)=Au+Av\boldsymbol{A}(\boldsymbol{u}+\boldsymbol{v})=\boldsymbol{A}\boldsymbol{u}+\boldsymbol{A}\boldsymbol{v} and homogeneity A(λu)=λAu\boldsymbol{A}(\lambda \boldsymbol{u})=\lambda \boldsymbol{A}\boldsymbol{u} for all u,v∈V\boldsymbol{u},\boldsymbol{v}\in V and λ∈F\lambda\in\mathbb{F}. The set of all linear maps from VV to WW is denoted L(V,W)\mathcal{L}(V,W).

Basic linear maps and operations

Two canonical examples are the zero map 0 ⁣:V→W\boldsymbol{0}\colon V\to W, defined by 0(v)=0W\boldsymbol{0}(\boldsymbol{v})=\boldsymbol{0}_W, and the identity map I ⁣:V→V\boldsymbol{I}\colon V\to V, defined by I(v)=v\boldsymbol{I}(\boldsymbol{v})=\boldsymbol{v}. If A,B∈L(V,W)\boldsymbol{A},\boldsymbol{B}\in\mathcal{L}(V,W) and λ∈F\lambda\in\mathbb{F}, then the sum and scalar multiple of linear maps are defined by

(A+B)(v)=Av+Bv,(λA)(v)=λ(Av).\begin{aligned} (\boldsymbol{A}+\boldsymbol{B})(\boldsymbol{v})&=\boldsymbol{A}\boldsymbol{v}+\boldsymbol{B}\boldsymbol{v},\\ (\lambda \boldsymbol{A})(\boldsymbol{v})&=\lambda(\boldsymbol{A}\boldsymbol{v}). \end{aligned}

These operations make L(V,W)\mathcal{L}(V,W) itself a vector space.


Interpretation

A linear map preserves the linear structure of a vector space: it respects vector addition and scalar multiplication. It does not matter whether vectors are first combined and then mapped, or first mapped and then combined: A(λu+μv)=λAu+μAv\boldsymbol{A}(\lambda\boldsymbol{u}+\mu\boldsymbol{v})=\lambda\boldsymbol{A}\boldsymbol{u}+\mu\boldsymbol{A}\boldsymbol{v}.

A square grid with e1, e2 and v = e1 + e2, mapped by a linear map A onto a slanted grid with Ae1, Ae2 and Av = Ae1 + Ae2; lines stay parallel and evenly spaced.

The square grid of VV, with e1\boldsymbol{e}_1, e2\boldsymbol{e}_2 and v=e1+e2\boldsymbol{v}=\boldsymbol{e}_1+\boldsymbol{e}_2, is mapped to a slanted grid. By additivity, Av=Ae1+Ae2\boldsymbol{A}\boldsymbol{v}=\boldsymbol{A}\boldsymbol{e}_1+\boldsymbol{A}\boldsymbol{e}_2: the diagonal of the unit square goes to the diagonal of the parallelogram formed by Ae1\boldsymbol{A}\boldsymbol{e}_1 and Ae2\boldsymbol{A}\boldsymbol{e}_2. The grid lines stay straight, parallel and evenly spaced, and 0\boldsymbol{0} stays at 0\boldsymbol{0}. A linear map is determined by its images of a basis; here Ae1\boldsymbol{A}\boldsymbol{e}_1 and Ae2\boldsymbol{A}\boldsymbol{e}_2 are the matrix columns.

Drag the images Ae1\boldsymbol{A}\boldsymbol{e}_1 and Ae2\boldsymbol{A}\boldsymbol{e}_2 of the basis vectors: they decide where the whole grid goes, and Ax=x1Ae1+x2Ae2\boldsymbol{A}\boldsymbol{x}=x_1\boldsymbol{A}\boldsymbol{e}_1+x_2\boldsymbol{A}\boldsymbol{e}_2. Move tt to slide from the identity to A\boldsymbol{A}.

Every linear map sends 0\boldsymbol{0} to 0\boldsymbol{0}, because A0=A(0⋅0)=0⋅A0=0\boldsymbol{A}\boldsymbol{0}=\boldsymbol{A}(0\cdot\boldsymbol{0})=0\cdot\boldsymbol{A}\boldsymbol{0}=\boldsymbol{0}. This gives a quick test: g(x,y,z)=x−y+2z+1g(x,y,z)=x-y+2z+1 from the Examples fails it. Fixing the origin is not enough, though: x↦x2x\mapsto x^2 on R\mathbb{R} sends 00 to 00, but (1+1)2=4≠12+12(1+1)^2=4\neq1^2+1^2, so additivity fails.

The two conditions are differentiation rules already known from Math I: (f+g)′=f′+g′(f+g)'=f'+g' and (cf)′=cf′(cf)'=cf', which is why differentiation is a linear map. A common slip comes from the everyday name "linear function" for f(x)=ax+bf(x)=ax+b: it is a linear map only when b=0b=0; for b≠0b\neq0 its graph is a line that misses the origin.


Key Results

  • A linear map is completely determined by what it does to a basis of its domain.
  • The set L(V,W)\mathcal{L}(V,W) of all linear maps from VV to WW is itself a vector space.
  • A function f ⁣:Rn→Rk\boldsymbol{f}\colon\mathbb{R}^n\to\mathbb{R}^k is linear if and only if f(x)=Ax\boldsymbol{f}(\boldsymbol{x})=\boldsymbol{A}\boldsymbol{x} for some k×nk\times n matrix A\boldsymbol{A}, and then A\boldsymbol{A} is unique: its jj-th column is f(ej)\boldsymbol{f}(\boldsymbol{e}_j). In particular a linear map sends 0\boldsymbol{0} to 0\boldsymbol{0}, so a function x↦Ax+b\boldsymbol{x}\mapsto \boldsymbol{A}\boldsymbol{x}+\boldsymbol{b} with b≠0\boldsymbol{b}\ne\boldsymbol{0} is not linear but affine.
  • Linear map and linear transformation are synonyms. A linear map from a space to itself is also called a linear operator.

Examples

  • The zero map 0(v)=0\boldsymbol{0}(\boldsymbol{v})=\boldsymbol{0} is linear.
  • The derivative map D(p)=p′\boldsymbol{D}(p)=p' on polynomials is linear.
  • f(x,y)=x+yf(x,y)=x+y is a linear map R2→R\mathbb{R}^2\to\mathbb{R}; g(x,y,z)=x−y+2z+1g(x,y,z)=x-y+2z+1 is not, since g(0,0,0)=1≠0g(0,0,0)=1\ne0.

Prerequisites

Sources

Aliases: linear transformation, linear mapping, vector space homomorphism Keywords: zero map, identity map, sum of linear maps, scalar multiple of a linear map, standard matrix, matrix of a linear map Symbols: element of, lambda, mu, real numbers

Last updated: 20 October 2026 03:02