<< Chapter < Page | Chapter >> Page > |
We begin with a quick review of basic set theory from undergraduate courses.
Definition 1 A set is an unordered collection of objects denoted by a capital letter and written explicitly by listing its elements .
Definition 2 The union of two sets and is denoted by . The intersection of two sets and is denoted by .
Definition 3 A set is contained in another set , denoted , if . Two sets and are equal if .
Definition 4 The complement of is the set . The empty set is denoted by .
Definition 5 A set is finite if it has a finite number of elements. A set is countably infinite if there is a one-to-one relationship between its elements and the integers . A set is uncountably infinite if it is not finite or countably infinite.
Definition 6 A set is convex if for all all convex combinations of and are in , i.e., for all we have .
Example 1 [link] below shows that the line (containing all convex combinations of and ) is included in ; since this is true for each then the set is convex. Conversely, for the set we can find two points such that the line is not completely contained in ; therefore, is not convex.
Fact 1 If A is convex then is convex for .
Definition 7 The convex hull of a set is the smallest convex set S such that
Example 2 Consider the set in [link] below, which is not convex. By adding to all points that are convex combinations of elements of but not in (i.e., the points in the shaded region), we obtain the convex hull of .
A set with a single element is always convex.
Notification Switch
Would you like to follow the 'Signal theory' conversation and receive update notifications?