Further generalized refinement of Young’s inequalities for τ -mesurable operators
Ighachane Mohamed Amine, Akkouchi Mohamed
Moroccan Journal of Pure and Applied Analysis · 2021
doi:10.2478/mjpaa-2021-0015 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, we prove that if a , b > 0 and 0 ≤ v ≤ 1. Then for all positive integer m (1) - For v ∈ v ∈ [ 0 , 1 2 n ] v \in \left[ {0,{1 \over {{2^n}}}} \right] , we have ( a v b 1 - v ) m + ∑ k = 1 n 2 k - 1 v m ( b m - ( a b 2 k - 1 - 1 ) m 2 k ) 2 ≤ ( v a + ( 1 - v ) b ) m . {\left( {{a^v}{b^{1 - v}}} \right)^m} + \sum\limits_{k = 1}^n {{2^{k - 1}}{v^m}{{\left( {\sqrt {{b^m}} - \root {{2^k}} \of {\left( {a{b^{2k - 1}} - 1} \right)m} } \right)}^2} \le {{\left( {va + \left( {1 - v} \right)b} \right)}^m}.} (2) - For v ∈ v ∈ [ 2 n - 1 2 n , 1 ] v \in \left[ {{{{2^n} - 1} \over {{2^n}}},1} \right] , we have ( a v b 1 - v ) m + ∑ k = 1 n 2 k - 1 ( 1 - v ) m ( a m - ( b a 2 k - 1 - 1 ) m 2 k ) 2 ≤ ( v a + ( 1 - v ) b ) m , {\left( {{a^v}{b^{1 - v}}} \right)^m} + \sum\limits_{k = 1}^n {{2^{k - 1}}{{\left( {1 - v} \right)}^m}{{\left( {\sqrt {{a^m}} - \root {{2^k}} \of {\left( {b{a^{2k - 1}} - 1} \right)m} } \right)}^2} \le {{\left( {va + \left( {1 - v} \right)b} \right)}^m},} we also prove two similar inequalities for the cases v ∈ v ∈ [ 2 n - 1 2 n , 1 2 ] v \in \left[ {{{{2^n} - 1} \over {{2^n}}},{1 \over 2}} \right] and v ∈ v ∈ [ 1 2 , 2 n + 1 2 n ] v \in \left[ {{1 \over 2},{{{2^n} + 1} \over {{2^n}}}} \right] . These inequalities provides a generalization of an important refinements of the Young inequality obtained in 2017 by S. Furuichi. As applications we shall give some refined Young type inequalities for the traces, determinants, and p -norms of positive τ-measurable operators.
Abstract licence: CC BY-NC-ND
References10
10 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.