Canonical: https://knowlpedia.com/convex-analysis/separation-of-two-convex-sets-via-the-core-condition/

# Separation of Two Convex Sets via the Core Condition

If core(Ω1)≠∅ and core(Ω1) is disjoint from Ω2, then Ω1 and Ω2 are separable by a hyperplane.

Let \(X\) be a real [vector space](https://knowlpedia.com/linear-algebra/vector-space/) and let \(\Omega_1,\Omega_2\subset X\) be nonempty [convex sets](https://knowlpedia.com/convex-analysis/convex-set/). Assume [core(Ω₁)](https://knowlpedia.com/convex-analysis/algebraic-interior-core/) \(\neq\emptyset\) and
\[
\operatorname{core}(\Omega_1)\cap \Omega_2=\emptyset.
\]

**Theorem**: The sets \(\Omega_1\) and \(\Omega_2\) can be [separated by a hyperplane](https://knowlpedia.com/convex-analysis/separation-by-a-hyperplane/).

**Context:**
This strengthens the disjointness condition by requiring only that \(\Omega_2\) avoid the core of \(\Omega_1\). The argument uses [idempotence of core](https://knowlpedia.com/convex-analysis/idempotence-of-the-core-operator/) and the [auxiliary separation lemma](https://knowlpedia.com/convex-analysis/auxiliary-separation-lemma-for-disjoint-convex-sets-with-nonempty-core/).
