Diagonal scaling
A diagonal matrix scales each coordinate independently. It has an inverse obtained by reciprocal diagonal entries only when every diagonal entry is nonzero.
Dr. Trefor Bazett · YouTube · 9:45
Visualize diagonalization as a change of coordinates, a scaling, and a return to the original coordinates.
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.
A diagonal matrix scales each coordinate independently. It has an inverse obtained by reciprocal diagonal entries only when every diagonal entry is nonzero.
When enough independent eigenvectors form the columns of P, the matching eigenvalues form the diagonal of D, giving . This condition is essential.
First apply P inverse to obtain eigenbasis coordinates, then D to scale those coordinates, and finally P to return to the original basis. Not every matrix admits this diagonalization.
A diagonal matrix scales each coordinate independently. It has an inverse obtained by reciprocal diagonal entries only when every diagonal entry is nonzero.
When enough independent eigenvectors form the columns of P, the matching eigenvalues form the diagonal of D, giving . This condition is essential.
First apply P inverse to obtain eigenbasis coordinates, then D to scale those coordinates, and finally P to return to the original basis. Not every matrix admits this diagonalization.
A diagonal matrix scales each coordinate independently. It has an inverse obtained by reciprocal diagonal entries only when every diagonal entry is nonzero. When enough independent eigenvectors form the columns of P, the matching eigenvalues form the diagonal of D, giving . This condition is essential. First apply P inverse to obtain eigenbasis coordinates, then D to scale those coordinates, and finally P to return to the original basis. Not every matrix admits this diagonalization.