Performance prediction

2013-11-30T17:32:18Z

123.236.52.136:

In [[geometry]], a '''complex polytope''' is a generalization of a [[polytope]] in [[real space]] to an analogous structure in a [[Complex number|complex]] [[Hilbert space]], where each real dimension is accompanied by an [[imaginary number|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 a third vertex associated with an edge because one of them would then lie between the other two. On the complex line, which may be represented as an [[Argand diagram]], points are not ordered and there is no idea of "between", so more than two vertex points may be associated with a given edge.

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 lines|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.

==Regular complex polytopes==
[[Image:ComplexOctagon.svg|frame|right|Two representations of a regular complex octagon 4{4}2]]
The only complex polytopes to have been systematically studied are the [[regular polytope|regular]] ones. Shephard (1952) discovered them, and Coxeter (1974) developed the idea extensively. Shephard treated his figures as [[configuration (geometry)|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:

:<math>x^p -1 = 0</math>

(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 symbol|Schläfli's notation]] for regular polytopes. For a polygon bounded by ''p''1-edges, with a ''p''2-set as vertex figure and overall symmetry group of order ''g'', we denote the polygon as ''p''1(''g'')''p''2.

The number of vertices ''V'' is then ''g''/''p''2 and the number of edges ''E'' is ''g''/''p''1.

The complex octagon illustrated has eight 4-edges (''p''1=4) and sixteen 2-vertices (''p''2=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 ''p''1{''q''}''p''2 is due to Coxeter, and is based on group theory. The nodes ''p''1 and ''p''2 represent mirrors producing ''p''1 and ''p''2 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, i.e. for ''q''=4, ABAB = BABA. When ''q'' is odd, then ''p''1 = ''p''2, 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 ==
* [[Harold Scott MacDonald Coxeter|Coxeter, H. S. M.]] and Moser, W. O. J.; ''Generators and Relations for Discrete Groups'' (1965), esp pp 67–80.
* [[Harold Scott MacDonald Coxeter|Coxeter, H. S. M.]]; ''Regular Complex Polytopes'', Cambridge University Press, (1974).
* [[Harold Scott MacDonald Coxeter|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.

[[Category:Polytopes]]
[[Category:Complex analysis]]

formulasearchengine - User contributions [en]

Performance prediction