{
  "id": "enwiki-001376666353",
  "slug": "hypercube",
  "title": "Hypercube",
  "qid": "",
  "lead": "In geometry, a hypercube is an n-dimensional analogue of a square ( ) and a cube ( ); the special case for is known as a tesseract. 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{n} . 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.",
  "body": "In geometry, a hypercube is an n-dimensional analogue of a square ( ) and a cube ( ); the special case for is known as a tesseract. 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{n} . 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. Every hypercube admits, as its faces, hypercubes of a lower dimension contained in its boundary. A hypercube of dimension n admits 2n facets, or faces of dimension n-1 : a ( 1 -dimensional) line segment has 2 endpoints; a ( 2 -dimensional) square has 4 sides or edges; a 3 -dimensional cube has 6 square faces; a ( 4 -dimensional) tesseract has 8 three-dimensional cubes as its facets. The number of vertices of a hypercube of dimension n is 2^n (a usual, 3 -dimensional cube has 2^3=8 vertices, for instance). The number of the m -dimensional hypercubes (just referred to as m -cubes from here on) contained in the boundary of an n -cube is E_{m,n} = 2^{n-m}{n \\choose m} , &nbsp;&nbsp;&nbsp; where {n \\choose m}=\\frac{n!}{m!\\,(n-m)!} 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 line segments ( 1 -cubes) and 16 vertices ( 0 -cubes). This identity can be proven by a simple combinatorial argument: for each of the 2^n vertices of the hypercube, there are \\tbinom n m ways to choose a collection of m edges incident to that vertex. Each of these collections defines one of the m -dimensional faces incident to the considered vertex. Doing this for all the vertices of the hypercube, each of the m -dimensional faces of the hypercube is counted 2^m times since it has that many vertices, and we need to divide 2^n\\tbinom n m by this number. The number of facets of the hypercube can be used to compute the (n-1) -dimensional volume of its boundary: that volume is 2n times the volume of a (n-1) -dimensional hypercube; that is, 2ns^{n-1} where s is the length of the edges of the hypercube. These numbers can also be generated by the linear recurrence relation. E_{m,n} = 2E_{m,n-1} + E_{m-1,n-1} \\! , &nbsp; &nbsp; with E_{0,0}= 1 , and E_{m,n}=0 when n , n , or m . 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 E_{1,3}=12 line segments. The extended f-vector for an n-cube can also be computed by expanding (2x+1)^n (concisely, (2,1) n ), and reading off the coefficients of the resulting polynomial. For example, the elements of a tesseract is (2,1) 4 = (4,4,1) 2 = (16,32,24,8,1). == 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. Regular complex polytopes can be defined in complex Hilbert space called generalized hypercubes, &gamma; = p {4} 2 {3}... 2 {3} 2 , or .. . Real solutions exist with p = 2, i.e. &gamma; = &gamma; n = 2 {4} 2 {3}... 2 {3} 2 = {4,3,..,3}. For p > 2, they exist in \\mathbb{C}^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^{n-m}{n \\choose m} . This is p n vertices and pn facets.",
  "categories": [
    "107141658",
    "109365992",
    "127051206",
    "20476493",
    "23603337",
    "26220375",
    "28269686",
    "31347309",
    "44446176",
    "48128016",
    "72655480"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1376666353",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1790341955.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001376666353",
    "type": "webpage",
    "title": "Hypercube",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/hypercube",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001376666353",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1376666353",
    "note": "Immutable snapshot enwiki-001376666353"
  }
}