<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>linearly</title><description>Linear algebra for people building AI, taught with pictures, plain words, and code.</description><link>https://linearly.space/</link><item><title>Lecture 0: How Machines Learn</title><link>https://linearly.space/lectures/lecture-00/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-00/</guid><description>Computing spent decades following exact recipes. Learning began when we replaced the recipe with a search, and the search runs on arrays of numbers.</description></item><item><title>Lecture 1: Vectors &amp; Dimensions</title><link>https://linearly.space/lectures/lecture-01/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-01/</guid><description>What a dimension is, how vectors combine, and why the equation Ax = b runs through the whole course.</description></item><item><title>Lecture 2: Matrices as Transformations</title><link>https://linearly.space/lectures/lecture-02/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-02/</guid><description>A matrix is a machine that moves every point of space at once. Its columns say everything about it, and some machines destroy information.</description></item><item><title>Lecture 3: The Shapes of Data</title><link>https://linearly.space/lectures/lecture-03/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-03/</guid><description>Every array carries a list of axes. Learning to read that list, and to say which axis should disappear, is most of what writing numerical code is.</description></item><item><title>Lecture 4: Elimination</title><link>https://linearly.space/lectures/lecture-04/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-04/</guid><description>The algorithm inside every solver. Turn a system into a staircase, read the answer from the bottom up, and discover that every step you took was a matrix.</description></item><item><title>Lecture 5: The Algebra of Matrices</title><link>https://linearly.space/lectures/lecture-05/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-05/</guid><description>Four readings of AB on one small example, why order matters and grouping does not, and what it takes to undo a matrix at all.</description></item><item><title>Lecture 6: Factorizations: A = CR and A = LU</title><link>https://linearly.space/lectures/lecture-06/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-06/</guid><description>Split a matrix into simpler matrices and it starts talking: how many independent columns it really has, and exactly what elimination did to it.</description></item><item><title>Lecture 7: Vector Spaces &amp; Subspaces</title><link>https://linearly.space/lectures/lecture-07/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-07/</guid><description>Adding and scaling are the only two moves. Any place where they behave is a vector space, and the columns of a matrix build one of the most useful ones.</description></item><item><title>Lecture 7.5: The Null Space</title><link>https://linearly.space/lectures/lecture-07-5/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-07-5/</guid><description>Add two solutions of Ax = 0 and you get another solution. Add two solutions of Ax = b and you do not. That gap is what makes one of them a subspace, and elimination hands you a basis for it.</description></item><item><title>Lecture 8: The Complete Solution &amp; Rank</title><link>https://linearly.space/lectures/lecture-08/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-08/</guid><description>One anchor plus the whole null space. Whether b fits at all, and how a single number, the rank, tells you how many answers to expect before you compute one.</description></item><item><title>Lecture 9: The Four Subspaces &amp; the Rank Theorem</title><link>https://linearly.space/lectures/lecture-09/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-09/</guid><description>One small matrix, four subspaces, four bases read straight off a single elimination, and the reason row rank always equals column rank.</description></item><item><title>Lecture 10: Orthogonality of the Four Subspaces</title><link>https://linearly.space/lectures/lecture-10/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-10/</guid><description>Row space and null space meet at a right angle, and so does the other pair. Nothing perpendicular is missing, every reachable b comes from exactly one x, and that is where the pseudoinverse comes from.</description></item><item><title>Lecture 11: Projections</title><link>https://linearly.space/lectures/lecture-11/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-11/</guid><description>When the target is out of reach, the best you can do is its shadow. The projection formula, the projection matrix, and why the miss is always perpendicular.</description></item><item><title>Lecture 12: Least Squares &amp; Linear Regression</title><link>https://linearly.space/lectures/lecture-12/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-12/</guid><description>No line goes through all the data. Least squares picks the one that misses by the least, and it is the projection from the last chapter wearing different clothes.</description></item><item><title>Lecture 13: Orthonormal Bases, Gram-Schmidt &amp; QR</title><link>https://linearly.space/lectures/lecture-13/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-13/</guid><description>Perpendicular unit columns make every formula in this course cheaper. How to build them from any basis, and the factorization that records the work.</description></item><item><title>Lecture 14: Determinants</title><link>https://linearly.space/lectures/lecture-14/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-14/</guid><description>One number says how much a matrix inflates or flattens space. Every rule, every formula, and every use of the determinant comes out of that.</description></item><item><title>Lecture 15: Eigenvalues &amp; Positive Definite Matrices</title><link>https://linearly.space/lectures/lecture-15/</link><guid isPermaLink="true">https://linearly.space/lectures/lecture-15/</guid><description>Almost every direction gets turned when a matrix acts. A few survive and only stretch. Those directions run the long run, and their stretch factors shape every loss surface you will ever descend.</description></item></channel></rss>