Skip to main content

Generalized Gronwall fractional summation inequalities and their applications


Based on an iteration method, some generalized discrete fractional Gronwall inequalities are developed, which can be used in the qualitative analysis of the solutions to fractional difference equations and summation equations.


In recent years, the fractional differential and fractional integrals have been adopted in various fields of science and engineering, which can be used to describe certain phenomena, reflect some physiochemical properties, and provide accurate models for the systems under consideration. Some applications of fractional calculus include fluid flow, rheology, dynamical processes in self-similar and porous structures, electrical networks, probability and statistics, control theory of dynamical systems, chemical physics, optics, and signal processing, economics, and so on. Therefore, they are receiving extensive attention from a variety of domains. References [1, 2] introduced the definitions of fractional calculus, theorems and basic analytic solutions of the fractional equation in detail. At the same time, the fractional difference equations, fractional sum equations, and fractional inequalities also play important roles in many areas. In 1989, Miller and Ross [3] defined a fractional sum of order \(\alpha>0\) via the solution of a linear difference equation and proved some basic properties of this operator. After that, many authors followed up in various directions [417].

In 2000, Hirota [18] defined the fractional order difference operator \(\nabla^{\alpha}\) where α was a real number, using Taylor’s series. In 2003, Nagai [19] adopted another definition for the fractional difference by modifying Hirota’s definition. The definition in [19] contained the operator and the term \((-1)^{j}\) inside the summation index. Therefore this definition was difficult use in studying the properties of solutions of fractional difference equations. To avoid this, Deekshitulu and Mohan [20] modified the definition and rearranged the terms in the definition of Nagai [19]. Then they defined the fractional sum operator \(\nabla^{-\alpha}\) and the fractional difference operator \(\nabla^{\alpha}\). Recently, they discussed some basic inequalities, comparison theorems, and qualitative properties of the solutions of fractional difference equations in [2124]. Under the definition in [20], they also considered an initial value problem of fractional order and obtained some useful fractional difference inequalities of Gronwall-Bellman type [25].

In 2009, Atici and Eloe [26] introduced the definition of the fractional sum and the fractional difference: \(\nabla^{-\alpha}\), \(\nabla ^{\alpha}\), \(\triangle^{-\alpha}\), \(\triangle^{\alpha}\). In 2012, based on the definition, Atici and Eloe [27] and Ferreira [28] studied some discrete fractional Gronwall’s inequalities as regards \(\nabla^{-\alpha }\), \(\triangle^{-\alpha}\) separately. They all adopted the same method: After establishing a comparison theorem, they gave an explicit solution to the linear discrete fractional sum equation of the initial value problem, which allowed them to state and prove an analog of Gronwall’s inequality on discrete fractional calculus.

In 2011, Cheng [29] presented another form of definition. He provided some basic properties of fractional difference and summation, and established the theory symmetrical to the fractional differential equation.

In this paper, we will introduce some inequalities and their applications based on the definition in [29] to demonstrate the qualitative properties of solutions to some fractional summation equations. The proof is based on the iterative method.

Definition 1.1


Let ν be nonnegative real number, define the ν-order summation of \(x(n)\) as

$$\begin{aligned} \nabla^{-\nu}x(n)= \begin{bmatrix} \nu\\ n \end{bmatrix}\ast x(n)=\sum^{n}_{r=0} \begin{bmatrix} \nu\\ {n-r} \end{bmatrix} x(r), \end{aligned}$$

where \(\bigl [{\scriptsize\begin{matrix}{}\nu\cr n\end{matrix}} \bigr ] =\frac{\nu(\nu+1)\cdots(\nu+n-1)}{n!}\), is the convolution operator.

Definition 1.2


Let μ be positive real number and m be the minimum positive integer which is greater than μ (\(m-1\leq \mu\leq m\)). Define the μ-order difference of \(x(n)\) as

$$\nabla^{\mu}x(n)=\nabla^{m}\nabla^{-(m-\mu)}x(n), $$

where \(\nabla^{m}\) is the mth-order backward difference operator.

Definition 1.3


Define the discrete Mittag-Leffler function \(F_{\alpha,\beta}(\lambda,n)\) as

$$\begin{aligned}& F_{\alpha,\beta}(\lambda,n)=\sum^{\infty}_{k=0} \lambda^{k} \begin{bmatrix} {\alpha k+\beta} \\ {n}\end{bmatrix} \quad \bigl(|\lambda|< 1 \bigr), \\& F_{\alpha}(\lambda,n)=F_{\alpha,1}(\lambda,n)=\sum ^{\infty}_{k=0}\lambda ^{n} \begin{bmatrix} {\alpha k+1}\\ {n} \end{bmatrix}\quad \bigl(| \lambda| < 1 \bigr). \end{aligned}$$

In [11], Cheng gave the discrete fractional summation Gronwall inequality.

Theorem 1.1


Suppose that \(\beta> 0\). Let \(u_{n}\), \(a_{n}\), and \(g_{n}\) be nonnegative functions, where \(g_{n}\) is also monotone and nondecreasing and satisfies \(0\leq g_{n}\leq M \) (\(0\leq M <1\)), \(0\leq n \leq N\). If

$$u_{n}\leq a_{n}+g_{n}\nabla^{-\beta}u_{n}, $$


$$u_{n}\leq a_{n}+\sum^{\infty}_{k=1}(g_{n})^{k} \nabla^{-k\beta}a_{n}. $$

In [30], Zhang et al. have extended the result and given the following conclusion.

Theorem 1.2


Let \(\beta>0\), \(p\geq r> 0\), \(u_{n}\), \(a_{n}\), \(g_{n}\) be nonnegative functions, where \(g_{n}\) is also monotone and nondecreasing and satisfies \(0\leq g_{n}\leq M\) (\(0\leq M< 1\)), \(0\leq n\leq N\). If

$$(u_{n})^{p}\leq a_{n}+ g_{n} \nabla^{-\beta}(u_{n})^{r}, $$


$$u_{n}\leq \Biggl\{ a_{n}+D_{n}+\sum ^{\infty}_{k=1}(Cg_{n})^{k} \nabla^{-k\beta }D_{n} \Biggr\} ^{\frac{1}{p}}, $$


$$\begin{aligned}& D_{n}=g_{n}\nabla^{-\beta} \biggl\{ \frac{r}{p}k^{\frac{r-p}{p}}a_{n}+\frac {p-r}{p}k^{\frac{r}{p}} \biggr\} , \\& C=\frac{r}{p}k^{\frac{r-p}{p}},\quad k>1. \end{aligned}$$

In order to prove our results, we need the following basic information.

Lemma 1.1


Let \(\mu>0\), \(v>0\), then \(\nabla^{-\mu}\nabla^{-v}x(n)=\nabla^{-(u+v)}x(n)\).

Lemma 1.2


\(\nabla^{-\beta }\bigl [{\scriptsize\begin{matrix}{}{k}\cr {n}\end{matrix}} \bigr ]=\bigl [{\scriptsize\begin{matrix}{}{k+\beta}\cr {n}\end{matrix}} \bigr ]\), \(k, n, \beta>0\).

Main results

Theorem 2.1

Suppose that \(\beta>0\), \(u_{n}\), \(a_{n}\), \(g_{n}\), \(h_{n}\) are nonnegative functions, \(g_{n}\) and \(h_{n}\) are also monotone and nondecreasing, \(u_{n}\leq c\), \(g_{n}\leq M_{1}\), \(h_{n}\leq M_{2} \) (\(M_{1}M_{2}< 1\), \(0\leq n \leq N \)). If

$$\begin{aligned} u_{n}\leq a_{n}+g_{n} \nabla^{-\beta}h_{n}u_{n}, \end{aligned}$$


$$\begin{aligned} u_{n}\leq a_{n}+\sum ^{\infty}_{k=1}g_{n}^{k}h_{n}^{k} \nabla^{-k\beta}a_{n}. \end{aligned}$$


Let \(Bu_{n}=g_{n}\nabla^{-\beta }h_{n}u_{n}\). We find that B is linear and nondecreasing under the conditions that \(u_{n}\), \(g_{n}\), \(h_{n} \) are nonnegative functions and \(g_{n}\), \(h_{n}\) are also nondecreasing. Therefore, (2.1) turns into

$$u_{n}\leq a_{n}+Bu_{n}. $$

Then we have

$$\begin{aligned} u_{n} \leq& a_{n}+B(a_{n}+Bu_{n})=a_{n}+B a_{n}+B^{2}u_{n}\leq\cdots \\ \leq& a_{n}+\sum^{m-1}_{k=1}B^{k}a_{n}+B^{m}u_{n} \end{aligned}$$


$$ \begin{aligned} &Bu_{n}=g_{n} \nabla^{-\beta}h_{n}u_{n} \leq c M_{1}M_{2}\begin{bmatrix}{1+\beta}\\ {n} \end{bmatrix}, \\ &B^{2}u_{n}=g_{n}\nabla^{-\beta}h_{n} \bigl(g_{n}\nabla^{-\beta }h_{n}u_{n} \bigr) \leq c (M_{1}M_{2})^{2}\begin{bmatrix}{1+2\beta}\\ { n} \end{bmatrix}, \\ &\vdots \\ &B^{m}u_{n}=g_{n}^{m}h_{n}^{m} \nabla^{-m\beta}u_{n}\leq c (M_{1}M_{2})^{m} \begin{bmatrix}{1+m\beta}\\ { n} \end{bmatrix}. \end{aligned} $$

Noticing that \(|M_{1}M_{2}|<1\), then

$$\sum^{\infty}_{m=1}(M_{1}M_{2})^{m} \begin{bmatrix}{1+m\beta}\\ {n} \end{bmatrix}=F_{\beta,1}(M_{1}M_{2},n)-1. $$

Hence we have

$$\lim_{m \rightarrow\infty}(M_{1}M_{2})^{m} \begin{bmatrix} {1+m\beta}\\ {n} \end{bmatrix}=0. $$

From (2.4) we get

$$\lim_{m \rightarrow\infty}B^{m}u_{n}\leq0. $$

Due to the fact that \(B^{m}u_{n}\geq0\), we have

$$\lim_{m \rightarrow\infty}B^{m}u_{n}= 0. $$

Taking the limit as \(m\rightarrow\infty\) on both sides of (2.3) we get

$$u_{n}\leq a_{n}+\sum^{\infty}_{k=1}B^{k}a_{n} \leq a_{n}+\sum^{\infty }_{k=0}g_{n}^{k}h_{n}^{k} \nabla^{-k\beta}a_{n}. $$

This completes the proof of Theorem 2.1. □

Remark 2.1

If \(h_{n}\equiv1\), (2.2) becomes Theorem 2.2 of Chapter 3 in [29]:

$$u_{n}\leq a_{n}+\sum^{\infty}_{k=1}g_{n}^{k} \nabla^{-k\beta}a_{n}. $$

Corollary 2.1

With the conditions of Theorem  2.1, let \(g_{n}=a\), \(0< aM_{2} <1\). If

$$u_{n}\leq a_{n}+a\nabla^{-\beta}h_{n}u_{n}, $$


$$u_{n}\leq a_{n}+\sum^{\infty}_{k=1}a^{k}h_{n}^{k} \nabla^{-k\beta}a_{n}. $$

Corollary 2.2

Suppose that the conditions of Corollary  2.1 hold, \(a_{n}\) is monotone increasing and \(0< aM_{2}<1\). If

$$u_{n}\leq a_{n}+a\nabla^{-\beta}h_{n}u_{n}, $$


$$u_{n}\leq a_{n}F_{\beta,1}(aM_{2},n). $$


Under the conditions of Corollary 2.1 and \(a_{n}\) is monotone increasing, and we get

$$\begin{aligned} u_{n} \leq& a_{n}+\sum^{\infty}_{k=1}a^{k}h_{n}^{k} \nabla^{-k\beta}a_{n} \leq a_{n}+a_{n}\sum ^{\infty}_{k=1}a^{k}h_{n}^{k} \nabla^{-k\beta }\begin{bmatrix} {1}\\ {n} \end{bmatrix} \\ \leq& a_{n}\sum^{\infty}_{k=0}(aM_{2})^{k} \begin{bmatrix} {k\beta+1}\\ {n} \end{bmatrix}= a_{n}F_{\beta,1}(aM_{2},n)\quad (0< aM_{2}< 1). \end{aligned}$$


Corollary 2.3

Suppose that the conditions of Theorem  2.1 hold, if \(a_{n}\) is monotone increasing, then from

$$u_{n}\leq a_{n}+g_{n}\nabla^{-\beta}h_{n}u_{n}, $$

we get

$$u_{n}\leq a_{n}\sum^{\infty}_{k=0}(M_{1}M_{2})^{k} \nabla^{-k\beta }\begin{bmatrix} {1}\\ {n} \end{bmatrix}=a_{n}F_{\beta,1}(M_{1}M_{2},n). $$

Theorem 2.2

Suppose that \(\beta>0\), \(u_{n}\), and \(a_{n}\) are nonnegative functions, \(\varphi(t)\) is monotone and nondecreasing, \(\varphi(t+s)\leq\varphi (t)+\varphi(s)\), \(\varphi(t)\leq Lt\), \(0< L<1\). If

$$\begin{aligned} u_{n}\leq a_{n}+\nabla^{-\beta} \varphi(u_{n}), \end{aligned}$$


$$\begin{aligned} u_{n}\leq\sum^{\infty}_{k=0} \nabla^{-k\beta}\varphi^{k}(a_{n}). \end{aligned}$$


Let \(Bu_{n}=\nabla^{-\beta}\varphi (u_{n})\). Under the conditions that \(\varphi(a+b)\leq \varphi(a)+\varphi(b)\) and \(\varphi(t)\) is monotone and nondecreasing, we have

$$\begin{aligned}& \varphi \bigl(\nabla^{-\beta}\varphi(u_{n}) \bigr)=\varphi \Biggl(\sum^{n}_{r=0}\begin{bmatrix}{ \nu}\\ {n-r} \end{bmatrix}\varphi \bigl(u(r) \bigr) \Biggr) \leq\sum^{n}_{r=0} \begin{bmatrix} { \nu}\\ {n-r} \end{bmatrix}\varphi^{2} \bigl(u(r) \bigr)= \nabla^{-\beta } \varphi^{2}(u_{n}), \\& \varphi^{2} \bigl(\nabla^{-\beta}\varphi(u_{n}) \bigr) \leq \nabla^{-\beta}\varphi ^{3}(u_{n}), \\& \vdots \end{aligned}$$

then for all \(n\in N_{0}^{+}\),

$$\begin{aligned} u_{n} \leq& a_{n}+Bu_{n}=a_{n}+ \nabla^{-\beta}\varphi(u_{n}) \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n}+Bu_{n})=a_{n}+ \nabla^{-\beta }\varphi \bigl(a_{n}+\nabla^{-\beta} \varphi(u_{n}) \bigr) \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n})+ \nabla^{-\beta}\varphi \bigl(\nabla ^{-\beta}\varphi(u_{n}) \bigr) \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n})+ \nabla^{-2\beta}\varphi ^{2}(u_{n}) \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n})+ \nabla^{-2\beta}\varphi ^{2} \bigl(a_{n}+ \nabla^{-\beta}\varphi(u_{n}) \bigr) \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n})+ \nabla^{-2\beta}\varphi ^{2}(a_{n})+ \nabla^{-3\beta}\varphi^{3}(u_{n}) \\ \leq& \cdots \\ \leq& a_{n}+\nabla^{-\beta}\varphi(a_{n})+ \nabla^{-2\beta}\varphi ^{2}(a_{n})+ \nabla^{-3\beta}\varphi^{3}(a_{n})+\cdot\cdot\cdot \\ &{}+ \nabla^{-(m-1)\beta}\varphi^{m-1}(a_{n})+ \nabla^{-m\beta}\varphi^{m}(u_{n}), \end{aligned}$$

that is,

$$\begin{aligned} u_{n}\leq \sum^{m-1}_{k=0} \nabla^{-k\beta}\varphi^{k}(a_{n})+ \nabla^{-m\beta } \varphi^{m}(u_{n}). \end{aligned}$$

Noticing that \(\varphi(u_{n})\leq Lu_{n}\), \(|L|<1\), and \(u_{n}\) is bounded for \(0\leq n\leq N\), suppose that \(0< u_{n}\leq C\), then we get

$$ \begin{aligned} &\nabla^{-\beta}\varphi(u_{n})\leq L \nabla^{-\beta}u_{n} \leq L\nabla ^{-\beta}C=CL\begin{bmatrix}{1+\beta}\\ {n}\end{bmatrix}, \\ &\nabla^{-2\beta}\varphi^{2}(u_{n})\leq CL^{2}\begin{bmatrix}{1+2\beta}\\ {n} \end{bmatrix}, \\ &\nabla^{-3\beta}\varphi^{3}(u_{n})\leq C L^{3}\begin{bmatrix} {1+3\beta}\\ {n} \end{bmatrix}, \\ &\vdots \\ &\nabla^{-m\beta}\varphi^{m}(u_{n})\leq CL^{m}\begin{bmatrix} {1+m\beta}\\ { n} \end{bmatrix}. \end{aligned} $$

From the fact that the series

$$\sum^{\infty}_{m=0}L^{m} \begin{bmatrix}{1+m\beta}\\ { n} \end{bmatrix} $$

converges to \(F_{\beta,1}(L,n)\), \(|L|<1\), we have

$$\begin{aligned} \lim_{m\rightarrow\infty}L^{m}\begin{bmatrix}{1+m\beta}\\ { n} \end{bmatrix}=0. \end{aligned}$$

Due to the fact that \(\nabla^{-m\beta}\varphi^{m}(u_{n})\geq0\), from (2.8) and (2.9) we have

$$\lim_{m\rightarrow\infty}\nabla^{-m\beta}\varphi^{m}(u_{n})=0, $$

taking the limit as \(m\rightarrow\infty\) on both sides of (2.7), we have

$$u_{n}\leq\sum^{\infty}_{k=0} \nabla^{-k\beta}\varphi^{k}(a_{n}). $$

This completes the proof of Theorem 2.2. □

By choosing some particular functions \(\varphi(t)\), we can get the corresponding results. For example, suppose that \(a_{n}\), \(u_{n}\), β are the same as in Theorem 2.2. Let \(\varphi(t)=\frac{1}{2} \sin t \) (\(0\leq t\leq\frac{\pi}{2}\)), \(0\leq u_{n}\leq\frac{\pi}{2}\), then \(\varphi(t)\) satisfies \(\varphi(t+s)\leq\varphi(t)+\varphi(s)\), \(\varphi(t)\leq \frac{1}{2}t\). If

$$u_{n}\leq a_{n}+\frac{1}{2}\nabla^{-\beta}\sin u_{n}, $$


$$\begin{aligned} u_{n}\leq \sum^{\infty}_{k=0} \biggl( \frac{1}{2} \biggr)^{k}\nabla^{-k\beta} \sin^{k}a_{n}. \end{aligned}$$

Furthermore, if \(a_{n}\equiv1\), then from \(\sin t\leq t\), we have

$$u_{n}\leq\sum^{\infty}_{k=0} \biggl( \frac{1}{2} \biggr)^{k} \nabla ^{-k\beta}1\leq \sum ^{\infty}_{k=0} \biggl(\frac{1}{2} \biggr)^{k} \begin{bmatrix}{1+k\beta}\\ { n} \end{bmatrix}. $$


Consider the fractional difference equation

$$\begin{aligned} \textstyle\begin{cases} \nabla^{\alpha}y(n)=f \bigl(n, y(n) \bigr), \\ \nabla^{\alpha-1}y(n)|_{n=-1}=\eta, \end{cases}\displaystyle \end{aligned}$$

where \(0<\alpha<1\), \(0\leq n\leq N<\infty\).

From Proposition 3.1 in Chapter 3 of [29], we know that the problem (3.1) is equivalent to the summation equation

$$\begin{aligned} y(n)=\eta\begin{bmatrix}{\alpha}\\ {n} \end{bmatrix}+\nabla^{-\alpha}f \bigl(n, y(n) \bigr). \end{aligned}$$

Suppose that \(z_{n}\) is the solution of the initial value problem

$$\begin{aligned} \textstyle\begin{cases} \nabla^{\alpha}z(n)=f \bigl(n, z(n) \bigr), \\ \nabla^{\alpha-1}z(n)|_{n=-1}=\widetilde{\eta}, \end{cases}\displaystyle \end{aligned}$$

\(0<\alpha<1\), \(0\leq n\leq N<\infty\), then (3.3) is equivalent to the summation equation

$$\begin{aligned} z(n)=\widetilde{\eta}\begin{bmatrix}{\alpha}\\ {n} \end{bmatrix}+ \nabla^{-\alpha}f \bigl(n, z(n) \bigr). \end{aligned}$$

Theorem 3.1

Suppose that \(f(n, t)\) satisfies the condition

$$\begin{aligned} \bigl|f(n,z)-f(n,y) \bigr|\leq h_{n}|z-y|, \end{aligned}$$

where \(h_{n}\) is a monotone nondecreasing positive function, \(|h_{n}|<1\). Then the solutions of (3.1) rely on the initial value continuously.


From (3.2), (3.4), and (3.5) we have

$$\begin{aligned} \bigl|z(n)-y(n)\bigr| \leq& |\widetilde{\eta}-\eta| \begin{bmatrix} {\alpha}\\ {n} \end{bmatrix}+\nabla ^{-\alpha}\bigl|f \bigl(n,z(n) \bigr)-f \bigl(n,y(n) \bigr)\bigr| \\ \leq& |\widetilde{\eta}-\eta| \begin{bmatrix}{\alpha}\\ {n} \end{bmatrix}+ \nabla^{-\alpha}h_{n} \bigl|z(n)-y(n) \bigr|. \end{aligned}$$

From Corollary 2.1, we have

$$\begin{aligned} \bigl|z(n)-y(n) \bigr| \leq& |\widetilde{\eta}-\eta| \begin{bmatrix}{\alpha}\\{n} \end{bmatrix}+\sum ^{\infty }_{k=1}h_{n}^{k} \nabla^{-k\alpha}|\widetilde{\eta} -\eta| \begin{bmatrix} {\alpha}\\ {n} \end{bmatrix} \\ =&|\widetilde{\eta}-\eta|\sum^{\infty}_{k=0}h_{n}^{k} \begin{bmatrix} {k\alpha+\alpha}\\ {n} \end{bmatrix}=|\widetilde{\eta}-\eta|F_{\alpha,\alpha}(h_{n},n), \quad |h_{n}|< 1. \end{aligned}$$

Then the solutions of (3.1) rely on the initial value continuously. □

Remark 3.1

The condition (3.5) generalizes the Lipschitz condition, then Theorem 3.1 is a promotion of Theorem 3.2 in Chapter 3 of [29].

Theorem 3.2

Suppose that \(f(n,t)\) satisfies the condition

$$\begin{aligned} \bigl|f(n,z)-f(n,y) \bigr|\leq\varphi \bigl(|z-y| \bigr), \end{aligned}$$

where \(\varphi(t)\) is the same as in Theorem  2.2. Then the solutions of (3.1) rely on the initial value continuously.


From (3.2), (3.4), and (3.6) we have

$$\begin{aligned}[b] \bigl|z(n)-y(n) \bigr|&\leq |\widetilde{\eta}-\eta | \begin{bmatrix}{\alpha}\\ {n} \end{bmatrix}+\nabla^{-\alpha } \bigl|f \bigl(n,z(n) \bigr)-f \bigl(n,y(n) \bigr) \bigr| \\ &\leq |\widetilde{\eta}-\eta| \begin{bmatrix}{\alpha}\\ {n} \end{bmatrix}+ \nabla^{-\alpha}\varphi \bigl( \bigl|z(n)-y(n) \bigr| \bigr). \end{aligned} $$

By Theorem 2.2 we get

$$\begin{aligned} \bigl|z(n)-y(n) \bigr| \leq&\sum^{\infty}_{k=0} \nabla^{-k\alpha}\varphi ^{k} \Biggl(|\widetilde{\eta}-\eta| \begin{bmatrix}{\alpha}\\ {n} \end{bmatrix} \Biggr) \\ \leq& |\widetilde{\eta}-\eta|\sum^{\infty}_{k=0}L^{k} \begin{bmatrix} {k\alpha+\alpha}\\ {n} \end{bmatrix} =|\widetilde{\eta}-\eta|F_{\alpha,\alpha}(L,n). \end{aligned}$$

Then the solutions of (3.1) rely on the initial value continuously. □


  1. Miller, KS, Ross, B: An Introduction to the Fractional Calculus and Fractional Differential Equations. Wiley, New York (1993)

    MATH  Google Scholar 

  2. Samko, SG, Kilbas, AA, Maitchev, OI: Fractional Integrals and Derivatives. Theory and Applications. Nauka i Technika, Minsk (1987)

    Google Scholar 

  3. Miller, KS, Ross, B: Fractional difference calculus. In: Univalent Functions, Fractional Calculus, and Their Applications, pp. 139-152. Ellis Horwood, Chichester (1989)

    Google Scholar 

  4. Atici, FM, Sengul, SS: Modeling with discrete fractional equations. J. Math. Anal. Appl. 369, 1-9 (2010)

    MathSciNet  Article  MATH  Google Scholar 

  5. Abdeljawad, T, Baleanu, D: Caputo q-fractional initial value problems and a q-analogue Mittag-Leffler function. Commun. Nonlinear Sci. Numer. Simul. 16(12), 4682-4688 (2011). doi:10.1016/j.cnsns.2011.01.026

    MathSciNet  Article  MATH  Google Scholar 

  6. Abdeljawad, T, Baleanu, D: Fractional differences and integration by parts. J. Comput. Anal. Appl. 13(3), 574-582 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Atici, FM, Eloe, PW: A transform method in discrete fractional calculus. Int. J. Difference Equ. 2(2), 165-176 (2007)

    MathSciNet  Google Scholar 

  8. Atici, FM, Eloe, PW: Initial value problems in discrete fractional calculus. Proc. Am. Math. Soc. 137(3), 981-989 (2009)

    MathSciNet  Article  MATH  Google Scholar 

  9. Atici, FM, Sengul, S: Modeling with fractional difference equations. J. Math. Anal. Appl. 369(1), 1-9 (2010)

    MathSciNet  Article  MATH  Google Scholar 

  10. Atici, FM, Eloe, PW: Two-point boundary value problems for finite fractional difference equations. J. Differ. Equ. Appl. 17, 445-456 (2011)

    MathSciNet  Article  MATH  Google Scholar 

  11. Bastos, NRO, Ferreira, RAC, Torres, DFM: Necessary optimality conditions for fractional difference problems of the calculus of variations. Discrete Contin. Dyn. Syst. 29(2), 417-437 (2011)

    MathSciNet  Article  MATH  Google Scholar 

  12. Cheng, J, Chu, Y: On the fractional difference equations of order \((2, q)\). Abstr. Appl. Anal. 2011, Article ID 497259 (2011). doi:10.1155/2011/497259

    MathSciNet  Google Scholar 

  13. Cheng, J: The solution of fractional difference equations of order \((k, q)\). Acta Math. Appl. Sin. 34(2), 313-330 (2011)

    MathSciNet  MATH  Google Scholar 

  14. Cheng, J, Chu, Y: Fractional difference equations with real variable. Abstr. Appl. Anal. 2012, Article ID 918529 (2012)

    MathSciNet  Google Scholar 

  15. Goodrich, CS: Solutions to a discrete right-focal fractional boundary value problem. Int. J. Difference Equ. 5, 195-216 (2010)

    MathSciNet  Google Scholar 

  16. Goodrich, CS: Continuity of solutions to discrete fractional initial value problems. Comput. Math. Appl. 59(11), 3489-3499 (2010)

    MathSciNet  Article  MATH  Google Scholar 

  17. Jarad, F, Abdeljawad, T, Baleanu, D: On the stability of some discrete fractional nonautonomous systems. Abstr. Appl. Anal. 2012, Article ID 476581 (2012)

    MathSciNet  Google Scholar 

  18. Hirota, R: Lectures on Difference Equations. Science-sha, Tokyo (2000) (in Japanese)

    Google Scholar 

  19. Nagai, A: An integrable mapping with fractional difference. J. Phys. Soc. Jpn. 72, 2181-2183 (2003)

    MathSciNet  Article  MATH  Google Scholar 

  20. Deekshitulu, GVSR, Jagan Mohan, J: Fractional difference inequalities. Commun. Appl. Anal. 14, 89-97 (2010)

    MathSciNet  MATH  Google Scholar 

  21. Deekshitulu, GVSR, Jagan Mohan, J: Fractional difference inequalities of Bihari type. Commun. Appl. Anal. 14, 343-354 (2010)

    MathSciNet  MATH  Google Scholar 

  22. Deekshitulu, GVSR, Jagan Mohan, J: Fractional difference inequalities of Opial type and initial value problem. Fract. Differ. Calc. 2, 73-85 (2012)

    MathSciNet  Google Scholar 

  23. Deekshitulu, GVSR, Jagan Mohan, J: Some new fractional difference inequalities. In: ICMMSC 2012. CCIS, vol. 283, pp. 403-412. Springer, Berlin (2012)

    Google Scholar 

  24. Deekshitulu, GVSR, Jagan Mohan, J, Anand, PVS: Fractional difference inequalities of Volterra type. Int. J. Pure Appl. Math. 70, 137-149 (2011)

    MathSciNet  MATH  Google Scholar 

  25. Deekshitulu, GVSR, Jagan Mohan, J: Fractional difference inequalities of Gronwall-Bellman type. Acta Comment. Univ. Tartu Math. 17(1), 19-30 (2013)

    MathSciNet  MATH  Google Scholar 

  26. Atici, FM, Eloe, PW: Discrete fractional calculus with the nabla operator. Electron. J. Qual. Theory Differ. Equ. Special Edition I, 3 (2009)

  27. Atici, FM, Eloe, PW: Gronwall’s inequality on discrete fractional calculus. Comput. Math. Appl. 64, 3193-3200 (2012)

    MathSciNet  Article  MATH  Google Scholar 

  28. Ferreira, RAC: A discrete fractional Gronwall inequality. Proc. Am. Math. Soc. 140, 1605-1612 (2012)

    Article  MATH  Google Scholar 

  29. Cheng, J: The Theory of Fractional Difference Equations. Xiamen University Press, Xiamen (2011) (in Chinese)

    Google Scholar 

  30. Zhang, Y, Huang, J, Xu, X, Yang, Y: A class of discrete fractional Gronwall inequalities. Math. Pract. Theory 6, 222-225 (2014)

    MathSciNet  Google Scholar 

Download references


The authors are very grateful to the anonymous referees for their valuable suggestions and comments, which helped to improve the quality of the paper. The author RX is supported by the National Science Foundation of China (11171178 and 11271225).

Author information



Corresponding author

Correspondence to Run Xu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

RX studied the generalized discrete fractional Gronwall inequalities and completed the corresponding proof. YZ obtained the results of Section 3: Applications. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Xu, R., Zhang, Y. Generalized Gronwall fractional summation inequalities and their applications. J Inequal Appl 2015, 242 (2015).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


  • 39A12
  • 26A33


  • Gronwall’s inequality
  • fractional difference
  • fractional sum
  • fractional difference equation
  • fractional sum equation