TheoremBase

Properties of a Sum over a Finite Index Set

Statement

Let KK be a field, let FF and GG be nonempty finite sets, let f:F→Kf:F\to K and h:F→Kh:F\to K be maps, and let λ∈K\lambda\in K. Sums over a finite index set are those of Sum over a Finite Index Set, and sums with a numerical index range are the finite sums of KK.

Then the following hold.

1. (Agreement with an indexed sum) Let nn be a natural number, let [n][n] be the initial segment determined by nn, and let c:[n]→Kc:[n]\to K be a map with values ckc_{k}. Then [n][n] is a nonempty finite set and

∑x∈[n]c(x)=∑k=1nck.\sum_{x\in[n]}c(x)=\sum_{k=1}^{n}c_{k}.

2. (Reindexing along a bijection) Let θ:G→F\theta:G\to F be a bijection. Then

∑y∈Gf(θ(y))=∑x∈Ff(x).\sum_{y\in G}f\bigl(\theta(y)\bigr)=\sum_{x\in F}f(x).

3. (Additivity) Writing f+hf+h for the map whose value at xx is f(x)+h(x)f(x)+h(x),

∑x∈F(f(x)+h(x))=∑x∈Ff(x)+∑x∈Fh(x).\sum_{x\in F}\bigl(f(x)+h(x)\bigr)=\sum_{x\in F}f(x)+\sum_{x\in F}h(x).

4. (Homogeneity)

∑x∈Fλ f(x)=λ∑x∈Ff(x).\sum_{x\in F}\lambda\,f(x)=\lambda\sum_{x\in F}f(x).

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…