- Source: 4 21 polytope
In 8-dimensional geometry, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 8-ic semi-regular figure.
Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 4-node sequences, .
The rectified 421 is constructed by points at the mid-edges of the 421. The birectified 421 is constructed by points at the triangle face centers of the 421. The trirectified 421 is constructed by points at the tetrahedral centers of the 421.
These polytopes are part of a family of 255 = 28 − 1 convex uniform 8-polytopes, made of uniform 7-polytope facets and vertex figures, defined by all permutations of one or more rings in this Coxeter-Dynkin diagram: .
421 polytope
The 421 polytope has 17,280 7-simplex and 2,160 7-orthoplex facets, and 240 vertices. Its vertex figure is the 321 polytope. As its vertices represent the root vectors of the simple Lie group E8, this polytope is sometimes referred to as the E8 root polytope.
The vertices of this polytope can also be obtained by taking the 240 integral octonions of norm 1. Because the octonions are a nonassociative normed division algebra, these 240 points have a multiplication operation making them not into a group but rather a loop, in fact a Moufang loop.
For visualization this 8-dimensional polytope is often displayed in a special skewed orthographic projection direction that fits its 240 vertices within a regular triacontagon (called a Petrie polygon). Its 6720 edges are drawn between the 240 vertices. Specific higher elements (faces, cells, etc.) can also be extracted and drawn on this projection.
= Alternate names
=This polytope was discovered by Thorold Gosset, who described it in his 1900 paper as an 8-ic semi-regular figure. It is the last finite semiregular figure in his enumeration, semiregular to him meaning that it contained only regular facets.
E. L. Elte named it V240 (for its 240 vertices) in his 1912 listing of semiregular polytopes.
H.S.M. Coxeter called it 421 because its Coxeter-Dynkin diagram has three branches of length 4, 2, and 1, with a single node on the terminal node of the 4 branch.
Dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton (Acronym Fy) - 2160-17280 facetted polyzetton (Jonathan Bowers)
= Coordinates
=It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 8-dimensional space.
The 240 vertices of the 421 polytope can be constructed in two sets: 112 (22 × 8C2) with coordinates obtained from
(
±
2
,
±
2
,
0
,
0
,
0
,
0
,
0
,
0
)
{\displaystyle (\pm 2,\pm 2,0,0,0,0,0,0)\,}
by taking an arbitrary combination of signs and an arbitrary permutation of coordinates, and 128 roots (27) with coordinates obtained from
(
±
1
,
±
1
,
±
1
,
±
1
,
±
1
,
±
1
,
±
1
,
±
1
)
{\displaystyle (\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1)\,}
by taking an even number of minus signs (or, equivalently, requiring that the sum of all the eight coordinates be a multiple of 4).
Each vertex has 56 nearest neighbors; for example, the nearest neighbors of the vertex
(
1
,
1
,
1
,
1
,
1
,
1
,
1
,
1
)
{\displaystyle (1,1,1,1,1,1,1,1)}
are those whose coordinates sum to 4, namely the 28 obtained by permuting the coordinates of
(
2
,
2
,
0
,
0
,
0
,
0
,
0
,
0
)
{\displaystyle (2,2,0,0,0,0,0,0)\,}
and the 28 obtained by permuting the coordinates of
(
1
,
1
,
1
,
1
,
1
,
1
,
−
1
,
−
1
)
{\displaystyle (1,1,1,1,1,1,-1,-1)}
. These 56 points are the vertices of a 321 polytope in 7 dimensions.
Each vertex has 126 second nearest neighbors: for example, the nearest neighbors of the vertex
(
1
,
1
,
1
,
1
,
1
,
1
,
1
,
1
)
{\displaystyle (1,1,1,1,1,1,1,1)}
are those whose coordinates sum to 0, namely the 56 obtained by permuting the coordinates of
(
2
,
−
2
,
0
,
0
,
0
,
0
,
0
,
0
)
{\displaystyle (2,-2,0,0,0,0,0,0)\,}
and the 70 obtained by permuting the coordinates of
(
1
,
1
,
1
,
1
,
−
1
,
−
1
,
−
1
,
−
1
)
{\displaystyle (1,1,1,1,-1,-1,-1,-1)}
. These 126 points are the vertices of a 231 polytope in 7 dimensions.
Each vertex also has 56 third nearest neighbors, which are the negatives of its nearest neighbors, and one antipodal vertex, for a total of
1
+
56
+
126
+
56
+
1
=
240
{\displaystyle 1+56+126+56+1=240}
vertices.
Another construction is by taking signed combination of 14 codewords of 8-bit Extended Hamming code(8,4) that give 14 × 24 = 224 vertices and adding trivial signed axis
(
±
2
,
0
,
0
,
0
,
0
,
0
,
0
,
0
)
{\displaystyle (\pm 2,0,0,0,0,0,0,0)}
for last 16 vertices. In this case, vertices are distance of
4
{\displaystyle {\sqrt {4}}}
from origin rather than
8
{\displaystyle {\sqrt {8}}}
.
Hamming 8-bit Code
0 0 0 0 0 0 0 0 0
1 1 1 1 1 0 0 0 0 ⇒ ± ± ± ± 0 0 0 0
2 1 1 0 0 1 1 0 0 ⇒ ± ± 0 0 ± ± 0 0
3 0 0 1 1 1 1 0 0 ⇒ 0 0 ± ± ± ± 0 0
4 1 0 1 0 1 0 1 0 ⇒ ± 0 ± 0 ± 0 ± 0 ±2 0 0 0 0 0 0 0
5 0 1 0 1 1 0 1 0 ⇒ 0 ± 0 ± ± 0 ± 0 0 ±2 0 0 0 0 0 0
6 0 1 1 0 0 1 1 0 ⇒ 0 ± ± 0 0 ± ± 0 0 0 ±2 0 0 0 0 0
7 1 0 0 1 0 1 1 0 ⇒ ± 0 0 ± 0 ± ± 0 0 0 0 ±2 0 0 0 0
8 0 1 1 0 1 0 0 1 ⇒ 0 ± ± 0 ± 0 0 ± 0 0 0 0 ±2 0 0 0
9 1 0 0 1 1 0 0 1 ⇒ ± 0 0 ± ± 0 0 ± 0 0 0 0 0 ±2 0 0
A 1 0 1 0 0 1 0 1 ⇒ ± 0 ± 0 0 ± 0 ± 0 0 0 0 0 0 ±2 0
B 0 1 0 1 0 1 0 1 ⇒ 0 ± 0 ± 0 ± 0 ± 0 0 0 0 0 0 0 ±2
C 1 1 0 0 0 0 1 1 ⇒ ± ± 0 0 0 0 ± ±
D 0 0 1 1 0 0 1 1 ⇒ 0 0 ± ± 0 0 ± ±
E 0 0 0 0 1 1 1 1 ⇒ 0 0 0 0 ± ± ± ±
F 1 1 1 1 1 1 1 1
( 224 vertices + 16 vertices )
Another decomposition gives the 240 points in 9-dimensions as an expanded 8-simplex, and two opposite birectified 8-simplexes, and .
(
3
,
−
3
,
0
,
0
,
0
,
0
,
0
,
0
,
0
)
{\displaystyle (3,-3,0,0,0,0,0,0,0)}
: 72 vertices
(
−
2
,
−
2
,
−
2
,
1
,
1
,
1
,
1
,
1
,
1
)
{\displaystyle (-2,-2,-2,1,1,1,1,1,1)}
: 84 vertices
(
2
,
2
,
2
,
−
1
,
−
1
,
−
1
,
−
1
,
−
1
,
−
1
)
{\displaystyle (2,2,2,-1,-1,-1,-1,-1,-1)}
: 84 vertices
This arises similarly to the relation of the A8 lattice and E8 lattice, sharing 8 mirrors of A8: .
= Tessellations
=This polytope is the vertex figure for a uniform tessellation of 8-dimensional space, represented by symbol 521 and Coxeter-Dynkin diagram:
= Construction and faces
=The facet information of this polytope can be extracted from its Coxeter-Dynkin diagram:
Removing the node on the short branch leaves the 7-simplex:
Removing the node on the end of the 2-length branch leaves the 7-orthoplex in its alternated form (411):
Every 7-simplex facet touches only 7-orthoplex facets, while alternate facets of an orthoplex facet touch either a simplex or another orthoplex. There are 17,280 simplex facets and 2160 orthoplex facets.
Since every 7-simplex has 7 6-simplex facets, each incident to no other 6-simplex, the 421 polytope has 120,960 (7×17,280) 6-simplex faces that are facets of 7-simplexes. Since every 7-orthoplex has 128 (27) 6-simplex facets, half of which are not incident to 7-simplexes, the 421 polytope has 138,240 (26×2160) 6-simplex faces that are not facets of 7-simplexes. The 421 polytope thus has two kinds of 6-simplex faces, not interchanged by symmetries of this polytope. The total number of 6-simplex faces is 259200 (120,960+138,240).
The vertex figure of a single-ring polytope is obtained by removing the ringed node and ringing its neighbor(s). This makes the 321 polytope.
Seen in a configuration matrix, the element counts can be derived by mirror removal and ratios of Coxeter group orders.
= Projections
=3D
2D
These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5 Coxeter planes. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green.
= k21 family
=The 421 polytope is last in a family called the k21 polytopes. The first polytope in this family is the semiregular triangular prism which is constructed from three squares (2-orthoplexes) and two triangles (2-simplexes).
= Geometric folding
=The 421 is related to the 600-cell by a geometric folding of the Coxeter-Dynkin diagrams. This can be seen in the E8/H4 Coxeter plane projections. The 240 vertices of the 421 polytope are projected into 4-space as two copies of the 120 vertices of the 600-cell, one copy smaller (scaled by the golden ratio) than the other with the same orientation. Seen as a 2D orthographic projection in the E8/H4 Coxeter plane, the 120 vertices of the 600-cell are projected in the same four rings as seen in the 421. The other 4 rings of the 421 graph also match a smaller copy of the four rings of the 600-cell.
= Related polytopes
=In 4-dimensional complex geometry, the regular complex polytope 3{3}3{3}3{3}3, and Coxeter diagram exists with the same vertex arrangement as the 421 polytope. It is self-dual. Coxeter called it the Witting polytope, after Alexander Witting. Coxeter expresses its Shephard group symmetry by 3[3]3[3]3[3]3.
The 421 is sixth in a dimensional series of semiregular polytopes. Each progressive uniform polytope is constructed vertex figure of the previous polytope. Thorold Gosset identified this series in 1900 as containing all regular polytope facets, containing all simplexes and orthoplexes.
Rectified 4_21 polytope
The rectified 421 can be seen as a rectification of the 421 polytope, creating new vertices on the center of edges of the 421.
= Alternative names
=Rectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for rectified 2160-17280 polyzetton (Acronym riffy) (Jonathan Bowers)
= Construction
=It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 8-dimensional space. It is named for being a rectification of the 421. Vertices are positioned at the midpoint of all the edges of 421, and new edges connecting them.
The facet information can be extracted from its Coxeter-Dynkin diagram.
Removing the node on the short branch leaves the rectified 7-simplex:
Removing the node on the end of the 2-length branch leaves the rectified 7-orthoplex in its alternated form:
Removing the node on the end of the 4-length branch leaves the 321:
The vertex figure is determined by removing the ringed node and adding a ring to the neighboring node. This makes a 221 prism.
= Coordinates
=The Cartesian coordinates of the 6720 vertices of the rectified 421 is given by all permutations of coordinates from three other uniform polytope:
hexic 8-cube - odd negatives: ½(±1,±1,±1,±1,±1,±1,±3,±3) - 3584 vertices
birectified 8-cube - (0,0,±1,±1,±1,±1,±1,±1) - 1792 vertices
cantellated 8-orthoplex - (0,0,0,0,0,0,±1,±1,±2) - 1344 vertices
= Projections
=2D
These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5 Coxeter planes. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green.
Birectified 4_21 polytope
The birectified 421 can be seen as a second rectification of the uniform 421 polytope. Vertices of this polytope are positioned at the centers of all the 60480 triangular faces of the 421.
= Alternative names
=Birectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for birectified 2160-17280 polyzetton (acronym borfy) (Jonathan Bowers)
= Construction
=It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 8-dimensional space. It is named for being a birectification of the 421. Vertices are positioned at the center of all the triangle faces of 421.
The facet information can be extracted from its Coxeter-Dynkin diagram.
Removing the node on the short branch leaves the birectified 7-simplex. There are 17280 of these facets.
Removing the node on the end of the 2-length branch leaves the birectified 7-orthoplex in its alternated form. There are 2160 of these facets.
Removing the node on the end of the 4-length branch leaves the rectified 321. There are 240 of these facets.
The vertex figure is determined by removing the ringed node and adding rings to the neighboring nodes. This makes a 5-demicube-triangular duoprism.
= Projections
=2D
These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5 Coxeter planes. Edges are not drawn. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green, etc.
Trirectified 4_21 polytope
= Alternative names
=Trirectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for trirectified 2160-17280 polyzetton (acronym torfy) (Jonathan Bowers)
= Construction
=It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 8-dimensional space. It is named for being a birectification of the 421. Vertices are positioned at the center of all the triangle faces of 421.
The facet information can be extracted from its Coxeter-Dynkin diagram.
Removing the node on the short branch leaves the trirectified 7-simplex:
Removing the node on the end of the 2-length branch leaves the trirectified 7-orthoplex in its alternated form:
Removing the node on the end of the 4-length branch leaves the birectified 321:
The vertex figure is determined by removing the ringed node and ring the neighbor nodes. This makes a tetrahedron-rectified 5-cell duoprism.
= Projections
=2D
These graphs represent orthographic projections in the E7, E6, B8, D8, D7, D6, D5, D4, D3, A7, and A5 Coxeter planes. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green.
(E8 and B8 were too large to display)
See also
List of E8 polytopes
Notes
References
T. Gosset: On the Regular and Semi-Regular Figures in Space of n Dimensions, Messenger of Mathematics, Macmillan, 1900
Elte, E. L. (1912), The Semiregular Polytopes of the Hyperspaces, Groningen: University of Groningen
Coxeter, H. S. M., Regular Complex Polytopes, Cambridge University Press, (1974).
Kaleidoscopes: Selected Writings of H.S.M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication, 1995, ISBN 978-0-471-01003-6 [1]
(Paper 24) H.S.M. Coxeter, Regular and Semi-Regular Polytopes III, [Math. Zeit. 200 (1988) 3-45] See p347 (figure 3.8c) by Peter McMullen: (30-gonal node-edge graph of 421)
Klitzing, Richard. "8D uniform polytopes (polyzetta)". o3o3o3o *c3o3o3o3x - fy, o3o3o3o *c3o3o3x3o - riffy, o3o3o3o *c3o3x3o3o - borfy, o3o3o3o *c3x3o3o3o - torfy
Kata Kunci Pencarian:
- Daftar bentuk matematika
- Politop
- 4 21 polytope
- E8 polytope
- Cross-polytope
- Polytope
- Uniform 4-polytope
- 16-cell
- 1 42 polytope
- Tesseract
- Uniform k 21 polytope
- E6 polytope
