Next Article in Journal
Hub-and-Spoke Network Optimization with Flow Delay Cost: The Case of Goods Delivery on Urban Logistics Networks in Eastern China
Previous Article in Journal
Baire 1 Functions and the Topology of Uniform Convergence on Compacta
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Chebyshev–Jensen-Type Inequalities Involving χ-Products and Their Applications in Probability Theory

1
College of Computer Science, Chengdu University, Chengdu 610106, China
2
School of Information Engineering, Nanjing Xiaozhuang University, Nanjing 211171, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(10), 1495; https://doi.org/10.3390/math12101495
Submission received: 8 April 2024 / Revised: 4 May 2024 / Accepted: 6 May 2024 / Published: 10 May 2024

Abstract

:
By means of the functional analysis theory, reorder method, mathematical induction and the dimension reduction method, the Chebyshev-Jensen-type inequalities involving the χ -products · χ and [ · ] χ are established, and we proved that our main results are the generalizations of the classical Chebyshev inequalities. As applications in probability theory, the discrete with continuous probability inequalities are obtained.

1. Introduction

In [1], the authors points out that the classical Chebyshev’s integral inequality is deeply connected with the study of positive dependence of random variables, which are monotone functions of a common random variable. The Chebyshev-type inequalities and their applications were investigated by many authors [1,2,3,4,5,6,7,8,9,10,11,12,13]. In [2], the authors established the Chebyshev-type inequalities involving the permanents of matrix as follows:
per ( A B ) n ! per A n ! · per B n ! and per A i = 1 n j = 1 n a i , j per B i = 1 n j = 1 n b i , j .
In [3], the authors established the following Chebyshev type inequality:
a , b a * , b * a p a * p · b q b * q ,
where a , b , a * , b * R + + n ,
a , b i = 1 n a i b i and a p i = 1 n | a i | p 1 / p , 0 < p < max 1 i n | a i | , p = .
The Jensen type inequalities and their applications were also investigated by many authors [14,15,16,17,18,19,20,21,22,23,24]. In [14], the authors considered that comparing two integral means for absolutely continuous functions, whose absolute value of the derivative are convex, and displayed its applications.
The probability density function [24,25,26,27,28,29,30] of the random variable is a basic concept in the theories of probability and statistics. In [24], the authors studied the monotonicity of the interval function
JVar ϕ φ X a , b a b p I ϕ φ a b p I ϕ a b p I φ a b p I ,
which involving the probability density function p I , where I = [ a , b ] is an interval, and displayed its applications in the analysis of variance and the higher education. In [25], the authors considered the probability density function of a stochastic HIV model with cell-to-cell infection.
This paper established the Chebyshev–Jensen-type inequalities involving the χ -products · χ and [ · ] χ , and we proved that our main results are the generalizations of the classical Chebyshev inequalities (see Corollaries 1 and 2), as well as displaying the applications of our main results in probability theory, and the discrete with continuous probability inequalities are obtained.
In Section 2, we defined the comonotone and the χ -products; in Section 3, we established the discrete Chebyshev–Jensen-type inequalities; In Section 4, we established the continuous Chebyshev–Jensen-type inequalities; in Section 5, we displayed the applications of our main results in probability theory.
The research tools of this paper include the theories of functional analysis [31,32,33], discrete mathematics [2,34], mean value [35,36], and probability [24,25,26,27,28,29,30]. The research methods of this paper are based on mathematical induction [2,36], the reorder method [2], and the dimension reduction method [36].

2. Basic Concepts and Classical Results

We will use the following hypotheses and notations throughout the paper.
N 0 , 1 , 2 , , j , , N k n j N : k j n , R , ,
R + 0 , , R + + 0 , , X x 1 , x 2 , , x n R n , Y y 1 , y 2 , , y n R n ,
X ¯ n 1 x 1 + x 2 + + x i + + x n R , X r x 1 r , x 2 r , , x i r , , x n r R n ,
e 1 , 1 , , 1 , , 1 R n , f ( X ) f x 1 , f x 2 , , f x i , , f x n R n ,
X 1 X 2 X r X m x 1 1 x 1 2 x 1 m , x 2 1 x 2 2 x 2 m , , x r 1 x r 2 x r m , , x n 1 x n 2 x n m R n ,
C [ 0 , 1 ] f : [ 0 , 1 ] I : f be continuous , C r [ 0 , 1 ] f r : [ 0 , 1 ] I r : f r be continuous ,
f ¯ 0 1 f ( t ) d t , f C [ 0 , 1 ] , T t 1 , t 2 , , t r , , t m R m , Π ( T ) t 1 t 2 t r t m ,
χ r T χ T t r , r N 1 m , χ r s T 2 χ T t r t s , r , s N 1 m ,
I m I 1 × I 2 × × I r × × I m , I n = I n I 1 = I 2 = = I i = = I n = I ,
where I , I 1 , I 2 , , I r , , I m are the intervals, i N 1 n , r N 1 m , m N 2 and n N 2 .
Definition 1
(see [1]). The points X , Y R n are said to be comonotone, written as X Y , if
x i x j y i y j 0 , i , j N 1 n ,
and X and Y are said to be countermonotone, written as X Y , if X Y ; the functions f , g : [ 0 , 1 ] R are said to be comonotone, written as f g , if
f ( x ) f ( y ) g ( x ) g ( y ) 0 , x , y [ 0 , 1 ] ,
and f and g are said to be countermonotone, written as f g , if f g .
Definition 2.
Let the function χ : I m R be continuous. Then, we define the functional [31,32,33]
X 1 , , X m χ : I 1 n × × I m n R , X 1 , , X m χ 1 n i = 1 n χ x i 1 , , x i m
as the first χ-product of the points X 1 , X 2 , , X m , and the functional
X 1 , , X m χ : I 1 n × × I m n R , X 1 , , X m χ 1 n m 1 i 1 , , i m n χ x i 1 1 , , x i m m
as the second χ-product of the points X 1 , X 2 , , X m .
By Definition 2, we see that the functional X 1 , , X m χ is the mean value [35,36] of the functions χ x i 1 , , x i m , i N 1 n , and the functional X 1 , , X m χ is the mean value of the functions χ x i 1 1 , , x i m m , i 1 , , i m N 1 n , and
X 1 , X 2 , , X m Π = X 1 X 2 X m ¯
with
X 1 , X 2 , , X m Π = Π X 1 ¯ , X 2 ¯ , , X m ¯ = X 1 ¯ × X 2 ¯ × × X m ¯ .
Definition 3.
Let the function χ : I m R be continuous. Then, we define the functional [31,32,33]
f 1 , , f m χ : C 1 [ 0 , 1 ] × × C m [ 0 , 1 ] R , f 1 , , f m χ 0 1 χ f 1 , , f m d t
as the first χ-product of the functions f 1 , f 2 , , f m , where f r f r ( t ) , r N 1 m , and the functional
f 1 , , f m χ : C 1 [ 0 , 1 ] × × C m [ 0 , 1 ] R , f 1 , , f m χ 0 1 0 1 χ f 1 , , f m d t 1 d t m
as the second χ-product of the functions f 1 , f 2 , , f m , where f r f r ( t r ) , r N 1 m .
By Definition 3, we see that the functional f 1 , , f m χ is the mean value [35,36] of the function χ f 1 ( t ) , , f m ( t ) , and the functional f 1 , , f m χ is the mean value of the function χ f 1 ( t 1 ) , , f m ( t m ) , and
f 1 , f 2 , , f m Π = f 1 f 2 f m ¯
with
f 1 , f 2 , , f m Π = Π f 1 ¯ , f 2 ¯ , , f m ¯ = f 1 ¯ × f 2 ¯ × × f m ¯ .
The classical Chebyshev inequalities [1,2,3,4,5,6,7,8,9,10,11,12,13] can be expressed as follows.
Let X 1 , X 2 R n . If X 1 X 2 , then we have the following discrete Chebyshev inequality:
1 n i = 1 n x i 1 x i 2 = X 1 , X 2 Π X 1 , X 2 Π = X 1 ¯ × X 2 ¯ = 1 n i = 1 n x i 1 × 1 n i = 1 n x i 2 ,
and
X 1 , X 2 Π = X 1 ¯ × X 2 ¯ X 1 = x 1 1 e X 2 = x 1 2 e .
Let f 1 , f 2 : [ 0 , 1 ] R be continuous. If f 1 f 2 , then we have the following continuous Chebyshev inequality:
0 1 f 1 ( t ) f 2 ( t ) d t = f 1 , f 2 Π f 1 , f 2 Π = f 1 ¯ × f 2 ¯ = 0 1 f 1 ( t 1 ) d t 1 × 0 1 f 2 ( t 2 ) d t 2 ,
and
f 1 , f 2 Π = f 1 ¯ × f 2 ¯ f 1 ( t ) f 1 ( 0 ) f 2 ( t ) f 2 ( 0 ) .
An important hypothesis of Chebyshev inequality (11) is X 1 X 2 , and an important hypothesis of Chebyshev inequality (13) is f 1 f 2 . Using these methods to deal with the inequality problems is called the reorder method [2].
The classical Jensen inequalities [14,15,16,17,18,19,20,21,22,23,24] can be expressed as follows.
Let the function f : I R be a strictly convex function [14,21,22,23]. Then, for any X I n , we have the following discrete Jensen inequality:
f ( X ) ¯ f X ¯ ,
and
f ( X ) ¯ = f X ¯ X = x 1 e .
Let the functions g : [ 0 , 1 ] R and f : g [ 0 , 1 ] R be continuous, where g [ 0 , 1 ] is the valued field of the function g, and let the function f : g [ 0 , 1 ] R be a strictly convex function. Then, we have the following continuous Jensen inequality:
f ( g ) ¯ f g ¯ ,
and
f ( g ) ¯ = f g ¯ g ( t ) g ( 0 ) .
This paper will generalize the Chebyshev inequalities (11) and (13), and establish the Chebyshev–Jensen-type inequalities involving the χ -products · χ and [ · ] χ .

3. Discrete Chebyshev-Jensen-Type Inequalities

Theorem 1
(Discrete Chebyshev–Jensen-type inequalities). Let the function χ : I m R be continuous and
2 χ T t r t s > 0 , T I m r , s N 1 m .
If X 1 , X 2 , , X m I 1 n × I 2 n × × I m n and
X r X s , r , s N 1 m ,
then we have the following discrete Chebyshev–Jensen-type inequalities:
X 1 , X 2 , , X m χ X 1 , X 2 , , X m χ χ X 1 ¯ , X 2 ¯ , , X m ¯ .
Both the equalities in (21) hold if and only if
X r = x 1 r e , r N 1 m .
Lemma 1.
For the equalities
x i r x j r x i s x j s = 0 , i , j N 1 n r , s N 1 m r s
and
X s = x 1 s e , k N 1 m s N 1 m k ,
then the conditions (23) and (24) are equivalent.
Proof. 
We first prove that (23) ⇒ (24).
Indeed, if
X s = x 1 s e , s N 1 m ,
then for any k N 1 m , the equalities in (24) hold.
Assume that there exists a k N 1 m such that X k x 1 k e . Then, there exists a p N 2 n such that x p k x 1 k .
Let i N 1 n . Since x p k x 1 k , we have x i k x p k x i k x 1 k . Assume that x i k x 1 k . By (23), we have
x i k x 1 k x i s x 1 s = 0 , i N 1 n s N 1 m k x i s = x 1 s , i N 1 n s N 1 m k X s = x 1 s e , k N 1 m s N 1 m k ( 24 ) .
Assume that x i k x p k . By (23), we have
x i k x p k x i s x p s = 0 , i N 1 n s N 1 m k x i s = x p s , i N 1 n s N 1 m k X s = x p s e , k N 1 m s N 1 m k X s = x 1 s e , k N 1 m s N 1 m k ( 24 ) .
Next, we prove that (24) ⇒ (23).
Indeed, since r s , we have r k s k . Assume that r k . Then, by (24), we have X r = x 1 r e . Hence, (23) holds. Assume that s k . Then, by (24), we have X s = x 1 s e . Hence, the equalities in (23) also hold.
In summary, the conditions (23) and (24) are equivalent. □
Lemma 2.
Let the function χ : I m R be continuous and
2 χ T t r t s > 0 , T I m r , s N 1 m r s .
If X 1 , X 2 , , X m I 1 n × I 2 n × × I m n and
X r X s , r , s N 1 m r s ,
then we have the following Chebyshev-type inequality:
X 1 , X 2 , , X m χ X 1 , X 2 , , X m χ .
The equality in (28) holds if and only if (24) holds.
Lemma 3.
Lemma 2 is true when m = 2 .
Proof. 
Define the auxiliary function κ as follows:
κ : I 2 R , κ ( t ) χ x j 1 , t χ x i 1 , t ,
where i , j N 1 n i j . Then, by Definition 2 and (29), we have
X 1 , X 2 χ X 1 , X 2 χ = 1 n i = 1 n χ x i 1 , x i 2 1 n 2 1 i 1 , i 2 n χ x i 1 1 , x i 2 2 = 1 n i = 1 n χ x i 1 , x i 2 1 n 2 1 i , j n χ x i 1 , x j 2 = 1 n 2 n i = 1 n χ x i 1 , x i 2 1 i , j n χ x i 1 , x j 2 = 1 n 2 1 i , j n χ x i 1 , x i 2 1 i , j n χ x i 1 , x j 2 = 1 n 2 1 i , j n χ x i 1 , x i 2 χ x i 1 , x j 2 = 1 n 2 1 j , i n χ x j 1 , x j 2 χ x j 1 , x i 2 = 1 2 n 2 1 i , j n χ x i 1 , x i 2 χ x i 1 , x j 2 + χ x j 1 , x j 2 χ x j 1 , x i 2 = 1 2 n 2 1 i , j n χ x j 1 , x j 2 χ x i 1 , x j 2 χ x j 1 , x i 2 χ x i 1 , x i 2 = 1 2 n 2 1 i j n χ x j 1 , x j 2 χ x i 1 , x j 2 χ x j 1 , x i 2 χ x i 1 , x i 2 = 1 2 n 2 1 i j n κ ( x j 2 ) κ ( x i 2 ) ,
i.e.,
X 1 , X 2 χ X 1 , X 2 χ = 1 2 n 2 1 i j n κ ( x j 2 ) κ ( x i 2 ) .
According to the Lagrange mean value theorem, there exists a
ξ i , j 2 min x i 2 , x j 2 , max x i 2 , x j 2 I 2
such that
κ ( x j 2 ) κ ( x i 2 ) = x j 2 x i 2 d κ i , j ( t ) d t t = ξ i , j 2 = x j 2 x i 2 χ 2 x j 1 , ξ i , j 2 χ 2 x i 1 , ξ i , j 2 ,
and there exists a
ξ i , j 1 min x i 1 , x j 1 , max x i 1 , x j 1 I 1
such that
χ 2 x j 1 , ξ i , j 2 χ 2 x i 1 , ξ i , j 2 = x j 1 x i 1 χ 21 ξ i , j 1 , ξ i , j 2 .
Based on Definition 1, (26) and (27), we have
x j 2 x i 2 x j 1 x i 1 0 χ 21 ξ i , j 1 , ξ i , j 2 > 0 , i , j N 1 n i j .
Combining with (30), (31), (32), and (33), we obtain
X 1 , X 2 χ X 1 , X 2 χ = 1 2 n 2 1 i j n x j 2 x i 2 x j 1 x i 1 χ 21 ξ i , j 1 , ξ i , j 2 0 ( 28 ) .
By (34), we see that the equality in (28) holds if and only if
x j 2 x i 2 x j 1 x i 1 χ 21 ξ i , j 1 , ξ i , j 2 = 0 , i , j N 1 n i j .
Since
χ 21 ξ i , j 1 , ξ i , j 2 > 0 , i , j N 1 n i j
and
i = j x j 2 x i 2 x j 1 x i 1 = 0 , j N 1 n ,
the equalities (35) can be rewritten as
x j 2 x i 2 x j 1 x i 1 = 0 , i , j N 1 n .
By Lemma 1, the equalities (36) can be rewritten as (24). In other words, the equality in (28) holds if and only if (24) hold. □
Lemma 4.
Under the hypotheses in Lemma 2, then, for any i , j N 1 n and any m N 3 , we have
χ x i 1 , , x i m 1 , x j m + χ x j 1 , , x j m 1 , x i m χ x i 1 , , x i m + χ x j 1 , , x j m .
The equalities in (37) hold if and only if
x j m x i m x j k x i k = 0 , i , j N 1 n k N 1 m k m 1 .
Proof. 
Define an auxiliary function as follows:
φ : I m R , φ ( t ) χ x j 1 , , x j m 1 , t χ x i 1 , , x i m 1 , t .
First, we use the dimension reduction method [36] to prove that
φ x j m φ x i m 0 , i , j N 1 n ,
and the equalities in (40) hold if and only if (38) hold.
Indeed, the inequalities (40) are the equalities when i = j . Now, we assume that i j .
According to the Lagrange mean value theorem, there exists a
ξ i , j m min x i m , x j m , max x i m , x j m I m
such that
φ x j m φ x i m = x j m x i m d φ i , j ( t ) d t t = ξ i , j m ,
i.e.,
φ x j m φ x i m = x j m x i m F x j 1 , x j 2 , , x j k , , x j m 1 ,
where the function F : I m 1 R is defined as
F x j 1 , x j 2 , , x j k , , x j m 1 χ m x j 1 , , x j k , , x j m 1 , ξ i , j m χ m x i 1 , , x i k , , x i m 1 , ξ i , j m ,
k N 1 m 1 i , j N 1 n i j ,
x i 1 , , x i k , , x i m 1 , ξ i , j m are considered to be fixed constants, and x j 1 , x j 2 , , x j k , , x j m 1 are considered to be the variables. By hypothesis (26), we have
F x j 1 , , x j k , , x j m 1 x j k = χ m k x j 1 , , x j k , , x j m 1 , ξ i , j m > 0 .
If x j m x i m = 0 , then the inequalities (40) are the equalities. Now we assume that x j m x i m > 0 . By the hypotheses (27) and Definition 1, we have
X m X k , k N 1 m 1 x j k x i k 0 , i , j N 1 n k N 1 m 1 .
So, based on the mathematical analysis theory, (42) and (43), for any k N 1 m 1 and any x j 1 , , x j k , , x j m 1 I m 1 , we have
F x j 1 , x j 2 , , x j k , , x j m 1 F x j 1 , x j 2 , , x i k , , x j m 1 .
By (44), we have
F x j 1 , x j 2 , , x j k , , x j m 1 F x i 1 , x j 2 , , x j k , , x j m 1 F x i 1 , x i 2 , , x j k , , x j m 1 F x i 1 , x i 2 , , x i k , , x i m 2 , x j m 1 F x i 1 , x i 2 , , x i k , , x i m 2 , x i m 1 = 0 .
Hence,
F x j 1 , x j 2 , , x j k , , x j m 1 0 .
Combining with (41), (45), and x j m x i m > 0 , we obtain (40).
Similarly, we can prove that (40) also holds when x j m x i m < 0 . Thus, (40) is proved.
According to the above proof, the equalities in (40) hold if and only if
x j m = x i m x j 1 , , x j k , , x j m 1 = x i 1 , , x i k , , x i m 1 , i , j N 1 n ( 38 ) .
This proves our assertion.
Next, we prove (37). By (40), we have
χ x i 1 , , x i m + χ x j 1 , , x j m χ x i 1 , , x i m 1 , x j m + χ x j 1 , , x j m 1 , x i m = χ x j 1 , , x j m χ x i 1 , , x i m 1 , x j m χ x j 1 , , x j m 1 , x i m χ x i 1 , , x i m = φ x j m φ x i m 0 , i , j N 1 n ( 37 ) .
According to the above proof, we see that the equalities in (37) hold if and only if (38) holds. □
Now let us prove Lemma 2.
Proof. 
We use the mathematical induction [2,36] for m to prove Lemma 2.
(A)
Let m = 2 . According to Lemma 3, Lemma 2 is true.
(B)
Suppose that Lemma 2 is true when we replace m with m 1 in Lemma 2, where m 3 . Now, we prove that Lemma 2 is also true as follows.
Based on the above hypothesis and Definition 2, for any i m N 1 n , we have
1 n m 1 1 i 1 , i 2 , , i m 1 n χ x i 1 1 , x i 2 2 , , x i m 1 m 1 , x i m m 1 n i = 1 n χ x i 1 , x i 2 , , x i m 1 , x i m m ,
where x i m m is considered a constant, and the equalities in (46) hold if and only if
X s = x 1 s e , k N 1 m 1 s N 1 m 1 k .
By Lemma 1, the equalities in (47) hold if and only if
x i r x j r x i s x j s = 0 , i , j N 1 n r , s N 1 m 1 r s .
By Definition 2, (46) and (37) in Lemma 4, we obtain
X 1 , X 2 , , X m χ = 1 n m 1 i 1 , i 2 , , i m n χ x i 1 1 , x i 2 2 , , x i m 1 m 1 , x i m m = 1 n m i m = 1 n 1 i 1 , i 2 , , i m 1 n χ x i 1 1 , x i 2 2 , , x i m 1 m 1 , x i m m = 1 n i m = 1 n 1 n m 1 1 i 1 , i 2 , , i m 1 n χ x i 1 1 , x i 2 2 , , x i m 1 m 1 , x i m m 1 n i m = 1 n 1 n i = 1 n χ x i 1 , x i 2 , , x i m 1 , x i m m = 1 n 2 i m = 1 n i = 1 n χ x i 1 , x i 2 , , x i m 1 , x i m m = 1 n 2 j = 1 n i = 1 n χ x i 1 , x i 2 , , x i m 1 , x j m = 1 n 2 1 i , j n χ x i 1 , x i 2 , , x i m 1 , x j m = 1 n 2 1 j , i n χ x j 1 , x j 2 , , x j m 1 , x i m = 1 2 n 2 1 i , j n χ x i 1 , x i 2 , , x i m 1 , x j m + χ x j 1 , x j 2 , , x j m 1 , x i m 1 2 n 2 1 i , j n χ x i 1 , , x i m 1 , x i m + χ x j 1 , , x j m 1 , x j m = 1 2 n 2 1 i , j n χ x i 1 , , x i m 1 , x i m + 1 i , j n χ x j 1 , , x j m 1 , x j m = 1 2 n 2 n i = 1 n χ x i 1 , , x i m 1 , x i m + n j = 1 n χ x j 1 , , x j m 1 , x j m = 1 n i = 1 n χ x i 1 , , x i m 1 , x i m = X 1 , X 2 , , X m χ ( 28 ) .
Hence, (28) is proved.
Based on the above proof and Lemma 4, the equality in (28) holds if and only if (38) with (48) holds. In other words, the equality in (28) holds if and only if the equalities in (23) holds. By Lemma 1, the equality in (28) holds if and only if (24) hold.
According to the principle of the mathematical induction, the proof of Lemma 2 is completed. □
Lemma 5.
Let the function χ : I m R be continuous and
2 χ T t r 2 > 0 , T I m r N 1 m .
If X 1 , X 2 , , X m I 1 n × I 2 n × × I m n , then we have the following Jensen type inequality
X 1 , X 2 , , X m χ χ X 1 ¯ , X 2 ¯ , , X m ¯ .
The equality in (50) holds if and only if (22) holds.
Proof. 
By (49), we see that the function χ T is a strictly convex function [14,21,22,23] for the variable t r , r N 1 m . So, according to Definitions 2 and the Jensen inequality (15), we have
X 1 , X 2 , , X m χ = 1 n i 1 = 1 n 1 n i 2 = 1 n 1 n i m = 1 n χ x i 1 1 , x i 2 2 , , x i r r , , x i m m 1 n i 1 = 1 n 1 n i 2 = 1 n 1 n i m 1 = 1 n χ x i 1 1 , x i 2 2 , , x i m 1 m 1 , X m ¯ 1 n i 1 = 1 n 1 n i 2 = 1 n 1 n i m 2 = 1 n χ x i 1 1 , x i 2 2 , , x i m 2 m 2 , X m 1 ¯ , X m ¯ 1 n i 1 = 1 n χ x i 1 1 , X 2 ¯ , , X m 1 ¯ , X m ¯ χ X 1 ¯ , X 2 ¯ , , X m 1 ¯ , X m ¯ ( 50 ) ,
and the equality in (50) holds if and only if (22) holds by the above proof. □
Let’s turn to the proof of Theorem 1.
Proof. 
According to the hypotheses of Theorem 1 and Lemma 2, we see that (28) holds. By the hypotheses of Theorem 1 and Lemma 5, we see that (50) holds. Combining with (28) and (50), we get the inequalities (21).
Based on the Lemmas 2 and 5, we known that both the equalities in (21) hold if and only if (22) holds.
The proof of Theorem 1 is completed. □
In Theorem 1, set I m = R + + m and χ = Π . Then, by (5) and (6), we have the following Corollary 1. Therefore, Theorem 1 is a generalization of the discrete Chebyshev inequality (11).
Corollary 1.
(Discrete Chebyshev type inequality) Let X 1 , X 2 , , X m R + + n and (27) hold. Then, we have the following discrete Chebyshev type inequality:
X 1 X 2 X m ¯ = X 1 , X 2 , , X m Π X 1 , X 2 , , X m Π = X 1 ¯ × X 2 ¯ × × X m ¯ ,
and
X 1 X 2 X m ¯ = X 1 ¯ × X 2 ¯ × × X m ¯ ( 24 ) .

4. Continuous Chebyshev–Jensen-Type Inequalities

Theorem 2.
(Continuous Chebyshev–Jensen-type inequalities) Let the function χ : I m R be continuous and (19) hold. If f 1 , f 2 , , f m C 1 [ 0 , 1 ] × C 2 [ 0 , 1 ] × × C m [ 0 , 1 ] and
f r f s , r , s N 1 m ,
then we have the following continuous Chebyshev–Jensen-type inequalities:
f 1 , f 2 , , f m χ f 1 , f 2 , , f m χ χ f 1 ¯ , f 2 ¯ , , f m ¯ ,
and
f 1 , f 2 , , f m χ = f 1 , f 2 , , f m χ = χ f 1 ¯ , f 2 ¯ , , f m ¯ f r ( t ) f r ( 0 ) , r N 1 m .
Proof. 
Based on the theory of functional analysis [31,32,33], for any continuous functions φ : [ 0 , 1 ] R and ϕ : [ 0 , 1 ] m R , we have
0 1 φ ( t ) d t = lim n 1 n i = 1 n φ i 1 n 1
and
0 1 0 1 ϕ ( t 1 , , t m ) d t 1 d t m = lim n 1 n m 1 i 1 , , i m n ϕ i 1 1 n 1 , , i m 1 n 1 .
Let X 1 , X 2 , , X m I 1 n × I 2 n × × I m n , and let
x i r = f r i 1 n 1 , i N 1 n r N 1 m .
Then
x i j r = f r i j 1 n 1 , i j N 1 n r N 1 m j N 1 m .
By Definitions 2 and 3, (55), (56), (57), and (58), we have
lim n X 1 , X 2 , , X m χ = f 1 , f 2 , , f m χ ,
lim n X 1 , X 2 , , X m χ = f 1 , f 2 , , f m χ
and
lim n χ X 1 ¯ , X 2 ¯ , , X m ¯ = χ f 1 ¯ , f 2 ¯ , , f m ¯ .
By (52), (57), and Definition 1, (27) holds. By (27) and Theorem 1, we see that (21) holds. Combining with (59), (60), (61), and (21), we obtain
f 1 , f 2 , , f m χ = lim n X 1 , X 2 , , X m χ lim n X 1 , X 2 , , X m χ = f 1 , f 2 , , f m χ lim n χ X 1 ¯ , X 2 ¯ , , X m ¯ = χ f 1 ¯ , f 2 ¯ , , f m ¯ ( 53 ) .
Base on the above proof and Theorem 1, we see that (54) holds.
This completes the proof of Theorem 2. □
In Theorem 2, set I m = R + + m and χ = Π . Then, by (9) and (10), we have the following Corollary 2. Therefore, Theorem 2 is a generalization of the continuous Chebyshev inequality (13).
Corollary 2.
(Continuous Chebyshev type inequality) Let the functions f r : [ 0 , 1 ] R + + be continuous and (52) hold, r N 1 m . Then, we have the following continuous Chebyshev-type inequality:
f 1 f 2 f m ¯ f 1 , f 2 , , f m Π f 1 , f 2 , , f m Π f 1 ¯ × f 2 ¯ × × f m ¯ ,
and
f 1 f 2 f m ¯ = f 1 ¯ × f 2 ¯ × × f m ¯ f s ( t ) f s ( 0 ) , k N 1 m s N 1 m k .

5. Applications in Probability Theory

Let μ μ 1 , μ 2 , , μ m I m be an m-dimensional random variable, where
I r ( a r , b r ) , a r < b r , r N 1 m ,
and let its probability density function [24,25,26,27,28,29,30] p : I m R + + be continuous with p p μ . Then, the probability distribution function [24] of the random variable μ is
χ : I m R , χ ( T ) = a 1 t 1 a 2 t 2 a m t m p d μ 1 d μ 2 d μ m ,
which is also continuous, where χ b 1 , b 2 , , b m = 1 , and P ( R ) χ ( T ) [ 0 , 1 ] is the probability [27,28,29,30] of the random event
R : a 1 < μ 1 t 1 a 2 < μ 2 t 2 a r < μ r t r a m < μ m t m .
Let X 1 , X 2 , , X m I 1 n × I 2 n × × I m n . Then, P R i and P ( R i 1 , , i m ) are the probabilities of the random events
R i : a 1 < μ 1 x i 1 a 2 < μ 2 x i 2 a r < μ r x i r a m < μ m x i m
and
R i 1 , , i m : a 1 < μ 1 x i 1 1 a 2 < μ 2 x i 2 2 a r < μ r x i r r a m < μ m x i m m ,
respectively, where i N 1 n and i 1 , , i m N 1 n .
Let f 1 , , f m C 1 [ 0 , 1 ] × × C m [ 0 , 1 ] . Then P R P R ( t ) and P R * P R * ( T ) are the probabilities of the random events
R ( t ) : a 1 < μ 1 f 1 ( t ) a r < μ r f r ( t ) a m < μ m f m ( t )
and
R * ( T ) : a 1 < μ 1 f 1 ( t 1 ) a r < μ r f r ( t r ) a m < μ m f m ( t m ) ,
respectively.
We first demonstrate the applications of Theorem 1 in probability theory.
Theorem 3
(Discrete probability inequalities). Let the probability density function p : I m R + + be continuous, and let
p r ( μ ) p ( μ ) μ r > 0 , μ I m r N 1 m .
If X 1 , X 2 , , X m I 1 n × I 2 n × × I m n and (20) holds, then we have the following discrete probability inequalities:
1 n i = 1 n P R i 1 n m 1 i 1 , , i m n P ( R i 1 , , i m ) a 1 X 1 ¯ a m X m ¯ p d μ 1 d μ m .
Proof. 
Let T I m and r , s N 1 m . If r < s , then, based on the hypotheses of Theorem 3 and the functional analysis theory, we have
2 χ T t r t s = a 1 t 1 a k t k a m t m p μ 1 , , t r , , t s , , μ m d μ 1 d μ k d μ m > 0 ( 19 ) ,
where k N 1 m r , s . Similarly, we can prove that (19) also holds when r > s . Assume that r = s . Then, based on the functional analysis theory and (70), we have
2 χ T t r t s = a 1 t 1 a k t k a m t m p r μ 1 , , t r , , μ m d μ 1 d μ k d μ m > 0 ( 19 ) ,
where k N 1 m r . Thus, the inequalities in (19) hold.
By Definition 2 and (64), we have
X 1 , X 2 , , X m χ = 1 n i = 1 n P R i ,
which is the mean value [35,36] of the probabilities P ( R i ) , i N 1 n , and
X 1 , X 2 , , X m χ = 1 n m 1 i 1 , , i m n P ( R i 1 , , i m ) ,
which is the mean value of the probabilities P ( R i 1 , , i m ) , i 1 , , i m N 1 n .
Based on the hypotheses of Theorem 3, (19), and Theorem 1, the inequalities (21) hold. By (72) and (73), we see that the inequalities (21) can be rewritten as (71). The proof of Theorem 3 is completed. □
Next, we demonstrate the applications of Theorem 2 in probability theory.
Theorem 4.
(Continuous probability inequalities) Let the probability density function p : I m R + + be continuous and (70) hold, and let f 1 , , f m C 1 [ 0 , 1 ] × × C m [ 0 , 1 ] with (52) hold. If f 1 , , f m are convex functions, then we have the following continuous probability inequalities:
0 1 P R d t 0 1 0 1 P R * d t 1 d t m a 1 f 1 1 2 a m f m 1 2 p d μ 1 d μ m .
Proof. 
By Definition 3 and (64), we have
f 1 , f 2 , , f m χ = 0 1 P R d t ,
which is the mean value of the probability P R ( t ) , and
f 1 , f 2 , , f m χ = 0 1 0 1 P R * d t 1 d t m ,
which is the mean value of the probability P R * ( T ) .
Since f 1 , , f m are the convex functions [14,21,22,23], by Hadamard’s inequality [36], we have
f r ¯ = 1 1 0 0 1 f r ( t ) d t f r 0 + 1 2 = f r 1 2 , r N 1 m .
By the proof of Theorem 3, we see that (19) holds. Based on the hypotheses of Theorem 4, (19), and Theorem 2, the inequalities in (53) hold. By (53), (75), (76), and (77), we obtain
0 1 P R d t = f 1 , f 2 , , f m χ f 1 , f 2 , , f m χ = 0 1 0 1 P R * d t 1 d t m χ f 1 ¯ , f 2 ¯ , , f m ¯ = a 1 f 1 ¯ a m f m ¯ p d t 1 d t m a 1 f 1 1 2 a m f m 1 2 p d t 1 d t m ( 74 ) .
Hence, the inequalities in (74) are proved. This completes the proof of Theorem 4. □

6. Conclusions

In this paper, we established Chebyshev–Jensen-type inequalities involving the χ -products · χ and [ · ] χ , and we proved that our main results are the generalizations of the classical Chebyshev inequalities, as well as displaying the applications of our main results in probability theory, and the discrete with continuous probability inequalities were obtained. We also demonstrated the applications of mathematical induction, the reorder method, and the dimension reduction method in establishing inequalities. The proofs of our main results are novel, concise, and interesting.
The main contributions of this article are that we extended the special function Π in the Chebyshev inequalities (11) and (13) to the general function χ , and we extended the m = 2 in the Chebyshev inequalities (11) and (13) to the m 2 .
Let
2 χ T t r t s 0 , T I m r , s N 1 m .
Then, the function χ T is a constant. Hence, the inequalities (21) are the equalities.
If (20) does not hold, then, in general, (21) also does not hold. For example, if m = 2 , χ = Π and X 1 X 2 , then the inequalities in (21) are reversed.
There are a large number of functions χ : I m R satisfying the conditions in (19). For example, we define a function as follows [2]:
χ : R + + m R , χ ( T ) per t j α i m × m = per t 1 α 1 t 2 α 1 t m α 1 t 1 α 2 t 2 α 2 t m α 2 t 1 α m t 2 α m t m α m m × m ,
where α 1 , α 2 , , α m ( 1 , ) m . Then χ : R + + m R satisfies the conditions in (19).
There are a large number of probability density functions p : I m R satisfying the conditions in (70). For example, we define a probability density function as follows:
p : ( 0 , 1 ) m R + + , p ( μ ) per μ j α i m × m 0 1 0 1 0 1 per μ j α i m × m d μ 1 d μ 2 d μ m ,
where α 1 , α 2 , , α m R + + m . Then p : ( 0 , 1 ) m R + + satisfies the conditions in (70).
It is worth pointing out that to find new Chebyshev-type inequalities is an important research topic and how to improve or generalize the Chebyshev-type inequalities (21) is also an important research topic. These research topics are of theoretical significance and application value in probability theory.

Author Contributions

Conceptualization, R.L. and J.W.; methodology, R.L.; software, R.L.; validation, J.W. and L.Z.; formal analysis, R.L.; investigation, R.L.; resources, R.L.; data curation, R.L.; writing—original draft preparation, R.L.; writing—review and editing, J.W. and L.Z.; project administration, R.L.; funding acquisition, J.W. and L.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation of China under Grant No. 11161024 and the Sichuan Science and Technology Program No. 2023NSFSC0078.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Acknowledgments

The authors are deeply indebted to anonymous referees for many useful comments and keen observations that led to the present improved version of the paper as it stands, and also are grateful to their friends WanLan Wang [2,36] and TianYong Han [3] for numerous discussions and helpful suggestions in preparation of this paper.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Agahi, H.; Mesiar, R.; Ouyang, Y. Chebyshev type inequalities for pseudo-integrals. Nonlinear Anal. Theory Methods Appl. 2010, 72, 2737–2743. [Google Scholar] [CrossRef]
  2. Wen, J.J.; Wang, W.L. Chebyshev type inequalities involving permanents and their applications. Linear Algebra Appl. 2007, 422, 295–303. [Google Scholar] [CrossRef]
  3. Wen, J.J.; Pećarixcx, J.E.; Han, T.Y. Weak monotonicity and Chebyshev type inequality. Math. Inequal. Appl. 2015, 18, 217–231. [Google Scholar] [CrossRef]
  4. Acu, A.M.; Rusu, M.D. New results concerning Chebyshev-Grüss-type inequalities via discrete oscillations. Appl. Math. Comput. 2014, 243, 585–593. [Google Scholar] [CrossRef]
  5. Ouyang, Y.; Mesiar, R.; Li, J. On the comonotonic-★-property for Sugeno integral. Appl. Math. Comput. 2009, 211, 450–458. [Google Scholar] [CrossRef]
  6. Meaux, L.M.; Seaman, J.W.J.; Boullion, T.L. Calculation of multivariate Chebyshev-type inequalities. Comput. Math. Appl. 1990, 20, 55–60. [Google Scholar] [CrossRef]
  7. Daraby, B. Investigation of a Stolarsky type inequality for integrals in pseudo-analysis. Fract. Calc. Appl. Anal. 2010, 13, 467–473. [Google Scholar]
  8. Yewale, B.R.; Pachpatte, D.B. Some new Chebyshev type inequalities via extended generalized fractional integral operator. J. Fract. Calc. Appl. 2021, 12, 11–19. [Google Scholar]
  9. Wagene, A. Chebyshevs algebraic inequality and comparative statics under uncertainty. Math. Soc. Sci. 2006, 52, 217–221. [Google Scholar] [CrossRef]
  10. Anastassiou, G. Chebyshev-Grüss type inequalities on RN over spherical shells and balls. Appl. Math. Lett. 2008, 21, 119–127. [Google Scholar] [CrossRef]
  11. Yewale, B.R.; Pachpatte, D.B.; Aljaaidi, T.A. Chebyshev-type inequalities involving (k,ψ)-proportional fractional integral operators. J. Funct. Spaces 2022, 2022, 3966177. [Google Scholar] [CrossRef]
  12. Borovkov, A.A.; Logachov, A.V.; Mogulskii, A.A. Chebyshev-type inequalities and large deviation principles. Theory Probab. Appl. 2022, 66, 718–733. [Google Scholar] [CrossRef]
  13. Moslehian, M.S.; Bakherad, M. Chebyshev type inequalities for Hilbert space operators. J. Math. Anal. Appl. 2014, 420, 737–749. [Google Scholar] [CrossRef]
  14. Hwang, D.Y.; Dragomir, S.S. Comparing two integral means for absolutely continuous functions whose absolute value of the derivative are convex and applications. Appl. Math. Comput. 2014, 230, 259–266. [Google Scholar] [CrossRef]
  15. Zhao, J.; Butt, S.I.; Nasir, J.; Wang, Z.; Tlili, I. Hermite-Jensen-Mercer type inequalities for Caputo fractional derivatives. J. Funct. Spaces 2020, 2020, 7061549. [Google Scholar] [CrossRef]
  16. Abramovich, S.; Persson, L.E. Rearrangements and Jensen type inequalities related to convexity, superquadracity, strong convexity and 1-quasiconvexity. J. Math. Inequal. 2020, 14, 641–659. [Google Scholar] [CrossRef]
  17. Moradi, H.R.; Furuichi, S. Improvement and generalization of some Jensen-Mercer-type inequalities. J. Math. Inequal. 2020, 14, 377–383. [Google Scholar] [CrossRef]
  18. Butt, S.I.; Agarwal, P.; Yousaf, S.; Guirao, J.L.G. Generalized fractal Jensen and Jensen-Mercer inequalities for harmonic convex function with applications. J. Inequal. Appl. 2022, 2022, 1. [Google Scholar] [CrossRef]
  19. Ho, P.T.; Pyo, J. Evolution of the first eigenvalue along the inverse mean curvature flow in space forms. J. Math. Anal. Appl. 2024, 532, 127980. [Google Scholar] [CrossRef]
  20. Bošnjak, M.; Krnić, M.; Pexcxarixcx, J. Jensen-type inequalities, Montgomery identity and higher-order convexity. Mediterr. J. Math. 2022, 19, 230. [Google Scholar] [CrossRef]
  21. Minculete, N. On several inequalities related to convex functions. J. Math. Inequal. 2023, 17, 1075–1086. [Google Scholar] [CrossRef]
  22. Knoerr, J. The support of dually epi-translation invariant valuations on convex functions. J. Funct. Anal. 2021, 281, 109059. [Google Scholar] [CrossRef]
  23. Colesanti, A.; Ludwig, M.; Mussnig, F. A homogeneous decomposition theorem for valuations on convex functions. J. Funct. Anal. 2020, 279, 108573. [Google Scholar] [CrossRef]
  24. Wen, J.J.; Huang, Y.; Cheng, S.S. Theory of ϕ-Jensen variance and its applications in higher education. J. Inequal. Appl. 2015, 2015, 270. [Google Scholar] [CrossRef]
  25. Lu, M.; Wang, Y.; Jiang, D. Stationary distribution and probability density function analysis of a stochastic HIV model with cell-to-cell infection. Appl. Math. Comput. 2021, 410, 126483. [Google Scholar] [CrossRef]
  26. Gafel, H.S.; Rashid, S.; Elagan, S.K. Novel codynamics of the HIV-1/HTLV-I model involving humoral immune response and cellular outbreak: A new approach to probability density functions and fractional operators. AIMS Math. 2023, 8, 28246–28279. [Google Scholar] [CrossRef]
  27. Jung, Y.M.; Whang, J.J.; Yun, S. Sparse probabilistic K-means. Appl. Math. Comput. 2020, 382, 125328. [Google Scholar] [CrossRef]
  28. Ejsmont, W.; Lehner, F. Sums of commutators in free probability. J. Funct. Anal. 2021, 280, 108791. [Google Scholar] [CrossRef]
  29. Gvalani, R.S.; Schlichting, A. Barriers of the McKean-Vlasov energy via a mountain pass theorem in the space of probability measures. J. Funct. Anal. 2020, 279, 108720. [Google Scholar] [CrossRef]
  30. Jekel, D. Operator-valued chordal Loewner chains and non-commutative probability. J. Funct. Anal. 2020, 278, 108452. [Google Scholar] [CrossRef]
  31. Lu, G.; Sun, W.; Jin, Y.; Liu, Q. Ulam stability of Jensen functional inequality on a class of noncommutative groups. J. Funct. Spaces 2023, 2023, 6674969. [Google Scholar] [CrossRef]
  32. Jankov, M.D.; Pogány, T.K. Functional bounds for Exton’s double hypergeometric X function. J. Math. Inequal. 2023, 17, 259–267. [Google Scholar]
  33. Park, C.; Najati, A.; Moghimi, M.B.; Noori, B. Approximation of two general functional equations in 2-Banach spaces. J. Math. Inequal. 2023, 17, 153–162. [Google Scholar] [CrossRef]
  34. Dell’Accio, F.; Di Tommaso, F.; Guessab, A.; Nudo, F. A unified enrichment approach of the standard three-node triangular element. Appl. Numer. Math. 2023, 187, 1–23. [Google Scholar] [CrossRef]
  35. Liu, Y.; Iqbal, W.; Rehman, A.U.; Farid, G.; Nonlaopon, K. Giaccardi inequality for modified h-convex functions and mean value theorems. J. Funct. Spaces 2022, 2022, 4364886. [Google Scholar] [CrossRef]
  36. Wang, W.L. Approaches to Prove Inequalities; Harbin Institute of Technology: Harbin, China, 2011. (In Chinese) [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, R.; Wen, J.; Zhao, L. Chebyshev–Jensen-Type Inequalities Involving χ-Products and Their Applications in Probability Theory. Mathematics 2024, 12, 1495. https://doi.org/10.3390/math12101495

AMA Style

Liu R, Wen J, Zhao L. Chebyshev–Jensen-Type Inequalities Involving χ-Products and Their Applications in Probability Theory. Mathematics. 2024; 12(10):1495. https://doi.org/10.3390/math12101495

Chicago/Turabian Style

Liu, Ru, Jiajin Wen, and Lingzhi Zhao. 2024. "Chebyshev–Jensen-Type Inequalities Involving χ-Products and Their Applications in Probability Theory" Mathematics 12, no. 10: 1495. https://doi.org/10.3390/math12101495

APA Style

Liu, R., Wen, J., & Zhao, L. (2024). Chebyshev–Jensen-Type Inequalities Involving χ-Products and Their Applications in Probability Theory. Mathematics, 12(10), 1495. https://doi.org/10.3390/math12101495

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