Math 2.0

statement proposition

One-sided inverse of a square matrix is two-sided

Statement

Let FF be a field and let AA and BB be n×nn \times n matrices over FF. If BA=InBA = I_n, then AB=InAB = I_n, so AA is invertible and A−1=BA^{-1} = B. The same holds with the roles of AA and BB exchanged.

Remarks

The statement also holds over each commutative ring, by the determinant: BA=InBA = I_n gives det⁡Bdet⁡A=1\det B \det A = 1. For non-square matrices it fails: a 2×12 \times 1 matrix can have a left inverse but never a right inverse. A proof over a field uses rank–nullity: BA=InBA = I_n makes x↦Axx \mapsto Ax injective, hence surjective.

Explanations

L1 human

For square matrices, we only need to check one of AB=IAB = I and BA=IBA = I. The other one then holds automatically. This saves half of the work when we check an inverse.

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 6 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. Identity matrix object
  2. Matrix definition
  3. Matrix multiplication definition
  4. Square matrix definition
  5. Invertible matrix definition
  6. One-sided inverse of a square matrix is two-sided statement

Sources

  1. Web https://en.wikipedia.org/wiki/Invertible_matrix, Properties