2007
DOI: 10.1016/j.laa.2007.02.019
|View full text |Cite
|
Sign up to set email alerts
|

A matrix subadditivity inequality for f(A+B) and f(A)+f(B)

Abstract: In 1999 Ando and Zhan proved a subadditivity inequality for operator concave functions. We extend it to all concave functions: Given positive semidefinite matrices A, B and a non-negative concave function f on [0, ∞),for all symmetric norms (in particular for all Schatten p-norms). The case f (t) = √ t is connected to some block-matrix inequalities, for instance the operator norm inequalityfor any partitioned Hermitian matrix.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
41
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 64 publications
(42 citation statements)
references
References 7 publications
1
41
0
Order By: Relevance
“…for all symmetric norms. The case of operator concave functions is given in [2] and the general case is established in [14]; see also [12] for further results. Concerning differences, the following inequality holds…”
Section: Proof Note Thatmentioning
confidence: 99%
“…for all symmetric norms. The case of operator concave functions is given in [2] and the general case is established in [14]; see also [12] for further results. Concerning differences, the following inequality holds…”
Section: Proof Note Thatmentioning
confidence: 99%
“…In place of a detailed proof of the lemma, it suffices to note that part (a) of this lemma is an extension of Theorem 2.3 in [2] for n-tuples of operators (see, also [12, Theorem 1]), while a stronger version of part (b) of the lemma can be obtained by invoking an argument similar to that used in the proof of Proposition 4.1 in [17] (see, also [2, Theorem 2.9]). Parts (c) and (d) of the lemma have been recently given in [15] and [8], respectively. Henceforth, we assume that every function is continuous.…”
Section: Clarkson Inequalities For N-tuples Of Operatorsmentioning
confidence: 99%
“…We remark that the preceding proof is adapted from [4] Proof. We may assume that 0 ≤ x, y ∈ M. For each n = 1, 2, .…”
Section: Vol 13 (2009) Submajorisation Inequalities 117mentioning
confidence: 99%
“…In the special case that M = M n (C) equipped with standard trace, the preceding theorem is due to Bourin and Uchiyama [4].…”
Section: Subadditive Submajorisation For Concave Functionsmentioning
confidence: 99%
See 1 more Smart Citation