Convex combination

Given three points x1,x2,x3 in a plane as shown in the figure, the point P is a convex combination of the three points, while Q is not.
(Q is however an affine combination of the three points, as their affine hull is the entire plane.)
Convex combination of two points v1,v2∈ℝ2 in a two dimensional vector space ℝ2 as animation in Geogebra with t∈[0,1] and K(t):=(1−t)⋅v1+t⋅v2
Convex combination of three points v0,v1,v2 of 2-simplex∈ℝ2 in a two dimensional vector space ℝ2 as shown in animation with α0+α1+α2=1, P(α0,α1,α2) :=α0v0+α1v1+α2v2 . When P is inside of the triangle αi≥0. Otherwise, when P is outside of the triangle, at least one of the αi is negative.
Convex combination of four points A1,A2,A3,A4∈ℝ3 in a three dimensional vector space ℝ3 as animation in Geogebra with ∑i=14αi=1 and ∑i=14αi⋅Ai=P. When P is inside of the tetrahedron αi>=0. Otherwise, when P is outside of the tetrahedron, at least one of the αi is negative.
Convex combination of two functions as vectors in a vector space of functions - visualized in Open Source Geogebra with [a,b]=[−4,7] and as the first function f:[a,b]→ℝ a polynomial is defined. f(x):=310⋅x2−2 A trigonometric function g:[a,b]→ℝ was chosen as the second function. g(x):=2⋅cos⁡(x)+1 The figure illustrates the convex combination K(t):=(1−t)⋅f+t⋅g of f and g as graph in red color.

In convex geometry and vector algebra, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points in an affine space) where all coefficients are non-negative and sum to 1. In other words, the operation is equivalent to a weighted average, but whose weights are expressed as proportions, instead of freely chosen weights which require dividing by the sum of the weights to find the weighted average.

Formal definition

More formally, given a finite number of points x1,x2,…,xn in a real vector space or affine space, a convex combination of these points is a point of the form

α1x1+α2x2+⋯+αnxn

where the real numbers αi satisfy αi≥0 and α1+α2+⋯+αn=1.

As a particular example, every convex combination of two points lies on the line segment between the points.

A set is convex if it contains all convex combinations of its points. The convex hull of a given set of points is identical to the set of all their convex combinations.

There exist subsets of a vector space that are not closed under linear combinations but are closed under convex combinations. For example, the interval [0,1] is convex but generates the real-number line under linear combinations. Another example is the convex set of probability distributions, as linear combinations preserve neither nonnegativity nor affinity (i.e., having total integral one).

Other objects

See also