Math 2.0

Linear and multilinear algebra; matrix theory Definition

Positive semidefinite matrix

Builds on Hermitian 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∈ℂn.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∈ℝnx \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.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • 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

Where this leads

15 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Definite_matrix, Definitions
About this page
Tag0880F9EQCP
URIm2://0880F9EQCP
Kinddefinition
WritingW1 stated
MSC15B57, 15A63
DefinesPositive semidefinite matrix
UsesHermitian matrix

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by