## Does the space of n x n, positive-definite, self-adjoint, real matrices have a better name?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

This is also the space of real, symmetric bilinear forms in R^n.

-

1
The bilinear form should still be positive definite. – S. Carnahan♦ Oct 12 2009 at 2:54
Better in what sense? – Felix Goldberg May 25 at 19:23

## 6 Answers

Two possible answers:

• Standard jargon is SPD (for "symmetric positive-definite").

• This isn't exactly a "name," but the n x n symmetric positive-definite matrices are exactly those matrices A such that the bilinear function (x, y) -> yTAx defines an inner product on Rn. Conversely, every bilinear function is of that form for some A, so with some abuse of terminology, you could equate the set of those matrices with the set of inner products on Rn.

There are many other ways to characterize SPD matrices, but that's the only one I can think of at the moment that can be summarized as a single noun phrase.

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Note that this space is not a vector space, but is a convex cone in the vector space of nxn matrices (it is closed under addition and multiplication by positive scalars). Hence people sometimes refer to the "positive semidefinite cone".

-

Yes, I was going to post that as well. – Ilya Nikokoshev Oct 23 2009 at 19:18

This is the symmetric space of GL_n(R)

-

How about ? I have seen or used to denote the set of positive linear transformations in a set of linear transformations on an inner product space, but this was in the context of operator algebras.

-

For starters, since they're real I'd say symmetric instead of self-adjoint.

-

It is often usefull to know that this set can be identified with the set of non-singulat covariance matrices of random vectors with values in $\mathbb(R)^n$.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9425185918807983, "perplexity_flag": "head"}