{
  "id": "half-space",
  "title": "Half-space",
  "lang": "en",
  "source_lang": "en",
  "summary": "A half-space is a region on one side of a hyperplane, with the boundary either included or excluded.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Halfspace"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/half-space/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/half-space/",
      "json": "https://aiwiki.page/zh/half-space.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A half-space is either of the two regions into which a hyperplane divides a real Euclidean space, with or without the dividing hyperplane itself. Including the boundary gives a closed half-space; excluding it gives an open half-space. Half-spaces provide the geometric interpretation of linear inequalities and are basic building blocks of convex sets. (web.stanford.edu)"
    },
    {
      "heading": "Definition and geometry",
      "text": "For a nonzero vector \\(a\\in\\mathbb R^n\\) and a scalar \\(b\\in\\mathbb R\\), a closed half-space is\n\n\\[H_{\\leq}=\\{x\\in\\mathbb R^n:a^{\\mathsf T}x\\leq b\\}.\\]\n\nIts boundary is the hyperplane\n\n\\[P=\\{x:a^{\\mathsf T}x=b\\}.\\]\n\nHere \\(a^{\\mathsf T}x\\) is the standard inner product. The vector \\(a\\) is perpendicular to \\(P\\) and points outward from \\(H_{\\leq}\\), toward increasing values of \\(a^{\\mathsf T}x\\). Reversing the inequality selects the opposite side. (web.stanford.edu)\n\nThus, “half” identifies a side of a dividing hyperplane, not a finite region of half the space’s volume. In \\(\\mathbb R^2\\), the region is a half-plane; in \\(\\mathbb R^3\\), it is bounded by an ordinary plane. Multiplying both \\(a\\) and \\(b\\) by a positive scalar leaves the defining inequality unchanged. (web.stanford.edu)"
    },
    {
      "heading": "Open and closed half-spaces",
      "text": "The strict inequality\n\n\\[H_{<}=\\{x:a^{\\mathsf T}x<b\\}\\]\n\ndefines an open set, whereas \\(H_{\\leq}\\) is a closed set. Their boundary is \\(P\\); the interior of \\(H_{\\leq}\\) is \\(H_<\\), and the closure of \\(H_<\\) is \\(H_{\\leq}\\). These descriptions also hold in a real Hilbert space when \\(a^{\\mathsf T}x\\) is replaced by \\(\\langle a,x\\rangle\\). (arxiv.org)\n\nThe two opposite open half-spaces are disjoint. The two opposite closed half-spaces intersect exactly in their boundary hyperplane. Consequently,\n\n\\[\\{x:a^{\\mathsf T}x=b\\} = \\{x:a^{\\mathsf T}x\\leq b\\} \\cap \\{x:a^{\\mathsf T}x\\geq b\\}.\\]\n\n(stanford.edu)"
    },
    {
      "heading": "Convexity",
      "text": "Every half-space is convex. For example, if \\(x,y\\in H_{\\leq}\\) and \\(0\\leq t\\leq1\\), then\n\n\\[a^{\\mathsf T}\\bigl(tx+(1-t)y\\bigr) =t\\,a^{\\mathsf T}x+(1-t)a^{\\mathsf T}y \\leq b.\\]\n\nHence every convex combination of two points in the half-space remains inside it. The same argument applies to strict inequalities. (courses.csail.mit.edu)"
    },
    {
      "heading": "Intersections and optimization",
      "text": "A polyhedron is an intersection of finitely many closed half-spaces. Using a matrix \\(A\\), it can be written\n\n\\[Q=\\{x:Ax\\leq b\\},\\]\n\nwhere the inequalities are interpreted componentwise. Equality constraints can be represented by pairs of opposite inequalities. Such intersections may be bounded, unbounded, lower-dimensional, or empty; they are convex because intersections preserve convexity. (stanford.edu)\n\nIn linear programming, these intersections describe the feasible set. Half-spaces also express separation: a hyperplane can place a closed convex set on one side and an exterior point strictly on the other. This connects linear inequalities with geometric certificates of infeasibility. (courses.csail.mit.edu)"
    },
    {
      "heading": "Distance and projection",
      "text": "For \\(H_{\\leq}=\\{x:a^{\\mathsf T}x\\leq b\\}\\), the distance from a point \\(z\\) to the half-space is\n\n\\[\\operatorname{dist}(z,H_{\\leq}) =\\frac{\\max\\{0,a^{\\mathsf T}z-b\\}}{\\|a\\|_2}.\\]\n\nIts nearest-point projection is\n\n\\[\\Pi_{H_{\\leq}}(z) =z-\\frac{\\max\\{0,a^{\\mathsf T}z-b\\}}{\\|a\\|_2^2}\\,a.\\]\n\nA point already inside is unchanged; an exterior point moves perpendicularly to the boundary. The formula extends to real Hilbert spaces and supports projection algorithms for systems of inequalities. (arxiv.org)"
    },
    {
      "heading": "Nondegeneracy",
      "text": "The requirement \\(a\\ne0\\) is essential. If \\(a=0\\), the inequality \\(a^{\\mathsf T}x\\leq b\\) describes the whole space when \\(b\\geq0\\), and the empty set when \\(b<0\\); neither has a dividing hyperplane. A half-space should also be distinguished from its boundary: the half-space is full-dimensional, while the hyperplane has dimension \\(n-1\\). (web.stanford.edu)"
    }
  ],
  "links": [
    "hyperplane",
    "euclidean-space",
    "convex-set",
    "inner-product",
    "open-set",
    "closed-set",
    "closure-topology",
    "hilbert-space",
    "convex-combination",
    "polyhedron",
    "matrix",
    "linear-programming",
    "feasible-set"
  ],
  "sources": [
    {
      "title": "Convex Optimization",
      "url": "https://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf"
    },
    {
      "title": "Convex Optimization — Lecture Slides",
      "url": "https://web.stanford.edu/~boyd/cvxbook/bv_cvxslides.pdf"
    },
    {
      "title": "Linear Programming Lecture Notes",
      "url": "https://courses.csail.mit.edu/6.854/18/Scribe/s11-lp/s11-lp.html"
    },
    {
      "title": "Projecting onto intersections of halfspaces and hyperplanes",
      "url": "https://arxiv.org/abs/2006.06995"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}