Canonical: https://knowlpedia.com/convex-analysis/interior-and-closure-of-a-convex-set-are-convex/

# Interior and closure of a convex set are convex

In a normed space, the interior and closure of a convex set are convex.

Let \(X\) be a [normed vector space](https://knowlpedia.com/convex-analysis/norm-normed-vector-space/) and \(\Omega\subseteq X\) a [convex set](https://knowlpedia.com/convex-analysis/convex-set/). Then:

- the [interior](https://knowlpedia.com/convex-analysis/interior-of-a-set/) \(\operatorname{int}(\Omega)\) is convex, possibly empty;
- the [closure](https://knowlpedia.com/convex-analysis/closure-of-a-set/) \(\overline{\Omega}\) is convex.

## Remarks

**Context.** Convexity is stable under two basic topological operations in normed spaces, which is essential for analyzing convex feasible regions.

**Proof sketch.** For \(\overline{\Omega}\), approximate points by sequences in \(\Omega\) and use convexity plus limit arguments. For \(\mathrm{int}(\Omega)\), if \(x,y\in\mathrm{int}(\Omega)\) then small balls around \(x\) and \(y\) lie in \(\Omega\); convex combinations of these balls give a neighborhood of \(\lambda x+(1-\lambda)y\) contained in \(\Omega\), so the combination lies in \(\mathrm{int}(\Omega)\).
