Linear Transformations

A map between vector spaces is linear when it respects addition and scaling. Every such map on finite-dimensional spaces is determined by what it does to a basis, which is what a matrix records; its kernel and image are subspaces whose dimensions sum to the dimension of the domain.

Definition

Let V and W be vector spaces over the same field. A map T : V → W is a linear transformation when for all u , v ∈ V and all scalars a :

T ( u + v ) = T ( u ) + T ( v ) , T ( a v ) = a T ( v ) .

The two conditions combine to T ( a u + b v ) = a T ( u ) + b T ( v ) , and by induction T carries any linear combination to the corresponding combination of images. Setting a = 0 gives T ( 0 ) = 0 , so a map sending the zero vector anywhere else is not linear.

Determined by a basis. If { v 1 , … , v n } is a basis of V , every v ∈ V is uniquely v = ∑ j c j v j , so

T ( v ) = ∑ j = 1 n c j T ( v j ) .

The images of the basis vectors therefore determine T everywhere, and they may be assigned freely: any choice of n vectors in W defines exactly one linear map.

The matrix of a transformation. With bases fixed for V and W , let A be the matrix whose j th column is T ( v j ) expressed in the basis of W . Then T ( v ) has coordinate vector A c , where c holds the coordinates of v . The matrix depends on the chosen bases; the transformation does not.

Composition corresponds to matrix multiplication: if S has matrix B and T has matrix A , then T ∘ S has matrix A B . Since matrix multiplication is not commutative, neither is composition.

Kernel and image.

ker ⁡ T = { v ∈ V : T ( v ) = 0 } , im ⁡ T = { T ( v ) : v ∈ V } .

The kernel is a subspace of V and the image a subspace of W . Each because T respects the operations that define closure. Their dimensions are the nullity and the rank, and

dim ⁡ ker ⁡ T + dim ⁡ im ⁡ T = dim ⁡ V ,

the rank–nullity theorem. T is injective exactly when ker ⁡ T = { 0 } .

Assumptions and scope

  • Both spaces must be over the same field. A map from a complex space to a real one can respect real scaling without being linear over C , and complex conjugation is the standard example.

  • The matrix depends on the chosen bases. Two matrices represent the same transformation in different bases, which is what makes similarity and diagonalization meaningful questions.

  • Rank–nullity requires V finite-dimensional. On infinite-dimensional spaces a map can be injective without being surjective, which the theorem forbids when the dimensions are finite and equal.

  • Linearity is not smoothness or continuity. On finite-dimensional spaces linear maps are continuous, but the definition mentions neither, and the conditions are algebraic.

  • A map satisfying only additivity need not be linear over R , though the pathological examples require constructions unavailable in any explicit formula. Both conditions are stated because both are needed.

Forms this is expressed in

The same content in several forms. Each makes something visible that the others leave implicit, so moving between them is part of understanding the topic rather than a presentation choice.

geometric

The grid before and after, with the basis vectors and their images

A linear map drawn as what it does to the plane: the coordinate grid before, and the image of that same grid after.

Straight lines stay straight and parallel lines stay parallel, which is linearity made visible rather than asserted. The origin does not move, because T ( 0 ) = 0 for every linear map, which is exactly what separates a linear map from an affine one.

The matrix is read off the picture. e 1 lands on the first column of A and e 2 on the second, so for A = ( 2 1 1 3 ) the images are ( 2 , 1 ) and ( 1 , 3 ) . Every other vector follows, because a linear map is determined by what it does to a basis.

This is the form the rest of the subject reuses. The area scale factor of the transformed grid is the determinant; the directions the grid does not turn are the eigenvectors; the ellipse a circle becomes under it carries the singular values.

What the picture cannot supply is the map in higher dimensions, or an exact image coordinate; both come from the matrix arithmetic.

Translates into: geometric

Worked material

Example

A catalogue of maps on the plane

Each map below is linear, each is given by its matrix, and each is worth recognising on sight.

Scaling by k . ( k 0 0 k ) . Stretches everything away from the origin by a factor k . For k = 0 it is the zero map, whose kernel is all of R 2 and whose image is { 0 } : nullity 2, rank 0. For k = 1 it is the identity: nullity 0, rank 2.

Reflection in the x -axis. ( 1 0 0 − 1 ) , sending ( x , y ) to ( x , − y ) . Determinant − 1 , kernel trivial, image everything. Applying it twice gives the identity.

Rotation by θ . ( cos ⁡ θ − sin ⁡ θ sin ⁡ θ cos ⁡ θ ) . The columns are the images of ( 1 , 0 ) and ( 0 , 1 ) , which land at angle θ from where they started. Determinant cos 2 ⁡ θ + sin 2 ⁡ θ = 1 , so nothing is collapsed and nothing is scaled.

Projection onto the x -axis. ( 1 0 0 0 ) , sending ( x , y ) to ( x , 0 ) . The kernel is the y -axis and the image is the x -axis: nullity 1, rank 1, summing to 2. Applying it twice changes nothing after the first time, which is what makes it a projection.

Shear. ( 1 s 0 1 ) , sending ( x , y ) to ( x + s y , y ) . Horizontal lines slide by an amount proportional to their height. Determinant 1, so areas are preserved even though the picture is distorted. A reminder that the determinant measures area scaling, not distortion.

Map det nullityrank
zero020
projection011
identity102
rotation102
reflection − 1 02
shear102

The determinant is zero exactly when the kernel is nontrivial, and in the plane the three rank values 0, 1 and 2 are the only ones available, collapse everything, collapse a line, collapse nothing. Rank–nullity accounts for each row: the entries in the last two columns sum to 2 throughout.

Two that are not on the list. Translation by a fixed vector is not linear, since it moves the origin. "Reflection in the line y = 1 " is not linear for the same reason; only reflections in lines through the origin qualify.

Non-example

Maps that fail linearity

A shift. S ( x , y ) = ( x + 1 , y ) . Immediately S ( 0 , 0 ) = ( 1 , 0 ) ≠ 0 , so it is not linear. Additivity fails too: S ( 1 , 2 ) + S ( − 3 , 4 ) = ( 2 , 2 ) + ( − 2 , 4 ) = ( 0 , 6 ) , while S ( − 2 , 6 ) = ( − 1 , 6 ) . Any map with a constant term fails this way, including x ↦ m x + c for c ≠ 0 . The schoolroom "linear function" is affine, not linear.

A squaring. Q ( x , y ) = ( x 2 , y ) . Here Q ( 0 , 0 ) = ( 0 , 0 ) , so the origin test passes and gives no information. Homogeneity is what fails: Q ( 2 ⋅ ( 1 , 1 ) ) = Q ( 2 , 2 ) = ( 4 , 2 ) , while 2 ⋅ Q ( 1 , 1 ) = 2 ( 1 , 1 ) = ( 2 , 2 ) . The map is nonlinear in a way the origin never reveals, which is why the origin test rules out rather than rules in.

A norm. N ( x , y ) = x 2 + y 2 , as a map R 2 → R . It fixes the origin and it satisfies N ( a v ) = | a | N ( v ) , but | a | , not a . Taking a = − 1 : N ( − v ) = N ( v ) while − N ( v ) is negative for v ≠ 0 . Additivity fails too, since N ( 1 , 0 ) + N ( 0 , 1 ) = 2 while N ( 1 , 1 ) = 2 .

Transposition, which is linear. T ( M ) = M T on 2 × 2 matrices. It looks like a rearrangement rather than an algebraic operation, and it is linear: ( M + N ) T = M T + N T and ( a M ) T = a M T . Its kernel is { 0 } , since only the zero matrix transposes to zero, so by rank–nullity its image is all of M 2 × 2 , nullity 0 , rank 4 , summing to dim ⁡ M 2 × 2 = 4 .

Linearity is not about looking like a formula with no exponents. It is two equations that either hold for all inputs or do not, and the cases divide by how they fail: S at the origin, Q under scaling only, N under negative scaling and addition both. A map is linear when it respects the operations, whatever it looks like, which is why transposition qualifies and squaring does not.

Common errors

Common misconception

A map given by a first-degree formula is linear, so x ↦ m x + c and maps that add a constant vector qualify, since their graphs are straight lines.

Related units

Requires

Connected

Learn this topic

Used in

Sources

Results update as you type. Use the up and down arrow keys to move between results, Enter to open one, and Escape to close.

Type to search.

Settings

Appearance

Interface density

Your record

Your progress is stored in this browser and nowhere else: an identifier, the answers you have given, the mastery states and review schedule derived from them, and the lesson you last opened. Clearing it makes you a new learner on this device. It cannot be undone, and it will not affect your appearance or density settings.

Focus timer

Focus--minutes remaining

Phase

Kept in this browser only, and used to label the session in your own history.

Today

Nothing recorded yet. Finish a focus session and it will appear here.

Settings

Focus sessions between long breaks.

Sessions you are aiming for in a day.

Notifications

Your history

Sessions are stored in this browser and nowhere else. They are not evidence and never reach your mastery record.