There are two definitions of an ellipsoid in Boyd's book (Convex Optimization)
- $E = \{ x | (x-x_c)^T P (x-x_c) \leq 1 \}$
In the above, P is a positive semi definite matrix.
- $ E=\{ x_c+Au |\; ||u|| \leq 1 \}$
In the second definition, $A$ is non-singular.
I have certain questions about the above definitions.
- Why is positive definite required for the first case? what if $P$ is not positive semi definite?
- I know that non-singularity is required for $A$, otherwise ellipsoid dimensionality would reduce. I want to know that what is the relation between these two definitions. Is there any relation between $A$ and $P$?
I'll consider only vector spaces over $\mathbb R^n$ if that's OK.
Since $A$ is non-singular, $A^{-1}$ exists and is non-singular. So $x = Au + x_c$ is equivalent to $u = A^{-1}(x - x_c)$, and we can rewrite the second definition as follows:
$$ E = \{ x \mid \|A^{-1}(x - x_c)\| \leq 1 \}.$$
But $\|A^{-1}(x - x_c)\| = (x - x_c)^T \left(A^{-1}\right)^T A^{-1}(x - x_c)$, and since $A^{-1}$ is non-singular, $\left(A^{-1}\right)^T A^{-1}$ is positive definite.
In fact, if we let $P = \left(A^{-1}\right)^T A^{-1}$, then $P$ is the positive definite matrix you need for the first definition: $(x - x_c)^T P (x - x_c) = \|u\|$ where $u = A^{-1}(x - x_c)$, hence the set of $x$ such that $(x - x_c)^T P (x - x_c) \leq 1$ is just the set of $x = Au + x_c$ such that $\|u\| \leq 1$.