Convex combinations of one and two points, the reduction of a combination of N+1 points to a segment point between a combination of N points and the last point, removal of a point of weight zero, the combination obtained by joining two combinations, and closure of convex sets under convex combinations.
One point. A point t∈R1 lies in Δ1 if and only if t1=1. For x1∈Rn and t∈Δ1,
k=1∑1tkxk=x1.
Two points. For x1,x2∈Rn, a point t∈R2 lies in Δ2 if and only if t=(1−s,s) for some s∈[0,1], and then
k=1∑2tkxk=(1−s)x1+sx2.
Splitting off the last point. Let N∈N, x1,…,xN+1∈Rn, t∈ΔN+1 and z=∑k=1N+1tkxk. Then 0≤tN+1≤1. If tN+1=1, then z=xN+1. If tN+1<1, then s=1−tN+1>0, the point τ=(t1/s,…,tN/s) lies in ΔN, and, with y=∑k=1Nτkxk,
Joining two combinations. Let N,P∈N, x1,…,xN∈Rn, x1′,…,xP′∈Rn, τ∈ΔN, σ∈ΔP and λ∈[0,1]. Let w1,…,wN+P be the points with wk=xk for k∈[N] and wN+j=xj′ for j∈[P], and let t∈RN+P have tk=(1−λ)τk for k∈[N] and tN+j=λσj for j∈[P]. Then t∈ΔN+P and
(1−λ)k=1∑Nτkxk+λj=1∑Pσjxj′=k=1∑N+Ptkwk.
Membership. Let C⊆Rn be convex, N∈N, x1,…,xN∈C and t∈ΔN. Then ∑k=1Ntkxk∈C.
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.