Hypercube

Last updated
Perspective projections
Hexahedron.svg Hypercube.svg
Cube (3-cube) Tesseract (4-cube)

In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3). It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in n dimensions is equal to .

Contents

An n-dimensional hypercube is more commonly referred to as an n-cube or sometimes as an n-dimensional cube. The term measure polytope (originally from Elte, 1912) [1] is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. [2]

The hypercube is the special case of a hyperrectangle (also called an n-orthotope).

A unit hypercube is a hypercube whose side has length one unit. Often, the hypercube whose corners (or vertices) are the 2n points in Rn with each coordinate equal to 0 or 1 is called the unit hypercube.

Construction

A diagram showing how to create a tesseract from a point. Dimension levels.svg
A diagram showing how to create a tesseract from a point.
An animation showing how to create a tesseract from a point. From Point to Tesseract (Looped Version).gif
An animation showing how to create a tesseract from a point.

A hypercube can be defined by increasing the numbers of dimensions of a shape:

0 – A point is a hypercube of dimension zero.
1 – If one moves this point one unit length, it will sweep out a line segment, which is a unit hypercube of dimension one.
2 – If one moves this line segment its length in a perpendicular direction from itself; it sweeps out a 2-dimensional square.
3 – If one moves the square one unit length in the direction perpendicular to the plane it lies on, it will generate a 3-dimensional cube.
4 – If one moves the cube one unit length into the fourth dimension, it generates a 4-dimensional unit hypercube (a unit tesseract).

This can be generalized to any number of dimensions. This process of sweeping out volumes can be formalized mathematically as a Minkowski sum: the d-dimensional hypercube is the Minkowski sum of d mutually perpendicular unit-length line segments, and is therefore an example of a zonotope.

The 1-skeleton of a hypercube is a hypercube graph.

Vertex coordinates

Projection of a rotating tesseract. 8-cell.gif
Projection of a rotating tesseract.

A unit hypercube of dimension is the convex hull of all the points whose Cartesian coordinates are each equal to either or . This hypercube is also the cartesian product of copies of the unit interval . Another unit hypercube, centered at the origin of the ambient space, can be obtained from this one by a translation. It is the convex hull of the points whose vectors of Cartesian coordinates are

Here the symbol means that each coordinate is either equal to or to . This unit hypercube is also the cartesian product . Any unit hypercube has an edge length of and an -dimensional volume of .

The -dimensional hypercube obtained as the convex hull of the points with coordinates or, equivalently as the Cartesian product is also often considered due to the simpler form of its vertex coordinates. Its edge length is , and its -dimensional volume is .

Faces

Every hypercube admits, as its faces, hypercubes of a lower dimension contained in its boundary. A hypercube of dimension admits facets, or faces of dimension : a (-dimensional) line segment has endpoints; a (-dimensional) square has sides or edges; a -dimensional cube has square faces; a (-dimensional) tesseract has three-dimensional cube as its facets. The number of vertices of a hypercube of dimension is (a usual, -dimensional cube has vertices, for instance).

The number of the -dimensional hypercubes (just referred to as -cubes from here on) contained in the boundary of an -cube is

, [3]     where and denotes the factorial of .

For example, the boundary of a -cube () contains cubes (-cubes), squares (-cubes), line segments (-cubes) and vertices (-cubes). This identity can be proven by a simple combinatorial argument: for each of the vertices of the hypercube, there are ways to choose a collection of edges incident to that vertex. Each of these collections defines one of the -dimensional faces incident to the considered vertex. Doing this for all the vertices of the hypercube, each of the -dimensional faces of the hypercube is counted times since it has that many vertices, and we need to divide by this number.

The number of facets of the hypercube can be used to compute the -dimensional volume of its boundary: that volume is times the volume of a -dimensional hypercube; that is, where is the length of the edges of the hypercube.

These numbers can also be generated by the linear recurrence relation

,    with , and when , , or .

For example, extending a square via its 4 vertices adds one extra line segment (edge) per vertex. Adding the opposite square to form a cube provides line segments.

Number of -dimensional faces of a -dimensional hypercube (sequence A038207 in the OEIS )
m012345678910
n n-cubeNames Schläfli
Coxeter
Vertex
0-face
Edge
1-face
Face
2-face
Cell
3-face

4-face

5-face

6-face

7-face

8-face

9-face

10-face
0 0-cubePoint
Monon
( )
CDel node.png
1
1 1-cube Line segment
Dion [4]
{}
CDel node 1.png
21
2 2-cube Square
Tetragon
{4}
CDel node 1.pngCDel 4.pngCDel node.png
441
3 3-cube Cube
Hexahedron
{4,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
81261
4 4-cube Tesseract
Octachoron
{4,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
16322481
5 5-cube Penteract
Deca-5-tope
{4,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
32808040101
6 6-cube Hexeract
Dodeca-6-tope
{4,3,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
6419224016060121
7 7-cube Hepteract
Tetradeca-7-tope
{4,3,3,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
12844867256028084141
8 8-cube Octeract
Hexadeca-8-tope
{4,3,3,3,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
2561024179217921120448112161
9 9-cube Enneract
Octadeca-9-tope
{4,3,3,3,3,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
51223044608537640322016672144181
10 10-cube Dekeract
Icosa-10-tope
{4,3,3,3,3,3,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
1024512011520153601344080643360960180201

Graphs

An n-cube can be projected inside a regular 2n-gonal polygon by a skew orthogonal projection, shown here from the line segment to the 16-cube.

Petrie polygon Orthographic projections
1-simplex t0.svg
Line segment
2-cube.svg
Square
3-cube graph.svg
Cube
4-cube graph.svg
Tesseract
5-cube graph.svg
5-cube
6-cube graph.svg
6-cube
7-cube graph.svg
7-cube
8-cube.svg
8-cube
9-cube.svg
9-cube
10-cube.svg
10-cube
11-cube.svg
11-cube
12-cube.svg
12-cube
13-cube.svg
13-cube
14-cube.svg
14-cube
15-cube.svg
15-cube
16-cube t0 A15.svg
16-cube

The hypercubes are one of the few families of regular polytopes that are represented in any number of dimensions.

The hypercube (offset) family is one of three regular polytope families, labeled by Coxeter as γn. The other two are the hypercube dual family, the cross-polytopes , labeled as βn, and the simplices , labeled as αn. A fourth family, the infinite tessellations of hypercubes, he labeled as δn.

Another related family of semiregular and uniform polytopes is the demihypercubes , which are constructed from hypercubes with alternate vertices deleted and simplex facets added in the gaps, labeled as n.

n-cubes can be combined with their duals (the cross-polytopes) to form compound polytopes:

Relation to (n−1)-simplices

The graph of the n-hypercube's edges is isomorphic to the Hasse diagram of the (n−1)-simplex's face lattice. This can be seen by orienting the n-hypercube so that two opposite vertices lie vertically, corresponding to the (n−1)-simplex itself and the null polytope, respectively. Each vertex connected to the top vertex then uniquely maps to one of the (n−1)-simplex's facets (n−2 faces), and each vertex connected to those vertices maps to one of the simplex's n−3 faces, and so forth, and the vertices connected to the bottom vertex map to the simplex's vertices.

This relation may be used to generate the face lattice of an (n−1)-simplex efficiently, since face lattice enumeration algorithms applicable to general polytopes are more computationally expensive.

Generalized hypercubes

Regular complex polytopes can be defined in complex Hilbert space called generalized hypercubes, γp
n
= p{4}2{3}...2{3}2, or CDel pnode 1.pngCDel 4.pngCDel node.pngCDel 3.png..CDel 3.pngCDel node.pngCDel 3.pngCDel node.png. Real solutions exist with p = 2, i.e. γ2
n
= γn = 2{4}2{3}...2{3}2 = {4,3,..,3}. For p > 2, they exist in . The facets are generalized (n−1)-cube and the vertex figure are regular simplexes.

The regular polygon perimeter seen in these orthogonal projections is called a petrie polygon. The generalized squares (n = 2) are shown with edges outlined as red and blue alternating color p-edges, while the higher n-cubes are drawn with black outlined p-edges.

The number of m-face elements in a p-generalized n-cube are: . This is pn vertices and pn facets. [5]

Generalized hypercubes
p=2p=3p=4p=5p=6p=7p=8
2-generalized-2-cube.svg
γ2
2
= {4} = CDel node 1.pngCDel 4.pngCDel node.png
4 vertices
3-generalized-2-cube skew.svg
γ3
2
= CDel 3node 1.pngCDel 4.pngCDel node.png
9 vertices
4-generalized-2-cube.svg
γ4
2
= CDel 4node 1.pngCDel 4.pngCDel node.png
16 vertices
5-generalized-2-cube skew.svg
γ5
2
= CDel 5node 1.pngCDel 4.pngCDel node.png
25 vertices
6-generalized-2-cube.svg
γ6
2
= CDel 6node 1.pngCDel 4.pngCDel node.png
36 vertices
7-generalized-2-cube skew.svg
γ7
2
= CDel 7node 1.pngCDel 4.pngCDel node.png
49 vertices
8-generalized-2-cube.svg
γ8
2
= CDel 8node 1.pngCDel 4.pngCDel node.png
64 vertices
2-generalized-3-cube.svg
γ2
3
= {4,3} = CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
8 vertices
3-generalized-3-cube.svg
γ3
3
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
27 vertices
4-generalized-3-cube.svg
γ4
3
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
64 vertices
5-generalized-3-cube.svg
γ5
3
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
125 vertices
6-generalized-3-cube.svg
γ6
3
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
216 vertices
7-generalized-3-cube.svg
γ7
3
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
343 vertices
8-generalized-3-cube.svg
γ8
3
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
512 vertices
2-generalized-4-cube.svg
γ2
4
= {4,3,3}
= CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
16 vertices
3-generalized-4-cube.svg
γ3
4
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
81 vertices
4-generalized-4-cube.svg
γ4
4
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
256 vertices
5-generalized-4-cube.svg
γ5
4
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
625 vertices
6-generalized-4-cube.svg
γ6
4
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
1296 vertices
7-generalized-4-cube.svg
γ7
4
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
2401 vertices
8-generalized-4-cube.svg
γ8
4
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
4096 vertices
2-generalized-5-cube.svg
γ2
5
= {4,3,3,3}
= CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
32 vertices
3-generalized-5-cube.svg
γ3
5
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
243 vertices
4-generalized-5-cube.svg
γ4
5
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
1024 vertices
5-generalized-5-cube.svg
γ5
5
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
3125 vertices
6-generalized-5-cube.svg
γ6
5
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
7776 vertices
γ7
5
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
16,807 vertices
γ8
5
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
32,768 vertices
2-generalized-6-cube.svg
γ2
6
= {4,3,3,3,3}
= CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
64 vertices
3-generalized-6-cube.svg
γ3
6
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
729 vertices
4-generalized-6-cube.svg
γ4
6
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
4096 vertices
5-generalized-6-cube.svg
γ5
6
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
15,625 vertices
γ6
6
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
46,656 vertices
γ7
6
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
117,649 vertices
γ8
6
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
262,144 vertices
2-generalized-7-cube.svg
γ2
7
= {4,3,3,3,3,3}
= CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
128 vertices
3-generalized-7-cube.svg
γ3
7
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
2187 vertices
γ4
7
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
16,384 vertices
γ5
7
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
78,125 vertices
γ6
7
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
279,936 vertices
γ7
7
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
823,543 vertices
γ8
7
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
2,097,152 vertices
2-generalized-8-cube.svg
γ2
8
= {4,3,3,3,3,3,3}
= CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
256 vertices
3-generalized-8-cube.svg
γ3
8
= CDel 3node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
6561 vertices
γ4
8
= CDel 4node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
65,536 vertices
γ5
8
= CDel 5node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
390,625 vertices
γ6
8
= CDel 6node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
1,679,616 vertices
γ7
8
= CDel 7node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
5,764,801 vertices
γ8
8
= CDel 8node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
16,777,216 vertices

Relation to exponentiation

Any positive integer raised to another positive integer power will yield a third integer, with this third integer being a specific type of figurate number corresponding to an n-cube with a number of dimensions corresponding to the exponential. For example, the exponent 2 will yield a square number or "perfect square", which can be arranged into a square shape with a side length corresponding to that of the base. Similarly, the exponent 3 will yield a perfect cube, an integer which can be arranged into a cube shape with a side length of the base. As a result, the act of raising a number to 2 or 3 is more commonly referred to as "squaring" and "cubing", respectively. However, the names of higher-order hypercubes do not appear to be in common use for higher powers.

See also

Notes

  1. Elte, E. L. (1912). "IV, Five dimensional semiregular polytope". The Semiregular Polytopes of the Hyperspaces. Netherlands: University of Groningen. ISBN   141817968X.
  2. Coxeter 1973, pp. 122–123, §7.2 see illustration Fig 7.2C.
  3. Coxeter 1973, p. 122, §7·25.
  4. Johnson, Norman W.; Geometries and Transformations, Cambridge University Press, 2018, p.224.
  5. Coxeter, H. S. M. (1974), Regular complex polytopes, London & New York: Cambridge University Press, p. 180, MR   0370328 .

Related Research Articles

Cube A geometric 3-dimensional object with 6 square faces

In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex.

Tesseract Four-dimensional analogue of the cube

In geometry, the tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes.

Schläfli symbol Notation that defines regular polytopes and tessellations

In geometry, the Schläfli symbol is a notation of the form that defines regular polytopes and tessellations.

5-cell Four-dimensional analogue of the tetrahedron

In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol {3,3,3}. It is a 5-vertex four-dimensional object bounded by five tetrahedral cells. It is also known as a C5, pentachoron, pentatope, pentahedroid, or tetrahedral pyramid. It is the 4-simplex (Coxeter's polytope), the simplest possible convex 4-polytope, and is analogous to the tetrahedron in three dimensions and the triangle in two dimensions. The 5-cell is a 4-dimensional pyramid with a tetrahedral base and four tetrahedral sides.

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. All its elements or j-faces — cells, faces and so on — are also transitive on the symmetries of the polytope, and are regular polytopes of dimension ≤ n.

Cross-polytope Regular polytope dual to the hypercube in any number of dimensions

In geometry, a cross-polytope, hyperoctahedron, orthoplex, or cocube is a regular, convex polytope that exists in n-dimensional Euclidean space. A 2-dimensional cross-polytope is a square, a 3-dimensional cross-polytope is a regular octahedron, and a 4-dimensional cross-polytope is a 16-cell. Its facets are simplexes of the previous dimension, while the cross-polytope's vertex figure is another cross-polytope from the previous dimension.

In geometry, a truncated tesseract is a uniform 4-polytope formed as the truncation of the regular tesseract.

5-polytope

In five-dimensional geometry, a five-dimensional polytope or 5-polytope is a 5-dimensional polytope, bounded by (4-polytope) facets. Each polyhedral cell being shared by exactly two 4-polytope facets.

Demihypercube Polytope constructed from alternation of an hypercube

In geometry, demihypercubes are a class of n-polytopes constructed from alternation of an n-hypercube, labeled as n for being half of the hypercube family, γn. Half of the vertices are deleted and new facets are formed. The 2n facets become 2n(n−1)-demicubes, and 2n(n−1)-simplex facets are formed in place of the deleted vertices.

Uniform polytope

A uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons.

In five-dimensional geometry, a 5-cube is a name for a five-dimensional hypercube with 32 vertices, 80 edges, 80 square faces, 40 cubic cells, and 10 tesseract 4-faces.

In five-dimensional geometry, a 5-simplex is a self-dual regular 5-polytope. It has six vertices, 15 edges, 20 triangle faces, 15 tetrahedral cells, and 6 5-cell facets. It has a dihedral angle of cos−1(1/5), or approximately 78.46°.

6-cube 6-dimensional hypercube

In geometry, a 6-cube is a six-dimensional hypercube with 64 vertices, 192 edges, 240 square faces, 160 cubic cells, 60 tesseract 4-faces, and 12 5-cube 5-faces.

7-cube 7-dimensional hypercube

In geometry, a 7-cube is a seven-dimensional hypercube with 128 vertices, 448 edges, 672 square faces, 560 cubic cells, 280 tesseract 4-faces, 84 penteract 5-faces, and 14 hexeract 6-faces.

8-cube 8-dimensional hypercube

In geometry, an 8-cube is an eight-dimensional hypercube. It has 256 vertices, 1024 edges, 1792 square faces, 1792 cubic cells, 1120 tesseract 4-faces, 448 5-cube 5-faces, 112 6-cube 6-faces, and 16 7-cube 7-faces.

9-cube 9-dimensional hypercube

In geometry, a 9-cube is a nine-dimensional hypercube with 512 vertices, 2304 edges, 4608 square faces, 5376 cubic cells, 4032 tesseract 4-faces, 2016 5-cube 5-faces, 672 6-cube 6-faces, 144 7-cube 7-faces, and 18 8-cube 8-faces.

10-cube 10-dimensional hypercube

In geometry, a 10-cube is a ten-dimensional hypercube. It has 1024 vertices, 5120 edges, 11520 square faces, 15360 cubic cells, 13440 tesseract 4-faces, 8064 5-cube 5-faces, 3360 6-cube 6-faces, 960 7-cube 7-faces, 180 8-cube 8-faces, and 20 9-cube 9-faces.

6-polytope

In six-dimensional geometry, a six-dimensional polytope or 6-polytope is a polytope, bounded by 5-polytope facets.

Truncated 5-cubes

In five-dimensional geometry, a truncated 5-cube is a convex uniform 5-polytope, being a truncation of the regular 5-cube.

In six-dimensional geometry, a truncated 6-cube is a convex uniform 6-polytope, being a truncation of the regular 6-cube.

References

Family An Bn I2(p) / Dn E6 / E7 / E8 / F4 / G2 Hn
Regular polygon Triangle Square p-gon Hexagon Pentagon
Uniform polyhedron Tetrahedron OctahedronCube Demicube DodecahedronIcosahedron
Uniform polychoron Pentachoron 16-cellTesseract Demitesseract 24-cell 120-cell600-cell
Uniform 5-polytope 5-simplex 5-orthoplex5-cube 5-demicube
Uniform 6-polytope 6-simplex 6-orthoplex6-cube 6-demicube 122221
Uniform 7-polytope 7-simplex 7-orthoplex7-cube 7-demicube 132231321
Uniform 8-polytope 8-simplex 8-orthoplex8-cube 8-demicube 142241421
Uniform 9-polytope 9-simplex 9-orthoplex9-cube 9-demicube
Uniform 10-polytope 10-simplex 10-orthoplex10-cube 10-demicube
Uniform n-polytope n-simplex n-orthoplexn-cube n-demicube 1k22k1k21 n-pentagonal polytope
Topics: Polytope familiesRegular polytopeList of regular polytopes and compounds