Discrete Fractional Calculus (2015)
2. Discrete Delta Fractional Calculus and Laplace Transforms
2.9. Power Rule and Composition Rule
In this section (see Atici and Eloe [34], Holm [123, 125]), we present a number of properties and formulas concerning fractional sum and difference operators are developed. These include composition rules and fractional power rules, whose proofs employ a variety of tools, none of which involves the Laplace transform. However, some of these results may also be proved using the Laplace transform. The following are two previously known results for which the Laplace transform provides a significantly shorter and cleaner proof than the original ones found in [34, 123].
Theorem 2.71 (Power Rule).
Let ν,μ > 0 be given. Then for ![]()

or equivalently
![]()
Proof.
Applying Remark 2.57 together with Lemma 2.63, we conclude that for each ε > 0,
is of exponential order 1 +ε and therefore we have that
is of exponential order 1 + 2ε. Thus, after employing an argument similar to that given in Corollary 2.66, we conclude that both
and
converge for | s + 1 | > 1. Hence, for | s + 1 | > 1, we have

Since the Laplace transform is injective, it follows that

This completes the proof. □
Theorem 2.72.
Suppose that
is of exponential order r ≥ 1, and let ν,μ > 0 be given. Then
![]()
Proof.
Let f, r, ν, and μ be given as in the statement of the theorem. It follows from Corollary 2.66 that each of
![]()
exists for | s + 1 | > r. Therefore, we may apply (2.49) multiple times to write for | s + 1 | > r,

The result follows from symmetry and the fact that the operator
is injective (see Theorem 2.7). □