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 ${\displaystyle S}$ (denoted ${\displaystyle \operatorname {relint} (S)}$) is defined as its interior within the affine hull of ${\displaystyle S.}$^[1] In other words, $${\displaystyle \operatorname {relint} (S):=\{x\in S:{\text{ there exists }}\epsilon >0{\text{ such that }}B_{\epsilon }(x)\cap \operatorname {aff} (S)\subseteq S\},}$$ where ${\displaystyle \operatorname {aff} (S)}$ is the affine hull of ${\displaystyle S,}$ and ${\displaystyle B_{\epsilon }(x)}$ is a ball of radius ${\displaystyle \epsilon }$ centered on ${\displaystyle x}$. 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 ${\displaystyle \operatorname {aff} (S)}$ 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 ${\displaystyle C\subseteq \mathbb {R} ^{n}}$ the relative interior is equivalently defined as^[2][3] $${\displaystyle {\begin{aligned}\operatorname {relint} (C)&:=\{x\in C:{\text{ for all }}y\in C,{\text{ there exists some }}\lambda >1{\text{ such that }}\lambda x+(1-\lambda )y\in C\}\\&=\{x\in C:{\text{ for all }}y\neq x\in C,{\text{ there exists some }}z\in C{\text{ such that }}x\in (y,z)\}.\end{aligned}}}$$ where ${\displaystyle x\in (y,z)}$ means that there exists some ${\displaystyle 0<\lambda <1}$ such that ${\displaystyle x=\lambda z+(1-\lambda )y}$.

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

Theorem — If ${\displaystyle A\subset \mathbb {R} ^{n}}$ is nonempty and convex, then its relative interior ${\displaystyle \mathrm {relint} (A)}$ is the union of a nested sequence of nonempty compact convex subsets ${\displaystyle K_{1}\subset K_{2}\subset K_{3}\subset \cdots \subset \mathrm {relint} (A)}$.

Proof

Since we can always go down to the affine span of ${\displaystyle A}$, WLOG, the relative interior has dimension ${\displaystyle n}$. Now let ${\displaystyle K_{j}\equiv [-j,j]^{n}\cap \left\{x\in {\text{int}}(K):\mathrm {dist} (x,({\text{int}}(K))^{c})\geq {\frac {1}{j}}\right\}}$.

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

• ${\displaystyle \mathrm {relint} (S_{1})+\mathrm {relint} (S_{2})\subset \mathrm {relint} (S_{1}+S_{2})}$ for general sets. They are equal if both ${\displaystyle S_{1},S_{2}}$ are also convex.

• If ${\displaystyle S_{1},S_{2}}$ are convex and relatively open sets, then ${\displaystyle S_{1}+S_{2}}$ is convex and relatively open.

Theorem^[5] — Here ${\displaystyle \mathrm {Cone} }$ denotes positive cone. That is, ${\displaystyle \mathrm {Cone} (S)=\{rx:x\in S,r>0\}}$.

• ${\displaystyle \mathrm {Cone} (\mathrm {relint} (S))\subset \mathrm {relint} (\mathrm {Cone} (S))}$. They are equal if ${\displaystyle S}$ is convex.

See also

• Interior (topology) – Largest open subset of some given set
• Algebraic interior – Generalization of topological interior
• Quasi-relative interior – Generalization of algebraic interior

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.

• Zălinescu, Constantin (30 July 2002). Convex Analysis in General Vector Spaces. River Edge, N.J. London: World Scientific Publishing. ISBN 978-981-4488-15-0. MR 1921556. OCLC 285163112 – via Internet Archive.

Further reading

• Boyd, Stephen; Lieven Vandenberghe (2004). Convex Optimization. Cambridge: Cambridge University Press. p. 23. ISBN 0-521-83378-7.