Math 2.0

definition

Square root of a positive semidefinite matrix

Definition

Let AA be a positive semidefinite n×nn \times n complex Hermitian matrix. There is exactly one positive semidefinite matrix BB with B2=AB^2 = A. This matrix is the square root of AA, written A1/2A^{1/2} or A\sqrt{A}.

Remarks

If A=UDU∗A = U D U^* with UU unitary and DD diagonal with entries di≥0d_i \ge 0, then A1/2=UD1/2U∗A^{1/2} = U D^{1/2} U^*, with entries di\sqrt{d_i} in D1/2D^{1/2}. A1/2A^{1/2} commutes with each matrix that commutes with AA. Without the condition B⪰0B \succeq 0, a matrix can have many square roots; for example, I2I_2 has infinitely many.

Explanations

L1 human

A positive semidefinite matrix has exactly one positive semidefinite square root. In an orthonormal basis of eigenvectors, we take the square root of each eigenvalue. This is like the positive square root of a nonnegative number.

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 7 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. Transpose definition
  4. Conjugate transpose definition
  5. Hermitian matrix definition
  6. Positive semidefinite matrix definition
  7. Square root of a positive semidefinite matrix definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Square_root_of_a_matrix, Positive semidefinite matrices