{
  "id": "simplex",
  "title": "Simplex",
  "lang": "en",
  "source_lang": "en",
  "summary": "A simplex is the convex hull of affinely independent points, generalizing a point, line segment, triangle, and tetrahedron to arbitrary dimensions.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "n-simplex",
    "geometric simplex"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/simplex/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/simplex/",
      "json": "https://aiwiki.page/zh/simplex.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A simplex is the convex hull of a finite set of affinely independent points. An \\(n\\)-dimensional simplex, or \\(n\\)-simplex, has exactly \\(n+1\\) vertices: a point is a \\(0\\)-simplex, a line segment a \\(1\\)-simplex, a filled triangle a \\(2\\)-simplex, and a solid tetrahedron a \\(3\\)-simplex. Simplices are fundamental objects in geometry, topology, and computation because they provide particularly simple building blocks for higher-dimensional spaces."
    },
    {
      "heading": "Definition and affine independence",
      "text": "Let \\(v_0,\\ldots,v_n\\) be points in a real affine space, such as Euclidean space \\(\\mathbb{R}^m\\). These points are affinely independent if the vectors\n\n\\[v_1-v_0,\\ldots,v_n-v_0\\]\n\nare linearly independent. In particular, this requires \\(n\\leq m\\).\n\nThe simplex with these vertices is\n\n\\[\\sigma=\\operatorname{conv}\\{v_0,\\ldots,v_n\\} = \\left\\{ \\sum_{i=0}^{n}\\lambda_i v_i: \\lambda_i\\geq 0,\\quad \\sum_{i=0}^{n}\\lambda_i=1 \\right\\}.\\]\n\nThus, its points are precisely the convex combinations of its vertices. Its dimension is \\(n\\), even if it lies in a higher-dimensional ambient space.\n\nAffine independence is essential. Three collinear points, for example, do not determine a \\(2\\)-simplex: their convex hull is a segment. Configurations with this kind of dependence are sometimes called degenerate simplices, but they are excluded from the usual definition of a geometric \\(n\\)-simplex.\n\nA simplex is a convex set and a bounded convex polytope. It has the smallest possible number of vertices for a polytope of its dimension."
    },
    {
      "heading": "Standard simplex and barycentric coordinates",
      "text": "The standard \\(n\\)-simplex is commonly defined as\n\n\\[\\Delta^n= \\left\\{ (\\lambda_0,\\ldots,\\lambda_n)\\in\\mathbb{R}^{n+1}: \\lambda_i\\geq 0,\\quad \\sum_{i=0}^{n}\\lambda_i=1 \\right\\}.\\]\n\nIts vertices are the \\(n+1\\) standard coordinate vectors. Although it is represented in \\(\\mathbb{R}^{n+1}\\), it lies in an \\(n\\)-dimensional hyperplane.\n\nAnother common coordinate model is\n\n\\[\\widehat{\\Delta}^{\\,n} = \\left\\{ (x_1,\\ldots,x_n)\\in\\mathbb{R}^{n}: x_i\\geq 0,\\quad \\sum_{i=1}^{n}x_i\\leq 1 \\right\\},\\]\n\nwhose vertices are \\(0,e_1,\\ldots,e_n\\). These models are related by setting\n\n\\[\\lambda_0=1-\\sum_{i=1}^{n}x_i, \\qquad \\lambda_i=x_i\\quad (1\\leq i\\leq n).\\]\n\nEvery point \\(x\\) of a simplex has a unique representation\n\n\\[x=\\sum_{i=0}^{n}\\lambda_i v_i, \\qquad \\sum_{i=0}^{n}\\lambda_i=1.\\]\n\nThe coefficients \\(\\lambda_i\\) are its barycentric coordinates. On the simplex they are nonnegative; on its entire affine hull they may also be negative.\n\nThe map\n\n\\[F(\\lambda_0,\\ldots,\\lambda_n) = \\sum_{i=0}^{n}\\lambda_i v_i\\]\n\nis an affine bijection from the standard simplex to any simplex with the specified vertices. Consequently, all \\(n\\)-simplices are equivalent under invertible affine maps between their affine hulls. They need not be congruent or have the same angles or edge lengths."
    },
    {
      "heading": "Faces, boundary, and interior",
      "text": "Every nonempty subset of the vertices spans a face of the simplex. A face with \\(k+1\\) vertices is a \\(k\\)-simplex, so an \\(n\\)-simplex has\n\n\\[f_k=\\binom{n+1}{k+1}\\]\n\nfaces of dimension \\(k\\), where the expression is a binomial coefficient.\n\nIn particular, an \\(n\\)-simplex has:\n\n- \\(n+1\\) vertices;\n- \\(\\binom{n+1}{2}\\) edges;\n- \\(n+1\\) facets, meaning faces of dimension \\(n-1\\), for \\(n\\geq 1\\).\n\nThe simplex itself is counted as a face. With the additional convention that the empty set is a face of dimension \\(-1\\), its faces correspond exactly to all subsets of its vertex set. There are therefore \\(2^{n+1}\\) faces including the empty face and the simplex itself.\n\nFor \\(n\\geq 1\\), the facet opposite \\(v_i\\) is characterized by \\(\\lambda_i=0\\). More generally, setting a collection of barycentric coordinates to zero selects a face.\n\nA point is in the relative interior precisely when\n\n\\[\\lambda_i>0 \\quad\\text{for every }i.\\]\n\nIt is on the relative boundary when at least one coordinate is zero. “Relative” means that interior and boundary are taken within the simplex’s affine hull. A triangle embedded in \\(\\mathbb{R}^3\\), for example, has an empty three-dimensional interior but a nonempty two-dimensional relative interior.\n\nTopologically, an \\(n\\)-simplex is homeomorphic to a closed \\(n\\)-dimensional ball. For \\(n\\geq 1\\), its boundary is homeomorphic to the sphere \\(S^{n-1}\\)."
    },
    {
      "heading": "Metric geometry and volume",
      "text": "Affine structure determines faces and barycentric coordinates, but lengths, angles, and volumes require a metric.\n\nFor vertices \\(v_0,\\ldots,v_n\\in\\mathbb{R}^n\\), form the edge matrix\n\n\\[B= \\begin{bmatrix} v_1-v_0 & \\cdots & v_n-v_0 \\end{bmatrix}.\\]\n\nThe \\(n\\)-dimensional volume is\n\n\\[\\operatorname{Vol}_n(\\sigma) = \\frac{|\\det B|}{n!},\\]\n\nwhere \\(\\det\\) denotes the determinant. This generalizes the area formula for a triangle and the volume formula for a tetrahedron.\n\nFor a simplex embedded in \\(\\mathbb{R}^m\\) with \\(m\\geq n\\), the corresponding formula is\n\n\\[\\operatorname{Vol}_n(\\sigma) = \\frac{\\sqrt{\\det(B^{\\mathsf T}B)}}{n!}.\\]\n\nHere \\(B^{\\mathsf T}B\\) is the Gram matrix of the edge vectors. Its determinant is positive exactly when those vectors are linearly independent.\n\nA regular simplex has all edge lengths equal. An equilateral triangle and a regular tetrahedron are the familiar low-dimensional examples. For \\(n\\geq 1\\), a regular \\(n\\)-simplex with edge length \\(a\\) has volume\n\n\\[\\operatorname{Vol}_n = \\frac{a^n}{n!} \\sqrt{\\frac{n+1}{2^n}}.\\]\n\nThe coordinate-vector model of \\(\\Delta^n\\) is regular in its inherited Euclidean metric, with edge length \\(\\sqrt{2}\\). By contrast, the model with vertices \\(0,e_1,\\ldots,e_n\\) is not regular for \\(n\\geq 2\\). Thus, “standard simplex” specifies a convenient coordinate model rather than a unique metric convention."
    },
    {
      "heading": "Simplices in topology",
      "text": "A simplicial complex is a collection of simplices assembled according to compatibility rules: every face of a simplex belongs to the collection, and the intersection of two simplices is either empty or a face of both. Such complexes represent spaces through discrete combinatorial data.\n\nAn abstract simplex is described solely by its vertices, without specifying their positions. An abstract simplicial complex is a family of finite vertex sets closed under taking subsets. Its geometric realization turns this combinatorial information into a topological space.\n\nA triangulation represents a space as the realization of a simplicial complex. Despite the name, triangulations in higher dimensions use tetrahedra and higher-dimensional simplices as well as triangles. Triangulation is an important technique, but not every topological space—and not every topological manifold—admits one.\n\nIn algebraic topology, ordered vertices give a simplex an orientation. Its formal boundary is\n\n\\[\\partial[v_0,\\ldots,v_n] = \\sum_{i=0}^{n} (-1)^i [v_0,\\ldots,\\widehat{v_i},\\ldots,v_n],\\]\n\nwhere the hat means that the vertex is omitted. The alternating signs ensure that\n\n\\[\\partial^2=0.\\]\n\nThis identity underlies simplicial homology: the boundary of a boundary vanishes because each codimension-two face occurs twice with opposite signs.\n\nA singular \\(n\\)-simplex is a continuous map from \\(\\Delta^n\\) into a topological space. Unlike a geometric simplex, it need not be injective or have a simplex-shaped image. Singular simplices allow homology to be defined without choosing a triangulation."
    },
    {
      "heading": "Probability and statistics",
      "text": "For \\(k\\) possible outcomes, all probability distributions on those outcomes form the probability simplex\n\n\\[\\left\\{ (p_1,\\ldots,p_k)\\in\\mathbb{R}^k: p_i\\geq 0,\\quad \\sum_{i=1}^{k}p_i=1 \\right\\}.\\]\n\nThis is a simplex of dimension \\(k-1\\), not \\(k\\). Its vertices are distributions assigning probability \\(1\\) to a single outcome. Its relative interior consists of distributions assigning positive probability to every outcome; its boundary contains distributions assigning zero probability to at least one outcome.\n\nThe simplex therefore provides a natural parameter space for categorical probabilities and mixture weights. The Dirichlet distribution is a family of probability distributions on this space. In game theory, a player’s mixed strategies over finitely many pure strategies also form a simplex.\n\nThe softmax function maps finite real vectors into the relative interior of the probability simplex. Its coordinates are strictly positive, so it does not produce boundary distributions exactly."
    },
    {
      "heading": "Numerical methods and optimization",
      "text": "Simplices support interpolation particularly well because vertex values uniquely determine an affine function on the simplex. If the prescribed value at \\(v_i\\) is \\(f_i\\), the affine interpolant is\n\n\\[f(x)=\\sum_{i=0}^{n}\\lambda_i(x)f_i.\\]\n\nThis construction is central to the finite element method, where a domain is partitioned into elements such as triangles or tetrahedra. Barycentric coordinates serve as the simplest local shape functions. Extremely thin or nearly degenerate simplices can cause poor approximation behavior and numerical conditioning, making element quality important.\n\nThe simplex method is an algorithm for linear programming. Despite its name, the feasible region of a linear program need not be a simplex: it is generally a polyhedron, and the method moves between basic feasible solutions, geometrically associated with vertices.\n\nA different method, Nelder–Mead, maintains \\(n+1\\) trial points in \\(n\\) variables and transforms their simplex through operations such as reflection, expansion, and contraction. It is a derivative-free optimization method, distinct from the linear-programming simplex method, and it does not guarantee convergence to a minimum for arbitrary objectives."
    }
  ],
  "links": [
    "convex-hull",
    "geometry",
    "topology",
    "affine-space",
    "euclidean-space",
    "linear-independence",
    "convex-combination",
    "convex-set",
    "hyperplane",
    "affine-map",
    "binomial-coefficient",
    "homeomorphism",
    "matrix",
    "determinant",
    "gram-matrix",
    "triangulation",
    "algebraic-topology",
    "continuous-function",
    "probability-distribution",
    "dirichlet-distribution",
    "game-theory",
    "mixed-strategy",
    "softmax-function",
    "interpolation",
    "finite-element-method",
    "simplex-method",
    "linear-programming"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}