Some applications of two completely copositive maps (Q2174486)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some applications of two completely copositive maps
scientific article

    Statements

    Some applications of two completely copositive maps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    Let \(\mathbb{M}_n\) and \(\mathbb{M}_m(\mathbb{M}_n)\) be the set of \(n\times n\) matrices and the set of \(m\times m\) block matrices with each block in \(\mathbb{M}_n\), respectively. Both linear maps, \(\Phi_{\pm}:X\mapsto (\operatorname{tr}X)I\pm X\) are shown to be completely copositive, i.e., \([\Phi_{\pm}(A_{ji})]_{i,j=1}^m\) is positive semi-definite for all positive semi-definite matrices \([A_{ij}]_{i,j=1}^m\in\mathbb{M}_m(\mathbb{M}_n)\). In fact, it suffices to show that the corresponding Choi matrix \([\Phi_{\pm}(E_{ji})]_{i,j=1}^n\) is positive semi-definite, where \(\{E_{ij}: i,j=1,\dots,n\}\) is the standard basis of \(\mathbb{M}_n\). By observing that \[[\Phi_{\pm}(A_{ji})]_{i,j=1}^m=[A_{ij}]_{i,j=1}^m\pm\operatorname{tr}_2([A_{ij}]_{i,j=1}^m),\] inequalities between partial transpose and partial trace of positive semi-definite matrices are obtained. The case where \([A_{ij}]_{i,j=1}^m\) is a positive partial transpose becomes an immediate consequence. In addition, the result is applied to \(2\times 2\) block positive semi-definite matrices in order to obtain trace inequalities motivated by Kotelianskii's inequality. Reviewer's remark. In the abstract, it is stated that ``trace inequalities of positive semidefinite \(3\times 3\) block matrices are included.'' However, Theorem 3.3 and Theorem 3.4 are basically trace inequalities for principal \(2\times 2\) block positive semi-definite matrices.
    0 references
    0 references
    block matrices
    0 references
    positive semidefinite
    0 references
    positive partial transpose
    0 references
    partial trace
    0 references
    0 references
    0 references
    0 references
    0 references