TheInfoList

In geometry, a hypercube is an ''n''-dimensional analogue of a square () and a cube (). 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 $\sqrt$. 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) is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. 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 2''n'' points in R''n'' with each coordinate equal to 0 or 1 is called ''the'' unit hypercube.

Construction

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.

Coordinates

A unit hypercube of ''n'' dimensions is the convex hull of the points given by all sign permutations of the Cartesian coordinates $\left\left(\pm \frac, \pm \frac, \cdots, \pm \frac\right\right)$. It has an edge length of 1 and an ''n''-dimensional volume of 1. An ''n''-dimensional hypercube is also often regarded as the convex hull of all sign permutations of the coordinates $\left(\pm 1, \pm 1, \cdots, \pm 1\right)$. This form is often chosen due to ease of writing out the coordinates. Its edge length is 2, and its ''n''-dimensional volume is 2n.

Elements

Every ''n''-cube of n > 0 is composed of elements, or ''n''-cubes of a lower dimension, on the (''n''−1)-dimensional surface on the parent hypercube. A side is any element of (''n''−1)-dimension of the parent hypercube. A hypercube of dimension ''n'' has 2''n'' sides (a 1-dimensional line has 2 endpoints; a 2-dimensional square has 4 sides or edges; a 3-dimensional cube has 6 2-dimensional faces; a 4-dimensional tesseract has 8 cells). The number of vertices (points) of a hypercube is $2^$ (a cube has $2^$ vertices, for instance). The number of ''m''-dimensional hypercubes (just referred to as ''m''-cube from here on) on the boundary of an ''n''-cube is :$E_ = 2^$,     where $=\frac$ and ''n''! denotes the factorial of ''n''. For example, the boundary of a 4-cube (n=4) contains 8 cubes (3-cubes), 24 squares (2-cubes), 32 lines (1-cubes) and 16 vertices (0-cubes). This identity can be proved by combinatorial arguments; each of the $2^n$ vertices defines a vertex in a ''m''-dimensional boundary. There are  ways of choosing which lines ("sides") that defines the subspace that the boundary is in. But, each side is counted $2^m$ times since it has that many vertices, we need to divide by this number. This identity can also be used to generate the formula for the ''n''-dimensional cube surface area. The surface area of a hypercube is: $2ns^$. These numbers can also be generated by the linear recurrence relation :$E_ = 2E_ + E_ \!$,     with $E_ = 1 \!$,  and undefined elements (where $n < m$, $n < 0$, or $m < 0$ ) $=0$. For example, extending a square via its 4 vertices adds one extra line (edge) per vertex, and also adds the final second square, to form a cube, giving $E_ \!$ = 12 lines in total.

Graphs

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

Related families of polytopes

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 ''hγn''. ''n''-cubes can be combined with their duals (the cross-polytopes) to form compound polytopes: *In two dimensions, we obtain the octagrammic star figure , *In three dimensions we obtain the compound of cube and octahedron, *In four dimensions we obtain the compound of tesseract and 16-cell.

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''2...22, or ... Real solutions exist with ''p''=2, i.e. γ = γ''n'' = 22...22 = . For ''p''>2, they exist in $\mathbb^n$. 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: $p^$. This is ''p''''n'' vertices and ''pn'' facets..

* Hypercube interconnection network of computer architecture * Hyperoctahedral group, the symmetry group of the hypercube * Hypersphere * Simplex * ''Crucifixion (Corpus Hypercubus)'' (famous artwork)

Notes

References

* * p. 296, Table I (iii): Regular Polytopes, three regular polytopes in ''n'' dimensions (''n'' ≥ 5) * Cf Chapter 7.1 "Cubical Representation of Boolean Functions" wherein the notion of "hypercube" is introduced as a means of demonstrating a distance-1 code (Gray code) as the vertices of a hypercube, and then the hypercube with its vertices so labelled is squashed into two dimensions to form either a Veitch diagram or Karnaugh map.