TheoremBase

Small Cases, Reduction, and Membership for Convex Combinations

Statement

Let nn and NN be natural numbers with 1≤n1\le n and 1≤N1\le N, let R\mathbb{R} be the real numbers with the order ≤\le of its ordered field structure, and for a natural number pp let [p][p] be the initial segment determined by pp. Regard Euclidean space Rn\mathbb{R}^n as a real vector space by Euclidean Space Rn\mathbb{R}^n is a Real Vector Space, with the sum z+z′z+z' of points and the scalar multiple λz\lambda z. Systems of convex weights and convex combinations are those of Convex Combination of Finitely Many Points of Rn\mathbb{R}^n, and sums of real numbers are the finite sums of the field R\mathbb{R}.

Then the following hold.

1. (Small cases) Let x:[1]→Rnx:[1]\to\mathbb{R}^n and let tt be a system of convex weights of length 11. Then t1=1t_1=1 and ∑k=11tkxk=x1\sum_{k=1}^{1}t_kx_k=x_1. Let y:[2]→Rny:[2]\to\mathbb{R}^n and let uu be a system of convex weights of length 22. Then u2=1−u1u_2=1-u_1 and

∑k=12ukyk=u1 y1+(1−u1) y2.\sum_{k=1}^{2}u_ky_k=u_1\,y_1+(1-u_1)\,y_2 .

2. (Reduction) Let x:[N+1]→Rnx:[N+1]\to\mathbb{R}^n, let tt be a system of convex weights of length N+1N+1, write t′t' and x′x' for the restrictions of tt and xx to [N][N], and set s=∑k=1Ntk′s=\sum_{k=1}^{N}t'_k. Then s=1−tN+1s=1-t_{N+1}, 0≤s0\le s and s≤1s\le1. Moreover:

(a) if tN+1=1t_{N+1}=1, then ∑k=1N+1tkxk=xN+1\sum_{k=1}^{N+1}t_kx_k=x_{N+1};

(b) if tN+1≠1t_{N+1}\ne1, then 0<s0<s, the family τ\tau on [N][N] given by τk=s−1tk′\tau_k=s^{-1}t'_k is a system of convex weights of length NN, it satisfies s τk=tk′s\,\tau_k=t'_k for every k∈[N]k\in[N], and, with y=∑k=1Nτkxk′y=\sum_{k=1}^{N}\tau_kx'_k,

∑k=1N+1tkxk=s y+(1−s) xN+1.\sum_{k=1}^{N+1}t_kx_k=s\,y+(1-s)\,x_{N+1}.

3. (Membership) Let C⊆RnC\subseteq\mathbb{R}^n be convex, let x:[N]→Rnx:[N]\to\mathbb{R}^n take all of its values in CC, and let tt be a system of convex weights of length NN. Then ∑k=1Ntkxk∈C\sum_{k=1}^{N}t_kx_k\in C.

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…