Ttgjyuk

I understand that if you have a linear transformation from $U$ to $V$ with, say, $operatornamedim U = 3$, $operatornamerank T = 2$, then the set of points that map onto the $0$ vector will lie along a straight line, and therefore $operatornamenullityT = 1$.

Can anyone offer an intuitive explanation of why this is always true?

I like this question. Let me take a shot at it. I think it's best to think of the rank as the dimension of the range (or image).

Consider first a nonsingular transformation $T$ on an $n-$dimensional vector space. We know that the rank is $n$ and the nullity $0$, so the theorem holds in this case. $T$ maps a basis to a basis. Suppose we modify $T$ by mapping the first vector in the basis to $0$. Call the new transformation $T_1$. Clearly, the nullity of $T$ is $1$. What is the rank? In the image of $T$ one of the basis vectors collapses to $0$ when we go to the image of $T_1,$ so the image of $T_1$ has dimension $n-1$ and the theorem hold in this case.

Now continue the process. If $T_2$ is the same as $T_1$ except that the second basis vector is mapped to $0$, then the nullity will be $2$, and the image will be of dimension $n-2$, because again, one dimension collapses.

Of course, we can continue until we arrive at $T_n=0$ and the theorem always holds.

I hope this makes intuitive sense to you.

I like saulspatz' answer because it is very hands-on. I would like to offer another perspective, one based on the fact that linear transformations are characterized by their ranks, up to choice of bases in domain and codomain. The key is in this proposition:

Proposition. Suppose $Tcolon Vto W$ is a linear transformation with $dim V = n$ and $dim W = m$ and $operatornamerank T = r leqslant m$. Then there are bases $v_1,dots,v_n$ for $V$ and $w_1,dots,w_m$ for $W$ such that the matrix for $T$ with respect to these bases is
$$
mathcal M(T,v_1,dots,v_n,w_1,dots,w_m) = beginpmatrix I_rtimes r & 0_rtimes n-r \ 0_m-rtimes r & 0_m-rtimes n-rendpmatrix,
$$
where $I_rtimes r$ is the $rtimes r$ identity matrix, and the various $0_asttimesast$ are the zero matrices of the corresponding dimensions. As a quick corollary of the proposition, we can read off of the matrix for $T$ in these bases that
beginalign*
operatornamerankT &stackreltextdef= dim operatornameimageT = r, \
operatornamenullityT &stackreltextdef= dim ker T = n-r,
endalign*
and hence gain the rank-nullity theorem:
$$
dim V = n = r + (n-r) = operatornamerankT + operatornamenullityT.
$$
For a quick proof of the proposition, keeping things as "coarse" as possible for intuition's sake, because the rank of $T$ is $r$, take vectors $v_1,dots,v_r$ in $V$ such that $w_1 = T(v_1),dots,w_r = T(v_r)$ span the image of $T$. Extend $v_1,dots,v_r$ to a basis $v_1,dots,v_r,v_r+1,dots,v_n$ for $V$ and $w_1,dots,w_r$ to a basis $w_1,dots,w_r,w_r+1,dots,w_m$ for $W$. With respect to these bases, we quickly determine
$$
mathcal M(T,v_1,dots,v_n,w_1,dots,w_m) = beginpmatrix I_rtimes r & ast \ 0_m-rtimes r & astendpmatrix.
$$
Because the rank of $T$ is $r$, and the first $r$ columns of the matrix for $T$ are linearly independent, we determine that (possibly after some row and column operations) the two $ast$'s in the above matrix for $T$ have to be the zero matrices of appropriate dimensions, hence the proposition.