TheoremBase

Properties of Finite Sums

Statement

Let KK be a field. Let N\mathbb{N} be the set of natural numbers with successor map SS as in that definition, ordered by the relation ≤\le of that definition, let n∈Nn\in\mathbb{N}, and let [n][n] be the initial segment determined by nn, that is, the set of natural numbers kk with k≤nk\le n; every such kk also satisfies 1≤k1\le k by claim 4 of Properties of the Order on the Natural Numbers, so [n][n] is the set of natural numbers kk with 1≤k≤n1\le k\le n. Let a:[n]→Ka:[n]\to K and b:[n]→Kb:[n]\to K be maps, with values written aka_{k} and bkb_{k}, and let λ∈K\lambda\in K. All sums below are the finite sums of that definition.

Two different order relations occur below. In index ranges such as 1≤k≤n1\le k\le n the symbol ≤\le is the order on N\mathbb{N} just cited; in claims 5 and 6 it is the order of the ordered field of real numbers. Then the following hold.

1. (Restriction and recursion) If j∈[n]j\in[n] and a′a' denotes the restriction of aa to [j][j], then

∑k=1iak′=∑k=1iakfor every i∈[j],\sum_{k=1}^{i}a'_{k}=\sum_{k=1}^{i}a_{k}\qquad\text{for every }i\in[j],

so the value of a finite sum does not depend on which family extending the summands is used to form it. Moreover

∑k=11ak=a1,∑k=1S(m)ak=(∑k=1mak)+aS(m)whenever S(m)∈[n].\sum_{k=1}^{1}a_{k}=a_{1},\qquad \sum_{k=1}^{S(m)}a_{k}=\Bigl(\sum_{k=1}^{m}a_{k}\Bigr)+a_{S(m)}\quad\text{whenever }S(m)\in[n].

2. (Additivity)

∑k=1n(ak+bk)=∑k=1nak+∑k=1nbk.\sum_{k=1}^{n}(a_{k}+b_{k})=\sum_{k=1}^{n}a_{k}+\sum_{k=1}^{n}b_{k}.

3. (Homogeneity)

∑k=1n(λak)=λ∑k=1nak.\sum_{k=1}^{n}(\lambda a_{k})=\lambda\sum_{k=1}^{n}a_{k}.

4. (Conjugation) If KK is the field of complex numbers, then, with the complex conjugate,

∑k=1nak‾=∑k=1nak‾.\overline{\sum_{k=1}^{n}a_{k}}=\sum_{k=1}^{n}\overline{a_{k}} .

5. (Nonnegative summands) If KK is the field of real numbers, with the order ≤\le of its ordered field structure, and 0≤ak0\le a_{k} for every k∈[n]k\in[n], then

0≤∑k=1nak;0\le\sum_{k=1}^{n}a_{k};

and if in addition ∑k=1nak=0\sum_{k=1}^{n}a_{k}=0, then ak=0a_{k}=0 for every k∈[n]k\in[n].

6. (Each summand is at most the sum) Under the hypotheses of claim 5,

aj≤∑k=1nakfor every j∈[n].a_{j}\le\sum_{k=1}^{n}a_{k}\qquad\text{for every }j\in[n].

7. (A single possibly nonzero summand) Let i∈[n]i\in[n] and suppose that ak=0a_{k}=0 for every k∈[n]k\in[n] with k≠ik\ne i. Then

∑k=1nak=ai.\sum_{k=1}^{n}a_{k}=a_{i}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…