TheoremBase

Finite Sums of the Coordinates of a Point of ℝⁿ

For a point of Euclidean space, its restriction to [N] is a point of ℝ^N with the same coordinates, and the finite sum of its coordinates obeys the first and successor steps of the recursion, is a real number, commutes with scalar multiples, and dominates each coordinate when all coordinates are nonnegative.

Statement

In the settings of Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity and Euclidean Space and Real Matrices: Standing Notation, let N∈NN\in\mathbb{N}. For a point tt of Euclidean space, tkt_{k} is its kk-th component; ∑k=1Ntk\sum_{k=1}^{N}t_{k} is the finite sum of Iterated Operations: Finite Sums and Finite Products (iii), formed with the addition of R\mathbb{R}; and t∣[N]t|_{[N]} is the restriction of tt to [N][N].

For t∈RN+1t\in\mathbb{R}^{N+1}: t∣[N]∈RNt|_{[N]}\in\mathbb{R}^{N}, and (t∣[N])k=tk(t|_{[N]})_{k}=t_{k} for every k∈[N]k\in[N].

For t∈R1t\in\mathbb{R}^{1}: ∑k=11tk=t1\sum_{k=1}^{1}t_{k}=t_{1}.

For t∈RN+1t\in\mathbb{R}^{N+1}:

∑k=1N+1tk=∑k=1N(t∣[N])k+tN+1.\sum_{k=1}^{N+1}t_{k}=\sum_{k=1}^{N}(t|_{[N]})_{k}+t_{N+1}.

For t∈RNt\in\mathbb{R}^{N}: ∑k=1Ntk∈R\sum_{k=1}^{N}t_{k}\in\mathbb{R}.

For τ∈RN\tau\in\mathbb{R}^{N} and c∈Rc\in\mathbb{R}:

c∑k=1Nτk=∑k=1N(cτ)k.c\sum_{k=1}^{N}\tau_{k}=\sum_{k=1}^{N}(c\tau)_{k}.

For t∈RNt\in\mathbb{R}^{N} with 0≤tk0\le t_{k} for every k∈[N]k\in[N]: 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}.

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…