Math 2.0

Convex and discrete geometry Definition

Abstract polytope

Builds on Partial orderGraded posetConvex polytope

Definition

Let n≥−1n \ge -1 be an integer and let (𝒫,≤)(\mathcal{P}, \le) be a partially ordered set, whose elements are called faces. A flag of 𝒫\mathcal{P} is a maximal totally ordered subset. Two flags are adjacent if they differ in exactly one face. 𝒫\mathcal{P} is an abstract polytope of rank nn if:

  1. 𝒫\mathcal{P} has a least face F−1F_{-1} and a greatest face FnF_n;
  2. every flag of 𝒫\mathcal{P} has exactly n+2n + 2 faces;
  3. 𝒫\mathcal{P} is strongly flag-connected: any two flags Φ\Phi and Ψ\Psi are joined by flags Φ=Φ0,Φ1,…,Φk=Ψ\Phi = \Phi_0, \Phi_1, \dots, \Phi_k = \Psi. Here each Φi−1\Phi_{i-1} is adjacent to Φi\Phi_i, and Φ∩Ψ⊆Φi\Phi \cap \Psi \subseteq \Phi_i for each ii;
  4. the diamond condition holds: if F<GF < G are faces whose ranks differ by 22, then there are exactly two faces HH with F<H<GF < H < G.

Remarks

Conditions 1 and 2 make 𝒫\mathcal{P} a graded poset with ranks −1,0,…,n-1, 0, \dots, n. Faces of rank 00 are vertices, faces of rank 11 are edges, and faces of rank n−1n - 1 are facets.

Example: the faces of a triangle with vertices a,b,ca, b, c, together with ∅\varnothing as F−1F_{-1} and the triangle TT as F2F_2, ordered by inclusion, form an abstract polytope of rank 22. Every flag has the form ∅<a<ab<T\varnothing < a < ab < T, with 4=2+24 = 2 + 2 faces. Between ∅\varnothing and an edge there are exactly two vertices, and between a vertex and TT there are exactly two edges, so the diamond condition holds. More generally, the faces of any convex polytope of dimension nn, with ∅\varnothing added, form an abstract polytope of rank nn.

Non-example: take two triangles that share one vertex cc, with all their vertices and edges, a least face, and one greatest face of rank 22. The vertex cc lies on four edges, so between cc and the greatest face there are four faces of rank 11, and the diamond condition fails.

The hemicube is obtained from the cube by identifying antipodal faces. It is an abstract polytope of rank 33 with 44 vertices, 66 edges and 33 square faces, and it is not the face lattice of any convex polytope.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex polytope concept
  2. Graded poset concept
  3. Partial order concept
  4. Abstract polytope definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Abstract_polytope
About this page
TagATJXGC4KCG
URIm2://ATJXGC4KCG
Kinddefinition
WritingW0 stub
MSC52B15, 51M20, 06A07
DefinesAbstract polytope
UsesPartial order, Graded poset, Convex polytope

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.