Indefinite sum

{{Short description|Inverse of a finite difference}} In the calculus of finite differences, the '''indefinite sum''' (or '''antidifference''' operator), denoted by <math display="inline">\sum_x</math> or <math>\Delta^{-1}</math>,<ref>{{citation | last = Man | first = Yiu-Kwong | doi = 10.1006/jsco.1993.1053 | issue = 4 | journal = Journal of Symbolic Computation | mr = 1263873 | pages = 355–376 | title = On computing closed forms for indefinite summations | volume = 16 | year = 1993}}</ref><ref name="Goldberg1958">{{cite book | last = Goldberg | first = Samuel | title = Introduction to Difference Equations, with Illustrative Examples from Economics, Psychology, and Sociology | date = 1986 | orig-date = 1958 | publisher = Dover Publications | location = New York | page = 41 | isbn = 978-0-486-65084-5 | mr = 0094249 | url = https://books.google.com/books?id=QUzNwiVpWGAC&pg=PA41 | quote = If <math>Y</math> is a function whose first difference is the function <math>y</math>, then <math>Y</math> is called an indefinite sum of <math>y</math> and denoted by <math>\Delta^{-1}y</math>. }}</ref> is the linear operator that inverts the forward difference operator <math>\Delta f(x) = f(x+1)-f(x).</math> That is, if <math>\sum_x f(x) = F(x)</math>, then <math>F</math> satisfies the functional equation

:<math>F(x+1) - F(x) = f(x),</math>

so that applying the forward difference recovers the original function:<ref name="KelleyPeterson2001">{{cite book |last1=Kelley |first1=Walter G. |last2=Peterson |first2=Allan C. |title=Difference Equations: An Introduction with Applications |publisher=Academic Press |year=2001 |isbn=0-12-403330-X |page=20}}</ref> <math>\Delta \sum_x f(x) = f(x).</math> The operator thus plays the same role for finite differences that the indefinite integral plays for the derivative.

An indefinite sum is not unique: adding any 1-periodic function <math>C(x)</math> (satisfying <math>C(x+1)=C(x)</math>), the function <math>F(x)+C(x)</math> is also a solution. Therefore, an indefinite sum is unique up to a 1-periodic function <math>C(x)</math> instead of up to a constant <math>C</math> as the indefinite integral is.

To obtain the unique solution up to a constant <math>C</math>, one must impose additional analytic constraints. The '''Nørlund principal solution''' is the unique analytic solution that has the minimal possible exponential type (that is, its growth in the imaginary direction on the complex plane is the minimal possible), filtering out any non-constant periodic component.<ref name="Hauptlösung"/> Other methods include higher-order convexity conditions in real analysis, or using axioms and complex analysis to step back the function's behavior from a neighborhood of infinity in which it behaves polynomially.

For integer arguments, the indefinite sum naturally extends ordinary summation, turning a discrete sum into a continuous function. Many such extensions are well-known special functions.

== Forward and backward difference conventions ==

314x314px| thumb|A comparison of the indefinite sum operators to their discrete counterparts. The inverse backward difference of x is shown in yellow, and the inverse forward difference of x is shown in blue (both with respect to x).

The inverse forward difference operator, <math>\Delta^{-1}</math> (<math>F(x+1)-F(x)=f(x)</math>), extends the summation up to <math>x-1</math>, typically starting with the iterator at <math>0</math>: :<math>\,\sum_{k=0}^{x-1} f(k).</math>

Some authors analytically extend summation for which the upper limit is the argument without a shift, typically starting the iterator at <math>1</math>:<ref name="MüllerSchleicher2011" /><ref name="Candelpergher2017_p3" /><ref name="Candelpergher2017_p23" /> :<math>\,\sum_{k=1}^x f(k).</math> In this case, the analytic continuation, <math>F(x)</math>, for the sum is a solution of <math>\nabla^{-1} f(x)</math>. Stated explicitly, that is: :<math>\ F(x)-F(x-1) = f(x),</math> Which follows from the discrete counterpart: :<math>\sum_{k=1}^{x} f(k) - \sum_{k=1}^{x-1} f(k) = f(x).</math> Some authors use the equivalent form called the '''telescoping equation''':<ref>[http://www.risc.uni-linz.ac.at/people/mkauers/publications/kauers05c.pdf Algorithms for Nonlinear Higher Order Difference Equations], Manuel Kauers</ref> :<math> F(x+1) - F(x) = f(x+1). </math> The lower bounds of the discrete analog for both inverse forward difference and inverse backward difference can be an arbitrary constant other than those listed here, as it is absorbed into the height of the 1-periodic or constant term <math>C</math>.

==Fundamental theorem of the calculus of finite differences==

Indefinite sums can be used to calculate definite sums with the formula:<ref>"Handbook of discrete and combinatorial mathematics", Kenneth H. Rosen, John G. Michaels, CRC Press, 1999, {{ISBN|0-8493-0149-1}}</ref> :<math>\sum_{k=a}^b f(k)=\Delta^{-1}f(b+1)-\Delta^{-1}f(a).</math>

Alternatively, using the inverse backward difference operator, the relation is:

:<math>\sum_{k=a}^b f(k)=\nabla^{-1}f(b)-\nabla^{-1}f(a-1).</math>

==Examples== {{main|List of indefinite sums}} The following basic indefinite sums follow from the fundamental properties of the difference operator, where <math>C(x)</math> represents an arbitrary 1-periodic function (or a constant if the Nørlund principal solution is assumed):<ref name="JordanTable">{{cite book |last1=Jordan |first1=Charles |title=Calculus of Finite Differences |date=1960 |publisher=Chelsea Publishing Company |location=New York, NY |pages=104-107 |edition=Second |url=https://archive.org/details/calculusoffinite0000unse/page/104/mode/2up}}</ref>

:Constant: :<math>\sum_x c = cx + C(x)</math> :Exponential: :<math>\sum_x a^x = \frac{a^x}{a-1} + C(x) \quad a \neq 1</math> :Logarithm: :<math>\sum_x \ln x = \ln \Gamma(x) + C(x)</math> :Powers:<ref name="CandelpergherListCitations"/> :<math>\sum _x x^a = \begin{cases} \frac{B_{a+1}(x)}{a+1} + C(x), &\text{if } a\neq-1 \\ \psi(x)+C(x), &\text{if } a=-1 \end{cases} = \begin{cases} - \zeta(-a, x) +C(x), &\text{if } a\neq-1 \\ \psi(x)+C(x), &\text{if } a=-1 \end{cases}</math> where <math>B_a(x)</math> are the Bernoulli polynomials (via Abel-Plana, Hurwitz zeta, or as defined by their recurrence; not the definition by generating functions), <math>\zeta(s,a)</math> is the Hurwitz zeta function, and <math>\psi(z)</math> is the digamma function. This is related to the generalized harmonic numbers. Combined with series expansions (such as Taylor series) or partial fraction decomposition, the power formula allows the indefinite summation of many analytic functions and rational functions (term-wise, through the linearity of the operator).

===Falling factorials=== {{main|Falling and rising factorials}}

Falling factorials provide the discrete analog of the power rule from differential calculus. In infinitesimal calculus, <math>\frac{d}{dx} x^n = n x^{n-1}</math>. In the calculus of finite differences, the falling factorial

:<math>(x)_n = x^{\underline{n}} = x(x-1)(x-2)\cdots(x-n+1) = \frac{\Gamma\left(x+1\right)}{\Gamma\left(x-n+1\right)}</math>

plays the role of <math>x^n</math>, and the forward difference operator satisfies

:<math>\Delta (x)_n = n (x)_{n-1}.</math>

The indefinite sum of a falling factorial is given by the discrete analog of the power rule for integration:

:<math>\sum_x (x)_n = \frac{(x)_{n+1}}{n+1} + C(x),\quad n \neq -1.</math>

Equivalently, using the Gamma function:

:<math>\sum_x \frac{\Gamma\left(x+1\right)}{\Gamma\left(x-n+1\right)} = \frac{\Gamma\left(x+1\right)}{\left(n+1\right)\Gamma\left(x-n\right)} + C(x),\quad n \neq -1.</math>

For the case where <math>n=-1</math>, the solution is the digamma function with a shift, <math>\psi\left(x+1\right)+C(x)</math>, which naturally extends the harmonic numbers.

<div style="margin: 1em 2em 0 2em; border: 1px solid #dca9a9; padding: 0.4em;"> '''Example:''' Sum of the first <math>x</math> squares. Using <math>k^2 = (k)_2 + (k)_1</math> and the indefinite sum formula above,

:<math>\sum_k k^2 = \frac{(k)_3}{3} + \frac{(k)_2}{2} + C(k).</math>

Applying the fundamental theorem of the calculus of finite differences,

:<math>\begin{align} \sum_{k=0}^x k^2 &= \left. \left( \frac{(k)_3}{3} + \frac{(k)_2}{2} \right) \right|_{0}^{x+1} \\ &= \left( \frac{(x+1)_3}{3} + \frac{(x+1)_2}{2} \right) - \left( \frac{(0)_3}{3} + \frac{(0)_2}{2} \right) \\ &= \frac{(x+1)_3}{3} + \frac{(x+1)_2}{2}. \end{align}</math>

Expanding the falling factorials, :<math>(x+1)_3 = (x+1)x(x-1),\quad (x+1)_2 = (x+1)x,</math> and simplifying yields the formula :<math>\sum_{k=0}^x k^2 = \frac{x(x+\frac{1}{2})(x+1)}{3}.</math> </div>

===Summation by parts=== {{main|Summation by parts}} Indefinite summation by parts is the discrete analog of integration by parts. It is derived from the product rule for the forward difference operator.

'''Product rule.''' For two functions <math>u(x)</math> and <math>v(x)</math>, the product rule for the forward difference is: :<math>\Delta(u(x)v(x)) = u(x)\Delta v(x) + v(x+1)\Delta u(x).</math> Introducing the '''shift operator''' <math>\mathrm{E}</math>, defined by <math>\mathrm{E}f(x) = f(x+1)</math>, this can be written more compactly as: :<math>\Delta(uv) = u\Delta v + \mathrm{E}v\,\Delta u.</math>

'''Summation by parts.''' Rearranging the product rule gives: :<math>u(x)\Delta v(x) = \Delta(u(x)v(x)) - v(x+1)\Delta u(x).</math> Taking the indefinite sum of both sides and using the fact that <math>\sum_x \Delta F(x) = F(x) + C(x)</math> (where <math>C(x)</math> is an arbitrary 1‑periodic function) yields the formula for summation by parts:<ref name="KelleyPeterson2001p24">{{cite book |last1=Kelley |first1=Walter G. |last2=Peterson |first2=Allan C. |title=Difference Equations: An Introduction with Applications |publisher=Academic Press |year=2001 |isbn=0-12-403330-X |page=24}}</ref><ref name="JordanTable"/> :<math>\sum_x u(x)\Delta v(x) = u(x)v(x) - \sum_x v(x+1)\Delta u(x) + C(x).</math>

A symmetrical form, also obtained from the product rule, is: :<math>\sum_x f(x)\Delta g(x) + \sum_x g(x)\Delta f(x) = f(x)g(x) - \sum_x \Delta f(x)\Delta g(x) + C(x).</math>

'''Definite summation by parts.''' For definite sums from <math>a</math> to <math>b</math>, the formula becomes: :<math>\sum_{k=a}^{b} u(k)\Delta v(k) = \bigl[u(b+1)v(b+1) - u(a)v(a)\bigr] - \sum_{k=a}^{b} v(k+1)\Delta u(k).</math>

<div style="margin: 1em 2em 0 2em; border: 1px solid #dca9a9; padding: 0.4em;"> '''Example:''' product of a polynomial and an exponential<ref name="Jordan1960"/>

Summation by parts is effective for functions like <math>k2^k</math>. To find the indefinite sum <math>\textstyle\sum_k k2^k</math>, let <math>u(k) = k</math> and <math>\Delta v(k) = 2^k</math>. Then:

* <math>\Delta u(k) = (k+1)-k = 1</math> * <math>v(k) = \sum_k 2^k = \frac{2^k}{2-1} = 2^k</math> * <math>\mathrm{E}v(k) = v(k+1) = 2^{k+1}</math>

Applying the summation by parts formula: :<math>\sum_k k2^k = k \cdot 2^k - \sum_k 2^{k+1} \cdot 1 + C(k).</math> The remaining sum is elementary: :<math>\sum_k 2^{k+1} = 2\sum_k 2^k = 2\cdot 2^k = 2^{k+1}.</math> Hence the indefinite sum (antidifference) is :<math>F(k) := \sum_k k2^k = k2^k - 2^{k+1} + C(k) = (k-2)2^k + C(k).</math>

To evaluate the definite sum from <math>0</math> to <math>x</math>, we use the fundamental theorem with the forward difference inverse: :<math>\sum_{k=0}^{x} k2^k = F(x+1) - F(0).</math> Substituting the expression for <math>F</math>: :<math>\begin{align} \sum_{k=0}^{x} k2^k &= \bigl[(x+1-2)2^{x+1}\bigr] - \bigl[(0-2)2^{0}\bigr] \\ &= (x-1)2^{x+1} - (-2) \\ &= (x-1)2^{x+1} + 2. \end{align}</math> Thus, for any non‑negative integer <math>x</math>, :<math>\sum_{k=0}^{x} k2^k = (x-1)2^{x+1} + 2.</math> </div>

==Uniqueness of the principal solution== thumb|Visualization of the property ΔC(x)=0 for a 1-periodic function C(x). Because C(x+1)=C(x), the forward difference C(x+1)-C(x) and backward difference C(x)-C(x-1) both vanish. The functional equation <math>F(x+1) - F(x) = f(x)</math> does not have a unique solution. If <math>F_1(x)</math> is a particular solution, then for any function <math>C(x)</math> satisfying <math>C(x+1) = C(x)</math> (i.e., any 1-periodic function), the function <math>F_2(x) = F_1(x) + C(x)</math> is also a solution. Therefore, the indefinite sum operator defines a family of functions differing by an arbitrary 1-periodic component, <math>C(x)</math>.

To select the unique principal solution (German: Hauptlösung)<ref name="Hauptlösung">{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |pages=40–44 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref> up to an additive constant <math>C</math> (instead of up to the additive 1-periodic function <math>C(x)</math>) one must impose additional constraints. ===Complex analysis (exponential type)=== Following the theory developed by Niels Erik Nørlund,<ref name="Hauptlösung"/> the indefinite sum can be uniquely determined for analytic functions by imposing restriction on their growth in the complex plane. Specifically, by imposing minimal growth, the non-constant periodic terms can be filtered out.

thumb|Partitioning the complex plane for the inverse finite difference of <math>1/(x^2+1)</math>.

The usual formulation assumes that the summand <math>f(z)</math> is analytic in a vertical strip containing a portion of the real line. However, when <math>f(z)</math> has singularities (including those extending into the imaginary direction), a single vertical strip cannot contain the entire real axis. Instead, these singularities create vertical boundaries that split the domain into disjoint connected components. For example, poles at <math>\pm i</math> prevent a single strip from crossing the imaginary axis, splitting the domain at <math>\Re(z) = 0</math> into disjoint connected half-planes.

Nørlund’s theory provides a principal solution in each connected component that contains a segment of the real line. While these infinite vertical strips can be shifted horizontally to evaluate the function, they cannot cross the singularities without the recurrence relation causing the singularities to repeat (e.g. digamma). Thus, each connected component's principal solution contains no singularities in its respective connective component, but contains singularities that recur outwards into outer disjoint connected components.

The solution that contains the largest defined portion of the discrete sum being extended is then considered the disjoint connected component defining the canonical principal solution. This usually becomes, in practice, the right half-plane.

Suppose <math>f(z)</math> is analytic in a vertical strip containing a segment of the real axis, and let <math>F(z)</math> be an analytic solution of <math>F(z+1)-F(z)=f(z)</math> in that strip. To ensure uniqueness within that strip, require <math>F(z)</math> to be of minimal growth, specifically to be of exponential type less than <math>2\pi</math> in the imaginary direction. That is, there exist constants <math>M>0</math> and <math>\epsilon>0</math> such that <math>|F(z)| \leq M e^{(2\pi-\epsilon)|\Im(z)|}</math> as <math>|\Im(z)| \to \infty</math>.<ref name="NIST_DLMF_2.10" /><ref name="Olver1997"/>

Let <math>F_1(z)</math> and <math>F_2(z)</math> be two analytic solutions satisfying this growth condition on the same connected component. Their difference <math>C(z)=F_1(z)-F_2(z)</math> is then analytic, 1-periodic (i.e., <math>C(z+1)=C(z)</math>), and inherits the same exponential type less than <math>2\pi</math>.

Nørlund uses a fundamental result in complex analysis (related to Carlson's theorem, the Phragmén–Lindelöf principle, and the Paley–Wiener theorem) which states that a non-constant periodic entire function must have exponential type at least <math>2\pi</math>.<ref name="Hauptlösung"/> This follows from its Fourier series expansion: if <math>C(z)</math> is non-constant, its Fourier series contains a term <math>a_n e^{2\pi i n z}</math> with <math>n\neq 0</math>, which has type <math>2\pi|n| \geq 2\pi</math>. Since <math>C(z)</math> has type strictly less than <math>2\pi</math>, it cannot contain any such term and therefore must be constant. Hence, on any fixed connected component where the growth condition holds, the solution is unique up to a constant.

The exponential type less than <math>2\pi</math> in the imaginary direction on <math>f</math> condition is sufficient but not strictly necessary. Nørlund's general definition of the principal solution is the analytic solution <math>F</math> having Fourier components of the minimal possible exponential type for the given <math>f</math> (<math>F</math> of slowest possible growth in the complex plane).<ref name="Hauptlösung"/> If <math>f</math> has exponential type <math>k</math> in imaginary direction, then the principal solution <math>F(z)</math> will also have type <math>k</math> in that strip, provided it converges. For example, <math>f(z)=\sin(7z)</math> has exponential type <math>7</math>; its principal solution exists and has type <math>7</math>, even though <math>7>2\pi</math>.<ref name="Ergänzungssatz"/><ref name="JordanTable"/>

When <math>f</math> has exponential type exactly <math>2\pi n</math> for some non-zero integer <math>n</math> in every strip where it is analytic (e.g. <math>f(z)=\sin(2\pi n z)</math> has type <math>2\pi n</math>; its antidifference contains <math>\sin(\pi n)=0</math> in the denominator<ref name="JordanTable"/>) the principal solution fails to exist (or is undefined everywhere) because it resonates with the kernel of the difference operator:<ref name="Steffensen1950"/><ref name="MT_Bernoulli"/><ref name="NörlundBernoulli"/> <math display="block"> \Delta^{-1} = \frac{1}{e^{D}-1}. </math> In all other cases (i.e., when <math>f</math> is meromorphic and on some vertical strip that contains a segment of the real line and its exponential type is not an integer multiple of <math>2\pi</math>) the principal solution exists and is uniquely determined (up to a constant) on that connected component. Different components may give distinct branches; the canonical branch is the one analytic on the component containing the positive integers.

<div style="margin: 1em 2em 0 2em; border: 1px solid #dca9a9; padding: 0.4em;"> '''Example:''' Partitioning disjoint connected components (<math>\nabla^{-1}</math>)<br/> Consider the meromorphic function <math>f(x) = 1/(x^2+1)</math>. Its poles at <math>x = \pm i</math> split the complex plane into two maximal vertical strips that each contain a segment of the real line: the right half-plane <math>\Re(x) > 0</math> and the left half-plane <math>\Re(x) < 0</math>. We construct the Nørlund principal solution of the backward difference equation <math>F(x)-F(x-1) = f(x)</math> with empty-sum normalization <math>F(0)=0</math> on each strip.

'''Right half-plane (<math>\Re(x) > 0</math>).''' Partial fractions give :<math>\frac{1}{x^2+1} = \frac{1}{2i}\!\left(\frac{1}{x-i} - \frac{1}{x+i}\right).</math> The digamma function satisfies <math>\psi(z+1)-\psi(z) = 1/z</math> for all <math>z \notin \{0,-1,-2,\dots\}</math>. For <math>\Re(x) > 0</math> the arguments <math>x+1\pm i</math> and <math>1\pm i</math> never hit a non-positive integer, so the identity is valid at every term of the sum: :<math>\sum_{k=1}^x \frac{1}{k^2+1} = \frac{1}{2i}\Bigl[\bigl(\psi(x+1-i)-\psi(1-i)\bigr) - \bigl(\psi(x+1+i)-\psi(1+i)\bigr)\Bigr].</math> Because <math>\psi(\overline{z}) = \overline{\psi(z)}</math>, the two terms are complex conjugates, and the expression simplifies to a real function: :<math>F_{\text{right}}(x) = \operatorname{Im}\psi(1+i) - \operatorname{Im}\psi(x+1+i), \qquad \Re(x) > 0.</math> The non-simplified function is analytic on the whole right half-plane, and <math>F_{\text{right}}(0)=0</math>. Within this strip the difference equation <math>F(x)-F(x-1)=1/(x^2+1)</math> holds for every <math>x</math> in the respective connected component (half-plane). If one attempts to continue <math>F_{\text{right}}</math> across the imaginary axis by the recurrence <math>F(x+1)=F(x)+f(x+1)</math>, poles appear at <math>x = \pm i-1, \pm i-2, \dots</math>-integer shifts of the original singularities that lie in the left half-plane.

'''Left half-plane (<math>\Re(x) < 0</math>).''' Using the reflection <math>x\mapsto -x</math>, the analogous solution on the left half-plane is :<math>F_{\text{left}}(x) = \operatorname{Im}\psi(-x+i) - \operatorname{Im}\psi(i), \qquad \Re(x) < 0.</math> For <math>\Re(x) < 0</math> the argument <math>-x+i</math> has a positive real part, so it never equals <math>0,-1,-2,\dots</math>; the digamma identity applies and the difference equation is satisfied for all <math>x</math> in the strip. Again the non-simplified function is analytic on the whole left half-plane. Extending this solution to the right via the recurrence would introduce poles at <math>x = \pm i, \pm i+1, \pm i+2, \dots</math>, which lie in the right half-plane outside the original strip.

'''Summary:'''

{| class="wikitable" |- ! Domain !! Principal solution (inverse backward difference, <math>F(0)=0</math>) |- | <math>\Re(x) > 0</math> || <math>\operatorname{Im}\psi(1+i) - \operatorname{Im}\psi(x+1+i)</math> |- | <math>\Re(x) < 0</math> || <math>\operatorname{Im}\psi(-x+i) - \operatorname{Im}\psi(i)</math> |}

The two expressions are analytic on their respective strips and give distinct principal solutions. The poles of the digamma function, which would violate the identity <math>\psi(z+1)-\psi(z)=1/z</math>, are never reached inside the respective domains. However, the recurrence propagates the original singularities of <math>f</math> by integer steps, so any attempt to analytically continue one branch into the other component introduces poles. </div>

=== Real analysis (higher‑order convexity) ===

In real analysis, the uniqueness condition can be given using higher‑order convexity, generalizing the Bohr-Mollerup theorem. For an integer <math>p\ge 0</math>, a function is called <math>p</math>-convex if its divided differences of order <math>p</math> are non‑negative, and <math>p</math>-concave if those divided differences are non-positive. A function is called eventually <math>p</math>-convex (resp. eventually <math>p</math>-concave) if there exists <math>M>0</math> such that it is <math>p</math>-convex (resp. <math>p</math>-concave) on the interval <math>(M,\infty)</math>.

Marichal and Zenaïdi proved the following uniqueness theorem, their method requiring the solution to be eventually <math>p</math>-convex or <math>p</math>-concave.<ref name="MarichalTutorial">{{cite journal |last1=Marichal |first1=Jean‑Luc |last2=Zenaïdi |first2=Naïm |title=A generalization of Bohr‑Mollerup's theorem for higher order convex functions: a tutorial |journal=Aequationes Mathematicae |volume=98 |issue=2 |pages=455–481 |year=2024 |doi=10.1007/s00010-023-00968-9 |arxiv=2207.12694}}</ref><ref name="MarichalBook">{{cite book |last1=Marichal |first1=Jean‑Luc |last2=Zenaïdi |first2=Naïm |title=A Generalization of Bohr‑Mollerup's Theorem for Higher Order Convex Functions |series=Developments in Mathematics |volume=70 |publisher=Springer |year=2022 |doi=10.1007/978-3-030-95088-0 |isbn=978-3-030-95087-3 |url=https://link.springer.com/book/10.1007/978-3-030-95088-0}}</ref>

'''Theorem.''' Let <math>p\ge 0</math> be an integer and let <math>g:\mathbb{R}_+\to\mathbb{R}</math> satisfy <math>\lim_{n\to\infty}\Delta^p g(n)=0</math>. If <math>f:\mathbb{R}_+\to\mathbb{R}</math> is an eventually <math>p</math>-convex or eventually <math>p</math>-concave solution of <math>\Delta f = g</math>, then <math>f</math> is uniquely determined up to an additive constant. Moreover, for any <math>x>0</math>,

:<math>f(x) = f(1) + \lim_{n\to\infty}\left( \sum_{k=1}^{n-1} g(k) - \sum_{k=0}^{n-1} g(x+k) + \sum_{j=1}^p \binom{x}{j} \Delta^{\,j-1} g(n) \right),</math>

and the convergence is uniform on bounded subsets of <math>\mathbb{R}_+</math>.

===Müller–Schleicher axiomatic method=== In their paper ''How to Add a Noninteger Number of Terms'',<ref name="MüllerSchleicher2011">Markus Müller and Dierk Schleicher, [https://arxiv.org/abs/1001.4695 How to Add a Noninteger Number of Terms: From Axioms to New Identities], Amer. Math. Mon. 118(2), 136-152 (2011).</ref> Müller and Schleicher introduced an axiomatic approach to fractional summation with a real or complex number of terms. Their method extends the classical discrete sum

:<math>\sum_{k=1}^x f(k)</math>

to non-integer and complex upper limits <math>x</math>. The definition is built upon six natural axioms:

# Continued Summation: <math>\sum_{\nu = x}^{y}f(\nu) + \sum_{\nu = y + 1}^{z}f(\nu) = \sum_{\nu = x}^{z}f(\nu)</math>. # Translation Invariance: <math>\sum_{\nu = x + s}^{y + s}f(\nu) = \sum_{\nu = x}^{y}f(\nu + s)</math>. # Linearity: <math>\sum_{\nu = x}^{y}(\lambda f(\nu) + \mu g(\nu)) = \lambda \sum_{\nu = x}^{y}f(\nu) + \mu \sum_{\nu = x}^{y}g(\nu)</math>. # Empty Sum Condition: <math>\sum_{\nu = 1}^{1}f(\nu) = f(1)</math> (equivalent to the empty sum condition). # Holomorphy for Monomials: for each <math>d \in \mathbb{N}</math>, <math>z \mapsto \sum_{\nu = 1}^{z} \nu^{d}</math> is holomorphic in <math>\mathbb{C}</math>. # Right-Shift Continuity: if <math>f(z+n) \to 0</math> pointwise as <math>n \to +\infty</math>, then <math>\sum_{\nu = x}^{y} f(\nu+n) \to 0</math>; more generally, if <math>f(z+n)</math> can be approximated by polynomials <math>p_n(z+n)</math> of fixed degree with <math>|f(z+n) - p_n(z+n)| \to 0</math>, then: ::<math>\left| \sum_{\nu = x}^{y} f(\nu+n) - \sum_{\nu = x}^{y} p_n(\nu+n) \right| \to 0</math>.

Axioms S1–S4 force the sum to align with the ordinary finite sum when the limits are integers. Axiom S5 forces monomials to behave the same way under the generalization of fractional sums. Axiom S6 is the crucial axiom which allows one to "step back" the asymptotic region to determine the fractional sum in a finite interval. The exact conditions for the method to work are, as stated in the '''Definition 1.2''' of the paper:

<blockquote> Let <math>U \subset \mathbb{C}</math> and <math>\sigma \in \mathbb{N} \cup \{-\infty\}</math>. A function <math>f:U \rightarrow \mathbb{C}</math> will be called '''''fractional summable of degree''''' <math>\sigma</math> if the following conditions are satisfied: * <math>x+1 \in U</math> for all <math>x \in U;</math> * there exists a sequence of polynomials <math>(p_n)_{n \in \mathbb{N}}</math> of fixed degree <math>\sigma</math> such that for all <math>x \in U</math> :<math>|f(n+x)-p_n(n+x)| \rightarrow 0</math> as <math>n \rightarrow +\infty</math> * for every <math>x,y+1 \in U,</math> the limit :<math>\lim_{n\to\infty} \left( \sum_{\nu=n+x}^{n+y} p_n(\nu) + \sum_{\nu=1}^{n} \bigl( f(\nu+x-1)-f(\nu+y) \bigr) \right),</math> exists.</blockquote>

In the simplest case when <math>f(t) \to 0</math> as <math>t \to \infty</math> (i.e., the approximating polynomials are zero), this reduces to:

:<math>\nabla^{-1} f(x) = \sum_{k=1}^{x} f(k) = \sum_{n=1}^{\infty} \bigl( f(n) - f(n+x) \bigr) + C</math>

== Symmetry of the principal solution == Following directly from uniqueness, if <math>f(z)</math> is a meromorphic function, one can define a unique analytic solution of the backward difference sum, by imposing the conditions that: * '''Difference Equation''': <math>F(x)-F(x-1)=f(x)</math> * '''Normalization''': <math>F(0)=0</math> (empty sum boundary condition). * '''Growth constraint''': <math>F(z)</math> has the minimal possible exponential type in the imaginary direction. Under these conditions, <math>F(z)</math> satisfies a reflection formula (referred to by Nørlund as Ergänzungssatz, a complementary theorem to uniqueness of the principal solution [Hauptlösung], presenting it as <math>G\left(x-\omega|-\omega\right)=G\left(x|\omega\right),</math><math>F\left(x-\omega|-\omega\right)=F\left(x|\omega\right)</math> where <math>\omega</math> is the span).<ref name="Ergänzungssatz">{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |pages=73-74 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref> From Nørlund’s Ergänzungssatz for the principal solution, one obtains the following symmetry for the inverse backward difference when the summand is odd or even under the condition <math>F(0)=0</math> via direct application (setting <math>\omega=1</math>).

310x310px|thumb|Image of the inverse backward difference of x, where f(x)=x is a simple example odd function. In the real plane, the point symmetry appears as a line symmetry about negative 1 half. === Odd functions === If <math>f</math> is an odd function (<math>f(-z) = -f(z)</math>) and that a principal solution <math>F</math> exists. Define <math>H(x) = F(x) - F(-1-x)</math>. Using the difference equation <math>F(x)-F(x-1)=f(x)</math> and oddness, :<math>\begin{align} H(x)-H(x-1) &= [F(x)-F(x-1)] - [F(-1-x)-F(-x)] \\ &= f(x) - \bigl[-f(-x)\bigr] = f(x)+f(-x)=0, \end{align}</math> so <math>H</math> is 1-periodic. Because <math>F</math> has minimal exponential type, <math>H</math> does as well; by Nørlund’s uniqueness theorem, a non-constant 1-periodic function of type <math><2\pi</math> must be constant. Hence <math>H</math> is constant. Evaluating at <math>x=0</math> with <math>F(0)=0</math> and <math>f(0)=0</math> (oddness) gives <math>F(-1)=0</math>, so <math>H(0)=0</math>. Therefore <math>H\equiv 0</math>, yielding <math>0 = F(x) - F(-1-x),</math> :<math>F(z) = F(-1-z),</math> a point symmetry about <math>z = -1/2</math>. For example, <math>f(z)=z</math> gives <math>F(z)=\frac{z(z+1)}{2}</math>.<ref name="Ergänzungssatz"/>

=== Even functions === If <math>f</math> is an even function (<math>f(-z) = f(z)</math>) with a principal solution <math>F</math>, define <math>H(x) = F(x) + F(-1-x)</math>. Then :<math>\begin{align} H(x)-H(x-1) &= [F(x)-F(x-1)] + [F(-1-x)-F(-x)] \\ &= f(x) + \bigl[-f(-x)\bigr] = f(x)-f(-x)=0, \end{align}</math> so again <math>H</math> is a constant 1-periodic function. Setting <math>x=-1</math> gives the constant: <math>H(-1) = F(-1) + F(0) = F(-1)</math>. Consequently, :<math>F(z) + F(-1-z) = F(-1).</math>

== Relationship to indefinite products == {{Main|Indefinite product}}

In the symbolic method developed by Niels Erik Nørlund and L. M. Milne-Thomson, the indefinite product operator <math>\prod_x</math> serves as the multiplicative analog to the indefinite sum. It is defined by the first order homogeneous equation <math>F(x + 1) = f(x)F(x).</math>

By taking the logarithm of the product formula, one obtains the telescoping identity <math>\Delta \ln F(x) = \ln f(x)</math>.<ref name="NörlundGamma">{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |page=109 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref> This allows the indefinite product to be expressed through an indefinite sum: :<math>\prod_x f(x) = \varpi(x) \exp \left( \sum_x \ln f(x) \right),</math> where <math>\varpi(x)</math> is an arbitrary periodic function of period 1.<ref>{{cite book |last=Milne-Thomson |first=L. M. |title=The Calculus of Finite Differences |publisher=Macmillan and Co. |year=1933 |pages=324–325 |url=https://archive.org/details/calculusoffinite032017mbp/page/324/mode/2up}}</ref> This representation is valid provided a branch of the logarithm can be chosen so that <math>\ln\left(f\left(x\right)\right)</math> is single-valued and its indefinite sum exists. Conversely, an indefinite sum may be represented as the logarithm of an indefinite product: :<math>\sum_x f(x) = \ln \left( \prod_x \exp(f(x)) \right) + C(x).</math>

==Expansions and definitions==

===Newton series=== For an entire function of exponential type less than <math>\ln\left(2\right)</math><ref>{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |page=237 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref> the inverse forward difference operator, <math>\Delta^{-1}f(x)</math>, can be expressed by its Newton series expansion: <ref>Newton, Isaac, (1687). [https://archive.org/details/bub_gb_KaAIAAAAIAAJ/page/n459  ''Principia'', Book III, Lemma V, Case 1]</ref><ref>{{cite journal|url=http://math.colgate.edu/~integers/sjs3/sjs3.pdf|title=Three notes on Ser's and Hasse's representations for the zeta-functions|author=Iaroslav V. Blagouchine|journal=Integers (Electronic Journal of Combinatorial Number Theory)|volume=18A|pages=1–45|date=2018|doi=10.5281/zenodo.10581385 |arxiv=1606.02044}}</ref> :<math>\sum_x f(x)=\sum_{k=1}^\infty \binom{x}k \Delta^{k-1} f\left (0\right)+C(x)=\sum_{k=1}^{\infty}\frac{\Delta^{k-1}f(0)}{k!}(x)_k+C(x).</math>

:<math>(x)_k=\frac{\Gamma(x+1)}{\Gamma(x-k+1)}</math> is the falling factorial.

===Bernoulli‑operator series expansion=== Formally, the inverse forward difference operator can be expressed in terms of the derivative operator <math>D = \frac{d}{dx}</math> using the exponential generating function of the Bernoulli numbers:<ref name="Steffensen1950">{{cite book |last=Steffensen |first=J. F. |title=Interpolation |date=1950 |publisher=Chelsea Publishing Company |location=New York, NY |page=192 |edition=2nd |url=https://archive.org/details/interpolation0000unse/page/192/mode/2up}}</ref><ref name="MT_Bernoulli">{{cite book |last=Milne-Thomson |first=L. M. |title=The Calculus of Finite Differences |publisher=Macmillan and Co. |year=1933 |pages=139–140 |url=https://archive.org/details/calculusoffinite032017mbp/page/139/mode/2up}}</ref><ref name="NörlundBernoulli">{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |pages=142-143 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref>

<math display="block"> \Delta^{-1} = \frac{1}{e^{D}-1} = \sum_{v=0}^{\infty} \frac{B_v}{v!} D^{\,v-1}, </math>

where <math>B_v</math> are the Bernoulli numbers defined by the generating function <math>\frac{t}{e^{t}-1} = \sum_{v=0}^\infty B_v \frac{t^v}{v!}</math>. Under this convention <math>B_1 = -\tfrac12</math>.

If <math>f</math> is a polynomial, only finitely many terms of the series are non-zero as the finite difference of a monomial is a polynomial of one degree lower (following by induction, finitely many terms are required). For <math>f(x)=x^n</math> one obtains the antidifference:<ref name="MT_Bernoulli"/>

where <math>B_n(x)</math> are the Bernoulli polynomials of the first order.<ref name="MT_Bernoulli"/>

If <math>f</math> admits a Maclaurin series expansion <math>f(x)=\sum_{n=0}^{\infty} \frac{f^{(n)}(0)}{n!} x^n</math>, the antidifference of monomials in the series expansion yields the formal series:<ref name="NörlundBernoulli"/>

<math display="block"> \sum_x f(x)= \sum_{n=1}^{\infty} \frac{f^{(n-1)}(0)}{n!} B_n(x) + C(x). </math>

For non‑polynomials this expansion is generally asymptotic.

;Relation to the inverse backward difference If one instead expands the inverse backward difference operator, <math>\nabla^{-1} = \frac{e^{D}}{e^{D}-1}</math> (which extends <math>\sum_{k=1}^x f(k)</math>), it admits to the same expansion, but with <math>B_1 = +\tfrac12</math> in place of <math>B_1 = -\tfrac12</math>.

===Euler–Maclaurin formula=== {{Main|Euler–Maclaurin formula}}

The Euler–Maclaurin formula provides an asymptotic expansion for the inverse backward difference <math>\nabla^{-1}f(x) = \sum_{k=1}^x f(k)</math> when the function is sufficiently smooth. For any positive integer <math>m</math>, one has:<ref name="Candelpergher2017_p3">{{cite web | last=Candelpergher | first=Bernard | title=Ramanujan Summation of Divergent Series | website=HAL Archives Ouvertes | date=2017 | url=https://univ-cotedazur.hal.science/hal-01150208/file/RamanujanSummationSpringer2.pdf | page=3 | access-date=2025-12-07}}</ref><ref name="NIST_DLMF_2.10">{{cite web| url=https://dlmf.nist.gov/2.10#E2 | title=§2.10 Sums and Sequences | publisher=National Institute of Standards and Technology | work=NIST Digital Library of Mathematical Functions | access-date=2025-11-20}}</ref>

<math display="block"> \begin{aligned} \nabla^{-1}f(x) &= \int_{1}^{x} f(t)\,dt + \frac{f(1)+f(x)}{2} \\ &\quad + \sum_{k=2}^{m} \frac{(-1)^k B_k}{k!} \bigl( f^{(k-1)}(x) - f^{(k-1)}(1) \bigr) + R_m(x) + C(x), \end{aligned} </math>

where <math>B_k</math> are the Bernoulli numbers (<math>B_1 = -\tfrac12</math>, <math>B_3 = B_5 = \cdots = 0</math>), and the remainder term is

with <math>b_m(t) = B_m(t - \lfloor t \rfloor)</math> the periodized Bernoulli polynomial. The terms with odd <math>k > 1</math> vanish, so the sum effectively runs only over even indices. Choosing <math>m = 2p</math> gives the form

<math display="block"> \begin{aligned} \nabla^{-1}f(x) &= \int_{1}^{x} f(t)\,dt + \frac{f(1)+f(x)}{2} \\ &\quad + \sum_{k=1}^{p} \frac{B_{2k}}{(2k)!} \bigl( f^{(2k-1)}(x) - f^{(2k-1)}(1) \bigr) + R_{2p}(x) + C(x), \end{aligned} </math>

with the remainder

The formula gives the analytic continuation of the discrete sum.

===Laplace summation (Gregory summation formula)=== Laplace's summation formula, closely related to the Gregory summation formula, can be seen as the discrete counterpart to the Euler–Maclaurin formula. The inverse forward difference <math>\Delta^{-1}f(x)</math>:<ref>[http://mathworld.wolfram.com/BernoulliNumberoftheSecondKind.html Bernoulli numbers of the second kind on Mathworld]</ref><ref>{{cite book |last=Ferraro |first=Giovanni |title=The Rise and Development of the Theory of Series up to the Early 1820s |year=2008 |publisher=Springer Science+Business Media, LLC |page=248 |isbn=978-0-387-73468-2}}</ref><ref name="Jordan1960">{{cite book |last1=Jordan |first1=Charles |title=Calculus of Finite Differences |date=1960 |publisher=Chelsea Publishing Company |location=New York, NY |pages=284-285 |edition=Second |url=https://archive.org/details/calculusoffinite0000unse/page/284/mode/2up}}</ref><ref name="MilneLaplace">{{cite book |last=Milne-Thomson |first=L. M. |title=The Calculus of Finite Differences |publisher=Macmillan and Co. |year=1933 |pages=180-181 |url=https://archive.org/details/calculusoffinite032017mbp/page/180/mode/2up}}</ref>

:<math>\sum _x f(x)=\int_0^x f(t) dt -\sum_{k=1}^\infty \frac{c_k}{k!}\Delta^{k-1}f(x) + C(x) </math>

:where <math>c_k=\int_0^1 (x)_k dx</math> are the Cauchy numbers of the first kind.

:<math>(x)_k=\frac{\Gamma(x+1)}{\Gamma(x-k+1)}</math> is the falling factorial.

Truncating the series after <math>n</math> terms leaves a remainder that can be expressed as an integral of <math>f^{(n)}</math> times a periodic Bernoulli polynomial.<ref name="Jordan1960"/><ref name="MilneLaplace"/> In the notation of Charles Jordan, Gregory's formula is:<ref name="Jordan1960"/>

<math display="block"> \begin{align} \sum_{x=a}^z f(x) &= \int_a^z f(x)\,dx \\ &\quad - \sum_{m=1}^n b_m\bigl[\Delta^{m-1}f(z)-\Delta^{m-1}f(a)\bigr] \\ &\quad - b_n\,(z-a)\,\Delta^n f(\xi), \quad a<\xi<z, \end{align} </math> where the coefficients <math>b_m</math> are the Bernoulli numbers of the second kind. Note the argument is without a shift, aligning with the inverse backward difference.

=== Abel–Plana formula === {{Main|Abel–Plana formula}}

The indefinite sum <math>\nabla^{-1}f(x) = \sum_{k=1}^x f(k)</math> can be analytically continued by applying the standard Abel-Plana formula to the finite sum <math>\sum_{k=1}^n f(k)</math> and then analytically continuing the integer limit <math>n</math> to the variable <math>x</math>. This yields the formula:<ref name="Candelpergher2017_p23">{{cite web | last=Candelpergher | first=Bernard | title=Ramanujan Summation of Divergent Series | website=HAL Archives Ouvertes | date=2017 | url=https://univ-cotedazur.hal.science/hal-01150208/file/RamanujanSummationSpringer2.pdf | page=23 | access-date=2025-12-07}}</ref> <math display="block"> \begin{aligned} \nabla^{-1}f(x) &= \int_{1}^{x}f(t)dt+\frac{f(1)+f(x)}{2} \\ & \quad + i\int_{0}^{\infty}\frac{\left(f(x-it)-f(1-it)\right)-\left(f(x+it)-f(1+it)\right)}{e^{2\pi t}-1}dt + C(x) \end{aligned} </math>

This analytic continuation is valid when the conditions for the original formula are met. The sufficient conditions are:<ref name="NIST_DLMF_2.10" /><ref name="Olver1997">{{cite book | last=Olver | first=Frank W. J. | title=Asymptotics and Special Functions | publisher=A K Peters Ltd. | year=1997 | page=290 | isbn=978-1-56881-069-0}}</ref> # Analyticity: <math>f(z)</math> must be analytic in the closed vertical strip between <math>\Re(z)=1</math> and <math>\Re(z)=\Re(x)</math>. The formula provides the analytic solution up to, but not beyond, the nearest singularities of <math>f</math> to the line <math>\Re(z)=1.</math> # Growth: <math>f(z)</math> must be of exponential type less than <math>2\pi</math> in this strip, satisfying <math>|f(z)| \leq Me^{(2\pi-\epsilon)|\Im(z)|}</math> for some <math>M>0</math>, <math>\epsilon>0</math> as <math>|\Im(z)| \to \infty.</math>

<div style="margin: 1em 2em 0 2em; border: 1px solid #dca9a9; padding: 0.4em;"> <strong>Example:</strong> Step size generalization<br> Let <math>S>0</math> be a real step size and suppose <math>f(z)</math> satisfies the standard Abel–Plana conditions on the appropriate strips. Apply the Abel–Plana formula to the function <math>g(t)=f(St)</math> with upper limit <math>n = x/S + 1</math>: <math display="block"> \begin{aligned} \sum_{k=1}^{x/S+1} f(Sk) &= \int_{1}^{x/S+1} f(St)\,dt + \frac{f(S)+f(x+S)}{2} \\ &\quad + i\int_{0}^{\infty}\frac{f(x+S-iSt)-f(S-iSt)-f(x+S+iSt)+f(S+iSt)}{e^{2\pi t}-1}\,dt. \end{aligned} </math> Now subtract the last term <math>f(x+S)</math> from both sides, because <math>\sum_{k=1}^{x/S+1} f(Sk) = \sum_{k=1}^{x/S} f(Sk) + f(x+S)</math>: <math display="block"> \begin{aligned} \sum_{k=1}^{x/S} f(Sk) &= \int_{1}^{x/S+1} f(St)\,dt + \frac{f(S)+f(x+S)}{2} - f(x+S) \\ &\quad + i\int_{0}^{\infty}\frac{f(x+S-iSt)-f(S-iSt)-f(x+S+iSt)+f(S+iSt)}{e^{2\pi t}-1}\,dt. \end{aligned} </math> Simplify the boundary terms: <math>\tfrac{f(S)+f(x+S)}{2} - f(x+S) = \tfrac{f(S)-f(x+S)}{2}.</math> In the real integral, substitute <math>u = St</math>, <math>dt = du/S</math>, limits <math>t=1\to u=S</math>, <math>t=x/S+1 \to u=x+S</math>: <math display="block"> \int_{1}^{x/S+1} f(St)\,dt = \frac{1}{S}\int_{S}^{x+S} f(u)\,du. </math> The imaginary part is already in a convenient form; by reordering the terms it becomes: <math display="block"> i\int_{0}^{\infty}\frac{\bigl(f(S+iSt)-f(S-iSt)\bigr)-\bigl(f(x+S+iSt)-f(x+S-iSt)\bigr)}{e^{2\pi t}-1}\,dt. </math> Thus we obtain the step size generalization: <math display="block"> \begin{aligned} \nabla^{-1}_{S} f(x) &= \frac{1}{S}\int_{S}^{x+S} f(u)\,du + \frac{f(S)-f(x+S)}{2} \\ &\quad + i\int_{0}^{\infty}\frac{\bigl(f(S+iSt)-f(S-iSt)\bigr)-\bigl(f(x+S+iSt)-f(x+S-iSt)\bigr)}{e^{2\pi t}-1}\,dt \\ &\quad + C(x), \end{aligned} </math> where <math>C(x)</math> is a <math>S</math>-periodic function. The expression satisfies <math>F(x)-F(x-S)=f(x)</math> and, with the empty sum convention <math>F(0)=0</math> (or up to another constant convention; <math>C(x)</math> being a constant function), defines the Nørlund principal solution where the growth condition on <math>f</math> becomes type <math><2\pi/S</math> after the scaling. </div>

==Choice of the constant term== Because the indefinite sum is defined only up to an arbitrary 1-periodic function, the constant <math>C</math> must be fixed by an additional condition. Three common choices are the empty sum condition, an integral mean condition that identifies the result with the classical Bernoulli polynomials, and Ramanujan summation.

=== Empty sum boundary condition === The most direct method forces the indefinite sum to extend the usual discrete sum and to satisfy the empty sum convention. This is the same as <math>\lim_{x\to 0^-}F(x)=0\ \text{or}\ \lim_{x\to 0^+}F(x)=0.</math> 314x314px|thumb|Inverse backward difference of 1/x with respect to x, showing a shifted digamma function. ;Inverse backward difference: <math>\nabla^{-1}f(x)</math> corresponds to <math>\textstyle\sum_{k=1}^{x}f(k)</math>. The convention <math>\left. \nabla^{-1} f(x) \right|_{x=0} = 0</math> makes the sum over an empty interval zero.<ref name="MüllerSchleicher2011"/><ref name="JordanTable"/>

;Inverse forward difference: <math>\Delta^{-1}f(x)</math> corresponds to <math>\textstyle\sum_{k=0}^{x-1}f(k)</math>. The same convention yields <math>\left. \Delta^{-1} f(x) \right|_{x=0} = 0</math>.

These conditions determine the solution uniquely up to an additive constant. For example,<ref name="CandelpergherListCitations">{{cite web | last=Candelpergher | first=Bernard | title=Ramanujan Summation of Divergent Series | website=HAL Archives Ouvertes | date=2017 | url=https://univ-cotedazur.hal.science/hal-01150208/file/RamanujanSummationSpringer2.pdf | pages=18-23 }}</ref> :<math>\nabla^{-1}x^a={H_x^{(-a)}} = \zeta(-a) - \zeta(-a, x+1).</math> Here, <math>\zeta(-a)</math> is the constant <math>C</math> such that <math>F(0)=0</math>.

=== Integral mean condition === In the study of Faulhaber's formula and the Euler–Maclaurin formula, it is convenient to identify the indefinite sum of a monomial with the corresponding Bernoulli polynomial. The Bernoulli polynomials <math>B_n(x)</math> are defined by the generating function :<math>\frac{t e^{x t}}{e^t - 1} = \sum_{n=0}^\infty B_n(x) \frac{t^n}{n!}</math> together with the normalization :<math>\int_0^1 B_n(x)\,dx = 0 \qquad (n \ge 1).</math> This property follows from the difference equation <math>\Delta B_\nu(x) = \nu x^{\nu-1}</math> and the integration formula <math>\int_x^{x+1} B_\nu(z)\,dz = x^\nu</math>, derived by Nørlund<ref name="Nörlund1924p19">{{cite book |last1=Nörlund |first1=Niels Erik |title=Vorlesungen über Differenzenrechnung |publisher=Springer |isbn=978-3-642-50514-0 |page=19 |url=https://link.springer.com/book/10.1007/978-3-642-50824-0}}</ref> and found in standard references.

To match this convention, the constant is fixed by requiring that the solution have zero mean over a unit interval. For the inverse backward difference one may use :<math>\int_{-1}^{0} \bigl(\nabla^{-1}f(x)+C\bigr)\,dx = 0 \quad\text{or}\quad \int_{0}^{1} \bigl(\nabla^{-1}f(x)+C\bigr)\,dx = 0,</math> and for the inverse forward difference :<math>\int_{0}^{1} \bigl(\Delta^{-1}f(x)+C\bigr)\,dx = 0 \quad\text{or}\quad \int_{1}^{2} \bigl(\Delta^{-1}f(x)+C\bigr)\,dx = 0.</math>

'''Example.''' For <math>\Delta^{-1}x = \frac{x(x-1)}{2}+C</math>, the condition <math>\int_0^1 (\Delta^{-1}x)\,dx = 0</math> gives <math>C = \tfrac{1}{12}</math>. Hence <math>\Delta^{-1}x = \frac{x(x-1)}{2}+\frac{1}{12} = \tfrac12 B_2(x)</math> with <math>B_2(x)=x^2-x+\tfrac16</math>, consistent with the Bernoulli normalization.

This normalization is not mandatory; in modern treatments the empty sum condition is usually preferred. This is usually used in context of Bernoulli polynomials, the Hurwitz or Riemann zeta functions, generalized harmonic number function, or when dealing with monomials.

==References== {{reflist}}

==Further reading== * "Difference Equations: An Introduction with Applications", Walter G. Kelley, Allan C. Peterson, Academic Press, 2001, {{ISBN|0-12-403330-X}} * [https://web.archive.org/web/20110617053801/http://www.math.tu-berlin.de/~mueller/HowToAdd.pdf Markus Müller. How to Add a Non-Integer Number of Terms, and How to Produce Unusual Infinite Summations] * [https://arxiv.org/abs/math/0502109 Markus Mueller, Dierk Schleicher. Fractional Sums and Euler-like Identities] * [https://doi.org/10.1134%2FS0361768808020060 S. P. Polyakov. Indefinite summation of rational functions with additional minimization of the summable part. Programmirovanie, 2008, Vol. 34, No. 2.] * "Finite-Difference Equations And Simulations", Francis B. Hildebrand, Prenctice-Hall, 1968

== External links == * [https://homepages.math.uic.edu/~kauffman/DCalc.pdf Brian Hamrick: Discrete Calculus] (PDF, 70 kB) * [https://www.desmos.com/calculator/anih6sjvmb?backgroundColor=bbb&textColor=235656&invertedColors Interactive visualization] of the Nörlund principal solution for inverse backward differences. Implements Candelpergher's analytic continuation (Abel-Plana formula with recurrence) for visualizing Nörlund's principal solution.

{{DEFAULTSORT:Indefinite Sum}} Category:Mathematical analysis Indefinite sums Category:Finite differences Category:Linear operators in calculus