Math 2.0

definition

Positive semidefinite matrix

Definition

Let AA be an n×nn \times n complex Hermitian matrix. The matrix AA is positive semidefinite when x∗Ax≥0for all x∈Cn.x^* A x \ge 0 \qquad \text{for all } x \in \C^n. For a real symmetric AA, the condition is xTAx≥0x^T A x \ge 0 for all x∈Rnx \in \R^n.

Remarks

AA is positive semidefinite if and only if all its eigenvalues are nonnegative. Each positive definite matrix is positive semidefinite. The matrix (1111)\begin{pmatrix} 1 & 1 \\ 1 & 1 \end{pmatrix} is positive semidefinite but not positive definite. The notation A⪰0A \succeq 0 is common.

Explanations

L1 human

A positive semidefinite matrix never gives a negative value of xTAxx^T A x. It may give zero for some nonzero vectors. Covariance matrices and Gram matrices are always of this kind.

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. Matrix definition
  2. Square matrix definition
  3. Transpose definition
  4. Conjugate transpose definition
  5. Hermitian matrix definition
  6. Positive semidefinite matrix definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Definite_matrix, Definitions