Save this video free

Linear Algebra for Engineers lecture 31: Orthogonal Projections and Orthonormal Sets

Alex Townsend · 50:12 · Watch on YouTube

Part of Cornell MATH 2940 Linear Algebra for Engineers F26. See all 6 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

Alex Townsend develops orthogonal projection as the geometric shadow of a vector onto a line, then uses it to calculate nearest-point distances. He shows how orthonormal bases simplify coordinates and projections, and how a square matrix with orthonormal columns satisfies UᵀU = I and U⁻¹ = Uᵀ, motivating Gram–Schmidt and QR factorization.

Key takeaways

Chapters

0:00 Orthogonality and Coordinates in an Orthogonal Basis
6:00 Reading Orthogonal-Basis Coordinates as Shadows
13:00 Projecting (1, 0) onto the Line y = x
19:00 Finding the Nearest Point on a Line and Its Distance
26:00 Orthonormal Bases Simplify Coordinate Formulas
32:00 Normalizing the Example Orthogonal Basis
35:00 Orthonormal Columns Give UᵀU = I
40:00 Square Orthonormal Matrices Make Inversion a Transpose
44:00 Why Orthogonal Matrices Have Orthonormal Columns
47:00 Closing Question on Orthogonal-Matrix Eigenvalues

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

Transcript excerpt

0:00 is in lecture 31 which is section 6.2 and a bit of section 6.3 of the textbook. So we're we're just learning right now uh about orthogonality and as the lectures go on we're going to start using orthogonality and I showed you last time how one aspect of orthogonality was super useful when you want to work when you're working in a basis that's an orthogonal set then uh that can be really convenient. So we say two vectors are orthogonal if their dot product is zero. This is the linear algebra uh notation for dotproduct. It means x is a column vector. Y is a column vector. So here is a one by n matrix or vector, right? And here is that's xrpose and y is like an n

0:52 by one. So the output is a one by one matrix matrix multiplication. You get a number out of it. If that number is zero, they're orthogonal. This includes the zero vector. So the zero vector is the only vector that's orthogonal to itself. The zero vector is orthogonal to every vector. We know that we can calculate the length of a vector through this formula which is kind of another like sum up the anyway you square every entry sum them up and then you take the square root. Um if you're given an orthogonal basis that's really [clears throat] nice um because if you want to work in that basis the first thing you need to do is to work out the coordinates right the the the C1 CN

1:40 so that you can write B as a linear combination of your bases and that's really easy when you have orthogonality orthogonal vectors because we worked out last time this little neat formula which is a number divided by a

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, Alex Townsend.

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.