Save this video free

Linear Algebra - Lecture 20 - Fall, 2026

Nathanson math lectures · 46:31 · Watch on YouTube

Part of Lehman College (CUNY) Math 313. See all 17 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

The lecture develops least-squares solutions for possibly inconsistent systems \(Ax=b\) by projecting \(b\) onto the column space of \(A\). It proves that the minimizing vectors \(x\) are exactly the solutions of the normal equations \(A^T A x=A^T b\), then works through a three-equation, two-variable example whose least-squares solution is \((178/101,47/101)\).

Key takeaways

Chapters

0:00 Inconsistent Systems and the Least-Squares Error
8:00 Matrix Multiplication Identifies the Column Space
13:51 Least-Squares Solutions and the Normal-Equation Criterion
16:12 Transposes Convert Column Inner Products into Matrix Products
19:48 Projection onto a Finite-Dimensional Subspace
25:06 Why the Orthogonal Projection Is the Unique Closest Vector
30:26 Orthogonality of the Residual Produces the Normal Equations
38:21 A Three-Equation System with No Exact Solution
43:30 Solving the Example by \(A^T A x=A^T b\)

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:01 So this is lecture 20 on uh what is called best approximation and least squares. So the fundamental problem in linear algebra is solving systems of linear equations. So if you have a system of m equations in n variables a11 x1 up to a1 n xn = b sub1 that's one equation in n variables down to the mth equation a m1 x1 plus a m n xn = b subm. So we have m equations

0:51 in n variables. If the system is homogeneous, which means all the right hand sides are zero, then there is always a solution. Namely, there's the zero solution when you choose each of the n variables. to be zero. But if the system is inhomogeneous,

1:40 which means not homogeneous. That means B subi is different from zero for at least one of the right hand sides. I then the system might have no solution. For example, if you have the equation the system x1 + x2 = 1 and x1 + x2 = 2. There's no solution to this system of equations because [clears throat] no matter what values you pick for x1 and

2:27 x2, x1 + x2 cannot be equal to 1 and 2 simultaneously. So this is an example of a system that is inconsistent. A system with no solution is inconsistent. Nonetheless, nonetheless, you might try to find a set of values for the variables x1 up to xn that is as close as possible to a solution. So, let me say what I mean by that. So for every

3:18 vector x x1 up to xn in Rn, let when you plug these variables into the equations that a11 x1 up to a1 n xn, it's going to be equal to something. Let's say it's equal to some number b1 hat. And for the second

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Nathanson math lectures.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.