ConceptComplete

Linear Transformations

A linear transformation (or linear map) is a function between vector spaces that preserves the linear structure. These are the natural "morphisms" in the category of vector spaces.


Definition

Definition2.1Linear transformation

Let VV and WW be vector spaces over the same field FF. A function T:VWT : V \to W is a linear transformation (or linear map) if for all u,vVu, v \in V and cFc \in F:

  1. T(u+v)=T(u)+T(v)T(u + v) = T(u) + T(v) (preserves addition)
  2. T(cv)=cT(v)T(cv) = cT(v) (preserves scalar multiplication)

Equivalently, T(au+bv)=aT(u)+bT(v)T(au + bv) = aT(u) + bT(v) for all a,bFa, b \in F and u,vVu, v \in V.

RemarkNotation

We write T:VWT : V \to W or VTWV \xrightarrow{T} W. The set of all linear transformations from VV to WW is denoted L(V,W)\mathcal{L}(V, W) or HomF(V,W)\text{Hom}_F(V, W). When V=WV = W, we write L(V)\mathcal{L}(V) and call TT a linear operator (or endomorphism).

RemarkT(0) = 0

Every linear map sends 00 to 00: T(0)=T(0v)=0T(v)=0T(0) = T(0 \cdot v) = 0 \cdot T(v) = 0. If a function fails this, it is not linear.


Examples

ExampleIdentity and zero maps

For any vector space VV:

  • The identity map idV:VV\text{id}_V : V \to V, idV(v)=v\text{id}_V(v) = v, is linear.
  • The zero map T0:VWT_0 : V \to W, T0(v)=0T_0(v) = 0, is linear.
ExampleMatrix multiplication

For AMm×n(F)A \in M_{m \times n}(F), the map TA:FnFmT_A : F^n \to F^m defined by TA(x)=AxT_A(x) = Ax is linear. This is the most important example: every linear map between finite-dimensional spaces can be represented this way.

ExampleDifferentiation

D:Pn(R)Pn1(R)D : P_n(\mathbb{R}) \to P_{n-1}(\mathbb{R}) defined by D(p)=pD(p) = p' (the derivative) is linear:

D(af+bg)=(af+bg)=af+bg=aD(f)+bD(g).D(af + bg) = (af + bg)' = af' + bg' = aD(f) + bD(g).

More generally, D:C(R)C(R)D : C^\infty(\mathbb{R}) \to C^\infty(\mathbb{R}) is a linear operator.

ExampleIntegration

T:C[0,1]RT : C[0,1] \to \mathbb{R} defined by T(f)=01f(x)dxT(f) = \int_0^1 f(x)\,dx is linear:

T(af+bg)=01(af+bg)dx=a01fdx+b01gdx=aT(f)+bT(g).T(af + bg) = \int_0^1 (af + bg)\,dx = a\int_0^1 f\,dx + b\int_0^1 g\,dx = aT(f) + bT(g).

ExampleProjection

π:R3R2\pi : \mathbb{R}^3 \to \mathbb{R}^2 defined by π(x,y,z)=(x,y)\pi(x, y, z) = (x, y) (projection onto the xyxy-plane) is linear. More generally, the projection onto any subspace along a complement is linear.

ExampleRotation in R^2

Rotation by angle θ\theta about the origin is a linear map Rθ:R2R2R_\theta : \mathbb{R}^2 \to \mathbb{R}^2:

Rθ(x,y)=(xcosθysinθ,  xsinθ+ycosθ).R_\theta(x, y) = (x\cos\theta - y\sin\theta,\; x\sin\theta + y\cos\theta).

This corresponds to multiplication by the rotation matrix (cosθsinθsinθcosθ)\begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix}.

ExampleReflection

Reflection across the xx-axis in R2\mathbb{R}^2: T(x,y)=(x,y)T(x, y) = (x, -y) is linear. Reflection across any line through the origin is linear.

ExampleTranspose map

T:Mn×n(F)Mn×n(F)T : M_{n \times n}(F) \to M_{n \times n}(F) defined by T(A)=ATT(A) = A^T is linear:

(aA+bB)T=aAT+bBT.(aA + bB)^T = aA^T + bB^T.

ExampleTrace

tr:Mn×n(F)F\text{tr} : M_{n \times n}(F) \to F defined by tr(A)=i=1naii\text{tr}(A) = \sum_{i=1}^n a_{ii} is linear. This is a linear functional (a linear map to the base field).

ExampleEvaluation map

For cFc \in F, the map evc:P(F)F\text{ev}_c : P(F) \to F defined by evc(p)=p(c)\text{ev}_c(p) = p(c) is linear. This is another linear functional.

ExampleLeft shift

The left shift L:FFL : F^\infty \to F^\infty defined by L(a1,a2,a3,)=(a2,a3,a4,)L(a_1, a_2, a_3, \ldots) = (a_2, a_3, a_4, \ldots) is linear. It "deletes" the first entry. Similarly, the right shift R(a1,a2,)=(0,a1,a2,)R(a_1, a_2, \ldots) = (0, a_1, a_2, \ldots) is linear.

ExampleNon-example: translation

T:R2R2T : \mathbb{R}^2 \to \mathbb{R}^2 defined by T(x,y)=(x+1,y)T(x, y) = (x + 1, y) is not linear because T(0,0)=(1,0)(0,0)T(0, 0) = (1, 0) \neq (0, 0).

ExampleNon-example: squaring

T:RRT : \mathbb{R} \to \mathbb{R} defined by T(x)=x2T(x) = x^2 is not linear: T(2+3)=254+9=T(2)+T(3)T(2 + 3) = 25 \neq 4 + 9 = T(2) + T(3).


Basic properties

Theorem2.1Determined by values on a basis

Let β={v1,,vn}\beta = \{v_1, \ldots, v_n\} be a basis for VV, and let w1,,wnw_1, \ldots, w_n be any vectors in WW (not necessarily distinct or independent). Then there exists a unique linear transformation T:VWT : V \to W with T(vi)=wiT(v_i) = w_i for all ii.

Proof

Define T(a1v1++anvn)=a1w1++anwnT(a_1 v_1 + \cdots + a_n v_n) = a_1 w_1 + \cdots + a_n w_n. This is well-defined (since the aia_i are unique by linear independence) and linear (by construction). Uniqueness follows because any linear SS with S(vi)=wiS(v_i) = w_i satisfies S(a1v1++anvn)=a1w1++anwn=T()S(a_1 v_1 + \cdots + a_n v_n) = a_1 w_1 + \cdots + a_n w_n = T(\cdot).

RemarkLinear maps form a vector space

L(V,W)\mathcal{L}(V, W) is itself a vector space over FF under pointwise operations:

(T+S)(v)=T(v)+S(v),(cT)(v)=cT(v).(T + S)(v) = T(v) + S(v), \quad (cT)(v) = cT(v).

If dimV=n\dim V = n and dimW=m\dim W = m, then dimL(V,W)=mn\dim \mathcal{L}(V, W) = mn.

RemarkComposition is linear

If T:VWT : V \to W and S:WUS : W \to U are linear, then ST:VUS \circ T : V \to U is linear. Composition is associative: (RS)T=R(ST)(R \circ S) \circ T = R \circ (S \circ T).

RemarkLooking ahead

The key invariants of a linear map are its kernel and image. Their relationship is captured by the Rank-Nullity Theorem. In finite dimensions, every linear map can be encoded as a matrix.