# Fractional Order Difference Equations

Authors: J. Jagan Mohan; G. V. S. R. Deekshitulu
Journal: International Journal of Differential Equations
 (2012)

---

## Abstract

A difference equation is a relation between the differences of a function at one or more general values of the independent variable. These equations usually describe the
evolution of certain phenomena over the course of time. The present paper deals with the existence and uniqueness of solutions of fractional
difference equations.


---

## Body

## 1. Introduction

Fractional calculus has gained importance during the past three decades due to its applicability in diverse fields of science and engineering. The notions of fractional calculus may be traced back to the works of Euler, but the idea of fractional difference is very recent.Diaz and Osler [1] defined the fractional difference by the rather natural approach of allowing the index of differencing, in the standard expression for the nth difference, to be any real or complex number. Later, Hirota [2] defined the fractional order difference operator ∇α where α is any real number, using Taylor’s series. Nagai [3] adopted another definition for fractional order difference operator by modifying Hirota’s [2] definition. Recently, Deekshitulu and Mohan [4] modified the definition of Nagai [3] for 0<α<1 in such a way that the expression for ∇α does not involve any difference operator.The study of theory of fractional differential equations was initiated and existence and uniqueness of solutions for different types of fractional differential equations have been established recently [5]. Much of literature is not available on fractional integrodifferential equations also, though theory of integrodifferential equations [6] has been almost all developed parallel to theory of differential equations. Very little progress has been made to develop the theory of fractional order difference equations.The main aim of this paper is to establish theorems on existence and uniqueness of solutions of various classes of fractional order difference equations. Further we define autonomous and nonautonomous fractional order difference equations and find their solutions.


## 2. Preliminaries

Throughout the present paper, we use the following notations:ℕ be the set of natural numbers including zero. ℕa+={a,a+1,a+2,…} for a∈ℤ. Let u(n):ℕ0+→ℝ. Then for all n1,n2∈ℕ0+ and n1>n2, ∑j=n1n2‍u(j)=0, and ∏j=n1n2‍u(j)=1, that is, empty sums and products are taken to be 0 and 1, respectively. If n and n+1 are in ℕ0+, then for this function u(n), the backward difference operator ∇ is defined as ∇u(n)=u(n)-u(n-1). Now we introduce some basic definitions and results concerning nabla discrete fractional calculus.Definition 2.1.
The extended binomial coefficient(an), (a∈ℝ,n∈ℤ) is defined by
(2.1)(an)={Γ(a+1)Γ(a-n+1)Γ(n+1)n>0,1n=0,0n<0.Definition 2.2 (see [7]).
For any complex numbersα and β, let (α)β be defined as follows:
(2.2)(α)β={Γ(α+β)Γ(α)whenαandα+βare  neither  zero  nor  negative  integers,1whenα=β=0,0whenα=0,βis  neither  zero  nor  negative  integer,undefinedotherwise.Remark 2.3.
For any complex numbersα and β, when α, β and α+β are neither zero nor negative integers,
(2.3)(α+β)n=∑k=0n‍(nk)(α)n-k(β)k
for any positive integer n.In 2003, Nagai [3] gave the following definition for fractional order difference operator.Definition 2.4.
Letα∈ℝ and m be an integer such that m-1<α≤m. The difference operator ∇ of order α, with step length ε, is defined as
(2.4)∇αu(n)={∇α-m[∇mu(n)]=εm-α∑j=0n-1‍(α-mj)(-1)j∇mu(n-j)α>0,u(n)α=0,ε-α∑j=0n-1‍(αj)(-1)ju(n-j)α<0.The above definition of∇αu(n) given by Nagai [3] contains ∇ operator and the term (-1)j inside the summation index and hence it becomes difficult to study the properties of solution. To avoid this, Deekshitulu and Mohan [4] gave the following definition, for ε=m=1. Let α∈ℝ such that 0<α<1.Definition 2.5.
The fractional sum operator of orderα is defined as
(2.5)∇-αu(n)=∑j=0n-1‍(j+α-1j)u(n-j)=∑j=1n‍(n-j+α-1n-j)u(j).
And the fractional order difference operator of order α is defined as
(2.6)∇αu(n)=∑j=0n-1‍(j-αj)∇u(n-j)=∑j=1n‍(n-j-α-1n-j)u(j)-(n-α-1n-1)u(0).
Throughout this paper we assume that α∈ℝ and 0<α<1 unless until specified.Remark 2.6.
Letu(n),v(n):ℕ0+→ℝ and α, β∈ℝ such that 0<α,β,α+β<1 and c, d  are constants. Then (1)
∇α∇βu(n)=∇α+βu(n).(2)
∇α[cu(n)+dv(n)]=c∇αu(n)+d∇αv(n).(3)
∇-α∇αu(n)=u(n)-u(0).(4)
∇α∇-αu(n)=u(n).(5)
∇αu(0)=0 and ∇αu(1)=u(1)-u(0)=∇u(1).


## 3. Existence and Uniqueness of Solutions of Fractional Order Difference Equations

In the present section, we establish theorems on existence and uniqueness of solutions for various classes of fractional order difference equations.Definition 3.1.
Letf(n,r) be any function defined for n∈ℕ0+, 0≤r<∞. Then a nonlinear difference equation of order α together with an initial condition is of the form
(3.1)∇αu(n+1)=f(n,u(n)),u(0)=u0.
The existence of solutions to difference equations is trivial as the solutions are expressed as recurrence relations involving the values of the unknown function at the previous arguments.Now we consider (2.5) and replace u(n) by ∇αu(n), we have
(3.2)∇-α[∇αu(n)]=∑j=1n‍(n-j+α-1n-j)[∇αu(j)],oru(n)-u(0)=∑j=1n‍(n-j+α-1n-j)[∇αu(j)],oru(n)=u0+∑j=0n-1‍(n-j+α-2n-j-1)[∇αu(j+1)],oru(n)=u0+∑j=0n-1‍B(n-1,α;j)f(j,u(j)),
where B(n,α;j)=(n-j+α-1n-j) for 0≤j≤n. The above recurrence relation shows the existence of solution of (3.1).Example 3.2.
Iff(n,u(n))=a(n)u(n)+b(n) where a(n),b(n):ℕ0+→ℝ are any two nonnegative functions then
(3.3)u(n)=u0∏j=0n-1‍[1+B(n-1,α;j)a(j)]+∑j=0n-1‍B(n-1,α;j)b(j)∏k=j+1n-1‍[1+B(n-1,α;j)a(k)].
Recently, the authors have established the following fractional order discrete Gronwall-Bellman type inequality [8].Theorem 3.3.
Letu(n), a(n), and b(n) be real valued nonnegative functions defined on ℕ0+. If, for 0<α<1,
(3.4)u(n)≤u0+∑j=0n-1‍B(n-1,α;j)[a(j)u(j)+b(j)]
then
(3.5)u(n)≤u0∏j=0n-1‍[1+B(n-1,α;j)a(j)]+∑j=0n-1‍B(n-1,α;j)b(j)∏k=j+1n-1‍[1+B(n-1,α;j)a(k)]
for n∈ℕ0+.Definition 3.4.
Letf(n,r) and g(n,m,r) be any functions defined for n, m∈ℕ0+, m≤n and 0≤r<∞. Then a nonlinear difference equation of Volterra type of order α together with an initial condition is of the form
(3.6)∇αu(n+1)=f(n,u(n))+∑m=0n-1‍g(n,m,u(m)),u(0)=u0.
From (3.2) and (3.6), we have
(3.7)u(n)=u0+∑j=0n-1‍B(n-1,α;j)[f(j,v(j))+∑m=0j-1‍g(j,m,v(m))].
The above recurrence relation shows the existence of solution of (3.6). Now we establish the uniqueness of solutions for the fractional order difference equations (3.1) and (3.3).Lemma 3.5.
Forn∈ℕ0+,
(3.8)∑j=0n‍B(n,α;j)=(n+αn).Proof.
Consider(3.9)∑j=0n‍B(n,α;j)=∑j=0n‍Γ(n-j+α)Γ(α)Γ(n-j+1)=1Γ(n+1)∑j=0n‍(nj)(1)j(α)n-j(usingDefinition2.2)=1Γ(n+1)(1+α)n(usingRemark2.3)=1Γ(n+1)Γ(n+α+1)Γ(α+1)=(n+αn).Theorem 3.6.
Letf(n,r) be any function defined for n∈ℕ0+, 0≤r<∞. Suppose that f satisfies
(3.10)|f(n,v(n))-f(n,w(n))|≤L|v(n)-w(n)|,
where v(n),w(n):ℕ0+→ℝ are any two nonnegative functions, and L is a nonnegative constant. Then there exists unique solution for the initial value problem (3.1).Proof.
Letv(n) and w(n) be any two solutions of the initial value problem (3.1) such that v(0)=w(0). Then, using (3.2) and (3.10), we get
(3.11)|v(n+1)-w(n+1)|=|∑j=0n‍B(n,α;j)[f(j,v(j))-f(j,w(j))]|≤∑j=0n‍B(n,α;j)|f(j,v(j))-f(j,w(j))|≤L∑j=0n‍B(n,α;j)|v(j)-w(j)|<ϵ+L∑j=0n‍B(n,α;j)|v(j)-w(j)|,
where ϵ>0 be any small quantity. Let y(n)=|v(n)-w(n)|. Then
(3.12)y(n+1)<ϵ+L∑j=0n‍B(n,α;j)y(j).
Using Discrete Fractional Gronwall’s inequality (i.e., Theorem 3.3) we get
(3.13)y(n)<ϵ∏j=0n-1‍[1+LB(n-1,α;j)]<ϵexp[L∑j=0n-1‍B(n-1,α;j)].
Using Lemma 3.5, we get
(3.14)y(n)<ϵexp[L(n+α-1n-1)].
Since ϵ is arbitrary, inequality (3.14) implies that y(n) tends to zero. Thus v(n)=w(n).Theorem 3.7.
Consider a nonlinear fractional difference equation of Volterra type (3.6). Suppose that f and g satisfies
(3.15)|f(n,v(n))-f(n,w(n))|≤L|v(n)-w(n)|,∑m=0n-1‍|g(n,m,v(m))-g(n,m,w(m))|≤L2|v(n)-w(n)|,
where v(n),w(n):ℕ0+→ℝ are any two nonnegative functions and L is a nonnegative constant. Then there exists a unique solution for the initial value problem (3.6).Proof.
Letv(n) and w(n) be any two solutions of the initial value problem (3.6) such that v(0)=w(0). Then, using (3.2), we get
(3.16)|v(n+1)-w(n+1)|=|∑j=0n‍B(n,α;j)[f(j,v(j))-f(j,w(j))]+∑j=0n‍B(n,α;j)∑m=0j-1‍[g(j,m,v(m))-g(j,m,w(m))]|≤∑j=0n‍B(n,α;j)|f(j,v(j))-f(j,w(j))|+∑j=0n‍B(n,α;j)∑m=0j-1‍|g(j,m,v(m))-g(j,m,w(m))|≤L∑j=0n‍B(n,α;j)|v(j)-w(j)|+L2∑j=0n‍B(n,α;j)|v(j)-w(j)|≤(L+L2)∑j=0n‍B(n,α;j)|v(j)-w(j)|<ϵ+(L+L2)∑j=0n‍B(n,α;j)|v(j)-w(j)|,
where ϵ>0 be any small quantity. Let y(n)=|v(n)-w(n)|. Then
(3.17)y(n+1)<ϵ+(L+L2)∑j=0n‍B(n,α;j)y(j).
Using Discrete Fractional Gronwall’s inequality (i.e., Theorem 3.3) we get
(3.18)y(n)<ϵ∏j=0n-1‍[(L+L2)B(n-1,α;j)]<ϵexp[(L+L2)∑j=0n-1‍B(n-1,α;j)].
Using Lemma 3.5 we have
(3.19)y(n)<ϵexp[(L+L2)(n+α-1n-1)].
Since ϵ is arbitrary, inequality (3.19) implies that y(n) tends to zero. Thus v(n)=w(n).


## 4. Solutions of Fractional Order Difference Equations

In this section, we define autonomous and nonautonomous fractional order difference equations and find their solutions.Definition 4.1.
Letg(r) be any real-valued function defined on ℝ. Then an autonomous difference equation of order α together with an initial condition is of the form
(4.1)∇αu(n+1)=g(u(n)),u(0)=u0.
If the function g in (4.1) is replaced by a function f of two variables, that is, f:ℕ0+×ℝ→ℝ, then we have
(4.2)∇αu(n+1)=f(n,u(n)),u(0)=u0.
Equation (4.2) is called a nonautonomous difference equation of order α.Now we consider the simplest special cases of (4.1) and (4.2), namely, linear equations.The linear autonomous difference equation of orderα has following general form:
(4.3)∇αu(n+1)=au(n)+b,u(0)=u0,
where a≠0 and b are known constants.The general form of linear homogeneous nonautonomous difference equation of orderα is given by
(4.4)∇αu(n+1)=a(n)u(n),u(0)=u0
and the associated nonhomogeneous equation is given by
(4.5)∇αu(n+1)=a(n)u(n)+b(n),u(0)=u0,
where a(n)≠0 and b(n) are real-valued functions defined for n∈ℕ0+.Now we find the solutions of (4.3), (4.4), and (4.5).Solution of (4.4)
Using (3.2) and (4.4), we obtain
(4.6)u(n)=u0+∑j=0n-1‍B(n-1,α;j)a(j)u(j)
implies
(4.7)u(n)=u0∏j=n0n-1‍[1+B(n-1,α;j)a(j)].Solution of (4.5)
Using (3.2) and (4.5), we obtain
(4.8)u(n)=u0+∑j=0n-1‍B(n-1,α;j)[a(j)u(j)+b(j)]
implies
(4.9)u(n)=u0∏j=n0n-1‍[1+B(n-1,α;j)a(j)]+∑j=n0n-1‍B(n-1,α;j)b(j)∏k=j+1n-1‍[1+B(n-1,α;k)a(k)].Solution of (4.3)
Using (4.9), we obtain
(4.10)u(n)=u(0)∏j=0n-1‍[1+aB(n-1,α;j)]+b∑j=0n-1‍B(n-1,α;j)∏k=j+1n-1‍[1+B(n-1,α;k)a]=u(0)∏j=0n-1‍[1+aB(n-1,α;j)]+ba∑j=0n-1‍aB(n-1,α;j)∏k=j+1n-1‍[1+aB(n-1,α;k)]=u(0)∏j=0n-1‍[1+aB(n-1,α;j)]+ba[∏j=0n-1‍[1+aB(n-1,α;j)-1]]=[u(0)+ba]∏j=0n-1‍[1+aB(n-1,α;j)]-ba.Example 4.2.
Find the solution of(4.11)∇1/2u(n+1)=u(n)+1,u(0)=0.Solution.
Using (4.10), the solution of (4.11) is
(4.12)u(n)=∏j=0n-1‍[1+(n-j-32n-j-1)]-1.Example 4.3.
Find the solution of(4.13)∇1/2u(n+1)=u(n)+n,u(0)=0.Solution.
Using (4.9), the solution of (4.13) is
(4.14)u(n)=∑j=0n-1‍j(n-j-32n-j-1)∏k=j+1n-1‍[1+(n-k-32n-k-1)].Example 4.4.
Find the solution of(4.15)∇1/2u(n+1)=u(n),u(0)=1.Solution.
Using (4.7), the solution of (4.15) is
(4.16)u(n)=∏j=0n-1‍[1+(n-j-32n-j-1)].
Evaluating fractional differences of various functions numerically is quite cumbersome. Now we find the numerical the solution of the following fractional order difference equation together with an initial condition(4.17)∇αu(n+1)=u(n),u(0)=1
using a simple program in MATLAB for various values of α.The numerical solution for various values ofn and α are tabulated in Table 1. The graphical representation of the numerical solution for various values of n and α are shown in Figure 1.Table 1
Numerical solution of (4.17).
n
α
0.2
0.4
0.6
0.8
1.0
0
1.0000
1.0000
1.0000
1.0000
1.0000
1
2.0000
2.0000
2.0000
2.0000
2.0000
2
2.4000
2.8000
3.2000
3.6000
4.0000
3
2.6880
3.5840
4.7360
6.1920
8.0000
4
2.9245
4.3868
6.7062
10.3530
16.0000
5
3.1304
5.2221
9.2170
16.9624
32.0000
6
3.3156
6.0970
12.3917
27.3580
64.0000
7
3.4855
7.0164
16.3755
43.5659
128.0000
8
3.6437
7.9838
21.3391
68.6384
256.0000
9
3.7926
9.0020
27.4839
107.1529
512.0000
10
3.9337
10.0735
35.0464
165.9425
1024.0000Figure 1
Numerical solution of (4.17).



---

*Source: 780619-2012-11-28.xml*