Convex Optimization - affine Set



A set A is said to be an affine set if for any two distinct points, the line passing through these points lie in the set A.

Note

  • S is an affine set if and only if it contains every affine combination of its points.

  • Empty and singleton sets are both affine and convex set.

    For example, solution of a linear equation is an affine set.

Proof

Let S be the solution of a linear equation.

By definition, S={xRn:Ax=b}

Let x1,x2SAx1=b and Ax2=b

To prove : A[θx1+(1θ)x2]=b,θ(0,1)

A[θx1+(1θ)x2]=θAx1+(1θ)Ax2=θb+(1θ)b=b

Thus S is an affine set.

Theorem

If C is an affine set and x0C, then the set V=Cx0={xx0:xC} is a subspace of C.

Proof

Let x1,x2V

To show: αx1+βx2V for some α,β

Now, x1+x0C and x2+x0C by definition of V

Now, αx1+βx2+x0=α(x1+x0)+β(x2+x0)+(1αβ)x0

But α(x1+x0)+β(x2+x0)+(1αβ)x0C because C is an affine set.

Therefore, αx1+βx2V

Hence proved.

Advertisements