Perles Configuration
   HOME

TheInfoList



OR:

In geometry, the Perles configuration is a system of nine points and nine lines in the
Euclidean plane In mathematics, the Euclidean plane is a Euclidean space of dimension two. That is, a geometric setting in which two real quantities are required to determine the position of each point ( element of the plane), which includes affine notions of ...
for which every combinatorially equivalent realization has at least one irrational number as one of its coordinates. It can be constructed from the diagonals and symmetry lines of a regular pentagon, omitting one of the symmetry lines. In turn, it can be used to construct higher-dimensional
convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the wo ...
s that cannot be given rational coordinates, having the fewest vertices of any known example. All of the realizations of the Perles configuration in the projective plane are equivalent to each other under projective transformations.


Construction

One way of constructing the Perles configuration is to start with a regular
pentagon In geometry, a pentagon (from the Greek πέντε ''pente'' meaning ''five'' and γωνία ''gonia'' meaning ''angle'') is any five-sided polygon or 5-gon. The sum of the internal angles in a simple pentagon is 540°. A pentagon may be simpl ...
and its five diagonals. These diagonals form the sides of a smaller inner pentagon nested inside the outer pentagon. Each vertex of the outer pentagon is situated opposite from a vertex of the inner pentagon. The nine points of the configuration consist of four out of the five vertices of each pentagon and the shared center of the two pentagons. Two opposite vertices are omitted, one from each pentagon. The nine lines of the configuration consist of the five lines that are diagonals of the outer pentagon and sides of the inner pentagon, and the four lines that pass through the center and through opposite pairs of vertices from the two pentagons.


Projective invariance and irrationality

A realization of the Perles configuration is defined to consist of any nine points and nine lines with the same intersection pattern. That means that a point and line intersect each other in the realization, if and only if they intersect in the configuration constructed from the regular pentagon. Every realization of this configuration in the Euclidean plane or, more generally, in the real projective plane is equivalent, under a projective transformation, to a realization constructed in this way from a regular pentagon. Because the cross-ratio, a number defined from any four collinear points, does not change under projective transformations, every realization has four points having the same cross-ratio as the cross-ratio of the four collinear points in the realization derived from the regular pentagon. But, these four points have 1+\varphi as their cross-ratio, where \varphi is the golden ratio, an irrational number. Every four collinear points with rational coordinates have a rational cross ratio, so the Perles configuration cannot be realized by rational points. Branko Grünbaum has conjectured that every configuration that can be realized by irrational but not rational numbers has at least nine points; if so, the Perles configuration would be the smallest possible irrational configuration of points and lines.


Application in polyhedral combinatorics

Perles used his configuration to construct an eight-dimensional
convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the wo ...
with twelve vertices that can similarly be realized with real coordinates but not with rational coordinates. The points of the configuration, three of them doubled and with signs associated with each point, form the
Gale diagram In the mathematical discipline of polyhedral combinatorics, the Gale transform turns the vertices of any convex polytope into a set of vectors or points in a space of a different dimension, the Gale diagram of the polytope. It can be used to descr ...
of the Perles polytope. Ernst Steinitz's proof of
Steinitz's theorem In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar grap ...
can be used to show that every three-dimensional polytope can be realized with rational coordinates, but it is now known that there exist irrational polytopes in four dimensions. However, the Perles polytope has the fewest vertices of any known irrational polytope.


History and related work

The Perles configuration was introduced by Micha Perles in the 1960s. It is not the first known example of an irrational configuration of points and lines. describes an 11-point example, obtained by applying Von Staudt's algebra of throws to construct a configuration corresponding to the square root of two.; There is a long history of study of regular projective configurations, finite systems of points and lines in which each point touches equally many lines and each line touches equally many points. However, despite being named similarly to these configurations, the Perles configuration is not regular: most of its points touch three lines and most of its lines touch three points, but there is one line of four points and one point on four lines. In this respect it differs from the Pappus configuration, which also has nine points and nine lines, but with three points on every line and three lines through every point.


Notes


References

* * * *{{citation , last = Ziegler , first = Günter M. , author-link = Günter M. Ziegler , doi = 10.1007/BF02985377 , issue = 3 , journal = The Mathematical Intelligencer , mr = 2437198 , pages = 36–42 , title = Nonrational configurations, polytopes, and surfaces , volume = 30 , year = 2008, arxiv = 0710.4453 Configurations (geometry) Polyhedral combinatorics