Relative interior

In mathematics, the relative interior of a set is a refinement of the concept of the interior, which is often more useful when dealing with low-dimensional sets placed in higher-dimensional spaces.

Formally, the relative interior of a set (denoted ) is defined as its interior within the affine hull of [1] In other words, where is the affine hull of and is a ball of radius centered on . Any metric can be used for the construction of the ball; all metrics define the same set as the relative interior.

A set is relatively open iff it is equal to its relative interior. Note that when is a closed subspace of the full vector space (always the case when the full vector space is finite dimensional) then being relatively closed is equivalent to being closed.

For any convex set the relative interior is equivalently defined as[2][3] where means that there exists some such that .

Comparison to interior

  • The interior of a point in an at least one-dimensional ambient space is empty, but its relative interior is the point itself.
  • The interior of a line segment in an at least two-dimensional ambient space is empty, but its relative interior is the line segment without its endpoints.
  • The interior of a disc in an at least three-dimensional ambient space is empty, but its relative interior is the same disc without its circular edge.

Properties

TheoremIf is nonempty and convex, then its relative interior is the union of a nested sequence of nonempty compact convex subsets .

Proof

Since we can always go down to the affine span of , WLOG, the relative interior has dimension . Now let .

Theorem[4]Here "+" denotes Minkowski sum.

  • for general sets. They are equal if both are also convex.
  • If are convex and relatively open sets, then is convex and relatively open.

Theorem[5]Here denotes positive cone. That is, .

  • . They are equal if is convex.

See also

References

  1. ^ Zălinescu 2002, pp. 2–3.
  2. ^ Rockafellar, R. Tyrrell (1997) [First published 1970]. Convex Analysis. Princeton, NJ: Princeton University Press. p. 47. ISBN 978-0-691-01586-6.
  3. ^ Dimitri Bertsekas (1999). Nonlinear Programming (2nd ed.). Belmont, Massachusetts: Athena Scientific. p. 697. ISBN 978-1-886529-14-4.
  4. ^ Rockafellar, R. Tyrrell (1997) [First published 1970]. Convex Analysis. Princeton, NJ: Princeton University Press. Corollary 6.6.2. ISBN 978-0-691-01586-6.
  5. ^ Rockafellar, R. Tyrrell (1997) [First published 1970]. Convex Analysis. Princeton, NJ: Princeton University Press. Theorem 6.9. ISBN 978-0-691-01586-6.

Further reading


Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.