TheoremBase

The order facts follow from the definition of the order of the extended real line, its antisymmetry and the maximality of ∞; the sum of zeros equals its first partial sum, which is the first term.

Proof

Elements of [0,∞][0,\infty] lie in [−∞,∞][-\infty,\infty] and 0∈R⊆[−∞,∞]0\in\mathbb{R}\subseteq[-\infty,\infty], by The Extended Real Line, Its Order, and [0,∞] (ii); as 0≤00\le0 in R\mathbb{R}, also 0∈[0,∞]0\in[0,\infty] by The Extended Real Line, Its Order, and [0,∞] (ii).

Proof of (i). Let a∈[0,∞]a\in[0,\infty] with a≤0a\le0. By Order and Suprema in the Extended Real Line (viii), 0≤a0\le a. By Order and Suprema in the Extended Real Line (i), ≤\le is a total order, in particular a partial order, on [−∞,∞][-\infty,\infty], so it is antisymmetric by Partial and Total Orders on a Set and the Associated Strict Relation (i); hence a≤0a\le0 and 0≤a0\le a give a=0a=0.

Proof of (ii). Let a∈[0,∞]a\in[0,\infty]. If a∈Ra\in\mathbb{R}, then a≤∞a\le\infty by The Extended Real Line, Its Order, and [0,∞] (iii), the case y=∞y=\infty there, and a≠∞a\neq\infty because ∞∉R\infty\notin\mathbb{R} by The Extended Real Line, Its Order, and [0,∞] (i); so a<∞a<\infty by The Extended Real Line, Its Order, and [0,∞] (iii). Conversely, let a<∞a<\infty; then a≠∞a\neq\infty by The Extended Real Line, Its Order, and [0,∞] (iii). By The Extended Real Line, Its Order, and [0,∞] (ii), either a∈Ra\in\mathbb{R} and 0≤a0\le a, or a=∞a=\infty; the second is excluded, so a∈Ra\in\mathbb{R}.

Proof of (iii). Let a,b∈[0,∞]a,b\in[0,\infty] with a≤ba\le b and b<∞b<\infty, so b≠∞b\neq\infty by The Extended Real Line, Its Order, and [0,∞] (iii). If a=∞a=\infty, then ∞≤b\infty\le b, so b=∞b=\infty by Order and Suprema in the Extended Real Line (ii), which is impossible. So a≠∞a\neq\infty, and a∈Ra\in\mathbb{R} by The Extended Real Line, Its Order, and [0,∞] (ii); then a<∞a<\infty by (ii).

Proof of (iv). Let (ak)(a_{k}) be a sequence in [0,∞][0,\infty] with ak=0a_{k}=0 for every k∈Nk\in\mathbb{N}, and let s1=∑k=11aks_{1}=\sum_{k=1}^{1}a_{k} be its first partial sum. In particular ak=0a_{k}=0 for every k∈Nk\in\mathbb{N} with 1<k1<k, so Sums of Sequences in [0,∞]: Real Series, Linearity, Comparison, Rearrangement, Double Series and Monotone Convergence (vii), with n=1n=1, gives ∑k∈Nak=s1\sum_{k\in\mathbb{N}}a_{k}=s_{1}. By Iterated Operations: Finite Sums and Finite Products (ii), s1s_{1} is the iterated operation of the sum ++, a binary operation on [0,∞][0,\infty] by Addition and Multiplication on [0,∞] (i), applied to the restriction a∣[1]a|_{[1]} of aa to [1]={1}[1]=\{1\}, a subset of N\mathbb{N} by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i); since [1]⊆N[1]\subseteq\mathbb{N}, this restriction is a map [1]→[0,∞][1]\to[0,\infty] by Domains and Restrictions of Maps (ii), whose value at 11 is a1a_{1} by Domains and Restrictions of Maps (iii). By Iterated Operations: Finite Sums and Finite Products (i), with n=1n=1, this iterated operation is t(1)t(1), where t:[1]→[0,∞]t:[1]\to[0,\infty] is the map of Iterating a Binary Operation along a Finite List (i) for ++ and a∣[1]a|_{[1]}; that map satisfies t(1)=(a∣[1])(1)t(1)=(a|_{[1]})(1). Hence s1=t(1)=a1=0s_{1}=t(1)=a_{1}=0. Hence ∑k∈Nak=0\sum_{k\in\mathbb{N}}a_{k}=0.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…