Indefinite sum

From The Right Wiki
(Redirected from Antidifference)
Jump to navigationJump to search

In discrete calculus the indefinite sum operator (also known as the antidifference operator), denoted by x or Δ1,[1][2] is the linear operator, inverse of the forward difference operator Δ. It relates to the forward difference operator as the indefinite integral relates to the derivative. Thus

Δxf(x)=f(x).

More explicitly, if xf(x)=F(x), then

F(x+1)F(x)=f(x).

If F(x) is a solution of this functional equation for a given f(x), then so is F(x)+C(x) for any periodic function C(x) with period 1. Therefore, each indefinite sum actually represents a family of functions. However, due to the Carlson's theorem, the solution equal to its Newton series expansion is unique up to an additive constant C. This unique solution can be represented by formal power series form of the antidifference operator: Δ1=1eD1.

Fundamental theorem of discrete calculus

Indefinite sums can be used to calculate definite sums with the formula:[3]

k=abf(k)=Δ1f(b+1)Δ1f(a)

Definitions

Laplace summation formula

The Laplace summation formula allows the indefinite sum to be written as the indefinite integral plus correction terms obtained from iterating the difference operator, although it was originally developed for the reverse process of writing an integral as an indefinite sum plus correction terms. As usual with indefinite sums and indefinite integrals, it is valid up to an arbitrary choice of the constant of integration. Using operator algebra avoids cluttering the formula with repeated copies of the function to be operated on:[4] x=+12112Δ+124Δ219720Δ3+3160Δ4 In this formula, for instance, the term 12 represents an operator that divides the given function by two. The coefficients +12, 112, etc., appearing in this formula are the Gregory coefficients, also called Laplace numbers. The coefficient in the term Δn1 is[4] 𝒞nn!=01(xn)dx where the numerator 𝒞n of the left hand side is called a Cauchy number of the first kind, although this name sometimes applies to the Gregory coefficients themselves.[4]

Newton's formula

xf(x)=k=1(xk)Δk1[f](0)+C=k=1Δk1[f](0)k!(x)k+C
where (x)k=Γ(x+1)Γ(xk+1) is the falling factorial.

Faulhaber's formula

xf(x)=n=1f(n1)(0)n!Bn(x)+C,

Faulhaber's formula provides that the right-hand side of the equation converges.

Mueller's formula

If limx+f(x)=0, then[5]

xf(x)=n=0(f(n)f(n+x))+C.

Euler–Maclaurin formula

xf(x)=0xf(t)dt12f(x)+k=1B2k(2k)!f(2k1)(x)+C

Choice of the constant term

Often the constant C in indefinite sum is fixed from the following condition. Let

F(x)=xf(x)+C

Then the constant C is fixed from the condition

01F(x)dx=0

or

12F(x)dx=0

Alternatively, Ramanujan's sum can be used:

x1f(x)=f(0)F(0)

or at 1

x1f(x)=F(1)

respectively[6][7]

Summation by parts

Indefinite summation by parts:

xf(x)Δg(x)=f(x)g(x)x(g(x)+Δg(x))Δf(x)
xf(x)Δg(x)+xg(x)Δf(x)=f(x)g(x)xΔf(x)Δg(x)

Definite summation by parts:

i=abf(i)Δg(i)=f(b+1)g(b+1)f(a)g(a)i=abg(i+1)Δf(i)

Period rules

If T is a period of function f(x) then

xf(Tx)=xf(Tx)+C

If T is an antiperiod of function f(x), that is f(x+T)=f(x) then

xf(Tx)=12f(Tx)+C

Alternative usage

Some authors use the phrase "indefinite sum" to describe a sum in which the numerical value of the upper limit is not given:

k=1nf(k).

In this case a closed form expression F(k) for the sum is a solution of

F(x+1)F(x)=f(x+1)

which is called the telescoping equation.[8] It is the inverse of the backward difference operator. It is related to the forward antidifference operator using the fundamental theorem of discrete calculus described earlier.

List of indefinite sums

This is a list of indefinite sums of various functions. Not every function has an indefinite sum that can be expressed in terms of elementary functions.

Antidifferences of rational functions

xa=ax+C
From which a can be factored out, leaving 1, with the alternative form x0. From that, we have:
xx0=x
For the sum below, remember x=x1
xx=x(x+1)2+C
For positive integer exponents Faulhaber's formula can be used. For negative integer exponents,
x1xa=(1)a+1ψ(a+1)(x)a!+C,a
where ψ(n)(x) is the polygamma function can be used.
More generally,
xxa={ζ(a,x+1)+C1,if a1ψ(x+1)+C2,if a=1
where ζ(s,a) is the Hurwitz zeta function and ψ(z) is the Digamma function. C1 and C2 are constants which would normally be set to ζ(a) (where ζ(s) is the Riemann zeta function) and the Euler–Mascheroni constant respectively. By replacing the variable a with a, this becomes the Generalized harmonic number. For the relation between the Hurwitz zeta and Polygamma functions, refer to Balanced polygamma function and Hurwitz zeta function#Special cases and generalizations.
From this, using aζ(s,a)=sζ(s+1,a), another form can be obtained:
xxa=0xaζ(1a,u+1)du+C, if a1
xBa(x)=(x1)Ba(x)aa+1Ba+1(x)+C

Antidifferences of exponential functions

xax=axa1+C

Particularly,

x2x=2x+C

Antidifferences of logarithmic functions

xlogbx=logb(x!)+C
xlogbax=logb(x!ax)+C

Antidifferences of hyperbolic functions

xsinhax=12csch(a2)cosh(a2ax)+C
xcoshax=12csch(a2)sinh(axa2)+C
xtanhax=1aψea(xiπ2a)+1aψea(x+iπ2a)x+C
where ψq(x) is the q-digamma function.

Antidifferences of trigonometric functions

xsinax=12csc(a2)cos(a2ax)+C,a2nπ
xcosax=12csc(a2)sin(axa2)+C,a2nπ
xsin2ax=x2+14csc(a)sin(a2ax)+C,anπ
xcos2ax=x214csc(a)sin(a2ax)+C,anπ
xtanax=ix1aψe2ia(xπ2a)+C,anπ2
where ψq(x) is the q-digamma function.
xtanx=ixψe2i(x+π2)+C=k=1(ψ(kππ2+1x)+ψ(kππ2+x)ψ(kππ2+1)ψ(kππ2))+C
xcotax=ixiψe2ia(x)a+C,anπ2
xsincx=sinc(x1)(12+(x1)(ln(2)+ψ(x12)+ψ(1x2)2ψ(x1)+ψ(1x)2))+C
where sinc(x) is the normalized sinc function.

Antidifferences of inverse hyperbolic functions

xartanhax=12ln(Γ(x+1a)Γ(x1a))+C

Antidifferences of inverse trigonometric functions

xarctanax=i2ln(Γ(x+ia)Γ(xia))+C

Antidifferences of special functions

xψ(x)=(x1)ψ(x)x+C
xΓ(x)=(1)x+1Γ(x)Γ(1x,1)e+C
where Γ(s,x) is the incomplete gamma function.
x(x)a=(x)a+1a+1+C
where (x)a is the falling factorial.
xsexpa(x)=lna(sexpa(x))(lna)x+C
(see super-exponential function)

See also

References

  1. Man, Yiu-Kwong (1993), "On computing closed forms for indefinite summations", Journal of Symbolic Computation, 16 (4): 355–376, doi:10.1006/jsco.1993.1053, MR 1263873
  2. Goldberg, Samuel (1958), Introduction to difference equations, with illustrative examples from economics, psychology, and sociology, Wiley, New York, and Chapman & Hall, London, p. 41, ISBN 978-0-486-65084-5, MR 0094249, If Y is a function whose first difference is the function y, then Y is called an indefinite sum of y and denoted by Δ1y; reprinted by Dover Books, 1986
  3. "Handbook of discrete and combinatorial mathematics", Kenneth H. Rosen, John G. Michaels, CRC Press, 1999, ISBN 0-8493-0149-1
  4. 4.0 4.1 4.2 Merlini, Donatella; Sprugnoli, Renzo; Verri, M. Cecilia (2006), "The Cauchy numbers", Discrete Mathematics, 306 (16): 1906–1920, doi:10.1016/j.disc.2006.03.065, MR 2251571
  5. Markus Müller. How to Add a Non-Integer Number of Terms, and How to Produce Unusual Infinite Summations Archived 2011-06-17 at the Wayback Machine (note that he uses a slightly alternative definition of fractional sum in his work, i.e. inverse to backwards difference, hence 1 as the lower limit in his formula)
  6. Bruce C. Berndt, Ramanujan's Notebooks Archived 2006-10-12 at the Wayback Machine, Ramanujan's Theory of Divergent Series, Chapter 6, Springer-Verlag (ed.), (1939), pp. 133–149.
  7. Éric Delabaere, Ramanujan's Summation, Algorithms Seminar 2001–2002, F. Chyzak (ed.), INRIA, (2003), pp. 83–88.
  8. Algorithms for Nonlinear Higher Order Difference Equations, Manuel Kauers

Further reading