13
$\begingroup$

From Wikipedia:

an n-simplex is an n-dimensional polytope which is the convex hull of its n + 1 vertices.

I was wondering if the definition is equivalent to say a simplex is synonym of a convex polytope?

Is simplex defined only for $\mathbb{R}^n$, not for other more general spaces?

Thanks and regards!

4 Answers 4

12

A simplex (in $\mathbb{R}^{n}$) is a special case of a convex polytope, namely one with exactly $n+1$ extremal points (the convex hull of $n+1$ points in general position - that is to say they don't lie in a $(n-1)$-dimensional affine subspace). An example of a convex polytope which isn't a simplex is given by any one of the platonic solids except the tetrahedron.

Yes, there are more general notions of simplices. In a geodesic metric space, for example, it makes sense to speak of convex hulls. In hyperbolic $n$-space or on the $n$-dimensional sphere one can then define a hyperbolic or spherical simplex as the convex hull $(n+1)$ points that don't lie in a totally geodesic submanifold (and that are not too far apart from each other in the case of a sphere).

  • 0
    @t.b. Do you have a reference on general simplexes?2016-06-02
8

The definition is a little unclear. In order for the convex hull of $n+1$ vertices in $\mathbb{R}^n$ to actually be $n$-dimensional, the vertices must be in general position: that is, they should not lie in a proper affine subspace of $\mathbb{R}^n$. For example, a square is a convex polytope which is the convex hull of $4$ vertices, but it is not a $3$-simplex: a $3$-simplex is a tetrahedron.

I suppose the answer to the last question is "no": when people talk about geometric simplices they are definitely referring to the ones in $\mathbb{R}^n$, although some people talk about abstract simplices in the sense of abstract simplicial complexes.

  • 0
    @Qiaochu: Convex hull operators are everywhere. It may be that they are not recognized as such. In group theory we have the smallest group that contains a given set as well as the smallest coset that contains a given set. A similar statement can be made for rings.2011-05-03
6

I often work over simplices in $\mathbb{F}_q^d$ or other discrete spaces. Here, when we say a $k$-simplex, we mean a set of $(k+1)$-points spanning a $k$-dimensional subspace. I.e., for us, a $k$-simplex is just the set of vertices.

  • 0
    Sorry. It is the $d$-dimensional vector space over the finite field with $q$ elements. As Qiaochu noted, there is no analog of "convex hull" in $\mathbb{F}_q^d$, which is why we simply refer to the simplex as the set of vertices.2011-05-01
4

No, they are not equivalent. For example, an $n$-cube is a convex polytope but is not a simplex.

  • 1
    @Tim Notice that every vertex in a simplex shares an edge (a 1-simplex) with every other vertex.2011-05-01