first isomorphism theorem

Here is the structural climax of the whole subject of linear maps. Take any linear map T : V -> W. It fails to be injective exactly to the extent of its kernel, and it fails to be surjective exactly to the extent that W is bigger than its image. The first isomorphism theorem says: if you quotient out the kernel from the domain, what remains is a perfect copy of the image. In symbols, V / ker T is isomorphic to im T.

The intuition: two inputs u and v get sent to the same place exactly when u - v lies in the kernel. So T can't tell apart vectors that differ by a kernel element. The quotient space V/ker T is built precisely by declaring such vectors equal — by collapsing each coset to a point. Once you do that collapse, T becomes injective, and since it lands exactly on im T, it becomes a bijection onto the image. A linear bijection is an isomorphism.

Concretely the isomorphism is the induced map T-bar that sends the coset v + ker T to T(v). It is well defined because any two representatives differ by a kernel vector, which T sends to zero; it is linear because T is; it is injective by construction; and it is onto im T by definition of image. That single induced map carries all the content.

Why it matters: this one theorem is the engine behind rank-nullity, and it is the linear-algebra shadow of a theorem that recurs for groups, rings, and modules. Learning to see ker, im, and the quotient as three sides of one triangle is the conceptual upgrade Volume II is built around.