Kernel of a linear map Created 2026-09-24 Updated 2026-10-14
The kernel of a linear map is the vector subspace of inputs sent to zero. Linearity makes it a vector subspace: if , then for all scalars . A vector in the kernel represents a change that the map cannot detect, since for every input .
For given by , the zero-output equations are and . ThusIncreasing the first input while decreasing the second by the same amount leaves the output unchanged. For the linear functional , the kernel is the straight line shown in its diagram. A linear map is injective exactly when its kernel is the zero vector subspace, because is equivalent to .
The kernel describes invisible changes, rather than all inputs that produce a specified nonzero output. If , the corresponding fiber of a function is the affine solution space of a linear equation . The difference of two inputs in that fiber belongs to the kernel; an input in that fiber need not. In particular, for the fiber cannot be a vector subspace, since it does not contain the zero vector.[ref]
Solution Sets. Margalit and Rabinoff, Interactive Linear Algebra, §2.4.2, Key Observation and Remark: translate the homogeneous solution set by any particular solution
For the linear functional , , the kernel is . Each fiber is the parallel straight line . The input vector space is two-dimensional, but the output is one scalar: a whole straight line of inputs collapses to one point of the output real line.
