Multiplication by each column of givesSince is invertible, its columns are an eigenbasis and the similarity transformation givesThere is an important source variant: the alternative scanned copy supplies an erroneous inverse with an extra factor and a different top-right entry. Calling that supplied matrix , direct multiplication gives , so it cannot be . Inverting instead givesThis is the inverse in the cleaner copy used here. Using the scanned erroneous matrix would make nondiagonal, so correcting the inverse is necessary before applying the stated diagonalization. The inverse-matrix verification test catches the error without assuming the claimed outcome.
A power of a diagonal matrix acts entrywise. ThusFrom , adjacent factors cancel in repeated multiplication, givingThis is the matrix power rule for a similarity transformation, proved directly rather than by taking powers of separate noncommuting factors.
All three eigenvalues are nonzero, so . The inverse matrix is thereforeMultiplying this matrix by gives , independently checking both the sign and the fractions.
The determinant is multiplicative and unchanged by a similarity transformation. HenceFor , expansion of the original determinant givesin agreement with the product of its eigenvalues.
Articles by others on the same topic
There are currently no matching articles.