Let K be a field, with additive identity 0. Let N be the set of natural numbers with successor map S as in that definition. The notions finite and has k 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) over a subset E of the domain of h is the sum over E of the restriction of h to E.
Then the following hold.
1. (Singleton) Let a be an object and let h:{a}→K be a map. Then {a} is nonempty and finite and
x∈{a}∑h(x)=h(a).
2. (Peeling) Let F be a nonempty finite set, let a be an object with a∈/F, and let h:F∪{a}→K be a map. Then F∪{a} is nonempty and finite and
x∈F∪{a}∑h(x)=(x∈F∑h(x))+h(a).
3. (Splitting) Let F be a finite set, let F1 and F2 be nonempty subsets of F with F=F1∪F2 and F1∩F2=∅, and let h:F→K be a map. Then
x∈F∑h(x)=x∈F1∑h(x)+x∈F2∑h(x).
4. (Terms vanishing outside a subset) Let F be a nonempty finite set, let E⊆F be nonempty, and let h:F→K be a map with h(x)=0 for every x∈F∖E. Then
x∈F∑h(x)=x∈E∑h(x).
5. (Interchange) Let F and G be nonempty finite sets, let F×G be their Cartesian product, and let h:F×G→K be a map, whose value at the ordered pair (x,y) is written h(x,y). Then
x∈F∑(y∈G∑h(x,y))=y∈G∑(x∈F∑h(x,y)).