An abstract polytope is a combinatorial structure (as opposed to an inherently geometric structure) that encodes the incidences between elements in a polytope. It circumvents many of the issues that often arise when trying to define polytopes, such as the definition of their interior, or whether any of the many degenerate cases are to be considered, by completely forgoing any consideration of space and treating polytopes in purely structural terms.
In the context of abstract polytopes, "ordinary" geometrical polytopes can be treated as concrete polytopes. Any concrete polytope with the same incidence relations as a given abstract polytope is called a realization of it. Abstract polytopes may have none or many representations with any desired properties, be it regularity, uniformity, planarity, or any others.
The study of abstract polytopes is useful because it allows for much simpler formal treatment of a wide variety of shapes. Many constructions, like vertex figures, pyramid products, or antiprisms that are tricky to define in geometric terms, can be very easily stated in terms of abstract polytopes. Any of these constructions can then be made concrete if we have a mapping from the vertices of the abstract polytope into points in a space. All other elements will be automatically defined, which allows us to consider conditions such as planarity as secondary.
General terminology[edit | edit source]
Before we define an abstract polytope, we need to define some more general mathematically terminology.
Partially ordered sets[edit | edit source]
If we use to denote the relation of a poset, we may define , and in the usual ways.
If either or , the elements are said to be comparable. Note that there's no requirement that all pairs of elements are comparable, hence the name "partial". If this condition were to hold, the order might be called total.
If and there exists no such that , then is said to cover .
Bounded posets[edit | edit source]
An element in a poset is said to be minimal if for any . Likewise, is said to be maximal if for any . If a poset has a minimal or maximal element, they must be unique. A poset with both a minimal and maximal element is said to be bounded. In the context of abstract polytopes, these two elements are called the improper elements. All other elements are the proper ones.
Chains and flags[edit | edit source]
A chain of a poset is any subset such that forms a total order. That is, any two elements of the chain may be compared. Often chains may be extended by adding elements to them. If a chain can't be extended, it's called a maximal chain or flag.
A poset is called ranked or pure if all flags have the same size. Any such poset can be given a rank function such that for any ,
- If , then . (Monotonicity)
- If covers , then .
Rank functions are unique up to a constant. By convention, when talking about abstract polytopes, we set the rank function of a bounded ranked poset such that the rank of the minimal element is −1.
If two flags differ in exactly one element of rank j, they are said to be j-adjacent.
Sections[edit | edit source]
A section of a partially ordered set (called an interval in more general mathematical contexts) is the set of elements between two others. In the context of abstract polytopes, a section between and may be denoted as , so that
Any section of a ranked poset is ranked, and so may be given a rank too.
Connectivity[edit | edit source]
A bounded poset is said to be connected if it is rank 1 or if for any two proper elements and , there exists a sequence of proper elements such that , , and any are comparable. The special concession that rank 1 polytopes are connected ensures that the dyad is connected and thus an abstract polytope.
A bounded ranked poset is said to be strongly connected if every section is connected.
Diamond property[edit | edit source]
A poset is said to satisfy the diamond property whenever any section of rank 1 has exactly four elements. This is so called because the Hasse diagram (see below) of this section looks like a diamond or rhombus.
Definition[edit | edit source]
An abstract polytope is defined as a poset that's bounded, ranked, strongly connected, and satisfies the diamond condition. In what follows, we justify and contextualize this definition.
The elements of the abstract polytope represent elements of all "dimensions". Rank 0 elements are vertices, rank 1 elements are edges, rank 2 elements are faces, and so on. The relation may be read as " is contained in ".
The bounded condition is mostly a technicality that makes some definitions and results slightly cleaner. See the article improper element for a discussion of this condition.
The ranked condition makes it so that we can't "skip through dimensions". For instance, there can't be a vertex in a face without being edges that connect both. Moreover, the rank function makes it possible to talk of the "dimension" of an element without a reference to any particular space.
The strong connectivity condition serves to exclude compounds. This is almost universally adopted within the general mathematical community, for two reasons:
- Many elementary results on polytopes, specifically regular polytopes, hold only when this condition is enforced.
- Compound polytopes may be studied just by looking at their connected components.
Within this wiki, this condition is often relaxed or removed altogether.
The diamond property is the main property that sets polytopes apart from other more general structures. It generalizes the pattern "two edges join at a vertex in a polygon, two faces join at an edge in a polyhedron, two cells join at a face in a polychoron..." As another immediate consequence of this property, any edge has exactly two vertices.
Hasse diagrams[edit | edit source]
The Hasse diagram of a partial order is a directed graph that serves as a useful graphical notation. Elements of the poset are drawn as nodes in the graph, and elements that are related in the partial order are connected by an edge, so that the smallest element goes below the largest. To reduce clutter, only direct relations are drawn, so that if a ≤ b ≤ c, the edge between a and c will be omitted.
Since abstract polytopes are partial orders, they also have Hasse diagrams. In their specific case, the nodes are usually grouped by rank. A node will only be connected to elements of the next and the previous rank. For example, a polygonal ("face") element will be linked to several dyad elements (its edges) as well as whatever cells it is a face of, and a dyad ("edge") element will be linked to two point elements as well as whatever faces it is an edge of. Connections only go from d-elements down to (d−1)-elements, where d is any integer between 0 and the rank of P.
The Hasse diagram of a polytope is not to be confused with the abstract polytope itself. For instance, the Hasse diagram to the right has a tesseractic skeleton, but actually represents a tetrahedron.
Abstract regular polytope[edit | edit source]
An abstract polytope is regular if it meets the criteria of a regular polytope. Not every abstract regular polytope has a regular realization. For example, there is an infinite family of abstract polytopes that are the comb products of polygons and represent looped portions of the square tiling. They can be realized as non-regular toroids in 3-space or as regular skew polyhedra in 4-space (where they are made of the square faces of duoprisms).
The uniform polyhedra the dodecadodecahedron and ditrigonary dodecadodecahedron as well as their duals the medial rhombic triacontahedron and medial triambic icosahedron are regular when seen as abstract polytopes. There this simply is because an abstract polytope does not distinguish between those 5-fold elements with different geometric realizations, the convex regular pentagons and the regular pentagrams. Along with the ditrigonal icosahedron and some stephanoids, they are called the regular polyhedra of index 2 (where the fully regular polyhedra are of index 1). There are higher indexes that include more polyhedra.
See also[edit | edit source]
- Wikipedia Contributors. "Abstract polytope".