A proof via operator means of an order preserving inequality (Q1813210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90291-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973395267 / rank
 
Normal rank

Revision as of 01:05, 20 March 2024

scientific article
Language Label Description Also known as
English
A proof via operator means of an order preserving inequality
scientific article

    Statements

    A proof via operator means of an order preserving inequality (English)
    0 references
    0 references
    25 June 1992
    0 references
    In [Proc. Am. Math. Soc. 101, 85-88 (1987; Zbl 0721.47023)]\ the author of the paper under review proved that, if \(A\) and \(B\) are operators such that \(A\geq B\geq 0\), then \((B^ r A^ p B^ r)^{1/q}\geq B^{(p+2r)/q}\) whenever \(r\geq 0\), \(p\geq 0\), \(q\geq 1\), and \((1+2r)q\geq p+2r\). Subsequently, \textit{D. Wang} [Am. Math. Mon. 96, No. 6, 517-519 (1989; Zbl 0687.15014)] proved this result in the special case \(p=q=2\), \(r=1\) using the polar decomposition as the main tool while E. Kamei used the concept of the mean of two linear operators to provide proofs for the cases \(p=q=2\), \(r=1\) and \(p=2\), \(q=4/3\), \(r=1\). In the paper under review, the author uses the concept of operator means to prove his original result in its full generality.
    0 references
    operator inequality
    0 references
    means of linear operators
    0 references
    operator means
    0 references

    Identifiers