Next Article in Journal
A Novel Learning Algorithm Based on Bayesian Statistics: Modelling Thermostat Adjustments for Heating and Cooling in Buildings
Next Article in Special Issue
Hyers–Ulam Stability of Order k for Euler Equation and Euler–Poisson Equation in the Calculus of Variations
Previous Article in Journal
Efficient Algorithms for Data Processing under Type-3 (and Higher) Fuzzy Uncertainty
Previous Article in Special Issue
Improvement of Some Hayashi–Ostrowski Type Inequalities with Applications in a Probability Setting
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Reverse Hardy–Hilbert’s Inequality Containing Multiple Parameters and One Partial Sum

1
Institute of Applied Mathematics, Longyan University, Longyan 364012, China
2
Department of Mathematics, Longyan University, Longyan 364012, China
3
School of Mathematics and Statistics, Hechi University, Yizhou 546300, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(13), 2362; https://doi.org/10.3390/math10132362
Submission received: 1 June 2022 / Revised: 1 July 2022 / Accepted: 4 July 2022 / Published: 5 July 2022
(This article belongs to the Special Issue Mathematical Inequalities, Models and Applications)

Abstract

:
In this work, by introducing multiple parameters and utilizing the Euler–Maclaurin summation formula and Abel’s partial summation formula, we first establish a reverse Hardy–Hilbert’s inequality containing one partial sum as the terms of double series. Then, based on the newly proposed inequality, we characterize the equivalent conditions of the best possible constant factor associated with several parameters. At the end of the paper, we illustrate that more new inequalities can be generated from the special cases of the reverse Hardy–Hilbert’s inequality.

1. Introduction

Let p > 1 , 1 p + 1 q = 1 , a m 0 , b n 0 , 0 < m = 1 a m p < and 0 < n = 1 b n q < . Then,
m = 1 n = 1 a m b n m + n < π sin ( π / p ) ( m = 1 a m p ) 1 p ( n = 1 b n q ) 1 q ,  
where π sin ( π / p ) is the best possible constant factor. Inequality (1) is known in the literature as Hardy-Hilbert’s inequality (see [1]).
By introducing parameters λ i ( 0 , 2 ]   ( i = 1 , 2 ) , λ 1 + λ 2 = λ ( 0 , 4 ] , Krnić and Pečarić [2] provided a generalization of Hardy–Hilbert’s inequality (1) as follows:
m = 1 n = 1 a m b n ( m + n ) λ < B ( λ 1 , λ 2 ) [ m = 1 m p ( 1 λ 1 ) 1 a m p ] 1 p [ n = 1 n q ( 1 λ 2 ) 1 b n q ] 1 q ,
where the constant factor B ( λ 1 , λ 2 ) given by the beta function is the best possible one.
By introducing more parameters, Yang, Wu and Chen [3] established a further generalization of Hardy–Hilbert’s inequality (1) as follows:
n = 1 m = 1 a m b n ( m α + n β ) λ < ( 1 β k λ ( λ 2 ) ) 1 p ( 1 α k λ ( λ 1 ) ) 1 q × { m = 1 m p [ 1 α ( λ λ 2 p + λ 1 q ) ] 1 a m p } 1 p { n = 1 n q [ 1 β ( λ λ 1 q + λ 2 p ) ] 1 b n q } 1 q ,
where 1 p + 1 q = 1 , p > 1 , α , β ( 0 , 1 ] , λ ( 0 , 6 ] , λ 1 ( 0 , 2 α ] ( 0 , λ ) , λ 2 ( 0 , 2 β ] ( 0 , λ ) , k λ ( λ i ) : = B ( λ i , λ λ i ) ( i = 1 , 2 ) .
By constructing partial sums A m : = i = 1 m a i and B n : = k = 1 n b k , Adiyasuren, Batbold and Azar [4] presented the following analogous version of Hardy–Hilbert’s inequality with the best possible constant factor λ 1 λ 2 B ( λ 1 , λ 2 ) :
m = 1 n = 1 a m b n ( m + n ) λ < λ 1 λ 2 B ( λ 1 , λ 2 ) ( m = 1 m p λ 1 1 A m p ) 1 p ( n = 1 n q λ 2 1 B n q ) 1 q ,
where λ i ( 0 , 1 ] ( 0 , λ ) , λ 1 + λ 2 = λ ( λ ( 0 , 2 ] ; i = 1 , 2 ) . Inequality (4) is the other kind of (2) involving two partial sums inside the two terms of series.
Recently, Liao, Wu and Yang [5] considered a variation of inequality (3); one partial sum B n = k = 1 n b k was embedded inside the terms of series, i.e.,
m = 1 n = 1 a m b n ( m α + n β ) λ < λ ( 1 β k λ + 1 ( λ 2 + 1 ) ) 1 p ( 1 α k λ + 1 ( λ 1 ) ) 1 q × { m = 1 m p ( 1 α λ ^ 1 ) 1 a m p } 1 p { n = 1 n q [ 1 β ( 1 + λ ^ 2 ) ] 1 B n q } 1 q ,
where 1 p + 1 q = 1 , p > 1 , α , β ( 0 , 1 ] , λ ( 0 , 5 ] , λ 1 ( 0 , 2 α ] ( 0 , λ + 1 ) , λ 2 ( 0 , 2 β 1 ] ( 0 , λ + 1 ) , λ ^ 1 : = λ λ 2 p + λ 1 q ,   λ ^ 2 : = λ λ 1 q + λ 2 p , k λ + 1 ( λ i ) : = B ( λ i , λ + 1 λ i ) ( i = 1 , 2 ) .
Yang, Wu and Huang [6] established a reverse Hardy–Hilbert’s inequality with one partial sum B n = k = 1 n b k as the term of the double series, as follows:
m = 1 n = 1 a m B n ( m α + n β ) λ + 1 > 1 λ ( 1 β k λ ( λ 2 ) ) 1 p ( 1 α k λ ( λ 1 ) ) 1 q .
As a further study of the development methods of Hardy–Hilbert-type inequalities, some unconventional methods are adopted. For example, a half-discrete Hilbert-type inequality with the multiple upper limit function and the partial sums was provided by [7]. A reverse Hardy–Hilbert-type integral inequality involving one derivative function was published by [8]. Inequalities (4)–(6) and the work of [7,8] are meaningful extensions of (2) based on the Euler–Maclaurin summation formula, Abel’s partial summation formula and the techniques of real analysis. Some applications of Hardy–Hilbert-type inequalities in the real analysis and operator theory can be found in the monograph [9]. In [10], Hong gave an equivalent condition between the best possible constant factor and the parameters in the extension of (4). Some other similar results are provided by [11,12,13].
Inspired by the work of [4,5,6,7,8,9,10], in this paper, we construct a reverse Hardy–Hilbert’s inequality which contains one partial sum and some extra parameters inside the weight coefficients, the reverse Hardy–Hilbert’s inequality has different structural forms by comparing with existing results mentioned above. Our method is mainly based on some skillful applications of the Euler–Maclaurin summation formula and Abel’s partial summation formula. By means of the newly proposed inequality, we then discuss the equivalent conditions of the best possible constant factor associated with several parameters. As applications, we deal with some equivalent forms of the obtained inequality and illustrate how to derive more reverse inequalities of Hardy–Hilbert type from the current results.

2. Preliminaries

For convenience, let us first state the following conditions (C1) that would be used repeatedly in subsequent section:
(C1) p < 0 , 1 p + 1 q = 1 , λ ( 0 , 3 ] , η i [ 0 , 1 4 ] , λ i ( 0 , 3 2 ] ( 0 , λ ) ( i = 1 , 2 ) , η 1 + η 2 = η , λ ^ 1 : = λ λ 2 p + λ 1 q , λ ^ 2 : = λ λ 1 q + λ 2 p . a m , b n 0 ( m , n N = { 1 , 2 , } ) , 0 < m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p < , 0 < n = 1 ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q < , A m = j = 1 m a j with A m = o ( e t ( m η 1 ) ) ( t > 0 ) .
Lemma 1.
(cf. [9] (2.2.3)) (i) If ( 1 ) i d i d t i g ( t ) > 0 , t [ m , ) ( m N ) with g ( i ) ( ) = 0 ( i = 0 , 1 , 2 , 3 ) , P i ( t ) , B i ( i N ) are Bernoulli functions and Bernoulli numbers of i-order, then
m P 2 q 1 ( t ) g ( t ) d t = ε q B 2 q 2 q g ( m )   ( 0 < ε q < 1 ; q = 1 , 2 , ) .
In particular, for q = 1 , B 2 = 1 6 , we have:
1 12 g ( m ) < m P 1 ( t ) g ( t ) d t < 0 ;
for q = 2 , B 4 = 1 30 , it follows that:
0 < m P 3 ( t ) g ( t ) d t < 1 120 g ( m ) .
(ii) (cf. [9], (2.3.2)) If f ( t ) ( > 0 ) C 3 [ m , ) , lim t f ( i ) ( t ) = f ( i ) ( ) = 0   ( i = 0 , 1 , 2 , 3 ) , then we have the following Euler–Maclaurin summation formula:
k = m f ( k ) = m f ( t ) d t + 1 2 f ( m ) + m P 1 ( t ) f ( t ) d t ,
m P 1 ( t ) f ( t ) d t = 1 12 f ( m ) + 1 6 m P 3 ( t ) f ( t ) d t .
Lemma 2.
Suppose that s ( 0 , 3 ] , s 2 ( 0 , 3 2 ] ( 0 , s ) , k s ( s 2 ) : = B ( s 2 , s s 2 ) , we define the following weight coefficient:
ϖ s ( s 2 , m ) : = ( m η 1 ) s s 2 n = 1 ( n η 2 ) s 2 1 ( m + n η ) s ( m N ) .
Then, we have the following inequalities:
0 < k s ( s 2 ) ( 1 O 1 ( 1 ( m η 1 ) s 2 ) ) < ϖ s ( s 2 , m ) < k s ( s 2 )   ( m N )
where O 1 ( 1 ( m η 1 ) s 2 ) : = 1 k s ( s 2 ) 0 1 η 2 m η 1 u s 2 1 ( 1 + u ) s d u , which satisfies 0 < O 1 ( 1 ( m η 1 ) s 2 ) 1 s 2 k s ( s 2 ) ( 1 η 2 m η 1 ) s 2 .
Proof. 
For fixed m N , we set the following real function: g ( m , t ) : = ( t η 2 ) s 2 1 ( m η + t ) s ( t > η 2 ) . In the following, we divide two cases of s 2 ( 0 , 1 ) ( 0 , s ) and s 2 [ 1 , 3 2 ] ( 0 , s ) to prove (12).
(i) For s 2 ( 0 , 1 ) ( 0 , s ) , since ( 1 ) i g ( i ) ( m , t ) > 0   ( t > η 2 ; i = 0 , 1 , 2 ) , by using Hermite–Hadamard’s inequality (cf. [10]) and setting u = t η 2 m η 1 , we find:
ϖ s ( s 2 , m ) = ( m η 1 ) s s 2 n = 1 g ( m , n ) < ( m η 1 ) s s 2 1 2 g ( m , t ) d t = ( m η 1 ) s s 2 1 2 t s 2 1 ( m η 1 + t η 2 ) s d t = 1 2 η 2 m η 1 u s 2 1 ( 1 + u ) s d u 0 u s 2 1 ( 1 + u ) s d u = B ( s 2 , s s 2 ) = k λ ( s 2 ) .
On the other hand, in view of the decreasing property of the series, setting u = t η 2 m η 1 , we obtain:
ϖ s ( s 2 , m ) = ( m η 1 ) s s 2 n = 1 g ( m , n ) > ( m η 1 ) s s 2 1 g ( m , t ) d t = 1 η 2 m η 1 u s 2 1 ( 1 + u ) s d u = B ( s 2 , s s 2 ) 0 1 η 2 m η 1 u s 2 1 ( 1 + u ) s d u = k s ( s 2 ) ( 1 O 1 ( 1 ( m η 1 ) s 2 ) ) > 0 ,
where O 1 ( 1 ( m η 1 ) s 2 ) = 1 k s ( s 2 ) 0 1 η 2 m η 1 u s 2 1 ( 1 + u ) s d u > 0 , which satisfies the following inequality: 0 < 0 1 η 2 m η 1 u s 2 1 ( 1 + u ) s d u < 0 1 η 2 m η 1 u s 2 1 d u = 1 s 2 ( 1 η 2 m η 1 ) s 2 ( m N ) .
Hence, we obtain (12).
(ii) For s 2 [ 1 , 3 2 ] ( 0 , s ) , by (9), we have:
n = 1 g ( m , n ) = 1 g ( m , t ) d t + 1 2 g ( m , 1 ) + 1 P 1 ( t ) g ( m , t ) d t = η 2 g ( m , t ) d t h ( m ) ,
where h ( m ) is indicated as
h ( m ) : = η 2 1 g ( m , t ) d t 1 2 g ( m , 1 ) 1 P 1 ( t ) g ( m , t ) d t .
It is easy to observe that 1 2 g ( m , 1 ) = ( 1 η 2 ) s 2 1 2 ( m η + 1 ) s . Furthermore, integrating by parts, it follows that
η 2 1 g ( m , t ) d t = η 2 1 ( t η 2 s 2 1 ( m η + t ) s d t = 1 s 2 η 2 1 d ( t η ) 2 s 2 ( m η + t ) s = 1 s 2 ( t η ) 2 s 2 ( m η + t ) s | η 2 1 + s s 2 η 2 1 ( t η 2 s 2 d t ( m η + t ) s + 1 = 1 s 2 ( 1 η ) 2 s 2 ( m η + 1 ) s + s s 2 ( s 2 + 1 ) η 2 1 d ( t η ) 2 s 2 + 1 ( m η + t ) s + 1 > 1 s 2 ( 1 η 2 ) s 2 ( m η + 1 ) s + s s 2 ( s 2 + 1 ) [ ( t η 2 ) s 2 + 1 ( m η + t ) s + 1 ] η 2 1 + s ( s + 1 ) s 2 ( s 2 + 1 ) ( m η + 1 ) s + 2 η 2 1 ( t η 2 ) s 2 + 1 d t = 1 s 2 ( 1 η 2 ) s 2 ( m η + 1 ) s + s s 2 ( s 2 + 1 ) ( 1 η 2 ) s 2 + 1 ( m η + 1 ) s + 1 + s ( s + 1 ) ( 1 η 2 ) s 2 + 2 s 2 ( s 2 + 1 ) ( s 2 + 2 ) ( m η + 1 ) s + 2 .
We find that:
g ( m , t ) = ( s 2 1 ) ( t η 2 ) s 2 2 ( m η + t ) s + s ( t η 2 ) s 2 1 ( m η + t ) s + 1 = ( 1 s 2 ) ( t η 2 ) s 2 2 ( m η + t ) s + s ( t η 2 ) s 2 2 [ ( m η + t ) ( m η 1 ) ] ( m η + t ) s + 1 = ( 1 s 2 ) ( t η 2 ) s 2 2 ( m η + t ) s + s ( t η 2 ) s 2 2 ( m η + t ) s s ( m η 1 ) ( t η 2 ) s 2 2 ( m η + t ) s + 1 = ( s + 1 s 2 ) ( t η 2 ) s 2 2 ( m η + t ) s s ( m η 1 ) ( t η 2 ) s 2 2 ( m η + t ) s + 1 ,
and for s 2 [ 1 , 3 2 ] ( 0 , s ) , we deduce that
( 1 ) i d i d t i [ ( t η 2 ) s 2 2 ( m η + t ) s ] > 0 , ( 1 ) i d i d t i [ ( t η 2 ) s 2 2 ( m η + t ) s + 1 ] > 0   ( t > η 2 ; i = 0 , 1 , 2 , 3 ) .
By utilizing (8)–(10), for a : = 1 η 2 [ 3 4 , 1 ] , we obtain:
( s + 1 s 2 ) 1 P 1 ( t ) ( t η 2 ) s 2 2 ( m η + t ) s d t > s + 1 s 2 12 ( m η + 1 ) s a s 2 2 , ( m η 1 ) s 1 P 1 ( t ) ( t η 2 ) s 2 2 ( m η + t ) s + 1 d t > ( m η 1 ) s a s 2 2 12 ( m η + 1 ) s + 1 ( m η 1 ) s 720 [ ( t η 2 ) s 2 2 ( m η + t ) s + 1 ] t = 1 > ( m η + 1 ) s a s 12 ( m η + 1 ) s + 1 a s 2 2 ( m η + 1 ) s 720 [ ( s + 1 ) ( s + 2 ) a s 2 2 ( m η + 1 ) s + 3 + 2 ( s + 1 ) ( 2 s 2 ) a s 2 3 ( m η + 1 ) s + 2 + ( 2 s 2 ) ( 3 s 2 ) a s 2 4 ( m η + 1 ) s + 1 ] = s a s 2 2 12 ( m η + 1 ) s s a s 2 1 12 ( m η + 1 ) s + 1 s 720 [ ( s + 1 ) ( s + 2 ) a s 2 2 ( m η + 1 ) s + 2 + 2 ( s + 1 ) ( 2 s 2 ) a s 2 3 ( m η + 1 ) s + 1 + ( 2 s 2 ) ( 3 s 2 ) a s 2 4 ( m η + 1 ) s ] ,
and then we have:
h ( m ) > a s 2 4 ( m η + 1 ) s h 1 + s a s 2 3 ( m η + 1 ) s + 1 h 2 + s ( s + 1 ) a s 2 2 ( m η + 1 ) s + 2 h 3 ,
where h i   ( i = 1 , 2 , 3 ) are formulated as h 1 : = a 4 s 2 a 3 2 ( 1 s 2 ) a 2 12 s ( 2 s 2 ) ( 3 s 2 ) 720 ,   h 2 : = a 4 s 2 ( s 2 + 1 ) a 2 12 ( s + 1 ) ( 2 s 2 ) 360 , h 3 : = a 4 s 2 ( s 2 + 1 ) ( s 2 + 2 ) s + 2 720 .
Moreover, for s ( 0 , 3 ] ,   s 2 [ 1 , 3 2 ] ( 0 , s ) , a [ 3 4 , 1 ] , we find h 1 > a 2 12 s 2 [ s 2 2 ( 6 a + 1 ) s 2 + 12 a 2 ] 1 120 .
In view of a [ s 2 2 ( 6 a + 1 ) s 2 + 12 a 2 ] = 6 ( 4 a s 2 ) 6 ( 4 3 4 3 2 ) > 0 , and s 2 [ s 2 2 ( 6 a + 1 ) s 2 + 12 a 2 ] = 2 s 2 ( 6 a + 1 ) 2 3 2 ( 6 3 4 + 1 ) < 0 , we obtain:
h 1 ( 3 / 4 ) 2 12 ( 3 / 2 ) [ ( 3 2 ) 2 ( 6 3 4 + 1 ) 3 2 + 12 ( 3 4 ) 2 ] 1 120 = 3 128 1 120 > 0 , h 2 > a 2 ( 4 a 2 15 1 12 ) 1 90 ( 3 4 ) 2 [ 4 15 ( 3 4 ) 2 1 12 ] 1 90 = 3 80 1 90 > 0 , h 3 8 a 4 105 5 720 8 105 ( 3 4 ) 4 1 144 = 27 1120 1 144 > 0 ,
and hence we have h ( m ) > 0 .
On the other hand, we have:
n = 1 g ( m , n ) = 1 g ( m , t ) d t + 1 2 g ( m , 1 ) + 1 P 1 ( t ) g ( m , t ) d t = 1 g ( m , t ) d t + H ( m ) ,
where H ( m ) is indicated as H ( m ) : = 1 2 g ( m , 1 ) + 1 P 1 ( t ) g ( m , t ) d t .
We have already obtained that 1 2 g ( m , 1 ) = a s 2 1 2 ( m η + 1 ) s and g ( m , t ) = ( s + 1 s 2 ) ( t η 2 ) s 2 2 ( m η + t ) s + s ( m η 1 ) ( t η 2 ) s 2 2 ( m η + t ) s + 1 .
For s 2 [ 1 , 3 2 ] ( 0 , s ) , 0 < s 3 , by (7), we acquire:
( s + 1 s 2 ) 1 P 1 ( t ) ( t η 2 ) s 2 2 ( m η + t ) s d t > 0 , ( m η 1 ) s 1 P 1 ( t ) ( t η 2 ) s 2 2 ( m η + t ) s + 1 d t > ( m η 1 ) s a s 2 2 12 ( m η + 1 ) s + 1 = ( m η + 1 ) s + a s 12 ( m η + 1 ) s + 1 a s 2 2 = s 12 ( m η + 1 ) s a s 2 2 + s 12 ( m η + 1 ) s + 1 a s 2 1 > s 12 ( m η + 1 ) s a s 2 2 .
Then, we have:
H ( m ) > a s 2 1 2 ( m η + 1 ) s s a s 2 2 12 ( m η + 1 ) s = ( a 2 s 12 ) a s 2 2 ( m η + 1 ) s ( 1 2 3 4 3 12 ) a s 2 2 ( m η + 1 ) s = ( 3 8 3 12 ) a s 2 2 ( m η + 1 ) s > 0 .
Therefore, we derive the inequalities:
1 g ( m , t ) d t < n = 1 g ( m , n ) < η 2 g ( m , t ) d t .
By virtue of the results of the case (i), we obtain (12). The proof of Lemma 2 is complete. □
Lemma 3.
Under the assumption (C1), we have the following reverse Hardy–Hilbert’s inequality:
I 0 : = n = 1 m = 1 a m b n ( m + n η ) λ > ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q × [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q .
Proof. 
By symmetry, for s 1 ( 0 , 3 2 ] ( 0 , s ) , k s ( s 1 ) = B ( s 1 , s s 1 ) , we can obtain the following inequalities for the next weight coefficient:
0 < k s ( s 1 ) ( 1 O 2 ( 1 ( n η 2 ) s 1 ) ) < ω s ( s 1 , n ) : = ( n η 2 ) s s 1 m = 1 ( m η 1 ) s 1 1 ( m + n η ) s < k s ( s 1 ) ( n N ) ,
where O 2 ( 1 ( n η 2 ) s 1 ) : = 1 k s ( s 1 ) 0 1 η 1 n η 2 u s 1 1 ( 1 + u ) s d u ( > 0 ) .
By applying the reverse Hölder’s inequality (cf. [14]), we obtain:
I 0 = n = 1 m = 1 1 ( m + n η ) λ [ ( m η 1 ) ( 1 λ ) 1 / q ( n η 2 ) ( 1 λ 2 ) / p a m ] [ ( n η 2 ) ( 1 λ 2 ) / p ( m η 1 ) ( 1 λ ) 1 / q b n ] [ m = 1 n = 1 1 ( m + n η ) s ( m η 1 ) ( 1 λ ) 1 ( p 1 ) a m p ( n η 2 ) 1 λ 2 ] 1 p [ n = 1 m = 1 1 ( m + n η ) λ ( n η 2 ) ( 1 λ 2 ) ( q 1 ) b n q ( m η 1 ) 1 λ 1 ] 1 q = [ m = 1 ϖ λ ( λ 2 , m ) ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p [ n = 1 ω λ ( λ , 1 n ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q .
Now, by using (12) and (14) (for s = λ ,   s i = λ i   ( i = 1 , 2 ) ), in view of p < 0 ,   0 < q < 1 , we obtain (13). Lemma 3 is proved. □
Lemma 4.
If t > 0 , then we have the following inequality:
m = 1 e t ( m η 1 ) a m t m = 1 e t ( m η 1 ) A m .
Proof. 
In view of A m e t ( m η 1 ) = o ( 1 ) ( m ) , using Abel’s summation by parts formula, we find:
m = 1 e t ( m η 1 ) a m = lim m A m e t ( m η 1 ) + m = 1 A m [ e t ( m η 1 ) e t ( m η 1 + 1 ) ] = m = 1 A m [ e t ( m η 1 ) e t ( m η 1 + 1 ) ] = ( 1 e t ) m = 1 e t ( m η 1 ) A m .
Since 1 e t < t   ( t > 0 ) , we acquire inequality (15). This completes the proof of Lemma 4. □

3. Main Results

Theorem 1.
Under the assumption (C1), we have the following reverse Hardy–Hilbert’s inequality:
I : = m = 1 n = 1 A m b n ( m + n η ) λ + 1 > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q × [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q .
where O 2 ( 1 ( n η 2 ) λ 1 ) : = 1 k λ ( λ 1 ) 0 1 η 1 n η 2 u λ 1 1 ( 1 + u ) λ d u . In particular, for λ 1 + λ 2 = λ , we have
0 < m = 1 ( m η 1 ) p ( 1 λ 1 ) 1 a m p < , 0 < n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ 2 ) 1 b n q < ,
and the following reverse inequality:
I = m = 1 n = 1 A m b n ( m + n η ) λ + 1 > 1 λ B ( λ 1 , λ 2 ) × [ m = 1 ( m η 1 ) p ( 1 λ 1 ) 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ 2 ) 1 b n q ] 1 q .
Proof. 
In view of the formula 1 ( m + n η ) λ + 1 = 1 Γ ( λ + 1 ) 0 t ( λ + 1 ) 1 e ( m + n η ) t d t , by using (15), it follows that:
I = 1 Γ ( λ + 1 ) m = 1 n = 1 A m b n 0 t ( λ + 1 ) 1 e ( m + n η ) t d t = 1 Γ ( λ + 1 ) 0 t λ 1 [ t m = 1 e ( m η 1 ) t A m ] n = 1 e ( n η 2 ) t b n d t 1 Γ ( λ + 1 ) 0 t λ 1 m = 1 e ( m η 1 ) t a m n = 1 e ( n η 2 ) t b n d t = 1 Γ ( λ + 1 ) m = 1 n = 1 a m b n 0 t λ 1 e ( m + n η ) t d t = Γ ( λ ) Γ ( λ + 1 ) m = 1 n = 1 a m b n ( m + n η ) λ = I 0 λ .
Furthermore, by means of (13), we obtain (16). The proof of Theorem 1 is complete. □
Remark 1.
For s = λ + 1 ( 1 , 3 ] , s 2 = λ ˜ 2 ( 0 , 3 2 ] ( 0 , λ + 1 ) from (11) and (12), we have λ ( 0 , 2 ] , and the following inequality:
ϖ λ + 1 ( λ ˜ 2 , m ) = ( m η 1 ) λ + 1 λ ˜ 2 n = 1 ( n η 2 ) λ ˜ 2 1 ( m + n η ) λ + 1 < k λ + 1 ( λ ˜ 2 ) ( m N ) .
Theorem 2.
If λ 1 + λ 2 = λ ( 0 , 2 ] , λ 1 ( 0 , 1 ] ( 0 , λ ) ,   λ 2 ( 0 , 3 2 ] ( 0 , λ ) , then the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (16) is the best possible.
Proof. 
(i) For the case of λ 1 ( 0 , 1 ) ( 0 , λ ) , we prove that the constant factor 1 λ B ( λ 1 , λ 2 ) in (17) is the best possible.
For any 0 < ε < min { | p | ( 1 λ 1 ) , q λ 2 } , we set a ˜ m : = m λ 1 ε p 1 , b ˜ n : = n λ 2 ε q 1 ( m , n N ) . Since 0 < ε < | p | ( 1 λ 1 ) , we have 0 < λ 1 ε p < 1 ( p < 0 ) , and f ( t ) : = t λ 1 ε p 1 is strictly decreasing with respect to t > 0 . Thus, by the decreasing property of the series, we have A ˜ m : = i = 1 m a ˜ i = i = 1 m i λ 1 ε p 1 < 0 m t λ 1 ε p 1 d t = 1 λ 1 ε p m λ 1 ε p .
If there exists a constant M 1 λ B ( λ 1 , λ 2 ) such that (17) is valid when we replace 1 λ B ( λ 1 , λ 2 ) by M , then, in particular, for η i = η = 0   ( i = 1 , 2 ) , using a substitution of a m = a ˜ m , b n = b ˜ n and A m = A ˜ m in (17), we have:
I ˜ : = n = 1 m = 1 A ˜ m b ˜ n ( m + n ) λ + 1 > M [ m = 1 m p ( 1 λ 1 ) 1 a ˜ m p ] 1 p [ n = 1 ( 1 O 2 ( 1 n λ 1 ) ) n q ( 1 λ 2 ) 1 b ˜ n q ] 1 q .
By (19) and the decreasing property of the series, we obtain:
I ˜ > M [ m = 1 m p ( 1 λ 1 ) 1 m p λ 1 ε p ) 1 p [ n = 1 ( 1 O 2 ( 1 n λ 1 ) ) n q ( 1 λ 2 ) 1 n q λ 2 ε q ] 1 q = M ( 1 + m = 2 m 1 ε ) 1 p ( n = 1 n 1 ε m = 1 O 2 ( 1 n λ 1 + 1 + ε ) ) 1 q > M ( 1 + 1 x 1 ε d x ) 1 p ( 1 y 1 ε d y O ( 1 ) ) 1 q > M ε ( ε + 1 ) 1 p ( 1 ε O ( 1 ) ) 1 q .
By (18), for η i = η = 0   ( i = 1 , 2 ) ,   λ ˜ 2 = λ 2 ε q ( 0 , 3 2 ) ( 0 , λ ) , we have:
I ˜ < 1 λ 1 ε p m = 1 [ m λ ( λ 2 ε q ) + 1 n = 1 1 ( m + n ) λ + 1 n λ 2 ε q 1 ] m ε 1 = 1 λ 1 ε p m = 1 ϖ λ + 1 ( λ ˜ 2 , n ) m ε 1 < 1 λ 1 ε p k λ + 1 ( λ ˜ 2 ) ( 1 + m = 2 m ε 1 ) < 1 λ 1 ε p k λ + 1 ( λ ˜ 2 ) ( 1 + 1 x ε 1 d x ) = 1 ε 1 λ 1 ε p k λ + 1 ( λ ˜ 2 ) ( ε + 1 ) .
This yields:
1 λ 1 ε p k λ + 1 ( λ ˜ 2 ) ( ε + 1 ) > ε I ˜ > M ( ε + 1 ) 1 p ( 1 ε O ( 1 ) ) 1 q .
Putting ε 0 + into the above inequality, by virtue of the continuity of the beta function, we obtain 1 λ B ( λ 1 , λ 2 ) = 1 λ 1 B ( λ 1 + 1 , λ 2 ) = 1 λ 1 k λ + 1 ( λ 2 ) M .
Hence, M = 1 λ B ( λ 1 , λ 2 ) is the best possible constant factor in (17).
(ii) For the case of λ 1 = 1 ( 1 < λ 2 ) , for any 0 < ε < 1 , replacing λ by λ ε in (17), setting λ 1 = 1 ε , λ 2 = λ 1 , by case (i), we have the following inequality with the best possible constant factor 1 λ ε B ( 1 ε , λ 1 ) :
m = 1 n = 1 A m b n ( m + n η ) λ ε + 1 > 1 λ ε B ( 1 ε , λ 1 ) [ m = 1 ( m η 1 ) p ε 1 a m p ] 1 p K q , ε ,
where K q , ε : = [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) 1 ε ) ) ( n η 2 ) q ( 2 λ ) 1 b n q ] 1 q .
Since for λ 1 = 1 we have:
( m η 1 ) p ε 1 ( m η 1 ) 1 = ( m η 1 ) p ( 1 λ 1 ) 1 , m = 1 ( m η 1 ) p ε 1 a m p m = 1 ( m η 1 ) p ( 1 λ 1 ) 1 a m p < ,
it follows that lim ε 0 + m = 1 ( m η 1 ) p ε 1 a m p = m = 1 ( m η 1 ) p ( 1 1 ) 1 a m p , and in the same way, we conclude that lim ε 0 + K q , ε = K q , 0 is valid.
If there exists a constant factor M 1 λ B ( 1 , λ 1 ) = 1 λ ( λ 1 ) ( 1 < λ 2 ) , such that (17) (for λ 1 = 1 , λ 2 = λ 1 ) is valid when we replace 1 λ ( λ 1 ) by M , namely
m = 1 n = 1 A m b n ( m + n η ) λ + 1 > M [ m = 1 ( m η 1 ) 1 a m p ] 1 p K q , 0 ,
Then, by using Fatou lemma (cf. [15]) and (20), it follows that
lim ε 0 + { m = 1 n = 1 A m b n ( m + n η ) λ ε + 1 / [ m = 1 ( m η 1 ) p ε 1 a m p ] 1 p K q , ε } m = 1 n = 1 A m b n ( m + n η ) λ + 1 / [ m = 1 ( m η 1 ) 1 a m p ] 1 p K q , 0 > M .
By the property of limitation, there exists a constant δ 0 ( 0 , 1 ) , such that for any δ ( 0 , δ 0 ) ,
m = 1 n = 1 A m b n ( m + n η ) λ δ + 1 / [ m = 1 ( m η 1 ) p [ 1 ( 1 δ ) ] 1 a m p ] 1 p K q > M ,
namely,
m = 1 n = 1 A m b n ( m + n η ) λ δ + 1 > M [ m = 1 ( m η 1 ) p [ 1 ( 1 δ ) ] 1 a m p ] 1 p K q , δ .
Since the constant factor 1 λ δ B ( 1 δ , λ 1 ) in (20) (for ε = δ ) is the best possible, we have 1 λ δ B ( 1 δ , λ 1 ) M . Letting δ 0 + , we have 1 λ ( λ 1 ) = 1 λ B ( 1 , λ 1 ) M , which implies that M = 1 λ ( λ 1 ) is the best possible factor of (17) (for λ 1 = 1 ,   λ 2 = λ 1 ). This completes the proof of Theorem 2. □
Theorem 3.
Under the assumption (C1), if the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (16) is the best possible, then for
λ λ 1 λ 2 [ ( λ λ 2 3 2 ) q , ( λ λ 2 ) q ) ( λ 2 q , ( 3 2 λ 2 ) q ] ( { 0 } ) ,  
we have λ 1 + λ 2 = λ .
Proof. 
Note that for λ ^ 1 = λ λ 2 p + λ 1 q , λ ^ 2 = λ λ 1 q + λ 2 p , we find λ ^ 1 + λ ^ 2 = λ λ 2 p + λ 1 q + λ λ 1 q + λ 2 p = λ .
If λ λ 1 λ 2 [ ( λ λ 2 3 2 ) q , ( λ λ 2 ) q ) ( { 0 } ) , then we have 0 < λ ^ 1 = λ λ 2 p + λ 1 q 3 2 ; if λ λ 1 λ 2 ( λ 2 q , ( 3 2 λ 2 ) q ] ( { 0 } ) , then we have 0 < λ ^ 2 3 2 . By using (22), we obtain 0 < λ ^ i < λ   ( i = 1 , 2 ) , and then we deduce that λ ^ i ( 0 , 3 2 ] ( 0 , λ ) ( i = 1 , 2 ) .
By applying (17), we have
m = 1 n = 1 A m b n ( m + n η ) λ + 1 > 1 λ B ( λ ^ 1 , λ ^ 2 ) [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ ^ 1 ) ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q .
If the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (16) is the best possible, then by using (23), we have the following inequality: 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q 1 λ B ( λ ^ 1 , λ ^ 2 ) = 1 λ k λ ( λ ^ 1 ) ( R + = ( 0 , ) ) , namely, ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q k λ ( λ ^ 1 ) .
By employing the reverse Hölder’s inequality (cf. [14]), we obtain:
k λ ( λ ^ 1 ) = k λ ( λ λ 2 p + λ 1 q ) = 0 1 ( 1 + u ) λ u λ λ 2 p + λ 1 q 1 d u = 0 1 ( 1 + u ) λ ( u λ λ 2 1 p ) ( u λ 1 1 q ) d u [ 0 1 ( 1 + u ) λ u λ λ 2 1 d u ] 1 p [ 0 1 ( 1 + u ) λ u λ 1 1 d u ] 1 q = [ 0 1 ( 1 + v ) λ v λ 2 1 d v ] 1 p [ 0 1 ( 1 + u ) λ u λ 1 1 d u ] 1 q = ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q ,
which implies that k λ ( λ ^ 1 ) = ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q , namely, (24) keeps the form of equality.
Note that (24) keeps the form of equality if and only if there exist constants A and B such that they are not both zero satisfying (cf. [15]) A u λ λ 2 1 = B u λ 1 1   a . e . in R + . Assuming that A 0 , we have u λ λ 2 λ 1 = B A   a . e . in R + , and λ λ 2 λ 1 = 0 . Hence, we have λ 1 + λ 2 = λ . Theorem 3 is proved. □

4. Equivalent Forms and Some Particular Inequalities

Theorem 4.
Under the assumption (C1), we have the following reverse inequality equivalent to (16):
J : = { n = 1 ( n η 2 ) p λ ^ 2 1 ( 1 O ( 1 ( n η 2 ) λ 1 ) ) p 1 [ m = 1 A m ( m + n η ) λ + 1 ] p } 1 p > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p .
In particular, for λ 1 + λ 2 = λ , we have 0 < m = 1 ( m η 1 ) p ( 1 λ 1 ) 1 a m p < , and the following reverse inequality equivalent to (19):
{ n = 1 ( n η 2 ) p λ 2 1 ( 1 O ( 1 ( n η 2 ) λ 1 ) ) p 1 [ m = 1 A m ( m + n η ) λ + 1 ] p } 1 p > 1 λ B ( λ 1 , λ 2 ) [ m = 1 ( m η 1 ) p ( 1 λ 1 ) 1 a m p ] 1 p .
Proof. 
Suppose that (25) is valid. By using the reverse Höder’s inequality (cf. [14]), we have
I = n = 1 [ ( n η 2 ) 1 p + λ ^ 2 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) 1 q m = 1 A m ( m + n η ) λ + 1 ] [ ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) 1 q ( n η 2 ) 1 p λ ^ 2 b n ] J [ n = 1 ( 1 O 2 ( 1 ( n η 1 ) λ 1 ) ) ( n η 1 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q .
Then, from (25) and (27), we obtain (16).
On the other hand, assuming that (16) is valid, we set b n : = ( n η 2 ) p λ ^ 2 1 ( 1 O ( 1 ( n η 2 ) λ 1 ) ) p 1 [ m = 1 A m ( m + n η ) λ + 1 ] p 1 , n N . Then, it follows that J = [ n = 1 ( 1 O ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 p .
If J = , then (25) is naturally valid; if J = 0 , then it is impossible that it makes (25) valid, namely, J > 0 . Suppose that 0 < J < . By virtue of (16), we have
n = 1 ( 1 O 2 ( 1 ( n η 2 ) λ 1 ) ) ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q = J p = I > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p J p 1 , J > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q [ m = 1 ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p .
Thus, we obtain (25), which implies that (25) is equivalent to (16). The Theorem 4 is proved. □
Remark 2.
By the same way as above, in view of assumption (C1), if 0 < p < 1 , q < 0 , 1 p + 1 q = 1 , then we can obtain the following reverse equivalent inequalities containing one partial sums:
m = 1 n = 1 A m b n ( m + n η ) λ + 1 > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q [ m = 1 ( 1 O 1 ( 1 ( m η 1 ) λ 2 ) ) ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p [ n = 1 ( n η 2 ) q ( 1 λ ^ 2 ) 1 b n q ] 1 q , { n = 1 ( n η 2 ) p λ ^ 2 1 [ m = 1 A m ( m + n η ) λ + 1 ] p } 1 p > 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q [ m = 1 ( 1 O 1 ( 1 ( m η 1 ) λ 2 ) ) ( m η 1 ) p ( 1 λ ^ 1 ) 1 a m p ] 1 p .
Theorem 5.
If λ 1 + λ 2 = λ ( ( 0 , 2 ] ) satisfying λ 1 ( 0 , 1 ] ( 0 , λ ) and λ 2 ( 0 , 3 2 ] ( 0 , λ ) , then the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (25) is the best possible. On the other hand, by virtue of the assumption (C1), if the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (25) is the best possible, then for
λ λ 1 λ 2 [ ( λ λ 2 3 2 ) q , ( λ λ 2 ) q ) ( λ 2 q , ( 3 2 λ 2 ) q ] ( { 0 } ) ,
we have λ 1 + λ 2 = λ .
Proof. 
If λ 1 + λ 2 = λ ( ( 0 , 2 ] ) satisfying λ 1 ( 0 , 1 ] ( 0 , λ ) and λ 2 ( 0 , 3 2 ] ( 0 , λ ) , then by using Theorem 2, we conclude that the constant factor 1 λ ( k λ ( λ 2 ) ) 1 p ( k λ ( λ 1 ) ) 1 q in (16) is the best possible. By employing (27), we can prove that the constant factor in (25) is still the best possible.
On the other hand, if the same constant factor in (25) is the best possible, then by the equivalency of (25) and (16), in view of J q = I (in the proof of Theorem 4), it follows that the same constant factor in (16) is still the best possible. By applying Theorem 2, in view of the assumption, we have λ 1 + λ 2 = λ . The proof of Theorem 5 is complete. □
Remark 3.
(i) Taking η = η 1 = η 2 = 0 in (17) and (26), we obtain the following reverse equivalent inequalities:
m = 1 n = 1 A m b n ( m + n ) λ + 1 > 1 λ B ( λ 1 , λ 2 ) [ m = 1 m p ( 1 λ 1 ) 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 n λ 1 ) ) n q ( 1 λ 2 ) 1 b n q ] 1 q ,   { n = 1 n p λ 2 1 ( 1 O ( 1 n λ 1 ) ) p 1 [ m = 1 A m ( m + n ) λ + 1 ] p } 1 p > 1 λ B ( λ 1 , λ 2 ) [ m = 1 m p ( 1 λ 1 ) 1 a m p ] 1 p .
Hence, (17) (resp. (16)) is an extension of inequality (28).
In particular, for λ = 2 , λ 1 = λ 2 = 1 , we have
m = 1 n = 1 A m b n ( m + n ) 3 > 1 2 ( m = 1 m 1 a m p ) 1 p [ n = 1 ( 1 O 2 ( 1 n ) ) n 1 b n q ] 1 q , { n = 1 n p 1 ( 1 O ( 1 n ) ) p 1 [ m = 1 A m ( m + n ) 3 ] p } 1 p > 1 2 ( m = 1 m 1 a m p ) 1 p .
(ii) Putting λ = 1 , λ 1 = λ 2 = 1 2 in (17) and (26), we obtain the following reverse inequalities with the best possible constant factor π :
m = 1 n = 1 A m b n ( m + n η ) 2 > π [ m = 1 ( m η 1 ) p 2 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n η 2 ) 1 / 2 ) ) ( n η 2 ) q 2 1 b n q ] 1 q ,
{ n = 1 ( n η 1 ) p 2 1 ( 1 O ( 1 ( n η 1 ) 1 / 2 ) ) p 1 [ m = 1 A m ( m + n η ) 2 ] p } 1 p > π [ m = 1 ( m η 1 ) p 2 1 a m p ] 1 p .
Choosing η 1 = η 2 = η = 0 in (29) and (30), we have
m = 1 n = 1 A m b n ( m + n ) 2 > π ( m = 1 m p 2 1 a m p ) 1 p [ n = 1 ( 1 O 2 ( 1 n 1 / 2 ) ) n q 2 1 b n q ] 1 q , { n = 1 n p 2 1 ( 1 O ( 1 n 1 / 2 ) ) p 1 [ m = 1 A m ( m + n ) 2 ] p } 1 p > π ( m = 1 m p 2 1 a m p ) 1 p .
Choosing η 1 = η 2 = 1 4 , η = 1 2 in (29) and (30), we obtain:
m = 1 n = 1 A m b n ( m + n 1 2 ) 2 > π [ m = 1 ( m 1 4 ) p 2 1 a m p ] 1 p [ n = 1 ( 1 O 2 ( 1 ( n 1 4 ) 1 / 2 ) ) ( n 1 4 ) q 2 1 b n q ] 1 q , { n = 1 ( n 1 4 ) p 2 1 ( 1 O ( 1 ( n 1 4 ) 1 / 2 ) ) p 1 [ m = 1 A m ( m + n 1 2 ) 2 ] p } 1 p > π [ m = 1 ( m 1 4 ) p 2 1 a m p ] 1 p .

5. Conclusions

In this paper, inspired by the work of [4,5,6,7,8,9,10], we construct a reverse Hardy–Hilbert’s inequality which contains one partial sum and some extra parameters inside the weight coefficients in Theorem 1. Our method is mainly based on some skillful applications of the Euler–Maclaurin summation formula and Abel’s partial summation formula. By means of the newly proposed inequality, we then discuss the equivalent conditions of the best possible constant factor associated with several parameters in Theorems 2 and 3. As applications, we deal with some equivalent forms of the obtained inequality and illustrate how to derive more reverse inequalities of the Hardy–Hilbert type from the current results in Theorems 4 and 5. The lemmas and theorems reveal rich connotations and significance of this type of inequality.

Author Contributions

B.Y. carried out the mathematical studies and drafted the manuscript. S.W. and X.H. participated in the design of the study and performed the numerical analysis. All authors contributed equally in the preparation of this paper. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation (Nos.11961021, 11561019), the Hechi University Research Foundation for Advanced Talents under Grant (No.2021GCC024), the Characteristic Innovation Project of Guangdong Provincial Colleges and Universities (No.2020KTSCX088) and the Natural Science Foundation of Fujian Province of China (No.2020J01365).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that they have no competing interest.

References

  1. Hardy, G.H.; Littlewood, J.E.; Polya, G. Inequalities; Cambridge University Press: Cambridge, UK, 1934. [Google Scholar]
  2. Krnić, M.; Pečarić, J. Extension of Hilbert’s inequality. J. Math. Anal. Appl. 2006, 324, 150–160. [Google Scholar] [CrossRef] [Green Version]
  3. Yang, B.; Wu, S.; Chen, Q. A new extension of Hardy-Hilbert’s inequality containing kernel of double power functions. Mathematics 2020, 8, 894. [Google Scholar] [CrossRef]
  4. Adiyasuren, V.; Batbold, T.; Azar, L.E. A new discrete Hilbert-type inequality involving partial sums. J. Inequal. Appl. 2019, 2019, 127. [Google Scholar] [CrossRef]
  5. Liao, J.; Wu, S.; Yang, B. A multiparameter Hardy-Hilbert-type inequality containing partial sums as the terms of series. J. Math. 2021, 2021, 5264623. [Google Scholar] [CrossRef]
  6. Yang, B.; Wu, S.; Huang, X. A reverse Hardy-Hilbert’s inequality involving one partial sum as the terms of double series. J. Funct. Spaces 2022, 2022, 2175463. [Google Scholar] [CrossRef]
  7. Wang, A.; Hong, Y.; Yang, B. On a new half-discrete Hilbert-type inequality with the multiple upper limit function and the partial sums. J. Appl. Anal. Comput. 2022, 12, 814–830. [Google Scholar] [CrossRef]
  8. Chen, Q.; Yang, B. A reverse Hardy–Hilbert-type integral inequality involving one derivative function. J. Inequal. Appl. 2020, 2020, 259. [Google Scholar] [CrossRef]
  9. Yang, B.C. The Norm of Operator and Hilbert-Type Inequalities; Science Press: Beijing, China, 2009. [Google Scholar]
  10. Hong, Y.; Wen, Y. A necessary and sufficient condition of that Hilbert type series inequality with homogeneous kernel has the best constant factor. Ann. Math. 2016, 37, 329–336. [Google Scholar]
  11. Hong, Y. On the structure character of Hilbert’s type integral inequality with homogeneous kernel and application. J. Jilin Univ. 2017, 55, 189–194. [Google Scholar]
  12. Liu, Q. On a mixed Kernel Hilbert-type integral inequality and its operator expressions with norm. Math. Meth. Appl. Sci. 2021, 44, 593–604. [Google Scholar] [CrossRef]
  13. Yang, L.; Yang, R. Some new Hardy-Hilbert-type inequalities with multiparameters. AIMS Math. 2022, 7, 840–854. [Google Scholar] [CrossRef]
  14. Kuang, J.C. Applied Inequalities; Shangdong Science and Technology Press: Jinan, China, 2004. [Google Scholar]
  15. Kuang, J.C. Real and Functional Analysis; Higher Education Press: Beijing, China, 2015. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yang, B.; Wu, S.; Huang, X. A Reverse Hardy–Hilbert’s Inequality Containing Multiple Parameters and One Partial Sum. Mathematics 2022, 10, 2362. https://doi.org/10.3390/math10132362

AMA Style

Yang B, Wu S, Huang X. A Reverse Hardy–Hilbert’s Inequality Containing Multiple Parameters and One Partial Sum. Mathematics. 2022; 10(13):2362. https://doi.org/10.3390/math10132362

Chicago/Turabian Style

Yang, Bicheng, Shanhe Wu, and Xingshou Huang. 2022. "A Reverse Hardy–Hilbert’s Inequality Containing Multiple Parameters and One Partial Sum" Mathematics 10, no. 13: 2362. https://doi.org/10.3390/math10132362

APA Style

Yang, B., Wu, S., & Huang, X. (2022). A Reverse Hardy–Hilbert’s Inequality Containing Multiple Parameters and One Partial Sum. Mathematics, 10(13), 2362. https://doi.org/10.3390/math10132362

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop