## Return to Question

4 deleted 39 characters in body

Hi

I am meeting a problem concerning semi-definite positive matrices, and I have no clue concerning them, the classical approaches I know have not given any result, maybe people used to manipulating them could help me...

Call $\mathscr{P}$ the convex set of symmetric SDP matrices $S$ of order $N\geq 1$ such that $|S_{ij}|<1$ . Consider the mapping $$\Phi:S=(S_{ij})\mapsto (\frac{2}{\pi}\arcsin(S_{ij})).$$

I think it is a (well) known fact that $\Phi(\mathscr{P})\subset \mathscr{P}$. My question is the following: Is $\Phi(\mathscr{P})$ convex?

At first I thought that the answer was "no", but I checked that for $N=2$ the answer is "yes". I have no clue as how to test higher dimensions. Does anyone have a suggestion on a method?

Another possible formulation: Given two SDP matrices $A$ and $B$, and $a\in [0,1]$, is the matrix $C$ defined by $$C_{ij}=\frac{\pi}{2}\sin\left(a\frac{2}{\pi}\arcsin(A_{ij})+(1-a)\frac{2}{\pi}\arcsin(B_{ij})\right)$$ $C_{ij}=\sin\left(a\arcsin(A_{ij})+(1-a)\arcsin(B_{ij})\right)$\$ also SDP?

3 edited tags
2 added 235 characters in body

Hi

I am meeting a problem concerning semi-definite positive matrices, and I have no clue concerning them, the classical approaches I know have not given any result, maybe people used to manipulating them could help me...

Call $\mathscr{P}$ the convex set of symmetric SDP matrices $S$ of order $N\geq 1$ such that $|S_{ij}|<1$ . Consider the mapping $$\Phi:S=(S_{ij})\mapsto (\frac{2}{\pi}\arcsin(S_{ij})).$$

I think it is a (well) known fact that $\Phi(\mathscr{P})\subset \mathscr{P}$. My question is the following: Is $\Phi(\mathscr{P})$ convex?

At first I thought that the answer was "no", but I checked that for $N=2$ the answer is "yes". I have no clue as how to test higher dimensions. Does anyone have a suggestion on a method?

Another possible formulation: Given two SDP matrices $A$ and $B$, and $a\in [0,1]$, is the matrix $C$ defined by $$C_{ij}=\frac{\pi}{2}\sin\left(a\frac{2}{\pi}\arcsin(A_{ij})+(1-a)\frac{2}{\pi}\arcsin(B_{ij})\right)$$ also SDP?

1

# Mapping a subset of semi-definite matrices through arcsinus

Hi

I am meeting a problem concerning semi-definite positive matrices, and I have no clue concerning them, the classical approaches I know have not given any result, maybe people used to manipulating them could help me...

Call $\mathscr{P}$ the convex set of symmetric SDP matrices $S$ of order $N\geq 1$ such that $|S_{ij}|<1$ . Consider the mapping $$\Phi:S=(S_{ij})\mapsto (\frac{2}{\pi}\arcsin(S_{ij})).$$

I think it is a (well) known fact that $\Phi(\mathscr{P})\subset \mathscr{P}$. My question is the following: Is $\Phi(\mathscr{P})$ convex?

At first I thought that the answer was "no", but I checked that for $N=2$ the answer is "yes". I have no clue as how to test higher dimensions. Does anyone have a suggestion on a method?
{"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": 30, "mathjax_display_tex": 5, "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": false, "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.971051037311554, "perplexity_flag": "head"}