Transformations & Vector Spaces

Understand the abstract structures that unify linear algebra.

CfB5KPcwCSO15L3gONpMK5uMdYVqO+qDmeGUT8KwFCrOCVciVo47QuYuOo/80cHNaqJzUPBq5uJ3mPRPTHxfduxrkuyLyLrbKpWMNajuUJUuzjTx1FjK2EQIblRaXlYW/xJUFpB5RWBTkArCvKM1uzoPV4wwtQBz/HyIc3ajhHXIyjZtlfyYqObBHD7Nhw8llcZ1NIY7O4tStvxmywAk6yVbdJYpNo3Nfw37lmEd60VHbLMbCoOw9J8PW8czjIVWVMJtou2UCXrJVwII2dkiX08ynjziU4H6HiLxQqqItOfok3E853tRzEuNvhIzv568GZzoDfTwIKunXxCzSqjVnvFSxvlQKwxvVcIKkHQ+AJLS0PNM1Qrj2b9IHd4LVoR9DzBmFapPRodZX+xqyLyf3GFliS/uVsfeM/lEhSkT1OUj7DSEAGfQQ/OIXx2GC0rQyancvLBYaXzL+6nMt1ql1uujsiUBfzJMj/Zsg3M/aRXVZ06L/57K+Ai3I5Z+u+AwzhmhMYUYjFIE775kDRB1G5iicFDzvdiVOyqwzur2nybu9JbiasUM6WfJmCau2+4Jb+sYlXTQcjSDPKsGdvivDPq1Vb6hHgobVT3FHPmEGNEZICCyzHbrtRbSBmcFGKSb6265fP
YqDxyyOtJox1eQ4OINApshwHLoHuTW5IPioWbyPXJJZlM0rY+wFxlwZ+k4MZ94Es8e+oLXEZcw12XRZcW5D3UFAKSmgvWgkmzJ4LFxf/VPsS+wzZbcRJ53bHBNgYm3SqFnInv9KnvAwDu9WhnYy5/H332zwtlmT+JYr6djGGfTDPdCyRCUVFJi3bEOduWFYV+kc9qhZ5mdKELPJSByYkWdda33lZMipKbhTDbCuRmodue4Tj7w8yBlEuprAGSCVgy1HR29bLXrqzKDYFlgDXo1GFp2C1orNd6UpQ1TQMi1u2bYQhtFB7VZPRlyZyqr9tO6uSY3SzfkJxuv93Qou6vcn7ihz3YAmwoJTsBFSmzvsV6L9qxBcX9esV+G1CCE/mSRsvUhpyngTJE7B4Q5ggnrdNmTTLddEL2zRyw8ZHt3Q5nV00n03sMKWf7gLfC2c1QQIyuJO8RwJbfbML/uLpku9UtAKRnvEhtDrA2LtP6R0PIDrLt2Uyn0jmVc/GAKDBPprfuyfshSTjFY3Bbbh/zVsXN6w9FuurN61UZ4rAbBqG5pm6Gi790qpSR0kYcdwtETDLVqh58G0KGgLm8UKrl67Xx35nmOHLw7QtOdYacdhXbphPWLzQ58VPL7XZ8iZasCTV8o

Linear Transformations

A linear transformation T: V → W satisfies:

T(u + v) = T(u) + T(v)  (additivity)
T(cv) = cT(v)  (homogeneity)

Every linear transformation from ℝⁿ to ℝᵐ can be represented as multiplication by an m×n matrix. Geometric examples:

GzYd3C68KmF2U9vk7C3K/geSZLpd+H7eC8ZqrJiuzr42D8l9ex1sY1jZtVJXscfA3SWZD6A9WQVyGLWi3g5WeVM+STSbvPhnSIpqOcSMYOUfAJzzjPQ/rTV94i9pcQgdlpsoH6ky9kgYLssTBaTdr5zjxXI2crliZwg4hS4aB4u7APa+MCewhXVzwnMaAtKiFJ8mzkk+YiQHSl8gTBlMLQKQ+81+4df+EmFm2v5x+sbzZi4c9oiIQCOzwJktWn0b/4Pof8p5cVxFJVNpWJrJuk5S9UImF9ml4DrgFtT0PZWNp/yBR3sWvCFyc/EtR74Hy4k1Kw5yZLyi3kSsiH/I4zF6zvGDoFdM65Ki9mBGwWcF6Bv0qrJJXb+1hPaDpic+aW2QPNoordN840z/ePEJpdr1d23Uw7moZmjXPW63lYZAOu7Rn+zm4bsMBje7fzP+dpwpU5C1WU5KYYvxsj4M8NubRGfLBcVjlB+jf3lDbOWXyKbXJeB3G/DWV6E++DOr6mdv5eatG9N9TaJTDWrW0zJm3asyAy2cpioqh/bGK8DONfVdELTgUIkIr6IlNXGXCXZq3e/g+lrVWwLWDI/KMb1E5oaK4SlB0Ck9ijxvjZA9+jVQvDA7kmqwsL1sh96K4V2cb8
  • Rotation by θ: Uses sine and cosine in the matrix
  • diZ+t9WDhD3iTKTyNBmEIWlD75INYVxkqUE/tjNRdi2YP7Rrz20w70NVQHGAUEhDi2TrTDaRCzsYPPPoJGwzzwCfJe5wHI+rQeIh/jyMgrvb9IcTHrqyFJ60IJsoS4cACDGiBUTdyJTPwS50r73ZSGZwN//dSRL7azXXQC0Oxii1/+VZTyMd1bk/di84Nu8aNEGjYZkNI/jRyKmBLYbtn1knaozkQk2TYP1ZQm6FtTazl3FborcKy/1F70baxjsN0gXLtgyk8xi/kzgFpb+FyDGrdjSZZmZPRaXkEZnjihBurhe0xT/6kc9siIWmQb7b+BlOcNhJ70CTA7nLGAJoEOxH9M3LLZlK7Na49SJpXNNOh9XG6cVT0KbwREdNhmbYbpH8OmDaNPBTYWYb2GjC4MRX0JgLmnT5+IotFpgOtjhZMG9QSnMql66PnpohYVHwrfRDJ2V3xMD95A5eTIaOYmT4ficPQnDeMFPidEbHa0a7JOeT7rqaFOapm6mS4zu9ZV5SmYsxx3UgQye0DlD8z8/Tg2YoMihgn0e/nTBMT1St5trqlUXzAyOqUT0LFmgOrZ8uAG8ypPbGpNOY20XW9Vb+87Pyp0FXAoON3ycyg4RJhiNwIz9t/ai9RAEQtitv5jGcru
  • Reflection: Across a line or plane
  • Scaling: Diagonal matrix with scale factors
  • Projection: Onto a subspace — key in least-squares regression

These connect directly to coordinate geometry transformations.

Vector Spaces & Subspaces

A vector space V over ℝ is a set with addition and scalar multiplication satisfying 8 axioms (closure, associativity, commutativity, identity, inverse, compatibility, distributivity). Examples beyond ℝⁿ:

A subspace is a subset closed under addition and scalar multiplication. Important subspaces of a matrix A: column space (Col A), row space, null space (Nul A).

Basis & Dimension

A basis is a linearly independent spanning set.
dim(V) = number of vectors in any basis
dim(ℝⁿ) = n, with standard basis e₁, e₂, …, eₙ

Change of basis transforms coordinates between different bases — essential when working with eigenvectors as a basis (diagonalization).

uYPKQ0d5wCliXpw3/1lcYNQKR12kEWHXSkBoYLogMyJTBenAlDTZDLic5pX9IRaj83YgdtTal6njTuNYpH5OuasSdaPIszzi/BiUBVE4ZXjzwQ3/i31/cXTEbIivgtBo72JK73iadMFUCs5SFesqK8Z11AAYJdiQCnd6zF1SDmwH1A6DAcz/FzonDJUtwT6uzpekFPvFTq5kGMy7FvJPIgqUACn/Cz7n1A/MEUI20//9BU/yYY8vZS07RNAwUkvsf28TWrs9CJOMXV6y0FNjTvGyCHBn0M/g1AxiT5SlJO2ZtlL6jrhRih0qTZkSZXYDLibUoFLPnR9bovw+jZf3tXX/vgmQjFSYwUZcTjZ5MHcyvIfylZQPXLby9VUgcCjZOS8T2INRfWt2RBkPqLvhO5BW23vKWAZL6Aq29FTLxPnPo5kTSdWwf47nEZElKHORSkPxXPxonddfd7viq3x6Zdxh2SzT0wcAX8rN1rV0tVfNVWbXHP05hxYoupr/lnLx4Vltu7zsk1L5EWmIqtB/IC9N1aPGlYTno6jPwU7ia0hkwWr+XJaeEP+Qn7oQ+iKsarKdnvmYHQTUqd2Ee+MXBebjees4CPSKf0xiuVW1FWVP1p78P3orZqFZf+LjVXpS5ohQLd

Rank & Nullity

rank(A) = dim(Col A) = dim(Row A)
nullity(A) = dim(Nul A)
Rank-Nullity Theorem: rank(A) + nullity(A) = n
The Rank-Nullity Theorem is a dimension-counting result: the "input space" ℝⁿ splits into the part that maps to nonzero outputs (rank) and the part that maps to zero (nullity). This connects to solution counts for systems of equations: unique (full rank), infinite (nullity > 0), or none (inconsistent).