4-polytope

A 4-polytope is a closed four-dimensional figure. It comprises vertices (corner points), edges, faces and cells. A cell is the three-dimensional analogue of a face, and is therefore a polyhedron. Each face must join exactly two cells, analogous to the way in which each edge of a polyhedron joins just two faces. Like any polytope, the elements of a 4-polytope cannot be subdivided into two or more sets which are also 4-polytopes, i.e. it is not a compound. == Geometry ==

The convex regular 4-polytopes are the four-dimensional analogues of the Platonic solids. The most familiar 4-polytope is the tesseract or hypercube, the 4D analogue of the cube. The convex regular 4-polytopes can be ordered by size as a measure of 4-dimensional content (hypervolume) for the same radius. Each greater polytope in the sequence is rounder than its predecessor, enclosing more content{{Sfn|Coxeter|1973|pp=292-293|loc=Table I(ii): The sixteen regular polytopes {p,q,r} in four dimensions|ps=: [An invaluable table providing all 20 metrics of each 4-polytope in edge length units. They must be algebraically converted to compare polytopes of unit radius.]}} within the same radius. The 4-simplex (5-cell) is the limit smallest case, and the 120-cell is the largest. Complexity (as measured by comparing configuration matrices or simply the number of vertices) follows the same ordering. == Visualisation ==

4-polytopes cannot be seen in three-dimensional space due to their extra dimension. Several techniques are used to help visualise them. ;Orthogonal projection Orthogonal projections can be used to show various symmetry orientations of a 4-polytope. They can be drawn in 2D as vertex-edge graphs, and can be shown in 3D with solid faces as visible projective envelopes. ;Perspective projection Just as a 3D shape can be projected onto a flat sheet, so a 4-D shape can be projected onto 3-space or even onto a flat sheet. One common projection is a Schlegel diagram which uses stereographic projection of points on the surface of a 3-sphere into three dimensions, connected by straight edges, faces, and cells drawn in 3-space. ;Sectioning Just as a slice through a polyhedron reveals a cut surface, so a slice through a 4-polytope reveals a cut "hypersurface" in three dimensions. A sequence of such sections can be used to build up an understanding of the overall shape. The extra dimension can be equated with time to produce a smooth animation of these cross sections. ;Nets A net of a 4-polytope is composed of polyhedral cells that are connected by their faces and all occupy the same three-dimensional space, just as the polygon faces of a net of a polyhedron are connected by their edges and all occupy the same plane. == Topological characteristics ==

(1909), including a Schlegel diagram of the tesseract. The topology of any given 4-polytope is defined by its Betti numbers and torsion coefficients. The value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, and is zero for all 4-polytopes, whatever their underlying topology. This inadequacy of the Euler characteristic to reliably distinguish between different topologies in higher dimensions led to the discovery of the more sophisticated Betti numbers. Similarly, the notion of orientability of a polyhedron is insufficient to characterise the surface twistings of toroidal 4-polytopes, and this led to the use of torsion coefficients. == Classification ==

Criteria Like all polytopes, 4-polytopes may be classified based on properties like "convexity" and "symmetry". • A 4-polytope is convex if its boundary (including its cells, faces and edges) does not intersect itself and the line segment joining any two points of the 4-polytope is contained in the 4-polytope or its interior; otherwise, it is non-convex. Self-intersecting 4-polytopes are also known as star 4-polytopes, from analogy with the star-like shapes of the non-convex star polygons and Kepler–Poinsot polyhedra. • A 4-polytope is regular if it is transitive on its flags. This means that its cells are all congruent regular polyhedra, and similarly its vertex figures are congruent and of another kind of regular polyhedron. • A convex 4-polytope is semi-regular if it has a symmetry group under which all vertices are equivalent (vertex-transitive) and its cells are regular polyhedra. The cells may be of two or more kinds, provided that they have the same kind of face. There are only 3 cases identified by Thorold Gosset in 1900: the rectified 5-cell, rectified 600-cell, and snub 24-cell. • A 4-polytope is uniform if it has a symmetry group under which all vertices are equivalent, and its cells are uniform polyhedra. The faces of a uniform 4-polytope must be regular. • A 4-polytope is scaliform if it is vertex-transitive, and has all equal length edges. This allows cells which are not uniform, such as the regular-faced convex Johnson solids. • A regular 4-polytope which is also convex is said to be a convex regular 4-polytope. • A 4-polytope is prismatic if it is the Cartesian product of two or more lower-dimensional polytopes. A prismatic 4-polytope is uniform if its factors are uniform. The hypercube is prismatic (product of two squares, or of a cube and line segment), but is considered separately because it has symmetries other than those inherited from its factors. • A tiling or honeycomb of 3-space is the division of three-dimensional Euclidean space into a repetitive grid of polyhedral cells. Such tilings or tessellations are infinite and do not bound a "4D" volume, and are examples of infinite 4-polytopes. A uniform tiling of 3-space is one whose vertices are congruent and related by a space group and whose cells are uniform polyhedra. Classes The following lists the various categories of 4-polytopes classified according to the criteria above: is one of 47 convex non-prismatic uniform 4-polytopes Uniform 4-polytope (vertex-transitive): • Convex uniform 4-polytopes (64, plus two infinite families) • 47 non-prismatic convex uniform 4-polytope including: • 6 Convex regular 4-polytope • Prismatic uniform 4-polytopes: • {} × {p,q} : 18 polyhedral hyperprisms (including cubic hyperprism, the regular hypercube) • Prisms built on antiprisms (infinite family) • {p} × {q} : duoprisms (infinite family) • Non-convex uniform 4-polytopes (10 + unknown) is the largest of 10 regular star 4-polytopes, having 600 vertices. • 10 (regular) Schläfli-Hess polytopes • 57 hyperprisms built on nonconvex uniform polyhedra • Unknown total number of nonconvex uniform 4-polytopes: Norman Johnson and other collaborators have identified 2191 forms (convex and star, excluding the infinite families), all constructed by vertex figures by Stella4D software. Other convex 4-polytopes: • Polyhedral pyramid • Polyhedral bipyramid • Polyhedral prism is the only infinite regular 4-polytope in Euclidean 3-dimensional space. Infinite uniform 4-polytopes of Euclidean 3-space (uniform tessellations of convex uniform cells) • 28 convex uniform honeycombs: uniform convex polyhedral tessellations, including: • 1 regular tessellation, cubic honeycomb: {4,3,4} Infinite uniform 4-polytopes of hyperbolic 3-space (uniform tessellations of convex uniform cells) • 76 Wythoffian convex uniform honeycombs in hyperbolic space, including: • 4 regular tessellation of compact hyperbolic 3-space: {3,5,3}, {4,3,5}, {5,3,4}, {5,3,5} Dual uniform 4-polytope (cell-transitive): • 41 unique dual convex uniform 4-polytopes • 17 unique dual convex uniform polyhedral prisms • infinite family of dual convex uniform duoprisms (irregular tetrahedral cells) • 27 unique convex dual uniform honeycombs, including: • Rhombic dodecahedral honeycomb • Disphenoid tetrahedral honeycomb Others: • Weaire–Phelan structure periodic space-filling honeycomb with irregular cells is an abstract regular 4-polytope, existing in the real projective plane, it can be seen by presenting its 11 hemi-icosahedral vertices and cells by index and color. Abstract regular 4-polytopes: • 11-cell • 57-cell These categories include only the 4-polytopes that exhibit a high degree of symmetry. Many other 4-polytopes are possible, but they have not been studied as extensively as the ones included in these categories. == See also ==