A real square matrix is orthogonal if . Then , proving length preservation.
Define to be identity outside rows and columns , with block
The block's transpose times itself is identity because and the off-diagonal terms cancel. Thus is orthogonal, with determinant one.
For , choose , . Then , and every other coordinate is unchanged. If , choose . This fixes the useful nonnegative pivot convention.
Apply the rotations to the current matrix in the displayed order from right to left. First eliminates entry ; then eliminates without changing row two. Finally eliminates while preserving the zeros in column one. Thus
Inverting the product gives . Even if starts lower triangular, the row rotations generally create nonzero entries above the diagonal; there is no further universal simplification. For example gives positive-pivot
whose three entries above the diagonal are all nonzero.
If is orthogonal, is both upper triangular and orthogonal. Orthogonality of its columns successively forces all off-diagonal entries to vanish and all diagonal entries to have absolute value one. The first two pivots are positive under our convention, and the rotations have determinant one. Therefore the precise result is
Without a specified pivot-sign convention, the invariant statement is a diagonal matrix with entries and product .

Articles by others on the same topic (0)

There are currently no matching articles.