Scribd
Upload
16 views3 pages

Convex Sets (Unit-2)

Uploaded by

aniket.23556
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
16 views3 pages

Convex Sets (Unit-2)

Uploaded by

aniket.23556
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
456 CHAPTER 8 The Geometry of Vector Spaces 8.3 SOLUTIONS TO PRACTICE PROBLEMS 1. From Example 1, the problem is to determine if the points are affinely dependent. ‘Use the method of Example 2 and subtract one point from the other two. IF one of these two new points i a multiple of the other, the original three points lie ona line 2. The proof of Theorem 5 essentially points out that an affine dependence relation ‘among points corresponds to a linear dependence relation among the homogeneous forms of the points, using the same weights. So, row reduce: 4 pea ad nw) afa 2[~|41 5 4 1 1] [1 0 4 2 1 A ~fo 125 ° 75 ‘View this matrix as the coefficient matrix for Ax = 0 with four variables. Then x. is tree, xy = x4, x2 = —1.25xq, and xy = =.75x4, One solution is xy =x. = 4, 22 = —5, and xy = —3, A linear dependence among the homogeneous forms is 4h, — 5%, — 3¥y + 484 = 0. So4y; — Sv — 3¥5 + 4, = 0. Another solution method is to translate the problem to the origin by subtracting 'y; from the other points, find a linear dependence relation among the translated points, and then rearrange the terms. The amount of arithmetic involved is about ‘the same as in the approach shown above. CONVEX COMBINATIONS Section 8.1 considered special linear combinations of the form eave Heava test ceva, where ey eg +o og ‘This section further restricts the weights to be nonnegative. DEFINITION A convex combination of points v1.¥2,....¥ in R" is a linear combination of the form av eave bob eave such that cy +62 +--+ = 1 and cj 20 for all i. The set of all convex ‘combinations of points ina set $ is called the convex hulll of 5, denoted by conv S. ‘The convex hull of a single point v, is just the set {¥1}, the same asthe affine hull In other cases, the convex hull is properly contained in the affine hull. Recall that the affine hull of distinct points vy and v2 isthe line YSU =Ov tev, withr ink ‘Because the weights in a convex combination are nonnegative, the points in conv (v1, ¥2} ‘may be written as y=(-)y tiv, withOsr Oand y= Coe n( Si tot Sg) + oeeaven, w By the induetion hypothesis, the point z = (¢1/#)v, +--+ (ea/t)¥e is in S, since the nonnegative coefficients sum to 1. Thus equation (1) displays y asa convex combination ‘of two points in 5. By the principle of induction, every convex combination of such points lies in S. . ‘Theorem 9 below provides a more geometric characterization of the convex hull ‘of a set, It requires a preliminary result on intersections of sets. Recall from Section 4.1 (Exercise 32) that the intersection of two subspaces is itself a subspace. In fact, the intersection of any collection of subspaces is itself a subspace. A similar result holds for affine sets and convex sets. s conv $ T conv 7

You might also like