Solutions Manual to Accompany Geometry of Convex SetsISBN: 9781119184188
124 pages
April 2016

Description
A Solutions Manual to accompany Geometry of Convex Sets
Geometry of Convex Sets begins with basic definitions of the concepts of vector addition and scalar multiplication and then defines the notion of convexity for subsets of ndimensional space. Many properties of convex sets can be discovered using just the linear structure. However, for more interesting results, it is necessary to introduce the notion of distance in order to discuss open sets, closed sets, bounded sets, and compact sets. The book illustrates the interplay between these linear and topological concepts, which makes the notion of convexity so interesting.Thoroughly classtested, the book discusses topology and convexity in the context of normed linear spaces, specifically with a norm topology on an ndimensional space.
Geometry of Convex Sets also features:
 An introduction to ndimensional geometry including points; lines; vectors; distance; norms; inner products; orthogonality; convexity; hyperplanes; and linear functionals
 Coverage of ndimensional norm topology including interior points and open sets; accumulation points and closed sets; boundary points and closed sets; compact subsets of ndimensional space; completeness of ndimensional space; sequences; equivalent norms; distance between sets; and support hyperplanes ·
 Basic properties of convex sets; convex hulls; interior and closure of convex sets; closed convex hulls; accessibility lemma; regularity of convex sets; affine hulls; flats or affine subspaces; affine basis theorem; separation theorems; extreme points of convex sets; supporting hyperplanes and extreme points; existence of extreme points; Krein–Milman theorem; polyhedral sets and polytopes; and Birkhoff’s theorem on doubly stochastic matrices
 Discussions of Helly’s theorem; the Art Gallery theorem; Vincensini’s problem; Hadwiger’s theorems; theorems of Radon and Caratheodory; Kirchberger’s theorem; Hellytype theorems for circles; covering problems; piercing problems; sets of constant width; Reuleaux triangles; Barbier’s theorem; and Borsuk’s problem
Geometry of Convex Sets is a useful textbook for upperundergraduate level courses in geometry of convex sets and is essential for graduatelevel courses in convex analysis. An excellent reference for academics and readers interested in learning the various applications of convex geometry, the book is also appropriate for teachers who would like to convey a better understanding and appreciation of the field to students.
I. E. Leonard, PhD, was a contract lecturer in the Department of Mathematical and Statistical Sciences at the University of Alberta. The author of over 15 peerreviewed journal articles, he is a technical editor for the Canadian Applied Mathematical Quarterly journal.
J. E. Lewis, PhD, is Professor Emeritus in the Department of Mathematical Sciences at the University of Alberta. He was the recipient of the Faculty of Science Award for Excellence in Teaching in 2004 as well as the PIMS Education Prize in 2002.
Table of Contents
Preface vii
1 Introduction to NDimensional Geometry 1
1.2 Points, Vectors, and Parallel Lines 1
1.2.5 Problems 1
1.4 Inner Product and Orthogonality 3
1.4.3 Problems 3
1.6 Hyperplanes and Linear Functionals 5
1.6.3 Problems 5
2 Topology 13
2.3 Accumulation Points and Closed Sets 13
2.3.4 Problems 13
2.6 Applications of Compactness 20
2.6.5 Problems 20
3 Convexity 35
3.2 Basic Properties of Convex Sets 35
3.2.1 Problems 35
3.3 Convex Hulls 43
3.3.1 Problems 43
3.4 Interior and Closure of Convex Sets 52
3.4.4 Problems 52
3.5 Affine Hulls 55
3.5.4 Problems 55
3.6 Separation Theorems 66
3.6.2 Problems 66
3.7 Extreme Points of Convex Sets 78
3.7.7 Problems 78
4 Helly’s Theorem 89
4.1 Finite Intersection Property 89
4.1.2 Problems 89
4.3 Applications of Helly’s Theorem 92
4.3.9 Problems 92
4.4 Sets of Constant Width 99
4.4.8 Problems 99
Bibliography 109
Index 113