Next Article in Journal
A Novel Chaos-Based Cryptography Algorithm and Its Performance Analysis
Next Article in Special Issue
Some Further Results on the Fractional Cumulative Entropy
Previous Article in Journal
Stability of a Bi-Jensen Functional Equation on Restricted Unbounded Domains and Some Asymptotic Behaviors
Previous Article in Special Issue
Asymptotic Regularity and Existence of Time-Dependent Attractors for Second-Order Undamped Evolution Equations with Memory
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Monotonicity Results for Nabla Riemann–Liouville Fractional Differences

by
Pshtiwan Othman Mohammed
1,*,
Hari Mohan Srivastava
2,3,4,5,
Dumitru Baleanu
6,7,8,*,
Rashid Jan
9 and
Khadijah M. Abualnaja
10
1
Department of Mathematics, College of Education, University of Sulaimani, Sulaimani 46001, Iraq
2
Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 3R4, Canada
3
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
4
Department of Mathematics and Informatics, Azerbaijan University, 71 Jeyhun Hajibeyli Street, AZ1007 Baku, Azerbaijan
5
Section of Mathematics, International Telematic University Uninettuno, I-00186 Rome, Italy
6
Department of Mathematics, Cankaya University, Ankara 06530, Turkey
7
Institute of Space Sciences, R76900 Magurele-Bucharest, Romania
8
Department of Natural Sciences, School of Arts and Sciences, Lebanese American University, Beirut 11022801, Lebanon
9
Department of Mathematics, University of Swabi, Swabi 23430, KPK, Pakistan
10
Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Submission received: 8 June 2022 / Revised: 26 June 2022 / Accepted: 9 July 2022 / Published: 12 July 2022

Abstract

:
Positivity analysis is used with some basic conditions to analyse monotonicity across all discrete fractional disciplines. This article addresses the monotonicity of the discrete nabla fractional differences of the Riemann–Liouville type by considering the positivity of b 0 R L θ g ( z ) combined with a condition on g ( b 0 + 2 ) , g ( b 0 + 3 ) and g ( b 0 + 4 ) , successively. The article ends with a relationship between the discrete nabla fractional and integer differences of the Riemann–Liouville type, which serves to show the monotonicity of the discrete fractional difference b 0 R L θ g ( z ) .

1. Introduction

In recent years, discrete fractional operators (sums and differences) have turned out to be modern tools in the modelling of many phenomena of mathematical analysis [1,2,3], electric circuits [4,5], medical sciences [6], material sciences and mechanics (see, for details, [7,8,9]). From among the several meanings and avenues of such studies, we choose to mention the discrete delta/nabla fractional operators of the Riemann–Liouville, Liouville–Caputo or other types (see, for details, [10,11]), from singular and non-singular kernel operators to the definitions based upon the time-scale theory. Some of these definitions are equivalent, even though they seem to be completely different, and they have been established by different authors (see, for example, [12,13,14,15]).
The positivity and monotonicity analyses have proven to be useful tools in discrete fractional calculus theory:
For the set { b 0 , b 0 + 1 , b 0 + 2 , } denoted by J b 0 with b 0 R , let g be defined on J b 0 . Then, the function g will be monotonically increasing if g ( z ) is positive; that is:
g ( z ) : = g ( z ) g ( z 1 ) 0 ,
for each z J b 0 + 1 .
In the context of discrete fractional calculus, the development of new positivity and monotonicity analyses is a source of interesting mathematical problems (see, for example, [16,17,18,19,20,21]). In recent years, several papers have been published devoted exclusively to the study of the problem of the monotonicity of discrete nabla/delta fractional operators with a certain kernel (and often under additional assumptions about the function). The interested reader may be referred, for example, to the developments reported in [22,23,24,25,26,27,28].
Our results in this paper concern the analysis of monotonicity for the discrete nabla fractional differences of Riemann–Liouville-type under the conditions that b 0 R L θ g ( z ) 0 and the ones coming from one of the following:
  • g ( b 0 + 2 ) θ 1 g ( b 0 + 1 ) for J 3 in Theorem 1.
  • g ( b 0 + 3 ) θ 2 g ( b 0 + 2 ) + θ ( θ 2 ) ( 1 ) ( 2 ) g ( b 0 + 1 ) for J 4 in Theorem 2.
  • g ( b 0 + 4 ) θ 2 g ( b 0 + 3 ) + θ ( θ 3 ) ( 2 ) ( 3 ) g ( b 0 + 2 ) + θ ( θ 2 ) ( θ 3 ) ( 1 ) ( 2 ) ( 3 ) g ( b 0 + 1 ) for J 5 in Theorem 3.
Furthermore, we will show that the discrete nabla fractional Riemann–Liouville difference b 0 R L θ g ( z ) 0 for each z J b 0 + 1 by considering the relationship between the discrete nabla fractional and integer differences. It is worth mentioning that our results are motivated by the results in [29], wherein somewhat analogous results were investigated for the discrete delta Riemann–Liouville fractional differences.
The paper is divided into another three sections as follows. Section 2 considers preliminaries on discrete fractional operators of the Riemann–Liouville type and a main lemma, which we need in the next section. Our main results are presented in Section 3, which is separated into two subsections: In Section 3.1, we consider our three main theorems, which establish the monotonicity analysis of the discrete fractional operators. The relationship between the discrete nabla fractional and integer differences will be examined in Section 3.2, which will show how it will be used to establish the positivity of the discrete nabla fractional Riemann–Liouville operators. At the end of each theorem, a corollary is made. Section 4 provides a specific example, which confirms the applicability of our results. The article ends with concluding remarks and brief considerations of several discrete fractional modelling extensions, which can be applicable in the future to obtain monotonicity analysis for other types of discrete fractional operators in Section 5.

2. Preliminaries and a Lemma

Here, we provide some background material regarding the discrete nabla fractional operators toward the proof of our main achievements. As such, the main lemma is given.
Definition 1
(see [13,14,30]). Let us denote the set { b 0 , b 0 + 1 , b 0 + 2 , } by J b 0 and with the starting point a R . Assume that g is defined on J b 0 . Then, theRiemann–Liouville fractional sum of order θ ( > 0 ) is expressed as follows:
b 0 θ g ( z ) = r = b 0 + 1 z z r + 1 [ θ 1 ] Γ ( θ ) g ( r ) for z in J b 0 + 1 ,
where z ( θ ) is defined by
z [ θ ] = Γ z + θ Γ z for z and θ in R ,
and it yields zero at a pole. It is also worth recalling that
z [ θ ] = θ z [ θ 1 ] .
Definition 2
(see [30]). Let g be defined on J b 0 . Then theRiemann–Liouville fractional difference of order θ ( 1 < θ < ) is defined by
b 0 R L θ g ( z ) = b 0 ( θ ) g ( z ) = r = b 0 + 1 z z r + 1 [ θ 1 ] Γ ( θ ) g ( r ) for z in J b 0 + 1 , in J 1 .
Recently, Liu et al. [31] established an equivalent definition to Definition 2, as follows.
Definition 3
(see [31]). Let 1 < θ < . Then theRiemann–Liouville fractional difference of order θ can be expressed as follows:
b 0 R L θ g ( z ) = r = b 0 + 1 z z r + 1 [ θ 1 ] Γ ( θ ) g ( r ) for z in J b 0 + , in J 1 .
In order to begin our work later, we state and prove the following main lemma.
Lemma 1.
For g defined on J b 0 , theRiemann–Liouville fractional difference of order θ ( 1 < θ < 2 ) can be expressed as follows:
b 0 R L θ g ( z ) = g ( z ) + z b 0 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 )                + r = b 0 + 2 z 1 z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) for z in J b 0 + 3 .
In addition, it is essential to observe that
z r + 1 [ θ ] Γ ( 1 θ ) < 0 ,
for each r = b 0 + 2 , b 0 + 3 , , z 1 and z J b 0 + 3 .
Proof. 
According to Definition 3, we note for 1 < θ < 2 and z J b 0 + 2 that
b 0 R L θ g ( z ) = r = b 0 + 1 z z r + 1 [ θ 1 ] Γ ( θ ) g ( r ) = ( 3 ) b y r = b 0 + 1 z z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) = r = b 0 + 1 z z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) r = b 0 + 1 z 1 z r [ θ ] Γ ( 1 θ ) g ( r ) = 1 Γ ( 1 θ ) [ z b 0 [ θ ] g ( b 0 + 1 ) + r = b 0 + 2 z z r + 1 [ θ ] g ( r )
r = b 0 + 2 z z r + 1 [ θ ] g ( r 1 ) ] = g ( z ) + z b 0 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) + r = b 0 + 2 z 1 z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) ,
which completes the proof of (4). For r = b 0 + 2 , b 0 + 3 , , z 1 with z J b 0 + 3 , we have
z r + 1 [ θ ] Γ ( 1 θ ) = Γ z r θ + 1 Γ ( 1 θ ) Γ ( z r + 1 ) = ( z r θ ) ( z r θ 1 ) ( 2 θ ) ( 1 θ ) ( z r ) ! ,
which is clearly positive for θ ( 1 , 2 ) . Therefore, the second part of the lemma is proved. Hence, the proof of the lemma is complete. □

3. Main Results

This section is divided into two main subsections.

3.1. Monotonicity Results

This section is devoted to the study of the monotonicity analysis of the discrete fractional Riemann–Liouville differences.
Theorem 1.
Suppose that g : J b 0 R satisfies each of the following conditions:
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 2 ) θ 1 g ( b 0 + 1 ) for J 3 ,
for θ ( 1 , 2 ) . Then g ( z ) 0 for z J b 0 + 3 .
Proof. 
According to the assumption that b 0 R L θ g ( z ) 0 and the identity (4), one can see, for z J b 0 + 3 , that
g ( z ) z b 0 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) r = b 0 + 2 z 1 z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) .
If we set z : = b 0 + for J 3 , it follows that
g ( b 0 + ) [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) r = b 0 + 2 b 0 + 1 b 0 + r + 1 [ θ ] Γ ( 1 θ ) g ( r ) .
We proceed with the proof using the principle of mathematical induction on for the inequality (6). Indeed, for = 3 , we have
g ( b 0 + 3 ) 3 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) = 1 Γ ( 1 θ ) Γ ( 3 θ ) Γ ( 3 ) g ( b 0 + 1 ) + Γ ( 2 θ ) Γ ( 2 ) g ( b 0 + 2 ) = Γ ( 2 θ ) Γ ( 1 θ ) 2 θ 2 g ( b 0 + 1 ) + g ( b 0 + 2 ) g ( b 0 + 1 ) = ( θ 1 ) > 0 θ 2 g ( b 0 + 1 ) + g ( b 0 + 2 ) 0 per condition ( ii ) 0 .
Suppose that g ( b 0 + j ) 0 for j = 3 , 4 , , 1 and J 4 . Then, we shall show that g ( b 0 + ) 0 . By making use of (6), we obtain
g ( b 0 + ) [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) r = b 0 + 2 b 0 + 1 b 0 + r + 1 [ θ ] Γ ( 1 θ ) g ( r ) = [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) r = b 0 + 3 b 0 + 1 b 0 + r + 1 [ θ ] Γ ( 1 θ ) < 0 per ( 5 ) g ( r ) 0 per our claim [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) = 1 Γ ( 1 θ ) Γ ( θ ) Γ ( ) g ( b 0 + 1 ) + Γ ( θ 1 ) Γ ( 1 ) g ( b 0 + 2 ) = Γ ( θ 1 ) Γ ( 1 θ ) Γ ( 1 ) θ 1 g ( b 0 + 1 ) + g ( b 0 + 2 ) 0 per condition ( ii ) 0 ,
where we have used that
Γ ( θ 1 ) Γ ( 1 θ ) Γ ( 1 ) = ( θ 2 ) ( θ 3 ) ( 2 θ ) ( 1 θ ) ( 2 ) ! > 0 ,
for θ ( 1 , 2 ) and 3 . Thus, the proof is complete. □
Corollary 1.
If the function g : J b 0 R satisfies
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 2 ) θ 1 g ( b 0 + 1 ) for J 3 ,
for θ ( 1 , 2 ) , then, g ( z ) 0 for z J b 0 + 2 .
Proof. 
Define h : = g . Thus, the proof follows immediately from Theorem 1 applying for the function g. □
Theorem 2.
Assume that g : J b 0 R satisfies each of the following conditions:
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 3 ) θ 2 g ( b 0 + 2 ) + θ ( θ 2 ) ( 1 ) ( 2 ) g ( b 0 + 1 ) for J 4 ,
for θ ( 1 , 2 ) . Then g ( z ) 0 for z J b 0 + 4 .
Proof. 
The proof will make use of the principle of mathematical induction on for the inequality (6). In fact, for = 4 , it follows that
g ( b 0 + 4 ) 4 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 3 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) = 1 Γ ( 1 θ ) Γ ( 4 θ ) Γ ( 4 ) g ( b 0 + 1 ) + Γ ( 3 θ ) Γ ( 3 ) g ( b 0 + 2 ) + Γ ( 2 θ ) Γ ( 2 ) g ( b 0 + 3 ) = Γ ( 2 θ ) Γ ( 1 θ ) [ ( 2 θ ) ( 3 θ ) 6 g ( b 0 + 1 ) + 2 θ 2 g ( b 0 + 2 ) g ( b 0 + 1 ) + g ( b 0 + 3 ) g ( b 0 + 2 ) ] = ( θ 1 ) > 0 θ ( 2 θ ) 6 g ( b 0 + 1 ) θ 2 g ( b 0 + 2 ) + g ( b 0 + 3 ) 0 per condition ( ii ) 0 .
If we let g ( b 0 + j ) 0 for j = 4 , 5 , , 1 and J 5 , then, we try to show that g ( b 0 + ) 0 , with the help of (6), we can deduce
g ( b 0 + ) [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) r = b 0 + 4 b 0 + 1 b 0 + r + 1 [ θ ] Γ ( 1 θ ) 0 per ( 5 ) and our claim [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) = 1 Γ ( 1 θ ) [ Γ ( θ ) Γ ( ) g ( b 0 + 1 ) + Γ ( θ 1 ) Γ ( 1 ) g ( b 0 + 2 ) + Γ ( θ 2 ) Γ ( 2 ) g ( b 0 + 3 ) ] = Γ ( θ 2 ) Γ ( 1 θ ) Γ ( 2 ) > 0 per ( 7 ) θ ( θ 2 ) ( 1 ) ( 2 ) g ( b 0 + 1 ) θ 2 g ( b 0 + 2 ) + g ( b 0 + 3 ) 0 per condition ( ii ) 0 ,
which completes the proof. □
Corollary 2.
If the function g : J b 0 R satisfies
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 3 ) θ 2 g ( b 0 + 2 ) + θ ( θ 2 ) ( 1 ) ( 2 ) g ( b 0 + 1 ) for J 4 ,
for θ ( 1 , 2 ) , then, g ( z ) 0 for z J b 0 + 5 .
Proof. 
The proof follows immediately from Theorem 2 applied to the function h : = g .
Theorem 3.
Assume that g : J b 0 R satisfies each of the following conditions:
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 4 ) θ 2 g ( b 0 + 3 ) + θ ( θ 3 ) ( 2 ) ( 3 ) g ( b 0 + 2 ) + θ ( θ 2 ) ( θ 3 ) ( 1 ) ( 2 ) ( 3 ) g ( b 0 + 1 ) for J 5 ,
for θ ( 1 , 2 ) . Then g ( z ) 0 for z J b 0 + 5 .
Proof. 
Again, we will prove this theorem using the principle of mathematical induction induction on . Thus, (6) at = 5 leads to
g ( b 0 + 5 ) 5 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 4 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 3 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 4 ) = Γ ( 2 θ ) Γ ( 1 θ ) [ ( 2 θ ) ( 3 θ ) ( 4 θ ) 24 g ( b 0 + 1 ) + ( 2 θ ) ( 3 θ ) 6 g ( b 0 + 2 ) + 2 θ 2 g ( b 0 + 3 ) + g ( b 0 + 4 ) ] = ( θ 1 ) > 0 θ ( 2 θ ) ( 3 θ ) 24 g ( b 0 + 1 ) θ ( 2 θ ) 6 g ( b 0 + 2 ) θ 2 g ( b 0 + 3 ) + g ( b 0 + 4 ) 0 per condition ( ii ) 0 .
Now, we assume that g ( b 0 + j ) 0 for j = 5 , 6 , , 1 and J 6 . Then, we have to show that g ( b 0 + ) 0 . In view of (6), we can deduce
g ( b 0 + ) [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) 3 [ θ ] Γ ( 1 θ ) g ( b 0 + 4 ) r = b 0 + 5 b 0 + 1 b 0 + r + 1 [ θ ] Γ ( 1 θ ) 0 per ( 5 ) and our claim
[ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) 1 [ θ ] Γ ( 1 θ ) g ( b 0 + 2 ) 2 [ θ ] Γ ( 1 θ ) g ( b 0 + 3 ) 3 [ θ ] Γ ( 1 θ ) g ( b 0 + 4 ) = 1 Γ ( 1 θ ) [ Γ ( θ ) Γ ( ) g ( b 0 + 1 ) + Γ ( θ 1 ) Γ ( 1 ) g ( b 0 + 2 ) + Γ ( θ 2 ) Γ ( 2 ) g ( b 0 + 3 ) + Γ ( θ 3 ) Γ ( 3 ) g ( b 0 + 4 ) ] = Γ ( θ 3 ) Γ ( 1 θ ) Γ ( 3 ) > 0 per ( 7 ) θ ( θ 2 ) ( θ 3 ) ( 1 ) ( 2 ) ( 3 ) g ( b 0 + 1 ) θ ( θ 3 ) ( 2 ) ( 3 ) g ( b 0 + 2 ) θ 2 g ( b 0 + 3 ) + g ( b 0 + 4 ) 0 per condition ( ii ) 0 ,
which completes the proof. □
Corollary 3.
If the function g : J b 0 R satisfies
( i ) b 0 R L θ g ( z ) 0 for each z J b 0 + 3 , ( ii ) g ( b 0 + 4 ) θ 2 g ( b 0 + 3 ) + θ ( θ 3 ) ( 2 ) ( 3 ) g ( b 0 + 2 ) + θ ( θ 2 ) ( θ 3 ) ( 1 ) ( 2 ) ( 3 ) g ( b 0 + 1 ) for J 5 ,
for θ ( 1 , 2 ) , then, g ( z ) 0 for z J b 0 + 4 .
Proof. 
This proof follows directly from Theorem 3 applied to the function h : = g .

3.2. Discrete Nabla Fractional and Integer Differences

Based on Lemma 1, we can now establish a relationship between the discrete nabla fractional and integer differences of the Riemann–Liouville type, and we immediately present the final monotonicity result of this study.
Theorem 4.
Let g be defined on J b 0 and N 1 < θ < N with N J 1 . Then
b 0 R L θ g ( b 0 + N + ) = ı = 0 N 1 ( N + ) [ θ + ı ] Γ ( 1 θ ı ) ı g ( b 0 + 1 )     + 1 Γ ( N θ ) ı = 1 1 ( ı + 1 ) [ θ + N 1 ] N g ( b 0 + ı + N ) + N g ( b 0 + + N ) ,
for all J 0 . In addition, we have
( ı + 1 ) [ θ + N 1 ] Γ ( N θ ) = ( N θ + ı 1 ) ( N θ + ı 2 ) ( N + 1 θ ) ( N θ ) ( ı ) ! > 0 ,
for ı = 1 , 2 , , 1 with J 1 .
Proof. 
For N = 1 , from Lemma 1, we find for z J b 0 + 2 that
b 0 R L θ g ( z ) = z b 0 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) + r = b 0 + 2 z z r + 1 [ θ ] Γ ( 1 θ ) g ( r ) .
Now, by the same technique used in Lemma 1, for N = 2 , we have:
b 0 R L θ g ( z ) = 2 r = b 0 + 1 z z r + 1 [ 1 θ ] Γ ( 2 θ ) g ( r ) = r = b 0 + 1 z z r + 1 [ 1 θ ] Γ ( 2 θ ) g ( r ) = z b 0 [ 1 θ ] Γ ( 2 θ ) g ( b 0 + 1 ) + r = b 0 + 2 z z r + 1 [ 1 θ ] Γ ( 2 θ ) g ( r ) = z b 0 [ 1 θ ] Γ ( 2 θ ) g ( b 0 + 1 ) + r = b 0 + 2 z z r + 1 [ 1 θ ] Γ ( 2 θ ) g ( r ) = z b 0 [ θ ] Γ ( 1 θ ) g ( b 0 + 1 ) + z b 0 [ 1 θ ] Γ ( 2 θ ) g ( b 0 + 1 ) + r = b 0 + 3 z z r + 1 [ 1 θ ] Γ ( 2 θ ) 2 g ( r ) ,
for z J b 0 + 3 , where we have used the following fact
z b 0 [ 1 θ ] = z b 0 [ 1 θ ] z 1 b 0 [ 1 θ ] = ( 1 θ ) z b 0 [ θ ] .
We can continue by the same process to obtain
b 0 R L θ g ( z ) = ı = 0 N 1 z b 0 [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 )                   + r = b 0 + N + 1 z z r + 1 [ N θ 1 ] Γ ( N θ ) N g ( r ) ,
for z J b 0 + N + 1 . Now, we define z b 0 + N + for J 1 to obtain
b 0 R L θ g ( b 0 + N + ) = ı = 0 N 1 N + [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 ) + r = b 0 + N + 1 b 0 + N + b 0 + N + r + 1 [ N θ 1 ] Γ ( N θ ) N g ( r ) = ı = 0 N 1 N + [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 ) + ı = 1 ı + 1 [ N θ 1 ] Γ ( N θ ) N g ( b 0 + ı + N ) = ı = 0 N 1 N + [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 ) + ı = 1 1 ı + 1 [ N θ 1 ] Γ ( N θ ) N g ( b 0 + ı + N ) + N g ( b 0 + + N ) ,
which completes the proof of the first part. For the second part of the theorem, we see that
( ı + 1 ) [ θ + N 1 ] Γ ( N θ ) = Γ ( ı θ + N ) Γ ( ı + 1 ) Γ ( N θ ) = ( N θ + ı 1 ) ( N θ + ı 2 ) ( N + 1 θ ) ( N θ ) ( ı ) ! > 0 ,
for N 1 < θ < N and ı = 1 , 2 , , 1 . Hence, the proof is complete. □
Our final result is on the positivity of b 0 R L θ g ( z ) , as follows.
Theorem 5.
Let g : J b 0 R be a function, N 1 < θ < N with N J 1 , N g ( z ) 0 for z J b 0 + 1 , ( 1 ) N ı N g ( b 0 + 1 ) 0 for ı = 0 , 1 , , N 1 . Then b 0 R L θ g ( z ) 0 for each z J b 0 + 1 .
Proof. 
Let be a fixed but arbitrary element in J 1 . We can then see that
N + [ θ + ı ] Γ ( 1 θ + ı ) = Γ ( N + θ + ı ) Γ ( 1 θ + ı ) Γ ( N + ) = ( N + θ + ı 1 ) ( N + θ + ı 2 ) ( 2 θ + ı ) ( 1 θ + ı ) ( N + 1 ) ! .
Now, if N ı 1 is even, then we obtain
N + [ θ + ı ] Γ ( 1 θ + ı ) > 0 and N g ( b 0 + 1 ) 0 ,
but if N ı 1 is odd, then we obtain
N + [ θ + ı ] Γ ( 1 θ + ı ) < 0 and N g ( b 0 + 1 ) 0 .
These provide that
ı = 0 N 1 N + [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 ) 0 .
Hence, according to Theorems 4, (8) and (12) and the assumption that N g ( z ) 0 , we can deduce
b 0 R L θ g ( b 0 + N + ) = ı = 0 N 1 N + [ θ + ı ] Γ ( 1 θ + ı ) ı g ( b 0 + 1 ) + ı = 1 1 ı + 1 [ N θ 1 ] Γ ( N θ ) N g ( b 0 + ı + N ) + N g ( b 0 + + N ) ı = 1 1 ı + 1 [ N θ 1 ] Γ ( N θ ) N g ( b 0 + ı + N ) 0 .
By putting z : = b 0 + N + for arbitrary J 1 , we obtain b 0 R L θ g ( z ) 0 for each z J b 0 + 1 as desired. □
Corollary 4.
Let g : J b 0 R be a function, N 1 < θ < N with N J 1 , N g ( z ) 0 for z J b 0 + 1 , ( 1 ) N ı N g ( b 0 + 1 ) 0 for ı = 0 , 1 , , N 1 . Then b 0 R L θ g ( z ) 0 for each z J b 0 + 1 .

4. Application: A Specific Example

In this section, we provide a specific example to illustrate our results.
Consider the function
g ( z ) = 8 3 z for z J b 0 + 2 .
At first, we will try to show that b 0 R L θ g ( z ) 0 for z { b 0 + 3 , b 0 + 4 } , θ = 3 2 and b 0 = 0 . From Definition 3 at z = b 0 + 3 , we have
b 0 R L θ g ( b 0 + 3 ) = 1 Γ ( θ ) r = b 0 + 1 b 0 + 3 ( b 0 + 3 r + 1 ) [ θ 1 ] g ( r ) = 1 Γ ( θ ) ( 3 ) [ θ 1 ] g ( b 0 + 1 ) + ( 2 ) [ θ 1 ] g ( b 0 + 2 ) + ( 1 ) [ θ 1 ] g ( b 0 + 3 ) = θ ( 1 θ ) 2 g ( b 0 + 1 ) θ g ( b 0 + 2 ) + g ( b 0 + 3 ) = 251 27 0 ,
which leads to
g ( b 0 + 3 ) θ ( 1 θ ) 2 g ( b 0 + 1 ) + θ g ( b 0 + 2 ) .
In addition, Definition 3 at z = b 0 + 4 gives
b 0 R L θ g ( b 0 + 4 ) = 1 Γ ( θ ) r = b 0 + 1 b 0 + 4 ( b 0 + 4 r + 1 ) [ θ 1 ] g ( r ) = 1 Γ ( θ ) { ( 4 ) [ θ 1 ] g ( b 0 + 1 ) + ( 3 ) [ θ 1 ] g ( b 0 + 2 ) + ( 2 ) [ θ 1 ] g ( b 0 + 3 ) + ( 1 ) [ θ 1 ] g ( b 0 + 4 ) } = θ ( 1 θ ) ( 2 θ ) 6 g ( b 0 + 1 ) θ ( 1 θ ) 2 g ( b 0 + 2 ) θ g ( b 0 + 3 ) + g ( b 0 + 4 ) = 3179 162 0 ,
which implies that
g ( b 0 + 4 ) θ ( 1 θ ) ( 2 θ ) 6 g ( b 0 + 1 ) + θ ( 1 θ ) 2 g ( b 0 + 2 ) + θ g ( b 0 + 3 ) .
On the other hand, we consider the condition:
g ( b 0 + 2 ) θ 1 g ( b 0 + 1 ) ,
at = 3 , 4 . At = 3 , it follows that
8 3 2 = g ( b 0 + 2 ) θ 2 g ( b 0 + 1 ) = 3 4 8 3 ,
which means that
g ( b 0 + 2 ) θ 2 g ( b 0 + 1 ) .
In addition, at = 4 , it follows that
8 3 2 = g ( b 0 + 2 ) Γ ( θ + 2 ) Γ ( θ ) Γ ( 3 ) g ( b 0 + θ h ) = θ 3 g ( b 0 + 1 ) = 1 2 8 3 ,
which is equivalent to
g ( b 0 + 2 ) θ 3 g ( b 0 + 1 ) .
Thus, we can conclude from the inequalities (13)–(14) that
g ( b 0 + 3 ) = g ( b 0 + 3 ) g ( b 0 + 2 ) θ ( 1 θ ) 2 g ( b 0 + 1 ) + θ g ( b 0 + 2 ) g ( b 0 + 2 ) = ( θ 1 ) θ 2 g ( b 0 + 1 ) + θ g ( b 0 + 2 ) 0 .
Also, from the inequalities (15)–(16) we can conclude that
g ( b 0 + 4 ) = g ( b 0 + 4 ) g ( b 0 + 3 ) θ ( 1 θ ) ( 2 θ ) 6 g ( b 0 + 1 ) + θ ( 1 θ ) 2 g ( b 0 + 2 ) + θ g ( b 0 + 3 ) g ( b 0 + 3 ) = ( θ 1 ) ( 2 θ ) 2 θ 3 g ( b 0 + 1 ) + θ g ( b 0 + 2 ) 0 .
These inequalities imply that g is non-decreasing in the time set { b 0 + 3 , b 0 + 4 } .

5. Conclusions and Future Directions

In this paper, we studied the monotonicity analysis for the discrete nabla fractional differences of the Riemann–Liouville type. The first three main results were dedicated to the positivity of g ( z ) by assuming that b 0 R L θ g ( z ) 0 combined with the condition that g ( b 0 + 2 ) θ 1 g ( b 0 + 1 ) for J 3 in Theorem 1, g ( b 0 + 3 ) θ 2 g ( b 0 + 2 ) + θ ( θ 2 ) ( 1 ) ( 2 ) g ( b 0 + 1 ) for J 4 in Theorem 2, and g ( b 0 + 4 ) θ 2 g ( b 0 + 3 ) + θ ( θ 3 ) ( 2 ) ( 3 ) g ( b 0 + 2 ) + θ ( θ 2 ) ( θ 3 ) ( 1 ) ( 2 ) ( 3 ) g ( b 0 + 1 ) for J 5 in Theorem 3.
On the other hand, the relationship between the discrete nabla fractional and integer differences of the Riemann–Liouville type has been made. From which the positivity of the discrete nabla fractional differences of the Riemann–Liouville type has been established. In addition, some particular results have been obtained in the corollaries, which showed the negativity (decreasing) of the function.
There is vast room for monotonicity analysis to be explored in this fertile field of discrete fractional operators, for example, discrete Caputo–Fabrizio and Atangana–Baleanu fractional operators (see [30,32,33] for information about these discrete operators).

Author Contributions

Conceptualisation, P.O.M., H.M.S., D.B. and R.J.; Data curation, P.O.M. and K.M.A.; Formal analysis, D.B. and K.M.A.; Funding acquisition, D.B. and K.M.A.; Investigation, P.O.M., H.M.S., D.B., R.J. and K.M.A.; Methodology, R.J. and K.M.A.; Project administration, H.M.S. and D.B.; Resources, R.J.; Software, P.O.M.; Supervision, H.M.S. and D.B.; Validation, R.J.; Visualisation, R.J.; Writing–original draft, P.O.M.; Writing–review and editing, H.M.S. and K.M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Atici, F.M.; Atici, M.; Belcher, M.; Marshall, D. A new approach for modeling with discrete fractional equations. Fund. Inform. 2017, 151, 313–324. [Google Scholar]
  2. Atici, F.; Sengul, S. Modeling with discrete fractional equations. J. Math. Anal. Appl. 2010, 369, 1–9. [Google Scholar] [CrossRef] [Green Version]
  3. Chen, C.R.; Bohner, M.; Jia, B.G. Ulam-hyers stability of Caputo fractional difference equations. Math. Meth. Appl. Sci. 2019, 42, 7461–7470. [Google Scholar] [CrossRef]
  4. Lizama, C. The Poisson distribution, abstract fractional difference equations, and stability. Proc. Amer. Math. Soc. 2017, 145, 3809–3827. [Google Scholar] [CrossRef]
  5. Silem, A.; Wu, H.; Zhang, D.-J. Discrete rogue waves and blow-up from solitons of a nonisospectral semi-discrete nonlinear Schrödinger equation. Appl. Math. Lett. 2021, 116, 107049. [Google Scholar] [CrossRef]
  6. Atici, F.M.; Atici, M.; Nguyen, N.; Zhoroev, T.; Koch, G. A study on discrete and discrete fractional pharmacokinetics-pharmacodynamics models for tumor growth and anti-cancer effects. Comput. Math. Biophys. 2019, 7, 10–24. [Google Scholar] [CrossRef] [Green Version]
  7. Goodrich, C.S. On discrete sequential fractional boundary value problems. J. Math. Anal. Appl. 2012, 385, 111–124. [Google Scholar] [CrossRef] [Green Version]
  8. Ferreira, R.A.C.; Torres, D.F.M. Fractional h-difference equations arising from the calculus of variations. Appl. Anal. Discrete Math. 2011, 5, 110–121. [Google Scholar] [CrossRef] [Green Version]
  9. Wu, G.; Baleanu, D. Discrete chaos in fractional delayed logistic maps. Nonlinear Dyn. 2015, 80, 1697–1703. [Google Scholar] [CrossRef]
  10. Srivastava, H.M. An introductory overview of fractional-calculus operators based upon the Fox-Wright and related higher transcendental functions. J. Adv. Engrg. Comput. 2021, 5, 135–166. [Google Scholar] [CrossRef]
  11. Srivastava, H.M. Some parametric and argument variations of the operators of fractional calculus and related special functions and integral transformations. J. Nonlinear Convex Anal. 2021, 22, 1501–1520. [Google Scholar]
  12. Goodrich, C.S.; Peterson, A.C. Discrete Fractional Calculus; Springer: Berlin/Heidelberg, Germany, 2015. [Google Scholar]
  13. Abdeljawad, T. On delta and nabla caputo fractional differences and dual identities. Discrete Dyn. Nat. Soc. 2013, 2013, 12. [Google Scholar] [CrossRef]
  14. Abdeljawad, T.; Jarad, F.; Atangana, A.; Mohammed, P.O. On a new type of fractional difference operators on h-step isolated time scales. J. Fract. Calc. Nonlinear Syst. 2021, 1, 46–74. [Google Scholar]
  15. Abdeljawad, T.; Atici, F. On the definitions of nabla fractional operators. Abstr. Appl. Anal. 2012, 2012, 1–13. [Google Scholar] [CrossRef]
  16. Dahal, R.; Goodrich, C.S. Mixed order monotonicity results for sequential fractional nabla differences. J. Differ. Equ. Appl. 2019, 25, 837–854. [Google Scholar] [CrossRef]
  17. Du, F.; Jia, B.; Erbe, L.; Peterson, A. Monotonicity and convexity for nabla fractional (q, h)-differences. J. Differ. Equ. Appl. 2016, 22, 1224–1243. [Google Scholar] [CrossRef]
  18. Mohammed, P.O.; Almutairi, O.; Agarwal, R.P.; Hamed, Y.S. On convexity, monotonicity and positivity analysis for discrete fractional operators defined using exponential kernels. Fractal Fract. 2022, 6, 55. [Google Scholar] [CrossRef]
  19. Dahal, R.; Goodrich, C.S.; Lyons, B. Monotonicity results for sequential fractional differences of mixed orders with negative lower bound. J. Differ. Equ. Appl. 2021, 27, 1574–1593. [Google Scholar] [CrossRef]
  20. Goodrich, C.S. A note on convexity, concavity, and growth conditions in discrete fractional calculus with delta difference. Math. Inequal. Appl. 2016, 19, 769–779. [Google Scholar] [CrossRef]
  21. Goodrich, C.S. A sharp convexity result for sequential fractional delta differences. J. Differ. Equ. Appl. 2017, 23, 1986–2003. [Google Scholar] [CrossRef]
  22. Dahal, R.; Goodrich, C.S. A monotonicity result for discrete fractional difference operators. Arch. Math. 2014, 102, 293–299. [Google Scholar] [CrossRef]
  23. Atici, F.; Uyanik, M. Analysis of discrete fractional operators. Appl. Anal. Discrete Math. 2015, 9, 139–149. [Google Scholar] [CrossRef]
  24. Mohammed, P.O.; Abdeljawad, T.; Hamasalh, F.K. On discrete delta Caputo-Fabrizio fractional operators and monotonicity analysis. Fractal Fract. 2021, 5, 116. [Google Scholar] [CrossRef]
  25. Mohammed, P.O.; Abdeljawad, T.; Hamasalh, F.K. On Riemann–Liouville and Caputo fractional forward difference monotonicity analysis. Mathematics 2021, 9, 1303. [Google Scholar] [CrossRef]
  26. Abdeljawad, T.; Baleanu, D. Monotonicity analysis of a nabla discrete fractional operator with discrete Mittag-Leffler kernel. Chaos Solit. Fract. 2017, 116, 1–5. [Google Scholar] [CrossRef]
  27. Goodrich, C.S.; Lizama, C. Positivity, monotonicity, and convexity for convolution operators. Discrete Contin. Dyn. Syst. 2020, 40, 4961–4983. [Google Scholar] [CrossRef]
  28. Goodrich, C.S.; Lyons, B. Positivity and monotonicity results for triple sequential fractional differences via convolution. Analysis 2020, 40, 89–103. [Google Scholar] [CrossRef]
  29. Erbe, L.; Goodrich, C.S.; Jia, B.; Peterson, A. Monotonicity results for delta fractional differences revisited. Math. Slovaca 2017, 67, 895–906. [Google Scholar] [CrossRef]
  30. Abdeljawad, T. Different type kernel h-fractional differences and their fractional h-sums. Chaos Solit. Fract. 2018, 116, 146–156. [Google Scholar] [CrossRef]
  31. Liu, X.; Du, F.; Anderson, D.; Jia, B. Monotonicity results for nabla fractional h-difference operators. Math. Meth. Appl. Sci. 2021, 44, 1207–1218. [Google Scholar] [CrossRef]
  32. Abdeljawad, T.; Al-Mdallal, Q.M.; Hajji, M.A. Arbitrary order fractional difference operators with discrete exponential kernels and applications. Discrete Dyn. Nat. Soc. 2017, 2017, 4149320. [Google Scholar] [CrossRef] [Green Version]
  33. Abdeljawad, T.; Madjidi, F. Lyapunov-type inequalities for fractional difference operators with discrete Mittag-Leffler kernel of order 2 < α < 5/2. Eur. Phys. J. Spec. Top. 2017, 226, 3355–3368. [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

Mohammed, P.O.; Srivastava, H.M.; Baleanu, D.; Jan, R.; Abualnaja, K.M. Monotonicity Results for Nabla Riemann–Liouville Fractional Differences. Mathematics 2022, 10, 2433. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142433

AMA Style

Mohammed PO, Srivastava HM, Baleanu D, Jan R, Abualnaja KM. Monotonicity Results for Nabla Riemann–Liouville Fractional Differences. Mathematics. 2022; 10(14):2433. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142433

Chicago/Turabian Style

Mohammed, Pshtiwan Othman, Hari Mohan Srivastava, Dumitru Baleanu, Rashid Jan, and Khadijah M. Abualnaja. 2022. "Monotonicity Results for Nabla Riemann–Liouville Fractional Differences" Mathematics 10, no. 14: 2433. https://0-doi-org.brum.beds.ac.uk/10.3390/math10142433

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