Skip to content
Back to exploration
Algebra / English

Linear transformations and matrices | Chapter 3, Essence of linear algebra

3Blue1Brown · YouTube · 10:58

Open original
READ & KEEP

The explanation, unpacked.

Reviewed learning material · Video analysis · English
Read the full overview

The video connects linear maps with images of standard basis vectors and matrix columns, using rotations, shears and grid motion to explain matrix-vector multiplication.

Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.

Chapters

0:00Introduction to Linear Transformations0:43Visualizing Transformations with Grids2:31Properties of Linear Transformations3:33Describing Transformations Numerically via Basis Vectors6:18The Matrix Representation8:00Examples: Rotation and Shear10:00Matrix Columns as Transformed Basis Vectors10:08Matrix-Vector Multiplication Intuition10:14Visualizing Space Transformation

Learning script

Generated from the video's visuals and explanation; not verbatim speech.

Linear algebra centers on understanding transformations—functions that map input vectors to output vectors. While 'function' is mathematically sufficient, 'transformation' evokes motion. We visualize this by tracking how every point in a 2D plane shifts. Instead of drawing infinite arrows, we observe an entire coordinate grid morphing. This perspective reveals the global structure of the mapping, showing how space itself stretches, rotates, or shears around the origin.

Linearity means T(av+bw)=aT(v)+bT(w)T(av+bw)=aT(v)+bT(w), so the origin stays fixed. Straight, parallel and evenly spaced grid lines illustrate this structure. A singular map can collapse a line into a point or the plane into a line; linearity does not require preserving dimension.

How do we encode such complex spatial movements numerically? Remarkably, we only need to track two specific vectors: the standard basis vectors i^=[1,0]T\hat{i} = [1, 0]^T and j^=[0,1]T\hat{j} = [0, 1]^T. Because linearity preserves vector addition and scalar multiplication, any arbitrary vector v⃗=xi^+yj^\vec{v} = x\hat{i} + y\hat{j} will transform exactly according to the same coefficients applied to the moved basis vectors. Thus, knowing where i^\hat{i} and j^\hat{j} land determines the destination of every other point in the plane.

We package these critical landing coordinates into a 2×22 \times 2 matrix. The first column records where i^\hat{i} goes, and the second column records where j^\hat{j} goes. When multiplying this matrix by a vector [x,y]T[x, y]^T, the operation computes x(column1)+y(column2)x(\text{column}_1) + y(\text{column}_2). This reframes matrix multiplication from a tedious arithmetic recipe into an intuitive geometric construction: scaling the transformed basis vectors and summing them to find the final position within the skewed coordinate system defined by the matrix. Input and output coordinates here use the fixed standard basis. This actively moves vectors rather than automatically changing coordinate systems. The basis images may be dependent and need not form a new basis.

Consider concrete examples. A 90∘90^\circ counterclockwise rotation sends i^\hat{i} to [0,1]T[0, 1]^T and j^\hat{j} to [−1,0]T[-1, 0]^T, yielding the matrix [[0,−1],[1,0]][[0, -1], [1, 0]]. Conversely, a horizontal shear keeps i^\hat{i} fixed at [1,0]T[1, 0]^T while sliding j^\hat{j} diagonally to [1,1]T[1, 1]^T, producing [[1,1],[0,1]][[1, 1], [0, 1]]. By reading off these basis destinations, we instantly construct the matrix representing the transformation, bridging abstract geometry with computational algebra.

The first matrix column records the image of î and the second the image of ĵ. Combining these images with input components determines every output. Dependent columns describe a valid dimension-reducing map.

Multiplying the input column [x,y]ᵀ gives output coordinates in the same standard frame: x times the first column plus y times the second. A change of basis and an active linear map are related but distinct operations.

When we apply this specific matrix to the standard Cartesian grid, every point shifts consistently along with the moving basis vectors. Notice that parallel lines remain evenly spaced and straight throughout the motion; this geometric behavior distinguishes valid linear transformations from nonlinear distortions like bending or curving. Understanding matrices purely as spatial operators provides essential intuition for advanced topics such as eigenvectors, change of basis, and determinant calculations later in the course.

Knowledge cards

01

Definition of Linear Transformation

A linear map preserves addition and scalar multiplication and fixes the origin. Grid behavior is a geometric explanation that allows lower-dimensional collapse; the algebraic axioms provide the definition.

02

Role of Basis Vectors

Any vector in R2\mathbb{R}^2 can be expressed as a linear combination of the standard basis vectors i^\hat{i} and j^\hat{j}. Since linear transformations respect this combination, tracking only the images of i^\hat{i} and j^\hat{j} allows us to determine the image of any arbitrary vector.

v⃗=xi^+yj^\vec{v} = x\hat{i} + y\hat{j}
03

Columns are images of the standard basis

Column one is T(î) and column two is T(ĵ), written in the fixed output basis. They need not be independent, so they do not necessarily form a transformed basis.

A=[∣∣T(i^)T(j^)∣∣]A = \begin{bmatrix} | & | \\ T(\hat{i}) & T(\hat{j}) \\ | & | \end{bmatrix}
04

Geometric Interpretation of Matrix-Vector Multiplication

Multiplying a matrix AA by a vector x⃗\vec{x} calculates a weighted sum of the columns of AA. The weights come from the components of x⃗\vec{x}. This represents constructing a new vector by scaling the transformed basis directions and adding them together.

Ax⃗=x1⋅col1(A)+x2⋅col2(A)A\vec{x} = x_1 \cdot \text{col}_1(A) + x_2 \cdot \text{col}_2(A)
05

Columns are images of the standard basis

Column one is T(î) and column two is T(ĵ), written in the fixed output basis. They need not be independent, so they do not necessarily form a transformed basis.

[abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix}
06

Computing Output via Linear Combination

Multiplying a matrix by a vector [x,y]T[x, y]^T yields a result formed by taking xx copies of the first column added to yy copies of the second column. This reflects linearity: images distribute over sums and scalar multiples.

[abcd][xy]=x[ac]+y[bd]\begin{bmatrix} a & b \\ c & d \end{bmatrix}\begin{bmatrix} x \\ y \end{bmatrix}=x\begin{bmatrix} a \\ c \end{bmatrix}+y\begin{bmatrix} b \\ d \end{bmatrix}
07

Geometric Signature of Linearity

A linear map preserves addition and scalar multiplication and fixes the origin. Grid behavior is a geometric explanation that allows lower-dimensional collapse; the algebraic axioms provide the definition.

08

Formal Definition of Linear Maps

Algebraically, a function LL qualifies as linear if it satisfies both additivity (L(v⃗+w⃗)=L(v⃗)+L(w⃗)L(\vec{v} + \vec{w}) = L(\vec{v}) + L(\vec{w})) and scaling (L(cv⃗)=cL(v⃗)L(c\vec{v}) = cL(\vec{v})). Visual preservation of grids corresponds precisely to satisfying these axioms simultaneously.

L(v⃗+w⃗)=L(v⃗)+L(w⃗),L(cv⃗)=cL(v⃗)L(\vec{v}+\vec{w})=L(\vec{v})+L(\vec{w}),\quad L(c\vec{v})=cL(\vec{v})

Explore the knowledge in this video

Open video knowledge graph →

  • Linear transformations ExplanationAt 2:31
    Why this connection?

    The reviewed definition card states that a linear map preserves vector addition and scalar multiplication and fixes the origin. Its action is determined by the images of the standard basis, which become matrix columns in fixed output coordinates. These images need not be linearly independent; a linear map may collapse dimension. Grid animations illustrate the algebraic definition rather than replace it.

Questions this video answers

Meet the concept

↗
Understand why

↗
Understand why

↗
Find a method

↗
Find a method

↗
Meet the concept

↗
Meet the concept

↗
Meet the concept

↗