vector space isomorphism

An isomorphism between vector spaces V and W is a linear map T: V -> W that is also a bijection — one-to-one and onto. Linearity means it respects the two operations, T(a*u + b*v) = a*T(u) + b*T(v); bijectivity means it loses and invents nothing. When such a T exists we call V and W isomorphic, written V isomorphic to W, and the inverse map T^-1 is automatically linear too, so the relationship is symmetric.

Being isomorphic means the two spaces are the SAME as far as linear algebra can tell. An isomorphism is a perfect relabeling: it carries bases to bases, independent sets to independent sets, subspaces to subspaces, and preserves every dimension and structural relationship. Any statement provable using only the vector-space operations is true in V exactly when it is true in W. The spaces may look utterly different — one polynomials, the other columns — yet be linear-algebraically indistinguishable.

The cornerstone theorem: every n-dimensional space over a field F is isomorphic to F^n. Pick a basis e_1, ..., e_n of V and send each vector to its tuple of coordinates; that map is a linear bijection onto F^n. So the degree-<=3 polynomials, the 2-by-2 matrices, and R^4 are all 'the same' four-dimensional real space wearing different costumes. This is why Vol I's results about R^n quietly govern every finite-dimensional space.

The honest punchline is the dimension theorem's twin: two finite-dimensional spaces over F are isomorphic if and only if they have equal dimension. Dimension is a COMPLETE invariant — it is the only thing an isomorphism can fail to match. This is a luxury unique to vector spaces, and it is what makes linear algebra so tractable compared to the messier classifications of groups, rings, or topological spaces.