The convex hull of a set of points in S is the boundary of the smallest convex region that contain all the points of S inside it or on its boundary.
OR
Let S⊆Rn The convex hull of S, denoted Co(S) by is the collection of all convex combination of S, i.e., x∈Co(S) if and only if x∈n∑i=1λixi, where n∑1λi=1 and λi≥0∀xi∈S
Remark − Conves hull of a set of points in S in the plane defines a convex polygon and the points of S on the boundary of the polygon defines the vertices of the polygon.
Theorem Co(S)={x:x=n∑i=1λixi,xi∈S,n∑i=1λi=1,λi≥0} Show that a convex hull is a convex set.
Let x1,x2∈Co(S), then x1=n∑i=1λixi and x2=n∑i=1λγxi where n∑i=1λi=1,λi≥0 and n∑i=1γi=1,γi≥0
For θ∈(0,1),θx1+(1−θ)x2=θn∑i=1λixi+(1−θ)n∑i=1γixi
θx1+(1−θ)x2=n∑i=1λiθxi+n∑i=1γi(1−θ)xi
θx1+(1−θ)x2=n∑i=1[λiθ+γi(1−θ)]xi
Considering the coefficients,
n∑i=1[λiθ+γi(1−θ)]=θn∑i=1λi+(1−θ)n∑i=1γi=θ+(1−θ)=1
Hence, θx1+(1−θ)x2∈Co(S)
Thus, a convex hull is a convex set.