Definition · applies to functions between vector spaces · also called linear transformation, linear operator (for maps from a space to itself)

High school

Consider a function $f$ from $\reals$ to $\reals$. The function $f$ is a linear map if $f$ has the form $f(x) = m x$ for some number $m$. The graph of a linear map is a straight line that passes through the origin.

Caveat. In high school algebra, $f(x) = m x + b$ is called a “linear function,” but it is a linear map only when $b = 0$. With $b \neq 0$, it is called affine.
Undergraduate

Consider vector spaces $V$ and $W$, and a function $T : V \to W$. The function $T$ is called a linear map if, for all vectors $u, v$ and scalars $c$,

  1. $T(u + v) = T(u) + T(v)$ (additivity), and
  2. $T(c v) = c T(v)$ (homogeneity).

Examples

Examples

Non-examples

Things that may be mistaken for examples.

Distinctions involving this term

  • Array vs. matrix vs. linear map: Grids of numbers appear throughout linear algebra and computing, but a grid can be just data, a matrix with its own arithmetic, or a way of writing a linear map. An array is a grid of data. A matrix is a grid of numbers with matrix arithmetic. A linear map is a function between vector spaces. A matrix represents a linear map as an array of scalars with respect to a given vector basis.

All definitions · All distinctions · All examples