TheoremBase

Restriction to a subset of the domain gives the first clause; the recursion of iterated operations gives the first and successor steps and closure gives membership; the scalar and nonnegativity clauses are the general finite-sum facts in the ordered field of real numbers, read along the segment.

Proof

Throughout, a set uu lies in Rn\mathbb{R}^{n} exactly when it is a map u:[n]→Ru:[n]\to\mathbb{R}, and then uk=u(k)u_{k}=u(k) for k∈[n]k\in[n] (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (ii)); R\mathbb{R}, with its addition, multiplication and order, is an ordered field (The Real Numbers Form an Ordered Field in Which Every Nonempty Set Bounded Above Has a Supremum (i)), in particular a commutative ring; and since its addition is associative and commutative, as the addition of a commutative ring, for a map a:[n]→Ra:[n]\to\mathbb{R} the sum ∑k=1nak\sum_{k=1}^{n}a_{k} of Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality, read over the interval {1,…,n}\{1,\dots,n\}, equals the finite sum of the statement, both being the sum over the finite set [n][n] (Natural Numbers as Indices: ℕ ⊆ ℕ₀, 1 ∈ ℕ₀, and the Two Readings of an Operation from 1 to n (v)).

Restriction. Let t∈RN+1t\in\mathbb{R}^{N+1}, so t:[N+1]→Rt:[N+1]\to\mathbb{R}. Now [N]⊆[N+1][N]\subseteq[N+1] by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (v), as N≤N+1N\le N+1. So t∣[N]:[N]→Rt|_{[N]}:[N]\to\mathbb{R} is a map (a set, being contained in tt) with (t∣[N])(k)=t(k)(t|_{[N]})(k)=t(k) for every k∈[N]k\in[N], and hence lies in RN\mathbb{R}^{N}, and its components are (t∣[N])k=tk(t|_{[N]})_{k}=t_{k} for k∈[N]k\in[N]. This proves (i).

The first step. Let t∈R1t\in\mathbb{R}^{1}, so t:[1]→Rt:[1]\to\mathbb{R}. The first identity of Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i), applied to the addition of R\mathbb{R} with n=1n=1 and a=ta=t, gives ∑k=11tk=t1\sum_{k=1}^{1}t_{k}=t_{1}, which is (ii).

The successor step. Let t∈RN+1t\in\mathbb{R}^{N+1}, so t:[N+1]→Rt:[N+1]\to\mathbb{R}. The second identity of Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i), applied to the addition of R\mathbb{R} with n=Nn=N and a=ta=t, gives

∑k=1N+1tk=(∑k=1Ntk)+tN+1,\sum_{k=1}^{N+1}t_{k}=\Big(\sum_{k=1}^{N}t_{k}\Big)+t_{N+1},

where, by Iterated Operations: Finite Sums and Finite Products (ii), the inner sum is the finite sum of t∣[N]t|_{[N]}. By (i), t∣[N]∈RNt|_{[N]}\in\mathbb{R}^{N} with components (t∣[N])k(t|_{[N]})_{k}, so the inner sum is ∑k=1N(t∣[N])k\sum_{k=1}^{N}(t|_{[N]})_{k}, and (iii) follows.

Membership. Let t∈RNt\in\mathbb{R}^{N}, so t:[N]→Rt:[N]\to\mathbb{R}. By Iterated Operations and Operations over Finite Sets Take Values in the Underlying Set (i), applied to the addition of R\mathbb{R}, ∑k=1Ntk∈R\sum_{k=1}^{N}t_{k}\in\mathbb{R}; this is (iv).

Scalar multiples. Let τ∈RN\tau\in\mathbb{R}^{N} and c∈Rc\in\mathbb{R}. By Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality (i), applied to the commutative ring R\mathbb{R} with a=τa=\tau,

c∑k=1Nτk=∑k=1Nc τk.c\sum_{k=1}^{N}\tau_{k}=\sum_{k=1}^{N}c\,\tau_{k}.

By Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iv), cτ∈RNc\tau\in\mathbb{R}^{N} and (cτ)k=c τk(c\tau)_{k}=c\,\tau_{k} for every k∈[N]k\in[N]. The right-hand sum is, by Iterated Operations: Finite Sums and Finite Products (i), the finite sum of the map k↦c τkk\mapsto c\,\tau_{k} on [N][N] (which is cτc\tau, since both have values c τkc\,\tau_{k}), so the right-hand sum is ∑k=1N(cτ)k\sum_{k=1}^{N}(c\tau)_{k}. This proves (v).

Nonnegative terms. Let t∈RNt\in\mathbb{R}^{N} with 0≤tk0\le t_{k} for every k∈[N]k\in[N]. By Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality (vi), applied to the ordered field R\mathbb{R} with a=ta=t, we get tj≤∑k=1Ntkt_{j}\le\sum_{k=1}^{N}t_{k} for every j∈[N]j\in[N], and 0≤∑k=1Ntk0\le\sum_{k=1}^{N}t_{k}. This proves (vi).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…