Indexed Summation of Sum of Mappings

Theorem
Let $\mathbb A$ be one of the standard number systems $\N, \Z, \Q, \R, \C$.

Let $a, b$ be integers.

Let $\closedint a b$ denote the integer interval between $a$ and $b$.

Let $f, g: \closedint a b \to \mathbb A$ be mappings.

Let $h = f + g$ be their pointwise sum.

Then we have the equality of indexed summations:
 * $\displaystyle \sum_{i \mathop = a}^b \map h i = \sum_{i \mathop = a}^b \map f i + \sum_{i \mathop = a}^b \map g i$

Proof
The proof proceeds by induction on $b$.

For all $b \in \Z_{\ge 0}$, let $\map P b$ be the proposition:
 * $\displaystyle \sum_{i \mathop = a}^b \map h i = \sum_{i \mathop = a}^b \map f i + \sum_{i \mathop = a}^b \map g i$

Basis for the Induction
Let $b < a$.

Then all indexed summations are zero.

Because $0 = 0 + 0$, the result follows.

Basis for the Induction
Let $b = a$.

Thus $\map P a$ is seen to hold.

This is our basis for the induction.

Induction Hypothesis
Now it needs to be shown that, if $\map P k$ is true, where $k \ge a$, then it logically follows that $\map P {k + 1}$ is true.

So this is the induction hypothesis:
 * $\displaystyle \sum_{i \mathop = a}^k \map h i = \sum_{i \mathop = a}^k \map f i + \sum_{i \mathop = a}^k \map g i$

from which it is to be shown that:
 * $\displaystyle \sum_{i \mathop = a}^{k + 1} \map h i = \sum_{i \mathop = a}^{k + 1} \map f i + \sum_{i \mathop = a}^{k + 1} \map g i$

Induction Step
We have:

So $\map P k \implies \map P {k + 1}$ and the result follows by the Principle of Mathematical Induction.

Also see

 * Indexed Summation of Multiple of Mapping
 * Summation of Sum of Mappings on Finite Set