Additivity of the Integral

Basis
Last updated: Tags: Calculus, Integration

Suppose you want to integrate a function defined by two different formulas on two pieces of an interval — a ramp that flattens halfway through, say. The integral over the whole interval is just the sum of the integrals over the two pieces. This is additivity, and it turns out to be both easy to prove from first principles and far-reaching in its consequences: it underlies the variable-upper-limit function that connects the integral to differentiation.

Why additivity matters

Many functions in practice are piecewise-defined: they obey different formulas on different sub-intervals. Without additivity you would need a single formula to integrate over the entire domain; with it, you can break the domain at every junction point, integrate each piece, and add the results. Additivity also lets you subtract integrals: cbf=abfacf\int_c^b f = \int_a^b f - \int_a^c f, which is essential for estimating tails and for isolating contributions from sub-regions.

Formal statement and proof

Theorem (Additivity). Let ff be Riemann integrable on [a,b][a, b], and let c(a,b)c \in (a, b). Then ff is integrable on both [a,c][a, c] and [c,b][c, b], and

abf(x)dx  =  acf(x)dx  +  cbf(x)dx.\int_a^b f(x)\,dx \;=\; \int_a^c f(x)\,dx \;+\; \int_c^b f(x)\,dx.

Proof. Recall that ff is integrable on [a,b][a, b] if and only if for every ε>0\varepsilon > 0 there exists a partition PP of [a,b][a, b] with U(f,P)L(f,P)<εU(f, P) - L(f, P) < \varepsilon, where UU and LL denote the upper and lower Darboux sums.

Step 1 — refining a partition by inserting cc. Let PP be any partition of [a,b][a, b], and let P=P{c}P^* = P \cup \{c\} be the partition obtained by inserting the point cc. If cc already belongs to PP then P=PP^* = P. Otherwise cc falls in the interior of some sub-interval [xk1,xk][x_{k-1}, x_k] of PP, which gets split into [xk1,c][x_{k-1}, c] and [c,xk][c, x_k]. For the upper sum, the supremum over the original interval satisfies

Mk  =  sup[xk1,xk]f    sup[xk1,c]fandMk    sup[c,xk]f,M_k \;=\; \sup_{[x_{k-1},x_k]} f \;\geq\; \sup_{[x_{k-1},c]} f \quad\text{and}\quad M_k \;\geq\; \sup_{[c,x_k]} f,

so replacing Mk(xkxk1)M_k(x_k - x_{k-1}) with two smaller (or equal) terms can only decrease the upper sum: U(f,P)U(f,P)U(f, P^*) \leq U(f, P). By the analogous argument for infima, L(f,P)L(f,P)L(f, P^*) \geq L(f, P). Therefore

U(f,P)L(f,P)    U(f,P)L(f,P).U(f, P^*) - L(f, P^*) \;\leq\; U(f, P) - L(f, P).

Step 2 — integrability on sub-intervals. Since ff is integrable on [a,b][a, b], for any ε>0\varepsilon > 0 pick PP with U(f,P)L(f,P)<εU(f,P) - L(f,P) < \varepsilon. Refine to PP^* as above, and set P1P[a,c]P_1 \coloneqq P^* \cap [a, c] and P2P[c,b]P_2 \coloneqq P^* \cap [c, b]. The Darboux sums split:

U(f,P)=U(f,P1)+U(f,P2),L(f,P)=L(f,P1)+L(f,P2).U(f, P^*) = U(f, P_1) + U(f, P_2), \qquad L(f, P^*) = L(f, P_1) + L(f, P_2).

Since each term is non-negative,

U(f,P1)L(f,P1)    U(f,P)L(f,P)<ε,U(f, P_1) - L(f, P_1) \;\leq\; U(f, P^*) - L(f, P^*) < \varepsilon,

and the same holds for P2P_2. As ε>0\varepsilon > 0 was arbitrary, ff is integrable on [a,c][a, c] and on [c,b][c, b].

Step 3 — the sum formula. Denote IabfI \coloneqq \int_a^b f, I1acfI_1 \coloneqq \int_a^c f, I2cbfI_2 \coloneqq \int_c^b f. For any partition PP^* of [a,b][a,b] containing cc:

L(f,P1)+L(f,P2)    I1+I2    U(f,P1)+U(f,P2).L(f, P_1) + L(f, P_2) \;\leq\; I_1 + I_2 \;\leq\; U(f, P_1) + U(f, P_2).

But the outer expressions equal L(f,P)L(f, P^*) and U(f,P)U(f, P^*) respectively, and both converge to II as the mesh of PP^* shrinks. Hence I1+I2=II_1 + I_2 = I. \square

Orientation convention and signed integrals

The Darboux definition implicitly assumes a<ba < b. To handle all orderings uniformly, adopt the conventions

aaf(x)dx    0,baf(x)dx    abf(x)dx(a<b).\int_a^a f(x)\,dx \;\coloneqq\; 0, \qquad \int_b^a f(x)\,dx \;\coloneqq\; -\int_a^b f(x)\,dx \quad (a < b).

With these in place, the additivity formula abf=acf+cbf\int_a^b f = \int_a^c f + \int_c^b f holds for any ordering of aa, bb, cc on the real line. To see why, consider the case c<a<bc < a < b:

abf  =  cbfcaf  =  cbf+acf,\int_a^b f \;=\; \int_c^b f - \int_c^a f \;=\; \int_c^b f + \int_a^c f,

which is just the original additivity formula with the roles of cc and aa swapped. All other cases follow similarly. The sign conventions ensure you can freely insert or remove intermediate limits without tracking which endpoint is larger.

The variable-upper-limit function

Fix a base point aa in the domain of integration, and define

F(x)    axf(t)dtF(x) \;\coloneqq\; \int_a^x f(t)\,dt

for all xx in the interval [a,b][a, b]. This is the variable-upper-limit function of ff based at aa (also called the integral function).

Well-definedness. By additivity applied to [a,x][a,b][a, x] \subset [a, b], integrability of ff on [a,b][a, b] implies integrability on [a,x][a, x] for every x[a,b]x \in [a, b]. Hence F(x)F(x) is a well-defined real number for each such xx.

Change of base point. If you replace aa by another base point aa', the resulting function Fa(x)=axf(t)dtF_{a'}(x) = \int_{a'}^x f(t)\,dt satisfies

Fa(x)  =  F(x)    F(a)constant  =  F(x)+C.F_{a'}(x) \;=\; F(x) \;-\; \underbrace{F(a')}_{\text{constant}} \;=\; F(x) + C.

Changing the base point shifts FF by a constant. This is the first hint of why primitives are unique only up to an additive constant — a theme developed fully in the Primitives checkpoint.

The function FF is the crucial bridge to the Newton–Leibniz formula: when ff is continuous, FF is differentiable with F(x)=f(x)F'(x) = f(x), which means FF is a primitive of ff.

Worked example: piecewise linear function

Consider the tent function

f(x)  =  {x0x1,2x1<x2.f(x) \;=\; \begin{cases} x & 0 \leq x \leq 1, \\ 2 - x & 1 < x \leq 2. \end{cases}

It rises linearly from 00 to 11 on [0,1][0,1], then falls back to 00 on [1,2][1,2]. Apply additivity at c=1c = 1:

02f(x)dx  =  01xdx  +  12(2x)dx.\int_0^2 f(x)\,dx \;=\; \int_0^1 x\,dx \;+\; \int_1^2 (2-x)\,dx.

The graph of each piece is a right triangle with base 11 and height 11, so each integral equals 12(1)(1)=12\tfrac{1}{2}(1)(1) = \tfrac{1}{2}. Therefore

02f(x)dx  =  12+12  =  1.\int_0^2 f(x)\,dx \;=\; \frac{1}{2} + \frac{1}{2} \;=\; 1.

Now use the variable-upper-limit function to trace how the accumulated area grows. For x[0,1]x \in [0,1],

F(x)=0xtdt=x22.F(x) = \int_0^x t\,dt = \frac{x^2}{2}.

For x[1,2]x \in [1,2], split at 11:

F(x)=01tdt+1x(2t)dt=12+[2tt22]1x=12+2xx2232=2xx221.F(x) = \int_0^1 t\,dt + \int_1^x (2-t)\,dt = \frac{1}{2} + \left[2t - \frac{t^2}{2}\right]_1^x = \frac{1}{2} + 2x - \frac{x^2}{2} - \frac{3}{2} = 2x - \frac{x^2}{2} - 1.

You can check that F(0)=0F(0) = 0, F(1)=12F(1) = \tfrac{1}{2}, and F(2)=1F(2) = 1, consistent with the areas computed above.

Summary

  • Additivity: if ff is integrable on [a,b][a, b] and c(a,b)c \in (a, b), then ff is integrable on [a,c][a, c] and [c,b][c, b], and abf=acf+cbf\int_a^b f = \int_a^c f + \int_c^b f.
  • Proof: insert cc into any partition (this cannot increase ULU - L), split sums exactly at cc, then pass to the limit.
  • Orientation conventions: aaf0\int_a^a f \coloneqq 0 and bafabf\int_b^a f \coloneqq -\int_a^b f make additivity valid for all orderings of a,b,ca, b, c.
  • Variable-upper-limit function: F(x)axf(t)dtF(x) \coloneqq \int_a^x f(t)\,dt is well-defined on [a,b][a, b]; changing the base point shifts FF by a constant.
  • FF is the bridge to the Newton–Leibniz formula: for continuous ff, F(x)=f(x)F'(x) = f(x).