{
  "id": "hyperplane-separation-theorem",
  "title": "Hyperplane Separation Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The hyperplane separation theorem gives conditions under which convex sets can be placed on opposite sides of a hyperplane, providing a foundation for convex analysis and optimization.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Separating hyperplane theorem",
    "Convex separation theorem"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/hyperplane-separation-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/hyperplane-separation-theorem/",
      "json": "https://aiwiki.page/zh/hyperplane-separation-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The hyperplane separation theorem is a family of results stating that, under suitable conditions, two convex sets can be separated by a hyperplane. In a finite-dimensional real space, any two nonempty, disjoint convex sets admit a nonzero linear functional whose values on one set do not exceed its values on the other. Stronger assumptions, such as compactness and closedness, can ensure a positive gap between the sets. These results connect geometric properties of convex sets with linear inequalities and underpin much of convex optimization and functional analysis."
    },
    {
      "heading": "Geometric and algebraic formulation",
      "text": "In Euclidean space \\(\\mathbb{R}^n\\), an affine hyperplane has the form\n\n\\[H=\\{x\\in\\mathbb{R}^n:a^\\mathsf{T}x=\\alpha\\},\\]\n\nwhere \\(a\\neq 0\\) is a normal vector and \\(\\alpha\\in\\mathbb{R}\\). The notation \\(a^\\mathsf{T}x\\) denotes the Euclidean inner product. The hyperplane bounds two closed half-spaces:\n\n\\[H^-=\\{x:a^\\mathsf{T}x\\leq\\alpha\\}, \\qquad H^+=\\{x:a^\\mathsf{T}x\\geq\\alpha\\}.\\]\n\nIt separates sets \\(A\\) and \\(B\\) if\n\n\\[a^\\mathsf{T}x\\leq\\alpha\\leq a^\\mathsf{T}y \\qquad \\text{for every }x\\in A,\\ y\\in B.\\]\n\nEquivalently,\n\n\\[\\sup_{x\\in A}a^\\mathsf{T}x \\leq \\inf_{y\\in B}a^\\mathsf{T}y.\\]\n\nThe normal vector must be nonzero: otherwise the inequalities give no geometric information.\n\nMore generally, in a real vector space, separation is expressed using a nonzero linear functional \\(f\\). In a topological vector space, separation theorems ordinarily require \\(f\\) to be continuous. The separating hyperplane is then the level set \\(\\{x:f(x)=\\alpha\\}\\)."
    },
    {
      "heading": "Degrees of separation",
      "text": "Several inequivalent conclusions are called “separation.” Terminology differs among texts, so the inequalities are more definitive than the names.\n\nWeak separation\n\nThe sets are weakly separated if there exist \\(a\\neq 0\\) and \\(\\alpha\\) such that\n\n\\[a^\\mathsf{T}x\\leq\\alpha\\leq a^\\mathsf{T}y \\quad(x\\in A,\\ y\\in B).\\]\n\nEither or both sets may meet the hyperplane. Both can even lie entirely in it, so weak separation alone does not imply disjointness.\n\nProper separation\n\nA weak separation is proper if \\(A\\cup B\\) is not contained in the separating hyperplane. Equivalently, at least one of the separating inequalities is strict for at least one point.\n\nThis rules out a separation that merely places both sets inside a common hyperplane.\n\nStrict separation\n\nUnder one common convention, strict separation means\n\n\\[a^\\mathsf{T}x<\\alpha<a^\\mathsf{T}y \\quad(x\\in A,\\ y\\in B).\\]\n\nEvery point lies strictly on its designated side, but the sets may approach the hyperplane arbitrarily closely. In particular, pointwise strict inequalities do not necessarily imply a positive gap between the supremum on \\(A\\) and the infimum on \\(B\\).\n\nStrong separation\n\nStrong separation requires\n\n\\[\\sup_{x\\in A}a^\\mathsf{T}x < \\inf_{y\\in B}a^\\mathsf{T}y.\\]\n\nEquivalently, there exist \\(a\\neq 0\\), \\(\\alpha\\), and \\(\\varepsilon>0\\) such that\n\n\\[a^\\mathsf{T}x\\leq\\alpha-\\varepsilon, \\qquad a^\\mathsf{T}y\\geq\\alpha+\\varepsilon.\\]\n\nThis gives a uniform margin. By the Cauchy–Schwarz inequality, the distance between the sets is then at least \\(2\\varepsilon/\\|a\\|\\).\n\nSome authors use “strict separation” for this stronger condition."
    },
    {
      "heading": "Principal finite-dimensional theorems",
      "text": "Let \\(A,B\\subseteq\\mathbb{R}^n\\) be nonempty and convex.\n\nDisjoint convex sets\n\nIf \\(A\\cap B=\\varnothing\\), then \\(A\\) and \\(B\\) can be properly separated, and therefore weakly separated.\n\nNo openness, closedness, or boundedness assumption is needed for this conclusion. Disjointness alone, however, does not guarantee strict or strong separation.\n\nA more general criterion uses relative interior, meaning interior within the smallest affine space containing a set. Two nonempty convex sets can be properly separated if and only if their relative interiors are disjoint. Thus proper separation can occur even when the sets share boundary points.\n\nOpen convex sets\n\nIf \\(A\\) is an open set and is disjoint from \\(B\\), a separator can be chosen with\n\n\\[a^\\mathsf{T}x<\\alpha\\leq a^\\mathsf{T}y \\quad(x\\in A,\\ y\\in B).\\]\n\nIf both sets are open, both sides can be made strict:\n\n\\[a^\\mathsf{T}x<\\alpha<a^\\mathsf{T}y.\\]\n\nOpenness does not by itself provide a uniform margin.\n\nA compact set and a closed set\n\nIf \\(A\\) is compact, \\(B\\) is closed, and the two sets are disjoint, then they can be strongly separated.\n\nIn particular, a point outside a nonempty closed convex set can be strongly separated from that set. Compactness of one set prevents the two disjoint sets from approaching each other only “at infinity.”\n\nPositive distance\n\nMore generally, if\n\n\\[\\operatorname{dist}(A,B) = \\inf\\{\\|x-y\\|:x\\in A,\\ y\\in B\\}>0,\\]\n\nthen the convex sets can be strongly separated. Conversely, strong separation implies positive distance.\n\nThus positive distance characterizes strong separability for nonempty convex sets in finite-dimensional Euclidean space. Closedness of both sets alone is insufficient."
    },
    {
      "heading": "Proof ideas",
      "text": "Closest points and a perpendicular separator\n\nSuppose \\(A\\) is compact, \\(B\\) is closed, and they are nonempty, convex, and disjoint. There exist points \\(p\\in A\\) and \\(q\\in B\\) realizing their positive minimum distance. Set\n\n\\[a=q-p.\\]\n\nFor any \\(x\\in A\\), convexity ensures that \\(p+t(x-p)\\in A\\) for \\(0\\leq t\\leq1\\). Since \\(p,q\\) minimize distance, differentiating the squared distance at \\(t=0\\) gives\n\n\\[a^\\mathsf{T}(x-p)\\leq0.\\]\n\nThe analogous argument in \\(B\\) gives\n\n\\[a^\\mathsf{T}(y-q)\\geq0 \\qquad(y\\in B).\\]\n\nConsequently,\n\n\\[\\sup_{x\\in A}a^\\mathsf{T}x \\leq a^\\mathsf{T}p < a^\\mathsf{T}q \\leq \\inf_{y\\in B}a^\\mathsf{T}y,\\]\n\nbecause\n\n\\[a^\\mathsf{T}(q-p)=\\|q-p\\|^2>0.\\]\n\nThe hyperplane perpendicular to the segment joining \\(p\\) and \\(q\\), through its midpoint, strongly separates the sets.\n\nReduction to separation from the origin\n\nFor general disjoint convex sets, consider their difference set\n\n\\[C=B-A=\\{y-x:y\\in B,\\ x\\in A\\}.\\]\n\nThis set is convex and does not contain \\(0\\). A separation theorem for a point and a convex set yields a nonzero \\(a\\) satisfying\n\n\\[a^\\mathsf{T}c\\geq0 \\qquad(c\\in C).\\]\n\nIt follows that\n\n\\[a^\\mathsf{T}x\\leq a^\\mathsf{T}y \\qquad(x\\in A,\\ y\\in B),\\]\n\nwhich gives a weak separating hyperplane.\n\nOne finite-dimensional proof separates \\(0\\) from the closure of \\(C\\). If \\(0\\) lies outside that closure, a nearest-point argument applies. If \\(0\\) lies on its boundary, separating normals obtained from nearby exterior points can be normalized; compactness of the unit sphere provides a convergent subsequence and a nonzero limiting normal. A refinement within the affine span gives proper separation."
    },
    {
      "heading": "Supporting hyperplanes",
      "text": "A closely related result is the supporting hyperplane theorem. If \\(C\\subseteq\\mathbb{R}^n\\) is nonempty and convex and \\(x_0\\) is a boundary point of \\(C\\), there exists \\(a\\neq0\\) such that\n\n\\[a^\\mathsf{T}x\\leq a^\\mathsf{T}x_0 \\qquad(x\\in C).\\]\n\nThe hyperplane through \\(x_0\\) therefore bounds a half-space containing \\(C\\).\n\nFor a set with empty interior, a supporting hyperplane may contain the entire set. Relative-interior formulations distinguish such containment from support that exposes a genuine boundary within the set’s affine span.\n\nPoint–set separation also gives the representation\n\n\\[C= \\bigcap \\{H^-:H^-\\text{ is a closed half-space containing }C\\}\\]\n\nfor every nonempty closed convex set \\(C\\subseteq\\mathbb{R}^n\\). Convexity and closedness are therefore exactly the properties needed for a set to be represented as an intersection of closed half-spaces."
    },
    {
      "heading": "Infinite-dimensional versions",
      "text": "In a real locally convex topological vector space, separation is formulated using continuous linear functionals. Two central versions are:\n\n- A nonempty open convex set and a disjoint nonempty convex set admit separation with a strict inequality on the open side.\n- A point outside a nonempty closed convex set can be strongly separated from it.\n\nThese statements are closely connected to the Hahn–Banach theorem. Its analytic form extends dominated linear functionals; its geometric forms produce separating functionals. The continuous separating functionals belong to the continuous dual space.\n\nEvery normed vector space is locally convex, so these versions apply there. Unlike in finite dimensions, a closed bounded set need not be compact, and distance-minimizing points need not exist. Functional-analytic proofs therefore cannot always rely on a nearest pair.\n\nLocal convexity is substantive: without it, a topological vector space may have too few continuous linear functionals to separate points and closed convex sets."
    },
    {
      "heading": "Applications",
      "text": "Optimization and certificates of infeasibility\n\nIn mathematical optimization, separation converts a geometric incompatibility into a linear certificate. A point outside a closed convex feasible set can be excluded by a valid linear inequality that retains every feasible point.\n\nThis principle underlies separation-based algorithms and results such as Farkas’ lemma. For a real matrix \\(M\\) and vector \\(b\\), exactly one of the following holds:\n\n\\[Mx=b,\\qquad x\\geq0,\\]\n\nor\n\n\\[M^\\mathsf{T}y\\geq0,\\qquad b^\\mathsf{T}y<0.\\]\n\nThe second system provides a certificate that the first has no solution.\n\nSeparation also supports Lagrangian duality and the derivation of Karush–Kuhn–Tucker conditions. The strength of the resulting conclusions depends on appropriate regularity assumptions; convexity alone does not guarantee every strong-duality statement.\n\nConvex functions\n\nThe epigraph of a convex function is a convex set. Supporting hyperplanes to the epigraph give affine lower bounds and, when available, subgradients.\n\nFor a differentiable convex function \\(f:\\mathbb{R}^n\\to\\mathbb{R}\\), this yields\n\n\\[f(y)\\geq f(x)+\\nabla f(x)^\\mathsf{T}(y-x).\\]\n\nHere the gradient determines the slope of a supporting hyperplane to the epigraph at \\((x,f(x))\\).\n\nLinear classification\n\nIn machine learning, a finite labeled dataset admits a strict affine linear separator exactly when the convex hulls of its two classes are disjoint. Because finite convex hulls are compact, disjointness also implies a positive separating margin.\n\nA support vector machine uses this geometry to seek a maximum-margin separator. If the hulls intersect, no hyperplane can strictly separate every training point in the original feature space."
    },
    {
      "heading": "Limitations and counterexamples",
      "text": "Disjoint closed convex sets need not be strongly separated\n\nConsider\n\n\\[A=\\{(x,y)\\in\\mathbb{R}^2:y\\geq e^x\\}, \\qquad B=\\{(x,y)\\in\\mathbb{R}^2:y\\leq0\\}.\\]\n\nBoth are closed and convex, and they are disjoint. Nevertheless, their distance is zero because \\(e^x\\to0\\) as \\(x\\to-\\infty\\). They cannot be strongly separated.\n\nThey also cannot be strictly separated in the two-sided pointwise sense defined above. The horizontal boundary of \\(B\\) forces any separator to be horizontal, while \\(A\\) approaches that boundary arbitrarily closely. They do admit one-sided strict separation:\n\n\\[y_B\\leq0<y_A.\\]\n\nConvexity cannot generally be omitted\n\nLet\n\n\\[A=\\{(-1,0),(1,0)\\}, \\qquad B=\\{(0,-1),(0,1)\\}.\\]\n\nThe sets are disjoint, but no nonzero linear functional weakly separates them. Any separating functional would also separate their convex hulls; the horizontal and vertical segments force its value to vanish in both coordinate directions.\n\nMore generally, a linear inequality valid on a set is valid on its convex hull. Hyperplane separability therefore depends on the convex hulls of the sets, not merely on whether the original sets intersect."
    }
  ],
  "links": [
    "convex-set",
    "hyperplane",
    "convex-optimization",
    "functional-analysis",
    "euclidean-space",
    "inner-product",
    "half-space",
    "vector-space",
    "linear-functional",
    "cauchy-schwarz-inequality",
    "euclidean-distance",
    "affine-space",
    "open-set",
    "compact-space",
    "closed-set",
    "closure-topology",
    "hahn-banach-theorem",
    "dual-space",
    "normed-vector-space",
    "mathematical-optimization",
    "feasible-set",
    "lagrangian-duality",
    "karush-kuhn-tucker-conditions",
    "convex-function",
    "gradient",
    "machine-learning",
    "convex-hull",
    "support-vector-machine"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}