Orthonormal basis
An orthonormal basis is a set of vectors that are pairwise orthogonal and each have length 1. The clip separates these two conditions and illustrates them with perpendicular unit arrows on a grid.
FiveMinuteLectures · YouTube · 4:50
This 160-second clip introduces the Gram-Schmidt process as a method for turning a basis in an inner product space into an orthonormal basis, motivated as preparation for QR factorization. It first defines orthonormality through perpendicular unit vectors, then presents the three-step algorithm: set , recursively subtract projections to form , and normalize via . The final section gives a geometric example showing that is orthogonal to . This 130-second clip gives a worked Gram-Schmidt example in . It begins with a geometric picture of orthogonal projection, then applies the process to , , using the standard dot product. The video constructs , computes -(,/\|\|^2), then computes -(,/\|\|^2)-(,/\|\|^2). Finally it normalizes each vector via /\|\|, yielding , , and , and states that these form an orthonormal basis for .
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The clip opens by placing the topic inside a matrix-decomposition series and naming the Gram-Schmidt process as preparation for QR factorization.
It then states the central goal: starting from any basis in an inner product space, produce an orthonormal basis.
The narrator breaks orthonormality into two requirements. First, the vectors must be mutually orthogonal; second, each must be a unit vector. The 2D diagram reinforces this with a right-angle marker and the condition .
The algorithm is presented in three steps. Step 1 sets . Step 2 builds later orthogonal vectors by subtracting projections: . Step 3 normalizes each result: .
To explain why Step 2 works, the video shifts to a geometric example with two vectors and under the standard dot product.
Orthogonal projection is described as the amount of one vector pointing in the direction of another. Visually, this is the foot obtained by dropping a perpendicular from the tip of to the line through .
Subtracting that projection from leaves , which the animation shows perpendicular to . This illustrates the mechanism behind the recursive Gram-Schmidt construction.
The clip opens with a static geometric diagram titled "Orthonormal Projections." A green vector labeled and a cyan vector labeled meet at a right angle. The narration explains the intuition: perpendicular vectors do not point in each other's direction, so removing the projection of one vector onto another leaves a component independent of that direction.
The scene switches to the concrete example. Three column vectors are displayed: , , and . The narrator states that the Gram-Schmidt process will be applied in using the standard dot product as the inner product.
Under the heading "1. Set initial vector," the first Gram-Schmidt step is written as . The explanation is that the initial vector is kept unchanged at this stage and only normalized later.
Under "2. Find subsequent vectors," the second vector is constructed by subtracting the projection of onto . The board shows , then expands it to . The displayed intermediate calculations are , and \|\|^, giving .
The narrator then recommends a verification step: dot and and check that the result is zero. This is presented as a practical way to confirm that the projection subtraction worked correctly.
Still under step 2, the third vector is formed by removing from both the component along and the component along . The formula shown is , expanded to . The simplified displayed form is , and the final vector is .
The narrator repeats the same checking principle: verify mutual orthogonality by taking pairwise dot products and confirming they equal zero.
Under "3. Normalize vectors," the yellow formula appears. The narration stresses that the norm must be the one induced by the chosen inner product; here that means \|\| = .
The normalization is carried out one vector at a time. First, \|\| = , so . Next, \|\| = , so . Finally, \|\| = , so .
The clip concludes that these three normalized vectors form an orthonormal basis for . The narrator then previews a follow-up topic: using the Gram-Schmidt process to obtain the QR decomposition of matrices.
An orthonormal basis is a set of vectors that are pairwise orthogonal and each have length 1. The clip separates these two conditions and illustrates them with perpendicular unit arrows on a grid.
The Gram-Schmidt process converts a given basis in an inner product space into an orthonormal basis . The video introduces this as preparation for QR factorization.
The first orthogonal intermediate vector is simply the first input vector. No projection subtraction is required at this stage.
For each new vector, remove its components along all previously constructed orthogonal vectors. This produces a vector orthogonal to the earlier ones.
After orthogonalization, divide each intermediate vector by its norm to obtain a unit vector. This completes the transition from orthogonal to orthonormal.
The projection of onto is the component of lying in the direction of . The clip visualizes it by dropping a perpendicular from the tip of to the line through .
Subtracting the projection removes exactly the part of that points along . The remainder is therefore perpendicular to , as shown by the right-angle marker in the animation.
The opening diagram shows that subtracting the projection of one vector onto another leaves a perpendicular remainder. Visually, is drawn at a right angle to , matching the narration that perpendicular vectors do not point in each other's direction.
The worked example applies Gram-Schmidt to three specific vectors in using the standard dot product as the inner product. The inputs are , , and .
The algorithm begins by setting the first orthogonal vector equal to the first input vector. No projection subtraction is needed at this stage because there is no earlier direction to remove.
To construct the second orthogonal vector, remove from its component along . The clip computes , and \|\|^, yielding .
After each construction, the narrator advises verifying orthogonality by taking pairwise dot products and confirming the result is zero. This is presented as a practical error-catching step during Gram-Schmidt.
For the third vector, remove from both the component along and the component along . The displayed simplification is , giving .
Once an orthogonal set \{,,\} has been built, each vector is divided by its norm to produce unit vectors. The clip emphasizes that the norm must come from the same inner product used earlier.
The normalized outputs shown on screen are , , and . The narrator states that these form an orthonormal basis for .
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
On-screen text shows "Unit vectors" and the equation \|\| = 1.
The narrator says unit vectors or normal vectors have length one under the dot product.
\|\|
Norm (length) of a vector .
Vectors in an inner product space; here illustrated with the standard dot product.
The procedure slide lists the input sequence , , , .
The narrator describes starting from a set of basis vectors.
, , ,
Given sequence of basis vectors to be transformed.
Basis vectors in an inner product space.
The slide defines and then gives .
The narrator says subsequent vectors are found by subtracting orthogonal projections onto previous vectors.
Intermediate orthogonalized vector before normalization.
Defined recursively for from the given basis vectors.
The general step uses , and the example later shows .
The narrator explains orthogonal projection as how much one vector points in the direction of another.
The clip does not display the explicit algebraic formula for .
Orthogonal projection of vector onto vector .
Vectors in an inner product space; the example is under the standard dot product.
The slide states and maps , , , , , , .
The narrator says the final step is to normalize all vectors by dividing by their norms.
Normalized orthonormal output vector corresponding to .
Defined after orthogonalization, provided \|\| .
Green vector labeled in the opening geometric diagram.
appears as the first input vector in the worked example.
First given vector; also used in the opening diagram as the reference direction for projection.
The expression is shown as a cyan vector perpendicular to .
appears as the second input vector.
Second given vector; in the opening diagram it is the vector being projected onto .
appears as the third input vector.
The narrator says the Gram-Schmidt process will be applied to three vectors in .
Third given vector in the example.
Opening title reads 'Orthonormal Projections' and the cyan vector is labeled - proj_{}().
Formulas use , , and .
Orthogonal projection of vector v onto vector u.
Defined by the inner-product formula shown later in the clip.
Set .
Narrator says to let be the initial vector and not touch it until the very end.
First orthogonal vector produced by the Gram-Schmidt process; here equal to the initial vector .
- proj_{}() and then .
Narrator says to find the second vector by subtracting the orthogonal projection of onto .
Second orthogonal vector obtained by removing from its component along .
- proj_{}() - proj_{}() and then .
Narrator says that for the last vector we need to subtract two orthogonal projections from both and .
Third orthogonal vector obtained by removing from its components along and .
The narrator defines an orthonormal basis as vectors that are mutually orthogonal and unit vectors.
A 2D grid shows two perpendicular arrows with a right-angle marker and the labels "Orthogonal vectors" and "Unit vectors \|\| = 1".
An orthonormal basis is a set of vectors that are pairwise orthogonal and each has norm 1. In the clip, orthogonality is illustrated by a 90-degree angle under the dot product, and normalization is illustrated by requiring length one.
The vectors belong to an inner product space.
The clip illustrates the standard dot product case.
The narrator says the Gram-Schmidt process takes any set of basis vectors in an inner product space and turns them into an orthonormal basis.
The slide maps , , , to , , , .
The Gram-Schmidt process converts a given basis into an orthonormal basis. The procedure first constructs orthogonal intermediate vectors and then normalizes them to obtain .
Input is a set of basis vectors in an inner product space.
The clip presents this as preparation for QR factorization.
Step 1 on the slide reads "Set initial vector :" followed by .
The narrator says the process begins by setting an initial vector, which stays the same until normalization.
The first orthogonal intermediate vector is chosen to be the first input basis vector itself. No projection subtraction is needed for this first vector.
Applied at the start of the recursive construction.
Step 2 on the slide reads "Find next vectors by subtracting orthogonal projections:" and shows .
The narrator says subsequent vectors are found by subtracting the orthogonal projection of the current vector onto all previous vectors already put into the orthogonal set.
The clip does not explicitly state that the input vectors must be linearly independent for every to be nonzero.
For each new input vector , remove its components along all previously constructed orthogonal vectors , , . The remainder is orthogonal to those previous vectors.
Used for .
The sum runs over all previously constructed vectors .
Step 3 on the slide reads "Normalize all vectors:" followed by .
The narrator says to normalize all vectors by dividing by the norm of the vectors themselves.
After constructing the orthogonal vectors , divide each by its own norm to obtain unit vectors . This completes the conversion from a basis to an orthonormal basis.
Requires \|\| .
Applied after the projection-subtraction step.
The narrator says orthogonal projection can be thought of as how much one vector points in the direction of another vector.
The animation drops a perpendicular from the tip of to the line through , marking a right angle.
The clip gives geometric intuition but does not display the coordinate formula for projection.
The orthogonal projection of one vector onto another measures the component of the first vector lying in the direction of the second. Geometrically, it is obtained by dropping a perpendicular from the tip of the vector being projected onto the line spanned by the other vector.
The clip illustrates this under the standard dot product.
Narrator says perpendicular vectors are independent in a way where they do not point in each other's direction.
Title 'Orthonormal Projections'; green vector and cyan vector - proj_{}() meet at a right angle marked by a square symbol.
The clip opens with a visual interpretation of projection: subtracting the component of one vector along another leaves a remainder perpendicular to that direction. The right-angle marker makes the orthogonality explicit.
Two vectors are in an inner-product space.
The subtraction removes the component of in the direction of .
Narrator says they will use the standard dot product as the inner product.
All three input vectors are displayed as column vectors in .
Before computing projections, the video fixes the ambient space and inner product: the example is carried out in using the standard dot product.
Vectors lie in .
The standard Euclidean dot product is used.
Header '1. Set initial vector' and equation 'Set '.
Narrator says to begin by letting be the initial vector and not touch it until the very end.
The algorithm starts by taking the first input vector unchanged as the first orthogonal vector.
There is at least one input vector.
No normalization has yet been applied in this stage.
Header '2. Find subsequent vectors' with - proj_{}(), then expanded as - (, / \|\|^2) .
Computed values shown: ,, \|\|^, and .
Narrator says to find the second vector by subtracting the orthogonal projection of onto .
To make the next vector orthogonal to the previous one, the component of along is removed using the projection formula.
is already known.
The inner product and induced norm are fixed.
is nonzero so division by \|\|^2 is valid.
Narrator says you can check that is orthogonal to by dotting them and making sure you get zero.
The displayed vectors are and .
The clip states the check verbally but does not show the arithmetic line for .
After constructing a new vector, the video recommends checking pairwise dot products to confirm orthogonality.
The chosen inner product is the standard dot product in this example.
The vectors under test are nonzero.
- proj_{}() - proj_{}(), then expanded as - (, / \|\|^2) - (, / \|\|^2).
Simplified displayed form: , followed by .
Narrator says for the last vector we need to subtract two orthogonal projections from both and .
For the third vector, the algorithm removes from both the component along and the component along , producing a vector orthogonal to the span of the earlier ones.
and are already constructed.
and are mutually orthogonal in the intended Gram-Schmidt process.
Each denominator \|\|^2 is nonzero.
The narrator says that if we subtract away the projection from our vector, the new vector does not point in the direction of the other vector at all, and therefore the two vectors are orthogonal.
The resulting cyan vector labeled is shown perpendicular to with a right-angle marker.
The clip states the conclusion visually and verbally but does not provide an algebraic proof using inner products.
If the orthogonal projection of onto is subtracted from , the resulting vector is orthogonal to .
The example is under the standard dot product.
denotes the orthogonal projection of onto .
For the two vectors shown in the example.
Narrator says two vectors that are perpendicular are sort of independent in a way where they don't point in each other's direction.
This is presented as intuition rather than a formal theorem statement.
Perpendicular vectors do not point in each other's direction, which the narrator describes as a form of independence.
The discussion is geometric and informal.
The setting is the opening projection diagram.
Informal universal-style statement about pairs of perpendicular vectors.
Narrator says you can check that is indeed orthogonal to by dotting them and making sure that you get zero.
and are displayed.
The verification is stated verbally; the explicit dot-product computation is not shown on screen.
The constructed vector is orthogonal to .
.
is defined by - (, / \|\|^2).
The inner product is the standard dot product on .
For the specific vectors in this worked example.
Narrator says again you can check that all three of these vectors are mutually orthogonal by dotting them and making sure that you get zero.
, , are displayed together before normalization.
The clip asserts the check but does not display all pairwise dot-product computations.
The three constructed vectors , , are mutually orthogonal.
, , are produced by the Gram-Schmidt steps shown.
The inner product is the standard dot product on .
For the three specific vectors in this example.
Narrator says with that we have found an orthonormal basis for .
Three normalized vectors , , are displayed.
The video does not separately prove spanning; it presents the result after completing the three-step process on three vectors in .
The normalized vectors , , form an orthonormal basis for .
The original three vectors are in .
The Gram-Schmidt process produced three nonzero orthogonal vectors.
Each vector was normalized using the induced norm.
For the specific example computed in the clip.
The slide lists three numbered steps: , , and .
The narrator explains the same three-step order: initialize, subtract projections, then normalize.
Start with the first basis vector unchanged as the first orthogonal intermediate vector.
Directly shown as Step 1 on the slide and described by the narrator.
For each later vector, subtract its projections onto all previously constructed orthogonal vectors.
Shown as Step 2 on the slide and explained in the audio as removing components along previous vectors.
Normalize each orthogonal intermediate vector to obtain a unit vector.
Shown as Step 3 on the slide and described by the narrator as dividing by the norm.
The procedure transforms , , , into , , , , an orthonormal set.
The animation constructs the projection of onto , then forms and shows it perpendicular to .
The narrator says subtracting the projection leaves a vector that does not point in the direction of the other vector, so the two are orthogonal.
This is a geometric demonstration rather than a full algebraic proof.
Begin with two non-orthogonal vectors in the plane.
Shown on the "Orthonormal Projections" slide.
Drop a perpendicular from the tip of to the line through to identify the component of in the direction.
Explained by the narrator as how much one vector points in the direction of another.
Subtract that component from .
The animation labels the resulting vector with this expression.
The remaining vector is perpendicular to , as indicated by the right-angle marker.
Stated by the narrator and shown visually.
Removing the projection of onto leaves a vector orthogonal to , illustrating the core mechanism used in Gram-Schmidt.
The board shows - proj_{}(), then the expanded projection formula, then intermediate values , and \|\|^, and finally .
Narrator explains that the second vector is found by subtracting the orthogonal projection of onto .
Start with the first orthogonal vector equal to the first input vector.
Displayed formula under '1. Set initial vector'.
Define the second vector by removing from its projection onto .
Displayed formula under '2. Find subsequent vectors'.
Rewrite the projection using the inner-product formula.
Displayed algebraic expansion on screen.
Compute the numerator of the projection coefficient.
Explicit dot-product calculation shown on screen.
Compute the squared norm in the denominator.
Explicit norm-squared calculation shown on screen.
Substitute the computed coefficient and simplify to the final vector.
Final displayed result for .
The second Gram-Schmidt vector is .
The board shows - proj_{}() - proj_{}(), then the expanded formula, then the simplified coefficient form , and finally .
Narrator says for the last vector we need to subtract two orthogonal projections from both and .
The intermediate dot products ,, \|\|^2, and , are not all shown as separate written lines in the sampled frames, although the simplified coefficients and are displayed.
Define the third vector by removing from its projections onto both earlier orthogonal vectors.
Displayed formula on screen.
Expand both projections using the inner-product formula.
Displayed algebraic expansion on screen.
Substitute the computed projection coefficients.
Simplified displayed formula on screen.
Carry out the vector subtraction to obtain the third orthogonal vector.
Final displayed result for .
The third Gram-Schmidt vector is .
Yellow formula / \|\| and successive displayed norms and normalized vectors.
Narrator says to normalize by dividing each vector by its norm and notes that the norm must be induced from the inner product.
Apply the general normalization rule to each orthogonal vector.
Displayed yellow formula under '3. Normalize vectors'.
Normalize the first vector.
Displayed norm and resulting on screen.
Normalize the second vector.
Displayed norm and resulting on screen.
Normalize the third vector.
Displayed norm and resulting on screen.
The normalized outputs are , , and .
The slide titled "Orthonormal Projections" shows vectors and , then constructs .
The narrator says, "say for example we want to make the following vectors orthogonal under this standard dot product."
No numerical coordinates are given for or .
Given two vectors and under the standard dot product, construct a new vector from that is orthogonal to .
Two vectors and are shown in the plane.
The inner product being used is the standard dot product.
Produce a vector orthogonal to by removing the component of in the direction.
Identify the projection of onto by dropping a perpendicular from the tip of to the line through .
The narrator defines projection as how much one vector points in the direction of another, and the animation shows the perpendicular drop.
Subtract the projection from .
The resulting vector is explicitly labeled on screen.
The new vector is orthogonal to .
A right-angle marker is shown between and the cyan difference vector, and the narrator states the conclusion.
The vector is orthogonal to .
Verified visually by the right-angle marker and verbally by the narrator's statement that the two vectors are orthogonal.
Input vectors , , are displayed.
Narrator says they will do the Gram-Schmidt process on these three vectors in using the standard dot product.
The full sequence of displayed steps produces , , and then , , .
Apply the Gram-Schmidt process to the three vectors , , in using the standard dot product, and produce an orthonormal basis.
Inner product is the standard dot product on .
Find orthogonal vectors ,, and then normalized vectors ,, forming an orthonormal basis for .
Keep the first vector unchanged.
Step 1 of the displayed Gram-Schmidt procedure.
Remove from its component along .
Projection formula shown and evaluated on screen.
Remove from its components along and .
Two-projection formula shown and simplified on screen.
Normalize .
Displayed normalization step with \|\| = .
Normalize .
Displayed normalization step with \|\| = .
Normalize .
Displayed normalization step with \|\| = .
An orthonormal basis produced by the example is , , .
The narrator recommends checking pairwise dot products among ,, to confirm orthogonality before normalization.
The title "Matrix Decompositions" appears surrounded by formulas including , PA = LU, , , A = QR, and JS.
Title text "Matrix Decompositions"
Surrounding decomposition formulas
Formulas fade in around the central title.
The central title remains fixed while surrounding formulas appear.
This frames the clip as part of a matrix decomposition series and motivates the later mention of QR factorization.
Three colored vectors emanate from the origin in a 3D coordinate system while the axes rotate.
The narrator says the process takes any set of basis vectors in an inner product space and turns them into an orthonormal basis.
Three coordinate axes
Three colored vectors from the origin
The coordinate frame rotates in 3D.
The vectors remain anchored at the origin.
The rotating 3D frame visually represents a general basis in an inner product space before orthogonalization.
A 2D grid shows two perpendicular vectors with a right-angle marker and the labels "Orthogonal vectors" and "Unit vectors \|\| = 1".
Cartesian grid
Two perpendicular vectors
Right-angle marker
Text labels
The view settles from 3D to a 2D grid.
Labels for orthogonality and unit length appear.
The two displayed vectors remain perpendicular.
This visual defines the target output of Gram-Schmidt: mutually orthogonal vectors of length one.
A black slide titled "Gram-Schmidt Process" lists the three steps and the mapping from , , , to , , , .
Title "Gram-Schmidt Process"
Numbered steps 1--3
Input and output vector sequences
Each step appears sequentially.
The final mapping line is boxed at the bottom.
The overall structure remains a three-step recursive procedure.
This is the formal algorithmic summary of the method introduced verbally earlier.
On the "Orthonormal Projections" slide, is projected onto , then the difference vector is shown perpendicular to .
Vector
Vector
Projection segment onto
Difference vector
Right-angle marker
A perpendicular is dropped from to the line of .
The projection component is isolated.
The residual vector is drawn and labeled.
The final configuration shows orthogonality.
remains fixed as the reference direction.
The animation demonstrates the geometric reason subtracting a projection removes the component along the reference vector.
Black background with title 'Orthonormal Projections'; a green vector labeled points up-right, a cyan vector labeled - proj_{}() points down-right, and a small square marks a right angle between them.
Title text 'Orthonormal Projections'
Green vector
Cyan vector
Right-angle marker
The clip presents a static conceptual diagram rather than an animated construction.
The two displayed vectors remain perpendicular throughout the interval.
The label identifies the cyan vector as the residual after projection removal.
The picture visually encodes that subtracting the projection of onto leaves a vector orthogonal to .
Three column vectors labeled , , are centered on a black background.
The scene changes from the geometric diagram to a purely algebraic setup.
All three vectors are treated as elements of .
This screen establishes the concrete data for the Gram-Schmidt computation.
Headers change from '1. Set initial vector' to '2. Find subsequent vectors' to '3. Normalize vectors'.
Intermediate results accumulate: first , then , then , then ,,.
Section headers
Orthogonal vectors ,,
Normalized vectors ,,
Projection formulas
The board first defines , then expands to compute , then adds , and finally replaces the w-labels with normalized u-labels.
The layout keeps the original input vectors visible while new derived vectors are added below or beside them.
The process proceeds in the same order throughout: orthogonalize first, normalize last.
The visual organization mirrors the Gram-Schmidt algorithm as a staged construction rather than a single formula dump.
The narrator separates the two requirements: mutually orthogonal vectors and unit vectors.
The slide labels "Orthogonal vectors" and "Unit vectors \|\| = 1" as distinct conditions.
A set of vectors can be orthogonal without being orthonormal.
The clip distinguishes orthogonality (pairwise 90-degree angles) from normalization (each vector having length 1). Orthonormality requires both conditions simultaneously.
The narrator describes projection as how much one vector points in the direction of another.
Only a component along is extracted before subtraction; the remainder is drawn separately.
One might think projecting onto replaces entirely or captures all of its information.
The animation shows that is only the part of lying in the direction; subtracting it leaves the perpendicular residual.
Narrator says the norm used here must be induced from the inner product, and in this case it is simply the square root of the vector dotted with itself.
One might normalize vectors with any convenient length function even after choosing a particular inner product for projections.
The clip explicitly warns that the norm must be the one induced by the chosen inner product; here that means \|w\| = .
Narrator repeatedly says you can check orthogonality by dotting the vectors and making sure you get zero.
After applying the projection formula, one may assume the result is automatically correct without checking.
The video recommends verifying pairwise dot products to ensure the newly constructed vectors are indeed orthogonal.
The narrator first defines orthonormal bases and then says Gram-Schmidt turns basis vectors into an orthonormal basis.
Understanding what an orthonormal basis is provides the target concept that Gram-Schmidt constructs.
Step 2 uses , and the later example explains the geometric meaning of projection.
The recursive subtraction step depends on the notion of orthogonal projection; the example supplies the geometric justification for why subtraction creates orthogonality.
The slide first constructs and then defines .
The Gram-Schmidt method contains orthogonalization as an intermediate stage followed by normalization to reach an orthonormal set.
The narrator says the clip covers the Gram-Schmidt process in preparation for the QR factorization.
The opening title card includes A = QR among matrix decompositions.
The video presents Gram-Schmidt as a tool used in preparation for QR factorization within the broader matrix-decomposition theme.
Opening diagram shows - proj_{}() perpendicular to .
Later the algorithm uses - proj_{}().
The geometric idea introduced at the start is directly applied as the computational rule for constructing the second Gram-Schmidt vector.
Narrator specifies the standard dot product as the inner product.
Projection formulas are written using , and \|\|^2.
Choosing the inner product is required before the projection formula and norm-squared denominator can be evaluated.
is defined first, then used inside the formula for .
The construction of depends on having already fixed .
The formula for subtracts projections onto both and .
The third vector requires the earlier orthogonal vectors and as the directions to be removed.
After displaying ,,, the board switches to '3. Normalize vectors' and defines / \|\|.
Narrator calls normalization the last part of the Gram-Schmidt process.
The process first builds an orthogonal set and then strengthens the result to an orthonormal set by normalization.
Narrator says the norm must be induced from the inner product.
Norms are computed from dot products with themselves.
The chosen inner product determines the specific norm used in normalization.
The narrator defines orthonormal basis using mutual orthogonality and unit length.
The slide lists the three steps of the Gram-Schmidt process.
The example shows becoming perpendicular to .
The slide shows .
Narrator says they will be doing the Gram-Schmidt process on three vectors in .
Full worked sequence from inputs to orthonormal output is displayed.
Opening right-angle diagram labels the remainder as - proj_{}().
is computed by subtracting proj_{}().
Narrator says to check orthogonality by dotting the vectors and making sure the result is zero.
Narrator says the norm used must be induced from the inner product.
/ \|\| and explicit norms are shown.
Final displayed , , vectors.
Covered · Opening title card situates the clip within matrix decompositions and mentions QR among other formulas.
Covered · Narrator introduces Gram-Schmidt as converting basis vectors into an orthonormal basis while a 3D basis animation plays.
Covered · The clip defines orthogonality and unit length visually and verbally.
Covered · The full three-step Gram-Schmidt algorithm is displayed and narrated.
Covered · A geometric example shows projection subtraction producing an orthogonal vector.
Covered · Opening geometric motivation for orthogonal projection and perpendicularity.
Covered · Setup of the three input vectors in and choice of standard dot product.
Covered · Step 1: set .
Covered · Step 2: compute by subtracting the projection of onto .
Covered · Verbal recommendation to check .
Covered · Step 2 continuation: compute by subtracting projections onto and .
Covered · Step 3: normalize ,, to obtain ,, and conclude an orthonormal basis for .
Reviewed English material v1: card "Orthonormal basis" at 0:20 — An orthonormal basis is a set of vectors that are pairwise orthogonal and each have length 1. The clip separates these two conditions and illustrates them with perpendicular unit arrows on a grid.