Proof of Nonnegativity and Monotonicity of a Sum over a Finite Index Set
lemmalem:finite-set-indexed-sum-nonnegative-2026aNonnegativity is transported from the numerical finite sum through an enumerating bijection; monotonicity follows by splitting the index set at the given subset, the complementary sum being nonnegative.
Each result cited is universally quantified over the data in its own statement, and is applied here to the data named.
Claim 1 (An enumeration of ). Since is nonempty and finite, Finite Set gives a natural number such that has elements, and that definition then supplies a bijection , where is the initial segment determined by . By Sum over a Finite Index Set, for every map ,
Claim 2 (Clause 1). Suppose for every . Then for every , because . By claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers,
and claim 1 identifies the two sides with and .
Claim 3 (Clause 2). Suppose for every . Each summand satisfies , because . Hence by claim 5 of Properties of Finite Sums, and claim 1 identifies that sum with .
Claim 4 (Clause 3). Suppose for every , and let be nonempty.
Suppose first . Then the two sums are the same real number, and for every real because the order of is a total order, hence reflexive.
Suppose now , and put , which is nonempty because and . Both and are finite by claim 3 of Basic Properties of Finite Sets, applied to the finite set and to each of them. They are disjoint and their union is , so claim 3 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set, applied to , to , to and to , gives
The restriction of to is nonnegative at every point of , so clause 2, proved in claim 3 and applied to the nonempty finite set and to that restriction, gives . Since
claim 3 of Elementary Arithmetic in an Ordered Field yields .
Loadingβ¦
Prerequisites
4fb3974c-9615-40d6-b1ae-37889fb3d74c