ArticlePublisher preview available

Trisecting the Nine-Vertex Complex Projective Plane

Authors:
To read the full-text of this research, you can request a copy directly from the author.

Figures

This content is subject to copyright. Terms and conditions apply.
Vol.:(0123456789)
The Mathematical Intelligencer © The Author(s), under exclusive licence to Springer Science+Business
Media, LLC, part of Springer Nature 2022
https://doi.org/10.1007/s00283-022-10214-w
359
Trisecting theNine‑Vertex Complex
Projective Plane RichardEvanSchwartz
A
k-simplex is a k-dimensional convex polytope
with
k+1
vertices. For
k=0, 1, 2, 3
, a
k-simplex is usually called respectively a
vertex, edge, triangle, tetrahedron. When k
is not important, a k-simplex is just called a
simplex.
A simplicial complex is a nite collection
C
of simplices,
all in an ambient Euclidean space, such that
If
SC
and
S
is a subsimplex of S, then
SC
.
If
S,TC
, then
ST
is either empty or in
C
.
Informally, the simplices in a simplicial complex t together
cleanly, without crashing through each other. The support
of
C
is the union of all the simplices in
C
. Often we blur
the distinction between
C
and
and think of a simplicial
complex as a union of simplices.
A simplicial complex may be described with no mention
of the ambient space containing it, but there is always the
understanding that in principle, one can nd an isomor-
phic complex in some Euclidean space. To give a pertinent
example, let
RP2
6
be the quotient of the regular icosahe-
dron by the antipodal map. This simplicial complex has 6
vertices, 15 edges, and 10 faces. One can reconstruct
RP2
6
in
5
by xing some 5-simplex
Σ5
, the convex hull of
vertices
v1,,v6
, then mapping vertex k of
RP2
6
to
vk
and
extending linearly.
The left side of Figure1 shows another incarnation of
RP2
6
. In this picture, the outer edges of the hexagon are sup-
posed to be identied according to the labels. The complex
RP2
6
is called a six-vertex triangulation of the real projective
plane
RP2
because its support is homeomorphic to
RP2
.
This triangulation has the fewest number of vertices among
triangulations of
RP2
, so it is called a minimal triangulation
of
RP2
. It is, in fact, the unique minimal triangulation of
RP2
. (Smaller examples such as the quotient of the regu-
lar octahedron by the antipodal map fail to be simplicial
complexes.)
Here are some other examples related to minimal
triangulations.
The boundary of a tetrahedron is the unique four-vertex
minimal triangulation of the 2-sphere. More generally, the
boundary of a
(k+1)
-simplex is the unique minimal trian-
gulation of the k-sphere.
If you identify the opposite sides of the big hexagon on
the right side of Figure1, you get the unique minimal tri-
angulation
T2
7
of the 2-torus. It has 14 triangles, 21 edges,
and 7 vertices.
In 1980, Wofgang Kühnel discovered
CP2
9
, the unique
nine-vertex minimal triangulation of the complex pro-
jective plane
CP2
. This triangulation has 36 4-simplices
and a symmetry group of order 54.
In 1992, Ulrich Brehm and Wolfgang Kühnel [4] dened
HP2
15
(and two variants), a 15-vertex simplicial complex
with 490 8-simplices. In 2019, Denis Gorodkov [6] proved
that
HP15
and the variants are PL homeomorphic to the
quaternionic projective plane
HP2
.
So far, it an open question whether there is a 27-vertex
triangulation of
OP2
, the octonionic (aka Cayley) projec-
tive plane.
The minimal triangulations of
RP3
and
RP4
have respec-
tively 11 and 16 vertices. See [5].
In 2021, Karim Adiprasito, Sergey Avvakumov, and
Roman Karasev [1] proved that real projective space
can be triangulated using a subexponential number of
simplices.
The survey article [5] by Basudeb Datta has a wealth of
information about minimal triangulations up to the year
2007 and a large number of references.
The subject of this paper is
CP9
2
. In [7], Wolfgang Kühnel
and Thomas F. Bancho establish many interesting proper-
ties of
CP2
9
and give a rather intricate proof that
CP2
9
really is
homeomorphic to
CP2
. Since [7], there has been a lot of work
done trying to understand
CP2
9
from various points of view.
In particular, there are a number of proofs that
CP2
9
CP
2
,
and also a number of proofs that
CP2
9
is the only minimal
triangulation of
CP2
. See the article by Bernard Morin and
Figure1.
RP2
6
(left) and
T2
7
(right).
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
Article
This survey explains the origin and the further development of the Heawood inequalities, the Heawood number, and generalizations to higher dimensions with results and further conjectures.
Article
Full-text available
In 1992, Brehm and Kühnel constructed an 8-dimensional simplicial complex M158M^8_{15} with 15 vertices as a candidate to be a minimal triangulation of the quaternionic projective plane. They managed to prove that it is a manifold “like a projective plane” in the sense of Eells and Kuiper. However, it was not known until now if this complex is PL homeomorphic (or at least homeomorphic) to HP2{\mathbb {H}}P^2. This problem was reduced to the computation of the first rational Pontryagin class of this combinatorial manifold. Realizing an algorithm due to Gaifullin, we compute the first Pontryagin class of M158M^8_{15}. As a result, we obtain that it is indeed a minimal triangulation of HP2{\mathbb {H}}P^2.
Article
Full-text available
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a given pl manifold. (ii) Given positive integers n and d, construction of n-vertex triangulations of different d-dimensional pl manifolds. (iii) Classifications of all the triangulations of a given pl manifold with same number of vertices. In Section 1, we have given all the definitions which are required for the remaining part of this article. In Section 2, we have presented a very brief history of triangulations of manifolds. In Section 3, we have presented examples of several vertex-minimal triangulations. In Section 4, we have presented some interesting results on triangulations of manifolds. In particular, we have stated the Lower Bound Theorem and the Upper Bound Theorem. In Section 5, we have stated several results on minimal triangulations without proofs. Proofs are available in the references mentioned there.
Article
We break the exponential barrier for triangulations of the real projective space, constructing a trianglation of ℝPn with e(12+o(1))nlogn{e^{\left({{1 \over 2} + o(1)} \right)\sqrt n \log n}} vertices.
Article
We introduce the notion of amicable partitions for combinatorial manifolds with complementarity. We prove that any 4-dimensional combinatorial manifold X 4 9 satisfying complementarity has an amicable partition and any amicable partition determines X 4 9 up to isomorphism. This gives a short proof of the uniqueness of Kuhnel's 9-vertex complex projec- tive plane.
Article
Starting with the well-known 7-vertex triangulation of the ordinary torus, we construct a 10-vertex triangulation of P2 which fits the equilibrium decomposition of P2 in the simplest possible way. By suitable positioning of the vertices, the full automorphism group of order 42 is realized by a discrete group of isometries in the Fubini-Study metric. A slight subdivision leads to an elementary proof of the theorem of Kuiper-Massey which says that P2 modulo conjugation is PL homeomorphic to the standard 4-sphere. The branch locus of this identification is a 7-vertex triangulation P 2 7 of the real projective plane. We also determine all tight simplicial embeddings of P 2 10 and P 2 7 .
Article
In the early days of topology, most of the objects of interest were defined in terms of triangulations, describing a topological space as a union of finitely many vertices, edges, triangles, and higher dimensional simplexes identified in certain ways along their boundaries. A triangulation with a relatively small number of simplexes, symmetrically placed, could make computations easier and suggest new properties of the object itself. Although subsequent approaches to algebraic topology have stressed other ways of defining properties of topological spaces, the discovery of a new particularly nice triangulation of an important space can once again bring out relationships that lead to new insights in different branches of mathematics. In this article we describe such a triangulation for one of the most significant objects in topology, the complex projective plane. In a triangulation each edge has two distinct vertices and no two vertices determine more than one edge so the minimum number of vertices in a triangulation of a circle is three. In a triangulation of a surface or surface-with-boundary, each triangle has three distinct vertices and no three vertices determine more than one triangle. Moreover, at most two triangles come together at every edge. Since a cylinder has two edge curves a minimal triangulation requires at least six vertices and we can present a triangulation with precisely six vertices. On the other hand, it is possible to give a triangulation of the M6bius band with only five vertices (Figure 1, on next page) so in a sense the twist in the band makes it possible to triangulate using fewer vertices than in the case of the untwisted cylindrical band. The boundary of the M6bius band is a pentagon and every vertex is connected to every other vertex. By adding a cone over the pentagon from a sixth point we obtain a surface without boundary called the real projective plane with six vertices, fifteen edges (connecting all distinct pairs of vertices) and ten triangles. We denote this special triangulation by RP 2. It can be described by taking the icosahedral triangulation of the 2-sphere and then identifying opposite vertices, edges and faces. This triangulation RP 2 has numerous special properties. Although it is not possible to construct any nonself-intersecting real projective plane in ordinary Euclidean 3-space, we can construct a one-to-one mapping of RP 2 into Euclidean 4-space by first building a