Abstract
Now that we have a solid background in Euclidean geometry, we can go deeper into our study of convex sets begun in Chapter 3. This chapter is devoted to a thorough study of separating and supporting hyperplanes. We prove two geometric versions of the Hahn–Banach theorem, from which we derive separation results for various kinds of pairs of convex sets (open, closed, compact). We prove various versions of Farkas’s lemma, a basic result in the theory of linear programming. We also discuss supporting hyperplanes and prove an important proposition due to Minkowski.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexander Barvinok. A Course in Convexity. GSM, Vol. 54. AMS, first edition, 2002.
Marcel Berger. G´eom´etrie 2. Nathan, 1990. English edition: Geometry 2, Universitext,Springer-Verlag.
Nicolas Bourbaki. Espaces Vectoriels Topologiques. El’ements de Math’ematiques. Hermann,1981.
Peter D. Lax. Functional Analysis. Wiley, first edition, 2002.
Jiri Matousek. Lectures on Discrete Geometry. GTM No. 212. Springer-Verlag, first edition,2002.
Jiri Matousek and Bernd Gartner. Understanding and Using Linear Programming. Universitext. Springer-Verlag, first edition, 2007.
Frederick A. Valentine. Convex Sets. McGraw-Hill, first edition, 1964.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Businees Media, LLC
About this chapter
Cite this chapter
Gallier, J. (2011). Separating and Supporting Hyperplanes. In: Geometric Methods and Applications. Texts in Applied Mathematics, vol 38. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9961-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9961-0_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9960-3
Online ISBN: 978-1-4419-9961-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)