Professional Documents
Culture Documents
Lecture 2
Xavier Cabezas
FCNM-ESPOL
December 21, 2020
Outline
Convex sets
Convex sets 2
Definition of convex set
x2
x2
x1
x1
Convex sets 3
Convex combination
A convex combination is any point x ∈ Rn of the form
x = λ 1 x1 + λ 2 x2 + . . . + λ k xk ,
with λ1 + λ2 + . . . + λk = 1 and λi ≥ 0, ∀i = 1, 2, . . . , k,
x1 , x2 , . . . , xk ∈ Rn and λ1 , λ2 , . . . , λk ∈ R.
x4 x3
x5
x1 x2
(a) S = { x1 , x2 , x3 , x4 , x5 } (b) S is uncountable.
Convex sets 4
Examples of convex sets
a0 x = b
Figure: A hyperplane H.
Convex sets 5
Examples of convex sets
a0 x ≤ b
P = { x | a0i x ≤ bi , i = 1, . . . , r } ,
where ai are vectors and bi are scalars.
Convex sets 7
Examples of convex sets
x1 , x2 , . . . , xk ∈ Rn and λ1 , λ2 , . . . , λk ∈ R.
k
X
C = {x | x = λi xi , λi ≥ 0, i = 1, . . . , k }
i=1
.
Convex sets 8
Intersection and sum of vectors of a convex set
Theorem
Let C1 and C2 be convex sets in Rn . Then
1. C1 ∩ C2 is convex.
2. C1 + C2 = { x1 + x2 | x1 ∈ C1 , x2 ∈ C2 } is convex.
3. C1 − C2 = { x1 − x2 | x1 ∈ C1 , x2 ∈ C2 } is convex.
Proof.
1. Taking x1 and x2 of C1 ∩ C2 , it is easy to note that
λx1 + (1 − λ)x2 is also in .C1 ∩ C2 , since that x1 , x2 ∈ C1 and
x1 , x2 ∈ C2 , and both sets are convex.
2. Let x11 + x12 and x21 + x22 be elements of C1 + C2 . The
expression λ(x11 + x12 ) + (1 − λ)(x21 + x22 ) can be written as
(λx11 + (1 − λ)x21 ) + (λx12 + (1 − λ)x22 ).
3. Similar to 2.
Convex sets 9
Caratheodory theorem
Theorem
Let S be a subset of Rn . Every element of conv S can be represented as
a convex combination of no more than n + 1 elements of S.
• The theorem is equivalent to:
(n+1 n+1
)
X X
conv S = λ i xi | λi = 1, λi ≥ 0, xi ∈ S, i = 1, . . . , n + 1
i=1 i=1
Proof.
In the lecture.
Convex sets 10
Outline
Convex sets
Theorem
Let C be a convex set in Rn with a nonempty interior. Let x1 ∈ cl C and
x2 ∈ int C. Then λx1 + (1 − λ)x2 ∈ int C for each λ ∈ (0, 1).
Proof.
In the lecture, but we need the following figure:
C x2
y z2
x1 z
z1
Corollary
If C is a convex set, then int C is convex.
Corollary
If C is a convex set with int C 6= ∅, then cl C is convex.
Corollary
If C is a convex set with int C 6= ∅, then cl int C = cl C.
Corollary
If C is a convex set with int C 6= ∅, then int cl C = int C.
Convex sets
Theorem
Let C be a closed convex in Rn and y ∈ / C. Then there exist a unique
point x̄ ∈ S with minimum distance from y. Furthermore, x̄ is such a
point if and only if (y − x̄)0 (x − x̄) ≤ 0 for all x ∈ C.
Proof.
In the lecture
C
x̄ x
(y − x̄)0 (x − x̄) ≤ 0
C1
C2
H
C1
C2
H
C1 C1
H H
C2 C2
Theorem
Let C be a nonempty closed convex set in Rn and y ∈ / C. Then there
exists a nonzero vector a and a scalar b such that a0 y > b and a0 x ≤ b for
each x ∈ C.
Proof.
• By the projection theorem there exists an unique minimizing point
x̄ ∈ C such that (y − x̄)0 (x − x̄) ≤ 0 for each x ∈ C. Let
a = y − x̄ 6= 0 and b = a0 x̄, we obtain a0 x ≤ b.
• ky − x̄k2 = (y − x̄)0 (y − x̄) = a0 (y − x̄) > 0, then a0 y > b.
Corollary
Let C be a nonempty closed convex set in Rn . Then C is the intersection
of all halfspaces containing C.
Theorem
Let A ∈ Rm×n and c ∈ Rn . Then exactly one of the following systems
has a solution:
1. Ax ≤ 0 and c0 x > 0.
2. A0 y = c and y ≥ 0.
Proof.
If system 2 has a solution, A0 y = c for some y > 0. If there is an x such
that Ax ≤ 0, then c0 x = (A0 y)0 x = y 0 Ax ≤ 0, i.e., the system 1 has no
solution.
The second part uses the fundamental separation theorem. That will be a
homework (easy to follow from the literature) as it is relevant particularly
in linear programming.
C
x̄ x
Proof.
If x̄ ∈
/ cl C, then the fundamental separation theorem can be applied.
Consider a0k yk > a0k x for all ak belonging to this subsequence and take
the limit as k → ∞, we obtain a0 x ≤ a0 x̄, i.e., a0 (x − x̄) ≤ 0.
Theorem
If C1 ∈ Rn and C2 ∈ Rn are two nonempty and disjoint convex sets,
there exists a hyperplane that separates them, i.e., a nonzero vector a
such that a0 x1 ≤ a0 x2 for all x1 ∈ C1 and x2 ∈ C2 .
C1
H
C2
Proof.
Let C = { x | x = x1 − x2 , x1 ∈ C1 , x2 ∈ C2 }. Note that 0 ∈/ C, since
C1 ∩ C2 = ∅. Since the supporting hyperplane theorem there is a vector
a 6= 0 such that a0 (x − 0) ≤ 0 for all x ∈ C. Then a0 x1 ≤ a0 x2 .
Separation and support of convex sets 23