Exercise 10.7

Exercise 7: (a) Show that the simplex Q k is the smallest convex subset of k that contains 0 ˇ , ě 1 , , ě k .

(b) Show that affine mappings take convex sets to convex sets.

Answers

(a) First we need to show that Q k is convex. Let x ˇ , y ˇ Q k , so that the components satisfy

x i 0 , y i 0 , x i 1 , y i 1 .

Let 0 λ 1 , and let ž = λ x ˇ + ( 1 λ ) y ˇ . Then

z i = λ x i + ( 1 λ ) y i z i = λ x i + ( 1 λ ) y i

so that z i lies between x i and y i , and z i lies between x i and y i . Hence ž Q k .

Let C be a convex subset of k containing 0 ˇ , ě 1 , , ě k ; we need to show that Q k C . We can consider Q i Q j for i < j by letting the components with index greater than i be 0. I am going to show that Q i C , i = 1 , , k by induction. Let x ˇ Q 1 . Then x ˇ = x 1 ě 1 + ( 1 x 1 ) 0 ˇ for 0 x 1 1 , so that x ˇ C . Now suppose that Q i 1 C and let x ˇ Q i . Then x 1 + + x i 1 implies

( x 1 + + x i 1 ) 1 x i 1 .

so that

x ˇ = ( 1 x i ) 1 ( x 1 , , x i 1 , 0 , , 0 ) Q i 1 C .

Hence x ˇ = ( 1 x i ) x ˇ + x i ě i C since 0 x i 1 , which shows that Q i C .

(b) Let X , Y be vector spaces and let f ˇ = f ˇ ( 0 ˇ ) + A , for some A L ( X , Y ) , be an affine mapping from X to Y . Let C be a convex subset of X , and let y ˇ 1 = f ˇ ( x ˇ 1 ) , y ˇ 2 = f ˇ ( x ˇ 2 ) be elements of f ˇ ( C ) for some x ˇ 1 C and x ˇ 2 C . Then for 0 λ 1 , we have λ x ˇ 1 + ( 1 λ ) x ˇ 2 C , so that

λ y ˇ 1 + ( 1 λ ) y ˇ 2 = f ˇ ( 0 ˇ ) + λA ( x ˇ 1 ) + ( 1 λ ) A ( x ˇ 2 ) = f ˇ ( 0 ˇ ) + A ( λ x ˇ 1 + ( 1 λ ) x ˇ 2 ) f ˇ ( C ) .

Hence f ˇ ( C ) is convex.

User profile picture
2023-08-07 00:00
Comments