SOLID STATE PRESS
← Back to catalog
The Rank-Nullity Theorem cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

The Rank-Nullity Theorem

Kernel, Image, and the Dimension Equation That Ties Them Together — A TLDR Primer

Linear algebra stops a lot of students in the same place: the moment the course shifts from solving equations to talking about kernels, images, and dimension. The Rank-Nullity Theorem sits at the center of that shift, and if you do not understand it, the rest of the course feels like it is written in a foreign language.

This TLDR primer cuts straight to what you need. It builds the theorem from the ground up — starting with what a linear map actually does, defining the kernel (the set of vectors sent to zero) and the image (the set of vectors the map can reach), then showing exactly why their dimensions must add up to the dimension of the domain. The proof is carried out step by step, in plain language you can follow without a graduate-level background.

From there, the guide translates everything into matrix language: null space, column space, pivot columns, and free variables from row reduction. A focused section on consequences shows how rank-nullity immediately tells you whether a linear map is injective, surjective, or both — and why those two properties collapse into one for square matrices. The final section previews where the theorem reappears: solution sets of linear systems, differential operators, and the broader fundamental theorem of linear algebra.

This guide is short by design, stripped to essentials, with worked examples and zero filler. Whether you are prepping for an exam, working through a college linear algebra course, or trying to get a foothold in the subject before class moves on, everything here is built to make the ideas stick.

If the kernel and image study guide you needed does not exist on your syllabus, it does now — grab your copy and get oriented.

What you'll learn
  • Define linear transformations, kernel, image, rank, and nullity precisely
  • State and interpret the Rank-Nullity Theorem in both matrix and abstract form
  • Prove the theorem by extending a basis of the kernel to a basis of the domain
  • Use rank-nullity to determine injectivity, surjectivity, and solvability of linear systems
  • Apply the theorem to compute dimensions of null spaces and column spaces from a matrix
What's inside
  1. 1. Linear Maps, Kernel, and Image
    Sets up the cast of characters: linear transformations between vector spaces, and the two subspaces — kernel and image — that the theorem relates.
  2. 2. Rank, Nullity, and the Statement of the Theorem
    Defines rank and nullity as dimensions of the image and kernel, then states the Rank-Nullity Theorem and unpacks what it says.
  3. 3. Why It's True: A Proof You Can Follow
    Proves the theorem by starting with a basis of the kernel, extending it to the whole domain, and showing the extension maps to a basis of the image.
  4. 4. The Matrix Version: Column Space and Null Space
    Translates the theorem into matrix language using row reduction, pivot columns, and free variables.
  5. 5. Consequences: Injectivity, Surjectivity, and Square Matrices
    Uses rank-nullity to derive when linear maps are one-to-one or onto, and why for square matrices the two conditions collapse into one.
  6. 6. Where This Shows Up Next
    Briefly maps rank-nullity onto later topics: solution sets of linear systems, differential operators, and the fundamental theorem of linear algebra.
Published by Solid State Press
The Rank-Nullity Theorem cover
TLDR STUDY GUIDES

The Rank-Nullity Theorem

Kernel, Image, and the Dimension Equation That Ties Them Together — A TLDR Primer
Solid State Press

The Rank-Nullity Theorem

Kernel, Image, and the Dimension Equation That Ties Them Together — A TLDR Primer

Copyright © 2026 Solid State Press.

Published by Solid State Press.

All rights reserved. No part of this book may be reproduced or transmitted in any form without prior written permission, except for brief quotations in critical reviews and educational use.

Part of the TLDR Study Guides series.

Contents

  1. 1 Linear Maps, Kernel, and Image
  2. 2 Rank, Nullity, and the Statement of the Theorem
  3. 3 Why It's True: A Proof You Can Follow
  4. 4 The Matrix Version: Column Space and Null Space
  5. 5 Consequences: Injectivity, Surjectivity, and Square Matrices
  6. 6 Where This Shows Up Next
Chapter 1

Linear Maps, Kernel, and Image

Every theorem in linear algebra needs a cast of characters. Before the Rank-Nullity Theorem can say anything, you need two objects — the kernel and the image of a linear map — and to understand those, you need to know what a linear map is. This section builds all three from the ground up.

Vector Spaces, Briefly

A vector space is a set of objects you can add together and scale by numbers, where those two operations behave the way you would expect from experience with arrows in the plane or columns of real numbers. The familiar examples are $\mathbb{R}^n$ — tuples of $n$ real numbers — but vector spaces also include spaces of polynomials, matrices, and functions. For this book, $\mathbb{R}^n$ and $\mathbb{R}^m$ will carry most of the weight, but every definition here applies to any finite-dimensional vector space.

The one piece of vocabulary you need immediately: a subspace is a subset of a vector space that is itself a vector space. Concretely, a subset $S$ is a subspace if it contains the zero vector, and if it is closed under addition and scalar multiplication — meaning any sum or scalar multiple of vectors in $S$ stays in $S$. The all-zeros vector on its own, $\{0\}$, is the smallest possible subspace. The whole space is the largest. Everything in between is something worth studying.

Linear Transformations

A linear transformation (also called a linear map) is a function $T: V \to W$ between two vector spaces that respects the vector-space structure. Precisely, $T$ must satisfy two rules for all vectors $\mathbf{u}, \mathbf{v} \in V$ and all scalars $c$:

$T(\mathbf{u} + \mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v})$

$T(c\mathbf{v}) = c\, T(\mathbf{v})$

Both rules together say that $T$ commutes with the operations of the vector space. You can add first and then apply $T$, or apply $T$ first and then add — you get the same answer either way. Same for scaling.

These two rules have an immediate consequence worth noting: $T(\mathbf{0}) = \mathbf{0}$ always. Proof: $T(\mathbf{0}) = T(0 \cdot \mathbf{v}) = 0 \cdot T(\mathbf{v}) = \mathbf{0}$. This will matter when we define the kernel.

A common source of confusion is the word "linear" itself. In high school, a "linear function" often means something like $f(x) = 2x + 3$. But $f(x) = 2x + 3$ is not a linear transformation in the sense above, because $f(0) = 3 \neq 0$. Linear transformations always send zero to zero. The high-school version is more precisely called an affine function.

About This Book

If you are staring down a college linear algebra exam review session and the rank-nullity theorem still feels like alphabet soup, this book is for you. It also works for the high school student encountering linear algebra for beginners who needs a clear vector space and linear transformation primer before jumping into a full textbook.

This guide walks through every piece of the theorem in order: the kernel and image of a linear map, rank and nullity as dimensions, a line-by-line proof, and the matrix-side picture involving null space, column space, and row reduction. It closes with the practical payoff — injectivity and surjectivity of linear maps explained through the lens of a single equation. Consider it a linear algebra kernel and image study guide with no filler and ruthless cuts.

Read straight through once to build the picture, then work every example alongside the text. A short problem set sits at the end — attempt it before checking the solutions, and the ideas will stick.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon