Regular polytope


In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. In particular, all its elements or -faces — cells, faces and so on — are also transitive on the symmetries of the polytope, and are themselves regular polytopes of dimension.
Regular polytopes are the generalised analog in any number of dimensions of regular polygons and regular polyhedra. The strong symmetry of the regular polytopes gives them an aesthetic quality that interests both mathematicians and non-mathematicians.
Classically, a regular polytope in dimensions may be defined as having regular facets and regular vertex figures. These two conditions are sufficient to ensure that all faces are alike and all vertices are alike. Note, however, that this definition does not work for abstract polytopes.
A regular polytope can be represented by a Schläfli symbol of the form with regular facets as and regular vertex figures as

Description

Regular polytopes are classified primarily according to their dimension.
  • In one dimension, the line segment simultaneously serves as the 1-simplex, the 1-hypercube and the 1-orthoplex.
  • In two dimensions, there are infinitely many regular polygons, namely the regular -sided polygon for. The triangle is the 2-simplex. The square is both the 2-hypercube and the 2-orthoplex. The -sided polygons for are exceptional.
  • In three and four dimensions, there are several more exceptional regular polyhedra and 4-polytopes respectively.
  • In five dimensions and above, the simplex, hypercube, and orthoplex are the only regular polytopes. There are no exceptional regular polytopes in these dimensions.
Regular polytopes can be further classified according to symmetry. For example, the cube and the regular octahedron share the same symmetry, as do the regular dodecahedron and regular icosahedron. Two distinct regular polytopes with the same symmetry are dual to one another. Indeed, symmetry groups are sometimes named after regular polytopes, for example, the tetrahedral and icosahedral symmetries.
The idea of a polytope is sometimes generalised to include related kinds of geometrical objects. Some of these have regular examples, as discussed in the section on historical discovery below.

Schläfli symbols

A concise symbolic representation for regular polytopes was developed by Ludwig Schläfli in the 19th century, and a slightly modified form has become standard. The notation is best explained by adding one dimension at a time.
The dual of a regular polytope is also a regular polytope. The Schläfli symbol for the dual polytope is just the original symbol written backwards: is self-dual, is dual to, to and so on.
The vertex figure of a regular polytope is the dual of the dual polytope's facet. For example, the vertex figure of is, the dual of which is — a cell of.
The measure and cross polytopes in any dimension are dual to each other.
If the Schläfli symbol is palindromic, then the polytope is self-dual. The self-dual regular polytopes are:

Regular simplices

The simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example,
This process is repeated further using new points to form higher-dimensional simplices.

Hypercubes

These are the measure polytopes or hypercubes. Their names are, in order of dimension:
The process of making each hypercube can be visualised on a graph: Begin with a point A. Extend a line to point B at distance r, and join to form a line segment. Extend a second line of length r, orthogonal to AB, from B to C, and likewise from A to D, to form a square ABCD. Extend lines of length r respectively from each corner, orthogonal to both AB and BC. Mark new points E,''F,G'',H to form the cube ABCDEFGH. This process is repeated further using new lines to form higher-dimensional hypercubes.

Orthoplexes

These are the cross polytopes or orthoplexes. Their names are, in order of dimensionality:
The process of making each orthoplex can be visualised on a graph: Begin with a point O. Extend a line in opposite directions to points A and B a distance r from O and 2r apart. Draw a line COD of length 2r, centred on O and orthogonal to AB. Join the ends to form a square ACBD. Draw a line EOF of the same length and centered on 'O', orthogonal to AB and CD. Join the ends to the square to form a regular octahedron. This process is repeated further using new lines to form higher-dimensional orthoplices.

Classification by Coxeter groups

Regular polytopes can be classified by their isometry group. These are finite Coxeter groups, but not every finite Coxeter group may be realised as the isometry group of a regular polytope. Regular polytopes are in bijection with Coxeter groups with linear Coxeter-Dynkin diagram and an increasing numbering of the nodes. Reversing the numbering gives the dual polytope.
The classification of finite Coxeter groups, which goes back to, therefore implies the classification of regular polytopes:
The bijection between regular polytopes and Coxeter groups with linear Coxeter-Dynkin diagram can be understood as follows. Consider a regular polytope of dimension and take its barycentric subdivision. The fundamental domain of the isometry group action on is given by any simplex in the barycentric subdivision. The simplex has vertices which can be numbered from 0 to by the dimension of the corresponding face of . The isometry group of is generated by the reflections around the hyperplanes of containing the vertex number . These hyperplanes can be numbered by the vertex of they do not contain. The remaining thing to check is that any two hyperplanes with adjacent numbers cannot be orthogonal, whereas hyperplanes with non-adjacent numbers are orthogonal. This can be done using induction. Therefore, the Coxeter-Dynkin diagram of the isometry group of has vertices numbered from 0 to such that adjacent numbers are linked by at least one edge and non-adjacent numbers are not linked.

History of discovery

Convex polygons and polyhedra

The earliest surviving mathematical treatment of regular polygons and polyhedra comes to us from ancient Greek mathematicians. The five Platonic solids were known to them. Pythagoras knew of at least three of them, and Theaetetus described all five. Later, Euclid wrote a systematic study of mathematics, publishing it under the title Elements, which built up a logical theory of geometry and number theory. His work concluded with mathematical descriptions of the five Platonic solids inscribed in a sphere and compares the ratios of their edges to the radius of the sphere.

Star polygons and polyhedra

The understanding of the solids remained static for many centuries after Euclid. The subsequent history of the regular polytopes can be characterised by a gradual broadening of the basic concept, allowing more and more objects to be considered among their number. Thomas Bradwardine was the first to record a serious study of star polygons. Various star polyhedra appear in Renaissance art, but it was not until Johannes Kepler studied the small stellated dodecahedron and the great stellated dodecahedron in 1619 that he realised these two polyhedra were regular. Louis Poinsot discovered the great dodecahedron and great icosahedron in 1809, and Augustin Cauchy proved the list complete in 1812. These polyhedra are collectively known as the Kepler-Poinsot polyhedra.