TheoremBase

Partial Sums of a Sequence in [0,∞]: First Term, Recursion and Two-Term Sums

The first partial sum of a sequence in [0,∞] is its first term, each partial sum is the previous one plus the next term, and a sequence vanishing outside its first two terms has sum equal to the sum of those two terms.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let [−∞,∞][-\infty,\infty], [0,∞][0,\infty] and the order ≤\le of [−∞,∞][-\infty,\infty] be as in The Extended Real Line, Its Order, and [0,∞] (ii) and The Extended Real Line, Its Order, and [0,∞] (iii), and the sum ++ on [0,∞][0,\infty] as in Addition and Multiplication on [0,∞] (i). Let (ak)(a_{k}) be a sequence in [0,∞][0,\infty], let sn=∑k=1naks_{n}=\sum_{k=1}^{n}a_{k}, for n∈Nn\in\mathbb{N}, be its partial sums, and let ∑k∈Nak\sum_{k\in\mathbb{N}}a_{k} be its sum.

s1=a1s_{1}=a_{1}.

sn+1=sn+an+1s_{n+1}=s_{n}+a_{n+1} for every n∈Nn\in\mathbb{N}.

If ak=0a_{k}=0 for every k∈Nk\in\mathbb{N} with k≠1k\neq1 and k≠2k\neq2, then ∑k∈Nak=a1+a2\sum_{k\in\mathbb{N}}a_{k}=a_{1}+a_{2}.

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…