Simplex

This article is about the mathematics concept. In communications, simplex refers to a one-way communications channel. See duplex, simplex communication.

In geometry, a simplex or n-simplex is an n-dimensional analogue of a triangle. Specifically, a simplex is the convex hull of a set of (n + 1) affinely independent points in some Euclidean space of dimension n or higher (i.e. a set of points such that no m-plane contains more than (m + 1) of them; such points are said to be in general position).

A regular simplex is a simplex that is also a regular polytope.

For example, a 0-simplex is a point, a 1-simplex is a line segment, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, and a 4-simplex is a pentachoron (in each case with interior).

The convex hull of any m of the n points is also a simplex, called an m-face. The 0-faces are called the vertices, the 1-faces are called the edges, the (n − 1)-faces are called the facets, and the sole n-face is the whole n-simplex itself. In general, the number of m-faces is equal to the binomial coefficient C(n + 1, m + 1).

Contents

1 The standard simplex 2 Geometric properties 3 Topology 4 See also 5 References

The standard simplex

The standard n-simplex is the subset of Rⁿ⁺¹ given by

<math>\Delta^n = \{(t_0,\cdots,t_n)\in\mathbb{R}^{n+1}\mid\Sigma_{i}{t_i} = 1 \mbox{ and } t_i \ge 0 \mbox{ for all } i\}<math>

Removing the restriction t_i ≥ 0 in the above gives an n-dimensional affine subspace of Rⁿ⁺¹ containing the standard n-simplex. The vertices of the standard n-simplex are the points

e₀ = (1, 0, 0, …, 0),

e₁ = (0, 1, 0, …, 0),

<math>\vdots<math>

e_n = (0, 0, 0, …, 1).

There is a canonical map from the standard n-simplex to an arbitrary n-simplex with vertices (v₀, …, v_n) given by

<math>(t_0,\cdots,t_n) \mapsto \Sigma_i t_i v_i<math>

The coefficients t_i are called the barycentric coordinates of a point in the n-simplex. Such a general simplex is often called an affine n-simplex, to emphasize that the canonical map is an affine transformation. It is also sometimes called an oriented affine n-simplex to emphasize that the canonical map may be orientation preserving or reversing.

Geometric properties

The volume of an n-simplex in n-dimensional space with vertices (v₀, ..., v_n) is

<math>

{1\over n!}\det
\begin{pmatrix}
 v_0-v_1 & v_1-v_2& \dots & v_{n-1}-v_{n}
\end{pmatrix}

<math>

where each column of the n × n determinant is the difference between two vertices. Any determinant which involves taking the difference between pairs of vertices, where the pairs connect the vertices as a simply connected graph will also give the (same) volume. Without the 1/n! it is the formula for the volume of an n-parallelepiped. One way to understand the 1/n! factor is as follows. If the coordinates of a point in a unit n-box are sorted, together with 0 and 1, and successive differences are taken, then since the results add to one, the result is a point in an n simplex spanned by the origin and the closest n vertices of the box. The taking of differences was an orthogonal (volume-preserving) transformation, but sorting compressed the space by a factor of n!.

The volume under a standard n-simplex (i.e. between the origin and the simplex) is

<math>

{1 \over (n+1)!} <math>

The volume of a regular n-simplex with unit side length is

<math>

{\sqrt {n+1} \over n! {\sqrt 2}^n} <math>

as can be seen by multiplying the previous formula by xⁿ⁺¹ to get the volume as a function of side length from the origin, differentiating, and normalizing by the appropriate factors (the numerator comes from dividing by the length of the normal vector (dx,dx,...,dx); the denominator comes from scaling the side length down by a factor of the square root of 2).

Topology

Topologically, an n-simplex is equivalent to an n-ball. Every n-simplex is therefore an n-dimensional manifold with boundary.

In algebraic topology, simplices are used as building blocks to construct an interesting class of topological spaces called simplicial complexes. These spaces are built from simplices glued together in a combinatorical fashion. Simplicial complexes are used to define a certain kind of homology called simplicial homology.

A finite set of k-simplexes embedded in an open subset of Rⁿ is called an affine k-chain. The simplexes in a chain need not be unique; they may occur with multiplicity. Rather than using standard set notation to denote an affine chain, it is instead the standard practice to use plus signs to separate each member in the set. If some of the simplexes have the opposite orientation, these are prefixed by a minus sign. If some of the simplexes occur in the set more than once, these are prefixed with an integer count. Thus, an affine chain takes the symbolic form of a sum with integer coefficients.

Note that each face of an n-simplex is an affine n-1-simplex, and thus the boundary of an n-simplex is an affine n-1-chain. Thus, if we denote one positively-oriented affine simplex as

<math>\sigma=[v_0,v_1,v_2,...v_n]<math>

with the <math>v_j<math> denoting the vertices, then the boundary <math>\partial\sigma<math> of σ is the chain

<math>\partial\sigma = \sum_{j=0}^n

(-1)^j [v_0,...,v_{j-1},v_{j+1},...,v_n]<math>.

More generally, a simplex (and a chain) can be embedded into a manifold by means of smooth, differentiable map <math>f:\mathbb{R}^n\rightarrow M<math>. In this case, both the summation convention for denoting the set, and the boundary operation commute with the embedding. That is,

<math>f(\sum_i a_i \sigma_i) = \sum_i a_i f(\sigma_i)<math>

where the <math>a_i<math> are the integers denoting orientation and multiplicity. For the boundary operator <math>\partial<math>, one has:

<math>\partial f(\phi) = f (\partial \phi)<math>

where φ is a chain. The boundary operation commutes with the mapping because, in the end, the chain is defined as a set and little more, and the set operation always commutes with the map operation (by definition of a map).

A continuous map <math>f:\sigma\rightarrow X<math> to a topological space X is frequently refered to as a singular n-simplex.

See also

• Delaunay triangulation
• glome tesseract polychoron
• polytope
• list of regular polytopes
• simplex algorithm - a method for solving optimisation problems with inequalities.
• simplicial complex
• simplicial homology
• simplicial set

References

• Walter Rudin, Principles of Mathematical Analysis (Third Edition), (1976) McGraw-Hill, New York, ISBN 0-07-054235-X (See chapter 10).de:Simplex (Mathematik)

fr:Simplexe pl:Simpleks sl:Simpleks