TheoremBase

Sums of Sequences in [0,∞]: Real Series, Linearity, Comparison, Rearrangement, Double Series and Monotone Convergence

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.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let ∞\infty, [0,∞][0,\infty] and the order ≤\le be as in The Extended Real Line, Its Order, and [0,∞] (i), The Extended Real Line, Its Order, and [0,∞] (ii) and The Extended Real Line, Its Order, and [0,∞] (iii), the sum ++ and the product ⋅\cdot as in Addition and Multiplication on [0,∞] (i) and Addition and Multiplication on [0,∞] (ii), sup⁡n\sup_{n} as in Order and Suprema in the Extended Real Line (iii), sums over finite sets of maps into [0,∞][0,\infty] as in Sums and Products over a Finite Set and over an Interval (i), Sums and Products over a Finite Set and over an Interval (ii), Sums and Products over a Finite Set and over an Interval (iii) and Sums and Products over a Finite Set and over an Interval (v), for ++, which is associative and commutative with neutral element 00 by Arithmetic in [0,∞]: Monoid Laws, Distributivity, Monotonicity and Cancellation (i), and sums of sequences in [0,∞][0,\infty] as in Sum of a Sequence in [0,∞] (ii). Let (ak)(a_{k}) and (bk)(b_{k}) be sequences in [0,∞][0,\infty], and sn=∑k=1naks_{n}=\sum_{k=1}^{n}a_{k} the partial sums of (ak)(a_{k}).

sn≤sn+1s_{n}\le s_{n+1} for every n∈Nn\in\mathbb{N}.

sn≤∑j∈Najs_{n}\le\sum_{j\in\mathbb{N}}a_{j} for every n∈Nn\in\mathbb{N}.

ak≤∑j∈Naja_{k}\le\sum_{j\in\mathbb{N}}a_{j} for every k∈Nk\in\mathbb{N}.

For every finite subset FF of N\mathbb{N}, ∑k∈Fak≤∑k∈Nak\sum_{k\in F}a_{k}\le\sum_{k\in\mathbb{N}}a_{k}.

If t∈[0,∞]t\in[0,\infty] and ∑k∈Fak≤t\sum_{k\in F}a_{k}\le t for every finite subset FF of N\mathbb{N}, then ∑k∈Nak≤t\sum_{k\in\mathbb{N}}a_{k}\le t.

Let ak∈Ra_{k}\in\mathbb{R} for every k∈Nk\in\mathbb{N}. Then ∑k∈Nak∈R\sum_{k\in\mathbb{N}}a_{k}\in\mathbb{R} if and only if the series ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges, and in that case the two sums are equal; otherwise ∑k∈Nak=∞\sum_{k\in\mathbb{N}}a_{k}=\infty. If instead ak=∞a_{k}=\infty for some k∈Nk\in\mathbb{N}, then ∑k∈Nak=∞\sum_{k\in\mathbb{N}}a_{k}=\infty.

If n∈Nn\in\mathbb{N} and ak=0a_{k}=0 for every k∈Nk\in\mathbb{N} with n<kn<k, then ∑k∈Nak=sn\sum_{k\in\mathbb{N}}a_{k}=s_{n}.

∑k∈N(ak+bk)=∑k∈Nak+∑k∈Nbk\sum_{k\in\mathbb{N}}(a_{k}+b_{k})=\sum_{k\in\mathbb{N}}a_{k}+\sum_{k\in\mathbb{N}}b_{k}.

∑k∈Ncak=c∑k∈Nak\sum_{k\in\mathbb{N}}ca_{k}=c\sum_{k\in\mathbb{N}}a_{k} for every c∈[0,∞]c\in[0,\infty].

If ak≤bka_{k}\le b_{k} for every k∈Nk\in\mathbb{N}, then ∑k∈Nak≤∑k∈Nbk\sum_{k\in\mathbb{N}}a_{k}\le\sum_{k\in\mathbb{N}}b_{k}.

If σ:N→N\sigma:\mathbb{N}\to\mathbb{N} is a bijection, then ∑k∈Naσ(k)=∑k∈Nak\sum_{k\in\mathbb{N}}a_{\sigma(k)}=\sum_{k\in\mathbb{N}}a_{k}.

Let w:N×N→[0,∞]w:\mathbb{N}\times\mathbb{N}\to[0,\infty] be a map.

∑m∈N∑n∈Nw(m,n)=∑n∈N∑m∈Nw(m,n)\sum_{m\in\mathbb{N}}\sum_{n\in\mathbb{N}}w(m,n)=\sum_{n\in\mathbb{N}}\sum_{m\in\mathbb{N}}w(m,n).

If τ:N→N×N\tau:\mathbb{N}\to\mathbb{N}\times\mathbb{N} is a bijection, then

∑m∈N∑n∈Nw(m,n)=∑n∈N∑m∈Nw(m,n)=∑k∈Nw(τ(k)).\sum_{m\in\mathbb{N}}\sum_{n\in\mathbb{N}}w(m,n)=\sum_{n\in\mathbb{N}}\sum_{m\in\mathbb{N}}w(m,n)=\sum_{k\in\mathbb{N}}w(\tau(k)).

If w(n,k)≤w(n+1,k)w(n,k)\le w(n+1,k) for all n,k∈Nn,k\in\mathbb{N}, then ∑k∈Nsup⁡nw(n,k)=sup⁡n∑k∈Nw(n,k)\sum_{k\in\mathbb{N}}\sup_{n}w(n,k)=\sup_{n}\sum_{k\in\mathbb{N}}w(n,k).

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…