<p>For any closed <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(K\subseteq \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>⊆</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>, recently all <i>K</i>-positivity preserver have been characterized, i.e., all linear operators <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(T:\mathbb {R}[x_1,\dots ,x_n]\rightarrow \mathbb {R}[x_1,\dots ,x_n]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>:</mo> <mi mathvariant="double-struck">R</mi> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">→</mo> <mi mathvariant="double-struck">R</mi> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(Tp\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mi>p</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> on <i>K</i> for all <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(p\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> on <i>K</i>. An important extension of polynomials <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\mathbb {R}[x_1,\dots ,x_n]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">R</mi> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> with real coefficients are polynomials <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\mathbb {R}^{m\times m}[x_1,\dots ,x_n]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mrow> <mi>m</mi> <mo>×</mo> <mi>m</mi> </mrow> </msup> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with matrix coefficients. Non-negativity on <i>K</i> for matrix polynomials with Hermitian coefficients <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\textrm{Herm}_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>Herm</mtext> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation> is then <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(p(x)\succeq 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> <mo>⪰</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> for all <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(x\in K\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>∈</mo> <mi>K</mi> </mrow> </math></EquationSource> </InlineEquation>. In the current work, we investigate linear operators <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(T:\textrm{Herm}_m[x_1,\dots ,x_n]\rightarrow \textrm{Herm}_m[x_1,\dots ,x_n]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>:</mo> <msub> <mtext>Herm</mtext> <mi>m</mi> </msub> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">→</mo> <msub> <mtext>Herm</mtext> <mi>m</mi> </msub> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. We focus on matrix <i>K</i>-positivity preserver, i.e., <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(Tp\succeq 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mi>p</mi> <mo>⪰</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> on <i>K</i> for all <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(p\succeq 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>⪰</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> on <i>K</i>. For <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(K=\mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>=</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> and compact sets <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(K\subseteq \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>⊆</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>, we give characterizations of matrix <i>K</i>-positivity preservers. We discuss the difference between the real and the matrix coefficient case and where our proof fails for general sets <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(K\subseteq \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>⊆</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(K\ne \mathbb {R}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>≠</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> and <i>K</i> non-compact.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

K-positivity preserver of matrix polynomials

  • Philipp J. di Dio,
  • Lars-Luca Langer

摘要

For any closed \(K\subseteq \mathbb {R}^n\) K R n , recently all K-positivity preserver have been characterized, i.e., all linear operators \(T:\mathbb {R}[x_1,\dots ,x_n]\rightarrow \mathbb {R}[x_1,\dots ,x_n]\) T : R [ x 1 , , x n ] R [ x 1 , , x n ] such that \(Tp\ge 0\) T p 0 on K for all \(p\ge 0\) p 0 on K. An important extension of polynomials \(\mathbb {R}[x_1,\dots ,x_n]\) R [ x 1 , , x n ] with real coefficients are polynomials \(\mathbb {R}^{m\times m}[x_1,\dots ,x_n]\) R m × m [ x 1 , , x n ] with matrix coefficients. Non-negativity on K for matrix polynomials with Hermitian coefficients \(\textrm{Herm}_m\) Herm m is then \(p(x)\succeq 0\) p ( x ) 0 for all \(x\in K\) x K . In the current work, we investigate linear operators \(T:\textrm{Herm}_m[x_1,\dots ,x_n]\rightarrow \textrm{Herm}_m[x_1,\dots ,x_n]\) T : Herm m [ x 1 , , x n ] Herm m [ x 1 , , x n ] . We focus on matrix K-positivity preserver, i.e., \(Tp\succeq 0\) T p 0 on K for all \(p\succeq 0\) p 0 on K. For \(K=\mathbb {R}^n\) K = R n and compact sets \(K\subseteq \mathbb {R}^n\) K R n , we give characterizations of matrix K-positivity preservers. We discuss the difference between the real and the matrix coefficient case and where our proof fails for general sets \(K\subseteq \mathbb {R}^n\) K R n with \(K\ne \mathbb {R}^n\) K R n and K non-compact.