# Simplex

In geometry, a **simplex** (plural: **simplexes** or **simplices**) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions.

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,
- a 4-simplex is a 5-cell.

Specifically, a ** k-simplex** is a

*k*-dimensional polytope which is the convex hull of its

*k*+ 1 vertices. More formally, suppose the

*k*+ 1 points are affinely independent, which means are linearly independent. Then, the simplex determined by them is the set of points

A **regular simplex**[1] is a simplex that is also a regular polytope. A regular *n*-simplex may be constructed from a regular (*n* − 1)-simplex by connecting a new vertex to all original vertices by the common edge length.

The **standard simplex** or **probability simplex** [2] is the simplex formed from the *k* + 1 standard unit vectors, or

In topology and combinatorics, it is common to “glue together” simplices to form a simplicial complex. The associated combinatorial structure is called an abstract simplicial complex, in which context the word “simplex” simply means any finite set of vertices.

## History

The concept of a simplex was known to William Kingdon Clifford, who wrote about these shapes in 1886 but called them "prime confines".
Henri Poincaré, writing about algebraic topology in 1900, called them "generalized tetrahedra".
In 1902 Pieter Hendrik Schoute described the concept first with the Latin superlative *simplicissimum* ("simplest") and then with the same Latin adjective in the normal form *simplex* ("simple").[3]

The **regular simplex** family is the first of three regular polytope families, labeled by Coxeter as *α _{n}*, the other two being the cross-polytope family, labeled as

*β*, and the hypercubes, labeled as

_{n}*γ*. A fourth family, the infinite tessellation of hypercubes, he labeled as

_{n}*δ*.[4]

_{n}## Elements

The convex hull of any nonempty subset of the *n* + 1 points that define an *n*-simplex is called a **face** of the simplex. Faces are simplices themselves. In particular, the convex hull of a subset of size *m* + 1 (of the *n* + 1 defining points) is an *m*-simplex, called an ** m-face** of the

*n*-simplex. The 0-faces (i.e., the defining points themselves as sets of size 1) are called the

**vertices**(singular: vertex), 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 .[5] Consequently, the number of

*m*-faces of an

*n*-simplex may be found in column (

*m*+ 1) of row (

*n*+ 1) of Pascal's triangle. A simplex

*A*is a

**coface**of a simplex

*B*if

*B*is a face of

*A*.

*Face*and

*facet*can have different meanings when describing types of simplices in a simplicial complex; see simplical complex for more detail.

The number of 1-faces (edges) of the *n*-simplex is the *n*-th triangle number, the number of 2-faces of the *n*-simplex is the (*n* − 1)th tetrahedron number, the number of 3-faces of the *n*-simplex is the (*n* − 2)th 5-cell number, and so on.

Δ^{n} |
Name | Schläfli Coxeter |
0- faces (vertices) |
1- faces (edges) |
2- faces |
3- faces |
4- faces |
5- faces |
6- faces |
7- faces |
8- faces |
9- faces |
10- faces |
Sum= 2 ^{n+1} − 1 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

Δ^{0} |
0-simplex(point) |
( ) |
1 | 1 | ||||||||||

Δ^{1} |
1-simplex(line segment) |
{ } = ( ) ∨ ( ) = 2 · ( ) |
2 | 1 | 3 | |||||||||

Δ^{2} |
2-simplex(triangle) |
{3} = 3 · ( ) |
3 | 3 | 1 | 7 | ||||||||

Δ^{3} |
3-simplex(tetrahedron) |
{3,3} = 4 · ( ) |
4 | 6 | 4 | 1 | 15 | |||||||

Δ^{4} |
4-simplex(5-cell) |
{3^{3}} = 5 · ( ) |
5 | 10 | 10 | 5 | 1 | 31 | ||||||

Δ^{5} |
5-simplex |
{3^{4}} = 6 · ( ) |
6 | 15 | 20 | 15 | 6 | 1 | 63 | |||||

Δ^{6} |
6-simplex |
{3^{5}} = 7 · ( ) |
7 | 21 | 35 | 35 | 21 | 7 | 1 | 127 | ||||

Δ^{7} |
7-simplex |
{3^{6}} = 8 · ( ) |
8 | 28 | 56 | 70 | 56 | 28 | 8 | 1 | 255 | |||

Δ^{8} |
8-simplex |
{3^{7}} = 9 · ( ) |
9 | 36 | 84 | 126 | 126 | 84 | 36 | 9 | 1 | 511 | ||

Δ^{9} |
9-simplex | {3^{8}} = 10 · ( ) |
10 | 45 | 120 | 210 | 252 | 210 | 120 | 45 | 10 | 1 | 1023 | |

Δ^{10} |
10-simplex |
{3^{9}} = 11 · ( ) |
11 | 55 | 165 | 330 | 462 | 462 | 330 | 165 | 55 | 11 | 1 | 2047 |

An (*n* + 1)-simplex can be constructed as a join (∨ operator) of an *n*-simplex and a point, ( ). An (*m* + *n* + 1)-simplex can be constructed as a join of an *m*-simplex and an *n*-simplex. The two simplices are oriented to be completely normal from each other, with translation in a direction orthogonal to both of them. A 1-simplex is the join of two points: ( ) ∨ ( ) = 2 · ( ). A general 2-simplex (scalene triangle) is the join of three points: ( ) ∨ ( ) ∨ ( ). An isosceles triangle is the join of a 1-simplex and a point: { } ∨ ( ). An equilateral triangle is 3·( ) or {3}. A general 3-simplex is the join of 4 points: ( ) ∨ ( ) ∨ ( ) ∨ ( ). A 3-simplex with mirror symmetry can be expressed as the join of an edge and two points: { } ∨ ( ) ∨ ( ). A 3-simplex with triangular symmetry can be expressed as the join of an equilateral triangle and 1 point: 3.( )∨( ) or {3}∨( ). A regular tetrahedron is 4 · ( ) or {3,3} and so on.

In some conventions,[7] the empty set is defined to be a (−1)-simplex. The definition of the simplex above still makes sense if *n* = −1. This convention is more common in applications to algebraic topology (such as simplicial homology) than to the study of polytopes.

## Symmetric graphs of regular simplices

These Petrie polygons (skew orthogonal projections) show all the vertices of the regular simplex on a circle, and all vertex pairs connected by edges.

1 |
2 |
3 |
4 |
5 |

6 |
7 |
8 |
9 |
10 |

11 |
12 |
13 |
14 |
15 |

16 |
17 |
18 |
19 |
20 |

## The standard simplex

The **standard n-simplex** (or

**unit**) is the subset of

*n*-simplex**R**

^{n+1}given by

The simplex Δ^{n} lies in the affine hyperplane obtained by removing the restriction *t*_{i} ≥ 0 in the above definition.

The *n* + 1 vertices of the standard *n*-simplex are the points *e*_{i} ∈ **R**^{n+1}, where

*e*_{0}= (1, 0, 0, ..., 0),*e*_{1}= (0, 1, 0, ..., 0),*e*_{n}= (0, 0, 0, ..., 1).

There is a canonical map from the standard *n*-simplex to an arbitrary *n*-simplex with vertices (*v*_{0}, ..., *v*_{n}) given by

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**to emphasize that the canonical map may be orientation preserving or reversing.

*n*-simplexMore generally, there is a canonical map from the standard -simplex (with *n* vertices) onto any polytope with *n* vertices, given by the same equation (modifying indexing):

These are known as generalized barycentric coordinates, and express every polytope as the *image* of a simplex:

A commonly used function from **R**^{n} to the interior of the standard -simplex is the softmax function, or normalized exponential function; this generalizes the standard logistic function.

### Examples

- Δ
^{0}is the point 1 in**R**^{1}. - Δ
^{1}is the line segment joining (1,0) and (0,1) in**R**^{2}. - Δ
^{2}is the equilateral triangle with vertices (1,0,0), (0,1,0) and (0,0,1) in**R**^{3}. - Δ
^{3}is the regular tetrahedron with vertices (1,0,0,0), (0,1,0,0), (0,0,1,0) and (0,0,0,1) in**R**^{4}.

### Increasing coordinates

An alternative coordinate system is given by taking the indefinite sum:

This yields the alternative presentation by *order,* namely as nondecreasing *n*-tuples between 0 and 1:

Geometrically, this is an *n*-dimensional subset of (maximal dimension, codimension 0) rather than of (codimension 1). The facets, which on the standard simplex correspond to one coordinate vanishing, here correspond to successive coordinates being equal, while the interior corresponds to the inequalities becoming *strict* (increasing sequences).

A key distinction between these presentations is the behavior under permuting coordinates – the standard simplex is stabilized by permuting coordinates, while permuting elements of the "ordered simplex" do not leave it invariant, as permuting an ordered sequence generally makes it unordered. Indeed, the ordered simplex is a (closed) fundamental domain for the action of the symmetric group on the *n*-cube, meaning that the orbit of the ordered simplex under the *n*! elements of the symmetric group divides the *n*-cube into mostly disjoint simplices (disjoint except for boundaries), showing that this simplex has volume Alternatively, the volume can be computed by an iterated integral, whose successive integrands are

A further property of this presentation is that it uses the order but not addition, and thus can be defined in any dimension over any ordered set, and for example can be used to define an infinite-dimensional simplex without issues of convergence of sums.

### Projection onto the standard simplex

Especially in numerical applications of probability theory a projection onto the standard simplex is of interest. Given with possibly negative entries, the closest point on the simplex has coordinates

where is chosen such that

can be easily calculated from sorting .[8] The sorting approach takes complexity, which can be improved to complexity via median-finding algorithms.[9] Projecting onto the simplex is computationally similar to projecting onto the ball.

### Corner of cube

Finally, a simple variant is to replace "summing to 1" with "summing to at most 1"; this raises the dimension by 1, so to simplify notation, the indexing changes:

This yields an *n*-simplex as a corner of the *n*-cube, and is a standard orthogonal simplex. This is the simplex used in the simplex method, which is based at the origin, and locally models a vertex on a polytope with *n* facets.

## Cartesian coordinates for regular *n*-dimensional simplex in R^{n}

*n*-dimensional simplex in R

^{n}

The coordinates of the vertices of a regular *n*-dimensional simplex can be obtained from these two properties,

- For a regular simplex, the distances of its vertices to its center are equal.
- The angle subtended by any two vertices of an
*n*-dimensional simplex through its center is

These can be used as follows. Let vectors (*v*_{0}, *v*_{1}, ..., *v*_{n}) represent the vertices of an *n*-simplex center the origin, all unit vectors so a distance 1 from the origin, satisfying the first property. The second property means the dot product between any pair of the vectors is . This can be used to calculate positions for them.

For example, in three dimensions the vectors (*v*_{0}, *v*_{1}, *v*_{2}, *v*_{3}) are the vertices of a 3-simplex or tetrahedron. Write these as

Choose the first vector *v*_{0} to have all but the first component zero, so by the first property it must be (1, 0, 0) and the vectors become

By the second property the dot product of *v*_{0} with all other vectors is -^{1}⁄_{3}, so each of their *x* components must equal this, and the vectors become

Next choose *v*_{1} to have all but the first two elements zero. The second element is the only unknown. It can be calculated from the first property using the Pythagorean theorem (choose any of the two square roots), and so the second vector can be completed:

The second property can be used to calculate the remaining *y* components, by taking the dot product of *v*_{1} with each and solving to give

From which the *z* components can be calculated, using the Pythagorean theorem again to satisfy the first property, the two possible square roots giving the two results

This process can be carried out in any dimension, using *n* + 1 vectors, applying the first and second properties alternately to determine all the values.

## Geometric properties

### Volume

The volume of an *n*-simplex in *n*-dimensional space with vertices (*v*_{0}, ..., *v*_{n}) is

where each column of the *n* × *n* determinant is the difference between the vectors representing two vertices.[10] A more symmetric way to write it is

Another common way of computing the volume of the simplex is via the Cayley–Menger determinant. It can also compute the volume of a simplex embedded in a higher-dimensional space, e.g., a triangle in .[11]

Without the 1/*n*! it is the formula for the volume of an *n*-parallelotope.
This can be understood as follows: Assume that *P* is an *n*-parallelotope constructed on a basis of .
Given a permutation of , call a list of vertices a *n*-path if

(so there are *n*! *n*-paths and does not depend on the permutation). The following assertions hold:

If *P* is the unit *n*-hypercube, then the union of the *n*-simplexes formed by the convex hull of each *n*-path is *P*, and these simplexes are congruent and pairwise non-overlapping.[12] In particular, the volume of such a simplex is

If *P* is a general parallelotope, the same assertions hold except that it is no more true, in dimension > 2, that the simplexes need to be pairwise congruent; yet their volumes remain equal, because the *n*-parallelotop is the image of the unit *n*-hypercube by the linear isomorphism that sends the canonical basis of to . As previously, this implies that the volume of a simplex coming from a *n*-path is:

Conversely, given an *n*-simplex of , it can be supposed that the vectors form a basis of . Considering the parallelotope constructed from and , one sees that the previous formula is valid for every simplex.

Finally, the formula at the beginning of this section is obtained by observing that

From this formula, it follows immediately that the volume under a standard *n*-simplex (i.e. between the origin and the simplex in **R**^{n+1}) is

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

as can be seen by multiplying the previous formula by *x*^{n+1}, to get the volume under the *n*-simplex as a function of its vertex distance *x* from the origin, differentiating with respect to *x*, at (where the *n*-simplex side length is 1), and normalizing by the length of the increment, , along the normal vector.

### Dihedral angles of the regular n-simplex

Any two (n-1)-dimensional faces of a regular *n*-dimensional simplex are themselves regular (*n-1)*-dimensional simplices, and they have the same dihedral angle of cos^{−1}(1/*n*).[13][14]

This can be seen by noting that the center of the standard simplex is , and the centers of its faces are coordinate permutations of . Then, by symmetry, the vector pointing from to is perpendicular to the faces. So the vectors normal to the faces are permutations of , from which the dihedral angles are calculated.

### Simplices with an "orthogonal corner"

An "orthogonal corner" means here that there is a vertex at which all adjacent edges are pairwise orthogonal. It immediately follows that all adjacent faces are pairwise orthogonal. Such simplices are generalizations of right triangles and for them there exists an *n*-dimensional version of the Pythagorean theorem:

The sum of the squared (*n* − 1)-dimensional volumes of the facets adjacent to the orthogonal corner equals the squared (*n* − 1)-dimensional volume of the facet opposite of the orthogonal corner.

where are facets being pairwise orthogonal to each other but not orthogonal to , which is the facet opposite the orthogonal corner.

For a 2-simplex the theorem is the Pythagorean theorem for triangles with a right angle and for a 3-simplex it is de Gua's theorem for a tetrahedron with an orthogonal corner.

### Relation to the (*n* + 1)-hypercube

*n*+ 1)-hypercube

The Hasse diagram of the face lattice of an *n*-simplex is isomorphic to the graph of the (*n* + 1)-hypercube's edges, with the hypercube's vertices mapping to each of the *n*-simplex's elements, including the entire simplex and the null polytope as the extreme points of the lattice (mapped to two opposite vertices on the hypercube). This fact may be used to efficiently enumerate the simplex's face lattice, since more general face lattice enumeration algorithms are more computationally expensive.

The *n*-simplex is also the vertex figure of the (*n* + 1)-hypercube. It is also the facet of the (*n* + 1)-orthoplex.

### Topology

Topologically, an *n*-simplex is equivalent to an *n*-ball. Every *n*-simplex is an *n*-dimensional manifold with corners.

### Probability

In probability theory, the points of the standard *n*-simplex in (*n* + 1)-space are the space of possible parameters (probabilities) of the categorical distribution on *n* + 1 possible outcomes.

### Compounds

Since all simplices are self-dual, they can form a series of compounds;

- Two triangles form a hexagram {6/2}.
- Two tetrahedra form a compound of two tetrahedra or stellated octahedron.
- Two 5-cells form a compound of two 5-cells in four dimensions.

## Algebraic topology

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 combinatorial 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**^{n} 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 facet 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

with the denoting the vertices, then the boundary of *σ* is the chain

It follows from this expression, and the linearity of the boundary operator, that the boundary of the boundary of a simplex is zero:

Likewise, the boundary of the boundary of a chain is zero: .

More generally, a simplex (and a chain) can be embedded into a manifold by means of smooth, differentiable map . In this case, both the summation convention for denoting the set, and the boundary operation commute with the embedding. That is,

where the are the integers denoting orientation and multiplicity. For the boundary operator , one has:

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 to a topological space *X* is frequently referred to as a **singular n-simplex**. (A map is generally called "singular" if it fails to have some desirable property such as continuity and, in this case, the term is meant to reflect to the fact that the continuous map need not be an embedding.)[15]

## Algebraic geometry

Since classical algebraic geometry allows to talk about polynomial equations, but not inequalities, the *algebraic standard n-simplex* is commonly defined as the subset of affine (*n* + 1)-dimensional space, where all coordinates sum up to 1 (thus leaving out the inequality part). The algebraic description of this set is

which equals the scheme-theoretic description with

the ring of regular functions on the algebraic *n*-simplex (for any ring ).

By using the same definitions as for the classical *n*-simplex, the *n*-simplices for different dimensions *n* assemble into one simplicial object, while the rings assemble into one cosimplicial object (in the category of schemes resp. rings, since the face and degeneracy maps are all polynomial).

The algebraic *n*-simplices are used in higher K-theory and in the definition of higher Chow groups.

## Applications

- In statistics, simplices are sample spaces of compositional data and are also used in plotting quantities that sum to 1, such as proportions of subpopulations, as in a ternary plot.
- In industrial statistics, simplices arise in problem formulation and in algorithmic solution. In the design of bread, the producer must combine yeast, flour, water, sugar, etc. In such mixtures, only the relative proportions of ingredients matters: For an optimal bread mixture, if the flour is doubled then the yeast should be doubled. Such mixture problem are often formulated with normalized constraints, so that the nonnegative components sum to one, in which case the feasible region forms a simplex. The quality of the bread mixtures can be estimated using response surface methodology, and then a local maximum can be computed using a nonlinear programming method, such as sequential quadratic programming.[16]

- In operations research, linear programming problems can be solved by the simplex algorithm of George Dantzig.
- In geometric design and computer graphics, many methods first perform simplicial triangulations of the domain and then fit interpolating polynomials to each simplex.[17]
- In chemistry, the hydrides of most elements in the p-block can resemble a simplex if one is to connect each atom. Neon does not react with hydrogen and as such is a point, fluorine bonds with one hydrogen atom and forms a line segment, oxygen bonds with two hydrogen in a bent fashion resembling a triangle, nitrogen reacts to form a tetrahedron, and carbon will form a structure resembling a Schlegel diagram of the 5-cell. This trend continues for the heavier analogues of each element, as well as if the hydrogen is replaced by halogen atoms.

## See also

- Aitchison geometry
- Complete graph
- Causal dynamical triangulation
- Distance geometry
- Delaunay triangulation
- Hill tetrahedron
- Other regular
*n*-polytopes - Hypersimplex
- Polytope
- Metcalfe's law
- List of regular polytopes
- Schläfli orthoscheme
- Simplex algorithm – a method for solving optimisation problems with inequalities.
- Simplicial complex
- Simplicial homology
- Simplicial set
- Ternary plot
- 3-sphere

## Notes

- Elte, E. L. (1912),
*The Semiregular Polytopes of the Hyperspaces*, Groningen: University of Groningen Chapter IV, five dimensional semiregular polytope - Boyd, Stephen P.; Vandenberghe, Lieven (2004).
*Convex Optimization*(pdf). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved October 15, 2011. - Miller, Jeff, "Simplex",
*Earliest Known Uses of Some of the Words of Mathematics*, retrieved 2018-01-08 - Coxeter 1973, pp. 120-124, §7.2.
- Coxeter 1973, p. 120.
- Sloane, N. J. A. (ed.). "Sequence A135278 (Pascal's triangle with its left-hand edge removed)".
*The On-Line Encyclopedia of Integer Sequences*. OEIS Foundation. - Kozlov, Dimitry,
*Combinatorial Algebraic Topology*, 2008, Springer-Verlag (Series: Algorithms and Computation in Mathematics) - Yunmei Chen, Xiaojing Ye. "Projection Onto A Simplex". arXiv:1101.6081.
- MacUlan, N.; De Paula, G. G. (1989). "A linear-time median-finding algorithm for projecting a vector on the simplex of n".
*Operations Research Letters*.**8**(4): 219. doi:10.1016/0167-6377(89)90064-3. - A derivation of a very similar formula can be found in Stein, P. (1966). "A Note on the Volume of a Simplex".
*The American Mathematical Monthly*.**73**(3): 299–301. doi:10.2307/2315353. JSTOR 2315353. - Colins, Karen D. "Cayley-Menger Determinant." From MathWorld—A Wolfram Web Resource, created by Eric W. Weisstein. http://mathworld.wolfram.com/Cayley-MengerDeterminant.html
- Every
*n*-path corresponding to a permutation is the image of the*n*-path by the affine isometry that sends to , and whose linear part matches to for all*i*. hence every two*n*-paths are isometric, and so is their convex hulls; this explains the congruence of the simplexes. To show the other assertions, it suffices to remark that the interior of the simplex determined by the*n*-path is the set of points , with and Hence the components of these points with respect to each corresponding permuted basis are strictly ordered in the decreasing order. That explains why the simplexes are non-overlapping. The fact that the union of the simplexes is the whole unit*n*-hypercube follows as well, replacing the strict inequalities above by "". The same arguments are also valid for a general parallelotope, except the isometry between the simplexes. - Parks, Harold R.; Dean C. Wills (October 2002). "An Elementary Calculation of the Dihedral Angle of the Regular
*n*-Simplex".*The American Mathematical Monthly*. Mathematical Association of America.**109**(8): 756–758. doi:10.2307/3072403. JSTOR 3072403. - Harold R. Parks; Dean C. Wills (June 2009).
*Connections between combinatorics of permutations and algorithms and geometry*. Oregon State University. - John M. Lee,
*Introduction to Topological Manifolds*, Springer, 2006, pp. 292–3. -
Cornell, John (2002).
*Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data*(third ed.). Wiley. ISBN 0-471-07916-2. - Vondran, Gary L. (April 1998). "Radial and Pruned Tetrahedral Interpolation Techniques" (PDF).
*HP Technical Report*. HPL-98-95: 1–32.

## References

- Walter Rudin,
*Principles of Mathematical Analysis (Third Edition)*, (1976) McGraw-Hill, New York, ISBN 0-07-054235-X*(See chapter 10 for a simple review of topological properties.)*. - Andrew S. Tanenbaum,
*Computer Networks (4th Ed)*, (2003) Prentice Hall, ISBN 0-13-066102-3*(See 2.5.3)*. - Luc Devroye,
*Non-Uniform Random Variate Generation.*(1986) ISBN 0-387-96305-7; Web version freely downloadable. - Coxeter, H.S.M. (1973).
*Regular Polytopes*(3rd ed.). New York: Dover.- pp. 120–121, §7.2. see illustration 7-2A
- p. 296, Table I (iii): Regular Polytopes, three regular polytopes in
*n*dimensions (*n*≥ 5)

- Weisstein, Eric W. "Simplex".
*MathWorld*. - Stephen Boyd and Lieven Vandenberghe,
*Convex Optimization*, (2004) Cambridge University Press, New York, NY, USA.

## External links

- Olshevsky, George. "Simplex".
*Glossary for Hyperspace*. Archived from the original on 4 February 2007.