Some Operator Inequalities on Chaotic Order and Monotonicity of Related Operator Function
Abstract
We will discuss some operator inequalities on chaotic order about several operators, which are generalization of Furuta inequality and show monotonicity of related Furuta type operator function.
1. Introduction
An operator T is said to be positive (denoted by T ≥ 0) if (Tx, x) ≥ 0 for all vectors x in a Hilbert space, and T is said to be strictly positive (denoted by T > 0) if T is positive and invertible.
Theorem LH [Löwner-Heinz inequality, denoted by (LH) briefly] If A ≥ B ≥ 0 holds, then Aα ≥ Bα for any α ∈ [0,1].
This was originally proved in [1, 2] and then in [3]. Although (LH) asserts that A ≥ B ≥ 0 ensures Aα ≥ Bα for any α ∈ [0,1], unfortunately Aα ≥ Bα does not always hold for α > 1. The following result has been obtained from this point of view.
Theorem F (Furuta inequality). If A ≥ B ≥ 0, then for each r ≥ 0,
- (i)
(Br/2ApBr/2) 1/q ≥ (Br/2BpBr/2) 1/q,
- (ii)
(Ar/2ApAr/2) 1/q ≥ (Ar/2BpAr/2) 1/q
hold for p ≥ 0 and q ≥ 1 with (1 + r)q ≥ p + r.
The original proof of Theorem F is shown in [4], an elementary one-page proof is in [5], and alternative ones are in [6, 7]. We remark that the domain of the parameters p, q, and r in Theorem F is the best possible for the inequalities (i) and (ii) under the assumption A ≥ B ≥ 0; see [8].
We write A ≫ B if log A ≥ log B for A, B > 0, which is called the chaotic order.
Theorem A. For A, B > 0, the following (i) and (ii) hold:
- (i)
A ≫ B holds if and only if Ar ≥ (Ar/2BpAr/2) r/(p+r) for p, r ≥ 0;
- (ii)
A ≫ B holds if and only if for any fixed δ ≥ 0, FA,B(p, r) = A−r/2(Ar/2BpAr/2) (δ + r)/(p+r)A−r/2 is a decreasing function of p ≥ δ and r ≥ 0.
(i) in Theorem A is shown in [9, 10], an excellent proof in [11], a proof in the case p = r in [12], (ii) in [9, 10], and so forth.
Lemma B (see [11].)Let A be a positive invertible operator, and let B be an invertible operator. For any real number λ,
Definition 1. Let An, An−1, …, A2, A1, B ≥ 0, r1, r2, …, rn ≥ 0, and p1, p2, …, pn ≥ 0 for a natural number n.
Let be defined by
Lemma 2. For An, An−1, …, A2, A1, B ≥ 0 and any natural number n, we have
- (i)
,
- (ii)
q[n] = q[n − 1]pn + rn.
2. Basic Results Associated with and q[n]
We will give some operator inequalities on chaotic order, and Theorem 5 is further extension of Theorem 3.1 in [13].
Lemma 3. If A ≫ B, for p ≥ 0 and r ≥ 0, then A ≫ (Ar/2BpAr/2) 1/(p+r).
Proof. Since A ≫ B, we can obtain the following inequality.
Ar ≥ (Ar/2BpAr/2) r/(p+r) holds for p ≥ 0 and r ≥ 0 by (i) of Theorem A.
Take the logarithm on both sides of the previous inequality; that is,
Theorem 4. If An ≫ An−1 ≫ ⋯≫A2 ≫ A1 ≫ B and r1, r2, …, rn ≥ 0, p1, p2, …, pn ≥ 0 for a natural number n. Then the following inequality holds:
Proof. We will show (9) by mathematical induction. In the case n = 1.
Since A1 ≫ B implies
Assume that (9) holds for a natural number k (1 ≤ k < n). We will show that (9) holds r1, r2, …, rk, rk+1 ≥ 0 and p1, p2, …, pk, pk+1 ≥ 0 for k + 1.
Put D = Ak+1, E = Ak, and , and (9) holds for n = k implying
Theorem 5. If An ≫ An−1 ≫ ⋯≫A2 ≫ A1 ≫ B and r1, r2, …, rn ≥ 0 for a natural number n. For any fixed δ ≥ 0, let p1, p2, …, pn be satisfied by
Proof. Since , q[0] = 1 in (6), we may define I0(p0, r0) = Bδ for p0 = r0 = 0.
Because A1 ≫ B, then for any fixed δ ≥ 0,
Putting rk+1 = r(δ + r1 + r2 + ⋯+rk) in (23), then (23) can be rewritten by
Corollary 6. If An ≫ An−1 ≫ ⋯≫A2 ≫ A1 ≫ B and r1, r2, …, rn ≥ 0 for a natural number n. For any fixed δ ≥ 0, let p1, p2, …, pn be satisfied by (16).
Then the following inequalities hold:
3. Monotonicity Property on Operator Functions
We would like to emphasize that the condition of Theorem 7 is stronger than Theorem 5, and moreover when we discuss monotonicity property on operator functions, we can only apply Theorem 7.
Theorem 7. If An ≫ An−1 ≫ ⋯≫A2 ≫ A1 ≫ B and r1, r2, …, rn ≥ 0, p1, p2, …, pn ≥ 0 for a natural number n. Then the following inequality holds:
Proof. We will show (28) by mathematical induction. In the case n = 1.
Since A1 ≫ B implies
Assume that (28) holds for a natural number k (1 ≤ k < n). We will show (28) for r1, r2, …, rk+1 ≥ 0 and p1, p2, …, pk, pk+1 ≥ 0 for k + 1.
We can obtain the following inequality from the hypothesis (28) for the case n = k:
Theorem 8. If An ≫ An−1 ≫ ⋯≫A2 ≫ A1 ≫ B and r1, r2, …, rn ≥ 0 for a natural number n. For any fixed δ ≥ 0, let p1, p2, …, pn be satisfied by (16).
Then
Proof. Since the condition (16) with δ ≥ 0 suffices (28) in Theorem 7, we have the following inequality by Theorem 7; see (28).
We state the following important inequality (35) for the forthcoming discussion which is the inequality in (16):
(a) Proof of the result that In(pn, rn) is a decreasing function of pn.
Without loss of generality, we can assume that pn > 0. We can obtain the following inequality by (28) and by (i) of Lemma 2:
Whence we have
(b) Proof of the result that In(pn, rn) is a decreasing function of rn.
Without loss of generality, we can assume that rn > 0. Raise each side of (28) to the power μ/rn ∈ [0,1] for rn ≥ μ ≥ 0 by LH, then
Acknowledgments
This work was supported by the National Natural Science Foundation of China (1127112; 11201127), Technology and Pioneering project in Henan Province (122300410110).