Generalized Sum is Monotone
Jump to navigation
Jump to search
It has been suggested that this page be renamed. In particular: Nomenclature is not optimal To discuss this page in more detail, feel free to use the talk page. |
Theorem
Let $I$ be an indexing set.
Let $\family {a_i}_{i \mathop \in I}$ be an $I$-indexed family of positive real numbers.
That is, let $a_i \in \R_{\ge 0}$ for all $i \in I$.
Then, for every finite subset $F$ of $I$:
- $\ds \sum_{i \mathop \in F} a_i \le \sum_{i \mathop \in I} a_i$
provided the generalized sum on the right converges.
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |