TheoremBase

Peeling, Splitting, and Interchange for Sums over a Finite Index Set

Statement

Let KK be a field, with additive identity 00. Let N\mathbb{N} be the set of natural numbers with successor map SS as in that definition. The notions finite and has kk elements are those of the indicated definitions. Sums over a finite index set are those of Sum over a Finite Index Set; a sum ∑x∈Eh(x)\sum_{x\in E}h(x) over a subset EE of the domain of hh is the sum over EE of the restriction of hh to EE.

Then the following hold.

1. (Singleton) Let aa be an object and let h:{a}→Kh:\{a\}\to K be a map. Then {a}\{a\} is nonempty and finite and

∑x∈{a}h(x)=h(a).\sum_{x\in\{a\}}h(x)=h(a).

2. (Peeling) Let FF be a nonempty finite set, let aa be an object with a∉Fa\notin F, and let h:F∪{a}→Kh:F\cup\{a\}\to K be a map. Then F∪{a}F\cup\{a\} is nonempty and finite and

∑x∈F∪{a}h(x)=(∑x∈Fh(x))+h(a).\sum_{x\in F\cup\{a\}}h(x)=\Bigl(\sum_{x\in F}h(x)\Bigr)+h(a).

3. (Splitting) Let FF be a finite set, let F1F_{1} and F2F_{2} be nonempty subsets of FF with F=F1∪F2F=F_{1}\cup F_{2} and F1∩F2=∅F_{1}\cap F_{2}=\emptyset, and let h:F→Kh:F\to K be a map. Then

∑x∈Fh(x)=∑x∈F1h(x)+∑x∈F2h(x).\sum_{x\in F}h(x)=\sum_{x\in F_{1}}h(x)+\sum_{x\in F_{2}}h(x).

4. (Terms vanishing outside a subset) Let FF be a nonempty finite set, let E⊆FE\subseteq F be nonempty, and let h:F→Kh:F\to K be a map with h(x)=0h(x)=0 for every x∈F∖Ex\in F\setminus E. Then

∑x∈Fh(x)=∑x∈Eh(x).\sum_{x\in F}h(x)=\sum_{x\in E}h(x).

5. (Interchange) Let FF and GG be nonempty finite sets, let F×GF\times G be their Cartesian product, and let h:F×G→Kh:F\times G\to K be a map, whose value at the ordered pair (x,y)(x,y) is written h(x,y)h(x,y). Then

∑x∈F(∑y∈Gh(x,y))=∑y∈G(∑x∈Fh(x,y)).\sum_{x\in F}\Bigl(\sum_{y\in G}h(x,y)\Bigr)=\sum_{y\in G}\Bigl(\sum_{x\in F}h(x,y)\Bigr).

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…