{
  "id": "hyperplane",
  "title": "Hyperplane",
  "lang": "en",
  "source_lang": "en",
  "summary": "A hyperplane is a flat subspace of codimension one, generalizing a line in a plane and a plane in three-dimensional space.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Affine hyperplane",
    "Vector hyperplane",
    "Linear hyperplane"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/hyperplane/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/hyperplane/",
      "json": "https://aiwiki.page/zh/hyperplane.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A hyperplane is a flat subspace whose dimension is one less than that of its ambient space. In two dimensions it is a line; in three dimensions, a plane; and in one dimension, a point. The precise definition depends on whether the ambient space is a vector space, an affine space, or a projective space. Hyperplanes provide a common language for linear equations, geometric separation, and classification. (ee263.stanford.edu)"
    },
    {
      "heading": "Definition and coordinate representation",
      "text": "In the real coordinate space \\(\\mathbb{R}^n\\), an affine hyperplane has the form\n\n\\[H=\\{x\\in\\mathbb{R}^n:a^\\mathsf{T}x=b\\}, \\qquad a\\ne0,\\]\n\nwhere \\(a=(a_1,\\ldots,a_n)\\) is a coefficient vector and \\(b\\) is a scalar. Equivalently, its defining equation is\n\n\\[a_1x_1+\\cdots+a_nx_n=b.\\]\n\nThe nonzero-coefficient condition is essential: if \\(a=0\\), the equation defines either the whole space or the empty set, rather than a hyperplane. Multiplying both \\(a\\) and \\(b\\) by the same nonzero scalar leaves the set unchanged. Thus, a hyperplane does not have a unique defining equation. (ee263.stanford.edu)\n\nWhen \\(b=0\\), the hyperplane contains the origin and is a linear subspace, often called a linear or vector hyperplane. For arbitrary \\(b\\), choosing any \\(x_0\\in H\\) gives\n\n\\[H=x_0+\\{v:a^\\mathsf{T}v=0\\}.\\]\n\nAn affine hyperplane is therefore a translate of a linear hyperplane. It need not be closed under vector addition or scalar multiplication. Both types are affine sets and convex sets. (stanford.edu)"
    },
    {
      "heading": "Algebraic characterization",
      "text": "The coordinate-free definition uses a nonzero linear map \\(f:V\\to K\\), where \\(K\\) is the underlying field. Such a scalar-valued map is called a linear functional. A linear hyperplane is exactly a set\n\n\\[H=\\ker f=\\{v\\in V:f(v)=0\\}.\\]\n\nConversely, every linear subspace of codimension one is the kernel of a nonzero linear functional. The functionals defining the same hyperplane differ only by a nonzero scalar factor. (people.clas.ufl.edu)\n\nFor finite-dimensional \\(V\\), the rank–nullity theorem explains the dimension: a nonzero functional has a one-dimensional image, so its kernel has dimension \\(\\dim V-1\\). More generally, codimension one means that the quotient space \\(V/H\\) has dimension one. This formulation also applies to infinite-dimensional vector spaces. The relevant functionals belong to the dual space \\(V^*\\). (people.clas.ufl.edu)\n\nHyperplanes also describe individual constraints in a system of linear equations. For a consistent system \\(Ax=c\\), with \\(n\\) unknowns and matrix rank \\(r\\), the solution set is an affine subspace of dimension \\(n-r\\). Several hyperplane constraints therefore need not produce another hyperplane: independent constraints reduce dimension further. (ee263.stanford.edu)"
    },
    {
      "heading": "Normal vectors, distance, and projection",
      "text": "In real Euclidean space, \\(a\\) is perpendicular to every direction lying within \\(H\\), and is called a normal vector. Indeed, differences of points on \\(H\\) satisfy \\(a^\\mathsf{T}(x-y)=0\\). This interpretation uses the Euclidean inner product; the algebraic definition itself requires no notion of perpendicularity. (ee263.stanford.edu)\n\nThe distance from a point \\(p\\) to \\(H\\) is\n\n\\[d(p,H)=\\frac{|a^\\mathsf{T}p-b|}{\\|a\\|_2}.\\]\n\nRemoving the absolute value gives an oriented signed distance. Its sign indicates the side of the hyperplane containing \\(p\\), once an orientation has been chosen. The nearest point, or orthogonal projection, is\n\n\\[\\operatorname{proj}_H(p) =p-\\frac{a^\\mathsf{T}p-b}{\\|a\\|_2^2}a.\\]\n\nFor example, the plane \\(x+2y+2z=3\\) has normal vector \\((1,2,2)\\); substitution into the distance formula shows that its distance from the origin is \\(1\\). (cs.cmu.edu)"
    },
    {
      "heading": "Half-spaces and convex geometry",
      "text": "A real affine hyperplane divides \\(\\mathbb{R}^n\\) into two open half-spaces, specified by \\(a^\\mathsf{T}x<b\\) and \\(a^\\mathsf{T}x>b\\). Replacing strict inequalities by non-strict ones produces closed half-spaces sharing \\(H\\) as their boundary. This description depends on the ordering of real numbers and is not an automatic property of hyperplanes over arbitrary fields. (stanford.edu)\n\nA supporting hyperplane meets a convex set while placing the entire set in one closed half-space. A separating hyperplane places two sets on opposite sides, possibly allowing contact with the boundary. The separating hyperplane theorem guarantees weak separation for two nonempty, disjoint convex sets in finite-dimensional real space; strict separation requires additional hypotheses. (stanford.edu)\n\nIn linear programming, affine inequalities define half-spaces whose intersection forms the feasible set. Level sets of a nonconstant linear objective function are parallel hyperplanes. At an attained optimum, the corresponding level hyperplane supports the feasible set, giving a geometric interpretation of optimization. (web.stanford.edu)"
    },
    {
      "heading": "Machine learning",
      "text": "In machine learning, a classifier can assign labels according to the sign of \\(w^\\mathsf{T}x+\\beta\\). Its decision boundary is a hyperplane when \\(w\\ne0\\). Two labeled collections have linear separability when such a boundary places them strictly on opposite sides. (cs229.stanford.edu)\n\nA hard-margin support vector machine selects a separating hyperplane maximizing the minimum distance to the training data. With labels \\(y_i\\in\\{-1,1\\}\\), its standard constraints are \\(y_i(w^\\mathsf{T}x_i+\\beta)\\ge1\\), and it minimizes \\(\\tfrac12\\|w\\|_2^2\\). Soft-margin variants allow violations. With a kernel method, the separating hyperplane lies in a transformed feature space, while its boundary in the original input space may be nonlinear. (cs229.stanford.edu)"
    },
    {
      "heading": "Projective hyperplanes",
      "text": "In projective geometry, a hyperplane in \\(\\mathbb{P}^n(K)\\) has projective dimension \\(n-1\\). In homogeneous coordinates it is defined by\n\n\\[a_0x_0+\\cdots+a_nx_n=0,\\]\n\nwith coefficients not all zero. Because homogeneous coordinates represent points only up to nonzero scaling, the equation is unchanged by rescaling a representative. Projective hyperplanes correspond to points of the projective space associated with the dual vector space—a basic instance of projective duality. (cis.upenn.edu)"
    }
  ],
  "links": [
    "dimension-vector-space",
    "vector-space",
    "affine-space",
    "equation",
    "linear-subspace",
    "convex-set",
    "linear-map",
    "field-mathematics",
    "linear-functional",
    "rank-nullity-theorem",
    "quotient-vector-space",
    "dual-space",
    "system-of-linear-equations",
    "matrix-rank",
    "normal-vector",
    "inner-product",
    "euclidean-distance",
    "orthogonal-projection",
    "half-space",
    "linear-programming",
    "feasible-set",
    "objective-function",
    "machine-learning",
    "linear-separability",
    "support-vector-machine",
    "training-data",
    "kernel-method",
    "projective-geometry"
  ],
  "sources": [
    {
      "title": "ee263.stanford.edu/lectures/linalg.pdf",
      "url": "https://ee263.stanford.edu/lectures/linalg.pdf"
    },
    {
      "title": "stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf",
      "url": "https://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf"
    },
    {
      "title": "people.clas.ufl.edu/sam/files/notes-B-2025-03-14.pdf",
      "url": "https://people.clas.ufl.edu/sam/files/notes-B-2025-03-14.pdf"
    },
    {
      "title": "cs.cmu.edu/~hchai2/courses/10701/lectures/Lecture24.pdf",
      "url": "https://www.cs.cmu.edu/~hchai2/courses/10701/lectures/Lecture24.pdf"
    },
    {
      "title": "web.stanford.edu/~boyd/cvxbook//bv_cvxslides.pdf",
      "url": "https://web.stanford.edu/~boyd/cvxbook//bv_cvxslides.pdf"
    },
    {
      "title": "cs229.stanford.edu/notes_archive/cs229-notes3.pdf",
      "url": "https://cs229.stanford.edu/notes_archive/cs229-notes3.pdf"
    },
    {
      "title": "cis.upenn.edu/~jean/gma-v2-chap5.pdf",
      "url": "https://www.cis.upenn.edu/~jean/gma-v2-chap5.pdf"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}