Math 2.0

definition

Orthogonal matrix

Definition

Let n≥1n \ge 1 and let QQ be a real n×nn \times n matrix. The matrix QQ is orthogonal when QTQ=In,Q^T Q = I_n, where QTQ^T is the transpose and InI_n is the identity matrix.

Remarks

Equivalently, QQ is invertible with Q−1=QTQ^{-1} = Q^T, and then also QQT=InQ Q^T = I_n. Equivalently, the columns of QQ form an orthonormal basis of Rn\R^n; the same holds for the rows. The map x↦Qxx \mapsto Qx keeps the dot product, so it is a linear isometry of Rn\R^n. The determinant of an orthogonal matrix is 11 or −1-1.

Explanations

L1 human

Orthogonal matrices describe the rigid motions of space that fix the origin: rotations and reflections. They keep all lengths and angles. To invert an orthogonal matrix, we only need to transpose it.

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 4 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. Transpose definition
  4. Orthogonal matrix definition

What depends on this

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

Sources

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