TheoremBase

A Sum over a Finite Index Set Does Not Depend on the Enumeration

Statement

Let KK be a field, let FF be a nonempty finite set, and let nn be a natural number such that FF has nn elements; such an nn is unique by Uniqueness of the Number of Elements. Let [n][n] be the initial segment determined by nn, and let f:F→Kf:F\to K be a map. Sums below are the finite sums of KK.

Then for all bijections φ:[n]→F\varphi:[n]\to F and ψ:[n]→F\psi:[n]\to F,

∑k=1nf(φ(k))=∑k=1nf(ψ(k)).\sum_{k=1}^{n}f\bigl(\varphi(k)\bigr)=\sum_{k=1}^{n}f\bigl(\psi(k)\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…