Math 2.0

definition

Lower triangular matrix

Definition

Let RR be a ring and let n≥0n \ge 0 be an integer. A square matrix L=(lij)L = (l_{ij}) of order nn over RR is lower triangular when lij=0l_{ij} = 0 for all i<ji < j. It is strictly lower triangular when lij=0l_{ij} = 0 for all i≤ji \le j.

Remarks

A matrix is lower triangular if and only if its transpose is upper triangular. Sums and products of lower triangular matrices of the same order are lower triangular. A system Lx=bLx = b with LL lower triangular and invertible is solved by forward substitution. In an LU decomposition, the factor LL is lower triangular.

Explanations

L1 human

A lower triangular matrix has zeros everywhere above its diagonal. Its nonzero entries fill a triangle at the bottom left. For example, (1023)\begin{pmatrix} 1 & 0 \\ 2 & 3 \end{pmatrix} is lower triangular.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Matrix definition
  2. Square matrix definition
  3. Lower triangular matrix definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Triangular_matrix, lead section