\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Diagonal Matrices
Needed by:
Row Reducer Matrices
Links:
Sheet PDF
Graph PDF

Triangular Matrices

Definition

A matrix is upper triangular if all its entries below the diagonal are zero. A matrix is lower triangular if all its entries above the diagonal are zero. If, in addition, the diagonal is zero, then the matrix is strictly upper triangular and strictle lower triangular respectively.

A triangular matrix is either upper or lower triangular. A strictly triangular matrix is either strictly upper triangular or strictly lower triangular.

A unit triangular matrix is a triangular matrix (upper or lower) whose diagonal entries are one. Somtimes such matrices are called unitriangular (a unitriangular matrix). So we speak of lower unit triangular, upper unit triangular, lower unitriangular and lower unitriangular matrices.

Other terminology

Some authors call lower triangular matrices left triangular and upper triangular matrices right triangular. Historically, some authors have called triangular matrices semidiagonal.

Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view