Complex polytope

Complex polytope

A complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one.

On a real line, two points bound a segment. This defines an edge with two bounding vertices. For a real polytope it is not possible to have third vertex because one would then lie in between the other two. On the complex line, which may be represented as an Argand diagram, points are not ordered and so more than two vertex points may be allowed.

Also, a real polygon has just two sides at each vertex, such that the boundary forms a closed loop. A real polyhedron has two faces at each edge such that the boundary forms a closed surface. A polychoron has two cells at each wall, and so on. These loops and surfaces have no analogy in complex spaces, for example a set of complex lines and points may form a closed chain of connections, but this chain does not bound a polygon. Thus, more than two elements meeting in one place may be allowed.

Since bounding does not occur, we cannot think of a complex edge as a line segment, but as the whole line. Similarly, we cannot think of a bounded polygonal face but must accept the whole plane.

Thus, a complex polytope may be understood as an arrangement of connected points, lines, planes and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on. Likewise, each line must contain multiple points, each plane multiple lines, and so on.

Contents

Regular complex polytopes

Two representations of a regular complex octagon 4{4}2

The only complex polytopes to have been systematically studied are the regular ones. Shephard (1952) discovered them, and Coxeter (1974) developed the idea extensively. Shephard treated his figures as configurations from the start, while Coxeter only found it necessary to do so from Chapter 12 onwards.

In the Argand diagram, of the edge of a regular complex polytope, the vertex points lie at the vertices of a regular polygon centered on the origin. Given the general point x + iy in the complex plane, for an edge having p vertices, these lie at the p roots of the equation:

xp − 1 = 0

(For p = 2 these are the real points +1 and − 1, and the edge is real).

Two real projections of the same regular complex octagon with edges a,b,c,d,e,f,g,h are illustrated. It has 16 vertices, which for clarity have not been individually marked. Each edge has four vertices at which it meets another edge, hence each edge meets four other edges. In the first diagram, each edge is represented by a square. The sides of the square are not parts of the polygon - this is important to understand - but are drawn in purely to help visually relate the four vertices. The edges are laid out symmetrically (coincidentally the diagram looks the same as a common projection of the hypercube, but in the case of the complex octagon the diamond shapes which can be traced are not parts of the structure). The second diagram abandons octagonal symmetry in favour of clarity. Each edge is shown as a line, and each meeting point on the line is a vertex on that edge. The connectivity between the various edges is clear to see.

Modified Schläfli notation

Shephard's notation

Shephard originally devised a modified form of Schläfli's notation for regular polytopes. For a polygon bounded by p1-edges, with a p2-set as vertex figure and overall symmetry group of order g, we denote the polygon as p1(g)p2.

The number of vertices V is then g/p2 and the number of edges E is g/p1.

The complex octagon illustrated has eight 4-edges (p1=4) and sixteen 2-vertices (p2=2). From this we can work out that g = 32, giving the modified Schläfli symbol 4(32)2.

Coxeter's notation

The modern notation p1{q}p2 is due to Coxeter, and is based on group theory. The nodes p1 and p2 represent mirrors producing p1 and p2 images in the plane. In group theory, this might be represented (for the example left) as AAAA = BB = 1. q represents the number of alternate reflections in the two mirrors that become equal to its opposite, ie for q=4, ABAB = BABA. When q is odd, then p1 = p2, e.g. 3{5}3 means AAA = BBB = 1; ABABA = BABAB.

The example octagon is represented as 4{4}2, which belongs to symmetry group AAAA = BB = 1, ABAB = BABA.

Real conjugates

In the ordinary, or real plane, we can construct a visible figure as the real conjugate of some complex polygon. Likewise in ordinary space, we can construct a visible figure as the real conjugate of some complex polyhedron.

To obtain the real conjugate, we discard the imaginary part of any coordinate. For example the complex point (a + ib) has real conjugate a.

The real conjugate of a complex edge is a line with the vertex points distributed along it (not generally evenly spaced). The second of the two octagon projections above shows the real conjugates of the sides.

References

  • Coxeter, H. S. M. and Moser, W. O. J.; Generators and Relations for Discrete Groups (1965), esp pp 67–80.
  • Coxeter, H. S. M.; Regular Complex Polytopes, Cambridge University Press, (1974).
  • Coxeter, H. S. M. and Shephard, G.C.; Portraits of a family of complex polytopes, Leonardo Vol 25, No 3/4, (1992), pp 239–244,
  • Shephard, G.C.; Regular complex polytopes, Proc. London math. Soc. Series 3, Vol 2, (1952), pp 82–97.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Complex space — In mathematics, n dimensional complex space is a multi dimensional generalisation of the complex numbers, which have both real and imaginary parts or dimensions. The n dimensional complex space can be seen as n cartesian products of the complex… …   Wikipedia

  • Complex polygon — The term complex polygon can mean two different things: In computer graphics, as a polygon which is neither convex nor concave. In geometry, as a polygon in the unitary plane, which has two complex dimensions. Contents 1 Computer graphics 2… …   Wikipedia

  • Polytope — Not to be confused with polytrope. In elementary geometry, a polytope is a geometric object with flat sides, which exists in any general number of dimensions. A polygon is a polytope in two dimensions, a polyhedron in three dimensions, and so on… …   Wikipedia

  • Regular polytope — In mathematics, a regular polytope is a polytope whose symmetry is transitive on its flags, thus giving it the highest degree of symmetry. All its elements or j faces (for all 0≤ j ≤ n , where n is the dimension of the polytope) cells, faces and… …   Wikipedia

  • Gosset 4 21 polytope — The Gosset 421 polytope is an 8 dimensional semiregular uniform polytope composed of 17,280 7 simplex and 2,160 7 orthoplex facets.It was discovered by Thorold Gosset, who described it in his 1900 paper as an 8 ic semi regular figure. It is the… …   Wikipedia

  • Simplicial complex — In mathematics, a simplicial complex is a topological space of a particular kind, constructed by gluing together points, line segments, triangles, and their n dimensional counterparts (see illustration). Simplicial complexes should not be… …   Wikipedia

  • Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… …   Wikipedia

  • Cross-polytope — In geometry, a cross polytope,[1] orthoplex,[2] hyperoctahedron, or cocube is a regular, convex polytope that exists in any number of dimensions. The vertices of a cross polytope are all the permutations of (±1, 0, 0, …, 0). The cross polytope is …   Wikipedia

  • Simplicial polytope — A d dimensional simplicial polytope is a polytope whose facets are adjacent to exactly d ridges.They are topologically dual to simple polytopes. Polytopes which are bothsimple and simplicial are either simplices or two dimensional polygons.… …   Wikipedia

  • CW complex — In topology, a CW complex is a type of topological space introduced by J. H. C. Whitehead to meet the needs of homotopy theory. This class of spaces is broader and has some better categorical properties than simplicial complexes, but still… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”