# Is $\mathcal{P}= \{ P: E[XX^T] \preceq A\}$ is sequentially compact?

by Lisa   Last Updated January 12, 2018 20:20 PM

Let $\mathcal{P}$ be a set of probability distributions on $\mathbb{R}^n$ such that \begin{align} \mathcal{P}= \{ P: E[XX^T] \preceq A\}. \end{align} where $A$ is a positive-definite matrix and where the expectation is take with respect to $P$. Also, $B \preceq A$ implies that $A-B$ is positive semi-definte matrix.

Question: Is the set $\mathcal{P}$ sequentially compact?

For $n=1$, $\mathcal{P}= \{ P: E[X^2] \le A\}$ is tight by Markov inequality and is therefore tight by Prohorov's theorem.

However, I am not sure what tools to use for $n>1$. Is there a way to prove tightness in this case?

Tags :

#### Query Search

Cache file /home/queryxchang/questarter.com/apps/frontend/config/../cache/-q-is-mathcal-p-p-e-xx-t-preceq-a-is-sequentially-compact-21-2602542-html could not be written
{"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, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 1, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9620369076728821, "perplexity": 735.1149486532642}, "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": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125947705.94/warc/CC-MAIN-20180425061347-20180425081347-00214.warc.gz"}