Let n and N be natural numbers with 1≤n and 1≤N, let R be the real numbers with the order ≤ of its ordered field structure, and for a natural number p let [p] be the initial segment determined by p. Regard Euclidean space Rn as a real vector space by Euclidean Space Rn is a Real Vector Space, with the sum z+z′ of points and the scalar multiple λz. Systems of convex weights and convex combinations are those of Convex Combination of Finitely Many Points of Rn, and sums of real numbers are the finite sums of the field R.
Then the following hold.
1. (Small cases) Let x:[1]→Rn and let t be a system of convex weights of length 1. Then t1=1 and ∑k=11tkxk=x1. Let y:[2]→Rn and let u be a system of convex weights of length 2. Then u2=1−u1 and
k=1∑2ukyk=u1y1+(1−u1)y2.
2. (Reduction) Let x:[N+1]→Rn, let t be a system of convex weights of length N+1, write t′ and x′ for the restrictions of t and x to [N], and set s=∑k=1Ntk′. Then s=1−tN+1, 0≤s and s≤1. Moreover:
(a) if tN+1=1, then ∑k=1N+1tkxk=xN+1;
(b) if tN+1=1, then 0<s, the family τ on [N] given by τk=s−1tk′ is a system of convex weights of length N, it satisfies sτk=tk′ for every k∈[N], and, with y=∑k=1Nτkxk′,
k=1∑N+1tkxk=sy+(1−s)xN+1.
3. (Membership) Let C⊆Rn be convex, let x:[N]→Rn take all of its values in C, and let t be a system of convex weights of length N. Then ∑k=1Ntkxk∈C.