Positive Semidefinite Matrix
# Definition
Suppose $A \in \mathbb{R}^{n \times n}$ for some $n \in \mathbb{N}$ and that $\forall x \in \mathbb{R}^{n}$, $$x^{T} A x \geq 0$$. Then $A$ is a Positive Semidefinite Matrix. We denote the set of $n \times n$ Positive Semidefinite Matrixs $\mathbb{S}_{n}^{+}$
# Propertes
- A Square Matrix is Positive Semidefinite iff its Eigenvalues are Nonnegative
- A Square Matrix is Positive Semidefinite iff all of its Principal Minors are Nonnegative
- A Square Matrix is Positive Semidefinite iff it is the Gram Matrix of n vectors
- A Square Matrix is Positive Semidefinite iff it is the product of a Matrix with its Transpose
- Positive Semidefinite Matrices form a Convex Cone
- Positive Semidefnite Matrices are Symmetric - Thus justifies the notation.
- A Symmetric Matrix is Positive Semidefinite iff its Frobenius Inner Product with any Positive Semidefinite Matrix is Nonnegative