An Intuitive Guide to Linear Algebra
betterexplained.com
betterexplained.com
They went out of their way to explain how first-order linearity was so fundamentally important for all sorts of non-linear forces.
Great links.
… or Mathematics for Machine Learning
There are YouTube videos for both books:
Axler: https://youtube.com/playlist?list=PLGAnmvB9m7zOBVCZBUUmSinFV...
MML: https://youtube.com/playlist?list=PLiiljHvN6z1_o1ztXTKWPrShr...
I appreciate any textbook with interesting real world examples and slow worked-through solutions. But maybe I'm a bit too lazy to do the work myself.
I still haven't grasped really what svd does, why it is different from eigenstuff (and... well... what eigenvalues/vectors are...) and the link between those and solving linear systems, and with the characteristic polynomial, and matrix inversion, and... I have intuitions, and I can mostly implement the stuff, but no clear understanding.
So... I suck at learning linear algebra :-)
This article leaves out the key insight of matrices as a transformation of space.
[1] Linear Algebra: Theory, Intuition, Code:
https://leanpub.com/linear_algebra
[2] Complete linear algebra: theory and implementation in code:
https://www.udemy.com/course/linear-algebra-theory-and-imple...
An Intuitive Guide to Linear Algebra (2012) - https://news.ycombinator.com/item?id=22416319 - Feb 2020 (102 comments)
An Intuitive Guide to Linear Algebra - https://news.ycombinator.com/item?id=8920638 - Jan 2015 (51 comments)
An Intuitive Guide to Linear Algebra - https://news.ycombinator.com/item?id=4633662 - Oct 2012 (115 comments)
> Exponents (F(x)=x^2) aren’t predictable: 10^2 is 100, but 20^2 is 400. We doubled the input but quadrupled the output.
I'm struggling to find sympathy for this tortured definition. "Predictability" seems like such poor way to work out an explanation for linearity.
For instance, in Excel is there a function for multiplying matrices? And getting the eigen-vector?
That said, I would be surprised if Excel spreadsheets were implemented as matrices. Since you can update one cell and have it automatically update any computation that uses that cell, I would expect spreadsheets to be implemented with some sort of dependency graph so it’s easy to traverse and update the values that need to be changed. (This could be implemented as an adjacency matrix, but I haven’t seen that representation used before for programming language dataflow analysis.)
The problem I've had with Excel etc. is that every cell can hide an operation and some do and some don't and it becomes difficult to understand what the totality of calculation is. Whereas if it could be expressed as operations between matrices the whole calculation could be expressed as a single formula, perhaps. (?)
Math is about concepts, structures, and relationships. It’s not about definitions and theorems. We use those only to formalize the concepts that we’ve thought of. That’s why I recommend the “intuitionist” approach for learning math. You can fill the computations and proofs later.
[1] https://www.youtube.com/watch?v=fNk_zzaMoSs&list=PLZHQObOWTQ...
- Strang's 4 subspaces: https://web.mit.edu/18.06/www/Essays/newpaper_ver3.pdf , and just enough supporting material to understand that at a basic level, and hopefully finishing up with the SVD, which to me is basically a summary of LA in one equation.
- A quick look at the eigenvalue problem, Ax = 𝛌x, with the key note that hey, in the vast majority of cases, Ax does not equal a scaled version of x (it took me way too long to realize that's what we were doing here when I was first learning LA). <roll tacoma narrows bridge tape here>
Thinking of matrices as spreadsheets is barely abstraction. Seeing the derivative operator represented as a matrix, acting over the polynomial vector space can open your eyes.
Taking the determinant of that matrix shows that d/dx isn't invertible.
Thinking of the fixed point of the transformation yields exp, the eigenfunction of the operator.
The "derivative operator" notion that the GP is describing was hugely important for me in intuiting what linalg could do.
Do you have a link someone could read more about this ?
This is actually a common theme of mathematics, that the individual objects are in some sense less interesting than maps between them. And, of course, the idea that any time you have a bunch of individual mathematical objects of the same type, mathematicians are going to group them together and call it a "space" of some kind.
In fact, my previous paragraph is pretty much the basis for category theory. One almost never looks at individual members of a category other than a few, selected special objects like initial and terminal objects. A lot of algebra works in a similar way. If I could impart one important insight from all the mathematics I've read, done, and seen, it would be this idea of relations being more important than the things themselves.
That way, one gradually develops a level of mathematical maturity that allows an appreciation of abstraction.
I read about half of this. It’s nearly incomprehensible to me - I’d have to dig to find out what he’s trying to accomplish.
He’s going out of his way to introduce novelty and it appears he will try anything except address the subject directly.
I didn’t even know until today there was a concept called linear algebra, it was taught to me as introductory geometry alongside other geometry concepts. So that’s neat to learn!
T(a+b)=T(a)+T(b)
Matrices just happen to be one way of expressing those transformations.
Since all linear transforms between vector spaces with a finite basis are finite matrices, the computational tools make it tractable to calculate properties of vector spaces that aren’t even decidable for e.g. groups. For a simple, but remarkable example: All finite vector spaces of the same dimension are isomorphic, but in general, it’s undecidable to compute if two finitely-presented groups are isomorphic.
But (iirc) it is semidecidable, like the halting problem, and isomorphism is decidable for finitely presented abelian groups.
Do you have a favorite example that highlights the unique computational properties of vector spaces?
*I don't know how this changes in the finitely-presented case, but I assume the extra constraint can be used to improve the performance of the algorithms. It's a lot easier to find asymptotic analysis of the finitely-generated case though and I don't see a way around dealing with the fact that it's still not free.
[0] - I'm basing this on Chapter 8 of https://cs.uwaterloo.ca/~astorjoh/diss2up.pdf, but this is a deep field in which I am not an expert, so if you are, I'd love to hear more.
If I may add, I found "useful magic" like discrete Fourier transforms, local linear approximations and homogenous differential equations as exciting examples to motivate students into the abstract theory of linear transformations
To people out there writing educational blogs: do more research and find good, well written, timeless resources to point people to for the basics. Spend your energy writing something new that we haven't all already read.
I used to teach this. One of the key ideas is to get rid of 3d geometry and state, from the beginning, huge sized problems (simple models of traffic using kirchoff’s laws, image convolution, statics…). Otherwise, why define the determinant? Just compute it. Or eigenvalues? Or kernels?
Are you aware of any resources that help to elucidate ideas like that?