Visualizing matrix multiplication as a linear combination
eli.thegreenplace.net
eli.thegreenplace.net
Think of the columns of the matrix A as basis vectors of a coordinate system represented in global coordinates, and the vector v as the components of a vector in that coordinate system. Then the product A * v transforms the vector v into the global coordinate system.
Carrying this forward, matrix multiplication A * B gives the combined representation of two coordinate transformations.
Edit: "Typically this visualization isn't taught" -- that's what I"m asking. What visualization were you taught, if not this one? I can't think of any other that makes any sense.
Hopefully the visualization on the linked page makes this formula's origin clear.
[1] https://upload.wikimedia.org/wikipedia/commons/e/eb/Matrix_m...
Oftentimes, no visualization or other motiviation is taught at all. Students are simply instructed the steps to follow to produce a correct result.
This tutorial is also pretty good for geometrical intuition: http://www.cns.nyu.edu/~eero/NOTES/geomLinAlg.pdf
https://github.com/arithma/mat44/blob/master/mat44.h
Used here: https://github.com/arithma/ios3dball
It's a very good thing that you thought it wise at some point. There's nothing like reinventing a few fundamental wheels for a better understanding of how they work.
AB = C,
C has the same number of rows as A and the same number of columns as B, and each column j of C is from column j of B acting as coefficients in a linear combination of all the columns of A.
Next: For the set of real numbers R, positive integers m and n, m by n real matrix A, real numbers a and b, and n by 1 x and y, we have that
A(ax + by) = (aA)x + (bA)y
so that A is linear.
If we regard x and y as vectors in the n-dimensional real vector space R^n, then we have that A is a function
A: R^n --> R^m
and a linear operator which can be good to know.
Then the subset of R^n
K = { x | x in R^n and Ax = 0 }
(where 0 is the m by 1 matrix of all zeros) is important to understand. E.g., K = [0] if and only if function A is 1-1. If m = n, then A has an inverse A^(-1) if and only if A is 1-1.
With C = AB, the matrix product is the same as function composition so that
Cx = (AB)x = A(Bx)
which also can be good to know and, of course, uses just the associative law of matrix multiplication.
That matrix multiplication is associative is a biggie -- sometimes says some big things, e.g., is the core of duality theory in linear programming.
And the situation is entirely similar for the complex numbers C in place of the real numbers R.
The first type is a change of basis where the columns of the matrix are the old basis represented in the new basis.
The second type is a linear function that takes in a vector and outputs another vector.
(If the mafiosi could read the following paper before rushing to click down-vote, then I'd be much obliged. http://www.math.rutgers.edu/~zeilberg/mamarimY/DM85.pdf)