Math 2.0

definition

Block matrix

Definition

Let RR be a ring. Let m=m1+⋯+mpm = m_1 + \cdots + m_p and n=n1+⋯+nqn = n_1 + \cdots + n_q with positive integers mim_i and njn_j. For each i≤pi \le p and j≤qj \le q, let AijA_{ij} be an mi×njm_i \times n_j matrix over RR. The block matrix with blocks AijA_{ij} is the m×nm \times n matrix A=(A11⋯A1q⋮⋱⋮Ap1⋯Apq),A = \begin{pmatrix} A_{11} & \cdots & A_{1q} \\ \vdots & \ddots & \vdots \\ A_{p1} & \cdots & A_{pq} \end{pmatrix}, in which AijA_{ij} fills rows m1+⋯+mi−1+1m_1 + \cdots + m_{i-1} + 1 to m1+⋯+mim_1 + \cdots + m_i and columns n1+⋯+nj−1+1n_1 + \cdots + n_{j-1} + 1 to n1+⋯+njn_1 + \cdots + n_j.

Remarks

If the column partition of AA matches the row partition of BB, then ABAB is computed block by block: (AB)ik=∑jAijBjk(AB)_{ik} = \sum_j A_{ij} B_{jk}. In Mathlib, Matrix.fromBlocks makes the 2×22 \times 2 block matrix (ABCD)\begin{pmatrix} A & B \\ C & D \end{pmatrix}. The determinant of a block triangular matrix is the product of the determinants of its diagonal blocks.

Explanations

L1 human

A block matrix is a large matrix cut into smaller rectangles. We can treat each rectangle like a single entry. Then we add and multiply block matrices with the usual rules, as long as the sizes fit.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 2 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. Block matrix definition

What depends on this

6 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Block_matrix, Formal definition