The sum of a sequence in [0,∞] bounds its finite partial sums and is their least upper bound, agrees with the sum of a convergent real series and is ∞ otherwise, and is additive, positively homogeneous, monotone, invariant under rearrangement, independent of the order of summation of a double sequence, and commutes with nondecreasing suprema.
For every finite subset F of N, ∑k∈Fak≤∑k∈Nak.
If t∈[0,∞] and ∑k∈Fak≤t for every finite subset F of N, then ∑k∈Nak≤t.
Let ak∈R for every k∈N. Then ∑k∈Nak∈R if and only if the series ∑k=1∞akconverges, and in that case the two sums are equal; otherwise ∑k∈Nak=∞. If instead ak=∞ for some k∈N, then ∑k∈Nak=∞.
If n∈N and ak=0 for every k∈N with n<k, then ∑k∈Nak=sn.
∑k∈N(ak+bk)=∑k∈Nak+∑k∈Nbk.
∑k∈Ncak=c∑k∈Nak for every c∈[0,∞].
If ak≤bk for every k∈N, then ∑k∈Nak≤∑k∈Nbk.
If σ:N→N is a bijection, then ∑k∈Naσ(k)=∑k∈Nak.
Let w:N×N→[0,∞] be a map.
∑m∈N∑n∈Nw(m,n)=∑n∈N∑m∈Nw(m,n).
If τ:N→N×N is a bijection, then
m∈N∑n∈N∑w(m,n)=n∈N∑m∈N∑w(m,n)=k∈N∑w(τ(k)).
If w(n,k)≤w(n+1,k) for all n,k∈N, then ∑k∈Nsupnw(n,k)=supn∑k∈Nw(n,k).
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.