KNOWPIA
WELCOME TO KNOWPIA

In geometry, every polyhedron is associated with a second **dual** structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other.^{[1]} Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra.^{[2]} Starting with any given polyhedron, the dual of its dual is the original polyhedron.

Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a corresponding symmetry class. For example, the regular polyhedra – the (convex) Platonic solids and (star) Kepler–Poinsot polyhedra – form dual pairs, where the regular tetrahedron is self-dual. The dual of an isogonal polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an isohedral polyhedron (one in which any two faces are equivalent [...]), and vice versa. The dual of an isotoxal polyhedron (one in which any two edges are equivalent [...]) is also isotoxal.

Duality is closely related to *polar reciprocity*, a geometric transformation that, when applied to a convex polyhedron, realizes the dual polyhedron as another convex polyhedron.

There are many kinds of duality. The kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality.

In Euclidean space, the dual of a polyhedron is often defined in terms of polar reciprocation about a sphere. Here, each vertex (pole) is associated with a face plane (polar plane or just polar) so that the ray from the center to the vertex is perpendicular to the plane, and the product of the distances from the center to each is equal to the square of the radius.^{[3]}

When the sphere has radius and is centered at the origin (so that it is defined by the equation ), then the polar dual of a convex polyhedron is defined as

for all in

where denotes the standard dot product of and .

Typically when no sphere is specified in the construction of the dual, then the unit sphere is used, meaning in the above definitions.^{[4]}

For each face plane of described by the linear equation the corresponding vertex of the dual polyhedron will have coordinates . Similarly, each vertex of corresponds to a face plane of , and each edge line of corresponds to an edge line of . The correspondence between the vertices, edges, and faces of and reverses inclusion. For example, if an edge of contains a vertex, the corresponding edge of will be contained in the corresponding face.

For a polyhedron with a center of symmetry, it is common to use a sphere centered on this point, as in the Dorman Luke construction (mentioned below). Failing that, for a polyhedron with a circumscribed sphere, inscribed sphere, or midsphere (one with all edges as tangents), this can be used. However, it is possible to reciprocate a polyhedron about any sphere, and the resulting form of the dual will depend on the size and position of the sphere; as the sphere is varied, so too is the dual form. The choice of center for the sphere is sufficient to define the dual up to similarity.

If a polyhedron in Euclidean space has a face plane, edge line, or vertex lying on the center of the sphere, the corresponding element of its dual will go to infinity. Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required 'plane at infinity'. Some theorists prefer to stick to Euclidean space and say that there is no dual. Meanwhile, Wenninger (1983) found a way to represent these infinite duals, in a manner suitable for making models (of some finite portion).

The concept of *duality* here is closely related to the duality in projective geometry, where lines and edges are interchanged. Projective polarity works well enough for convex polyhedra. But for non-convex figures such as star polyhedra, when we seek to rigorously define this form of polyhedral duality in terms of projective polarity, various problems appear.^{[5]}
Because of the definitional issues for geometric duality of non-convex polyhedra, Grünbaum (2007) argues that any proper definition of a non-convex polyhedron should include a notion of a dual polyhedron.

Any convex polyhedron can be distorted into a canonical form, in which a unit midsphere (or intersphere) exists tangent to every edge, and such that the average position of the points of tangency is the center of the sphere. This form is unique up to congruences.

If we reciprocate such a canonical polyhedron about its midsphere, the dual polyhedron will share the same edge-tangency points, and thus will also be canonical. It is the canonical dual, and the two together form a canonical dual compound.^{[6]}

For a uniform polyhedron, each face of the dual polyhedron may be derived from the original polyhedron's corresponding vertex figure by using the Dorman Luke construction.^{[7]}

Even when a pair of polyhedra cannot be obtained by reciprocation from each other, they may be called duals of each other as long as the vertices of one correspond to the faces of the other, and the edges of one correspond to the edges of the other, in an incidence-preserving way. Such pairs of polyhedra are still topologically or abstractly dual.

The vertices and edges of a convex polyhedron form a graph (the 1-skeleton of the polyhedron), embedded on the surface of the polyhedron (a topological sphere). This graph can be projected to form a Schlegel diagram on a flat plane. The graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph.

More generally, for any polyhedron whose faces form a closed surface, the vertices and edges of the polyhedron form a graph embedded on this surface, and the vertices and edges of the (abstract) dual polyhedron form the dual graph of the original graph.

An abstract polyhedron is a certain kind of partially ordered set (poset) of elements, such that incidences, or connections, between elements of the set correspond to incidences between elements (faces, edges, vertices) of a polyhedron. Every such poset has a dual poset, formed by reversing all of the order relations. If the poset is visualized as a Hasse diagram, the dual poset can be visualized simply by turning the Hasse diagram upside down.

Every geometric polyhedron corresponds to an abstract polyhedron in this way, and has an abstract dual polyhedron. However, for some types of non-convex geometric polyhedra, the dual polyhedra may not be realizable geometrically.

Topologically, a polyhedron is said to be **self-dual** if its dual has exactly the same connectivity between vertices, edges, and faces. Abstractly, they have the same Hasse diagram. Geometrically, it is not only topologically self-dual, but its polar reciprocal about a certain point, typically its centroid, is a similar figure. For example, the dual of a regular tetrahedron is another regular tetrahedron, reflected through the origin.

Every polygon is topologically self-dual, since it has the same number of vertices as edges, and these are switched by duality. But it is not necessarily self-dual (up to rigid motion, for instance). Every polygon has a regular form which is geometrically self-dual about its intersphere: all angles are congruent, as are all edges, so under duality these congruences swap. Similarly, every topologically self-dual convex polyhedron can be realized by an equivalent geometrically self-dual polyhedron, its canonical polyhedron, reciprocal about the center of the midsphere.

There are infinitely many geometrically self-dual polyhedra. The simplest infinite family is the pyramids.^{[8]} Another infinite family, elongated pyramids, consists of polyhedra that can be roughly described as a pyramid sitting on top of a prism (with the same number of sides). Adding a frustum (pyramid with the top cut off) below the prism generates another infinite family, and so on. There are many other convex self-dual polyhedra. For example, there are 6 different ones with 7 vertices and 16 with 8 vertices.^{[9]}

A self-dual non-convex icosahedron with hexagonal faces was identified by Brückner in 1900.^{[10]}^{[11]}^{[12]} Other non-convex self-dual polyhedra have been found, under certain definitions of non-convex polyhedra and their duals.

Duality can be generalized to *n*-dimensional space and **dual polytopes;** in two dimension these are called dual polygons.

The vertices of one polytope correspond to the (*n* − 1)-dimensional elements, or facets, of the other, and the *j* points that define a (*j* − 1)-dimensional element will correspond to *j* hyperplanes that intersect to give a (*n* − *j*)-dimensional element. The dual of an *n*-dimensional tessellation or honeycomb can be defined similarly.

In general, the facets of a polytope's dual will be the topological duals of the polytope's vertex figures. For the polar reciprocals of the regular and uniform polytopes, the dual facets will be polar reciprocals of the original's vertex figure. For example, in four dimensions, the vertex figure of the 600-cell is the icosahedron; the dual of the 600-cell is the 120-cell, whose facets are dodecahedra, which are the dual of the icosahedron.

The primary class of self-dual polytopes are regular polytopes with palindromic Schläfli symbols. All regular polygons, {a} are self-dual, polyhedra of the form {a,a}, 4-polytopes of the form {a,b,a}, 5-polytopes of the form {a,b,b,a}, etc.

The self-dual regular polytopes are:

- All regular polygons, {a}.
- Regular tetrahedron: {3,3}
- In general, all regular
*n*-simplexes, {3,3,...,3} - The regular 24-cell in 4 dimensions, {3,4,3}.
- The great 120-cell {5,5/2,5} and the grand stellated 120-cell {5/2,5,5/2}

The self-dual (infinite) regular Euclidean honeycombs are:

- Apeirogon: {∞}
- Square tiling: {4,4}
- Cubic honeycomb: {4,3,4}
- In general, all regular
*n*-dimensional Euclidean hypercubic honeycombs: {4,3,...,3,4}.

The self-dual (infinite) regular hyperbolic honeycombs are:

**^**Wenninger (1983), "Basic notions about stellation and duality", p. 1.**^**Grünbaum (2003)**^**Cundy & Rollett (1961), 3.2 Duality, pp. 78–79; Wenninger (1983), Pages 3-5. (Note, Wenninger's discussion includes nonconvex polyhedra.)**^**Barvinok (2002), Page 143.**^**See for example Grünbaum & Shephard (2013), and Gailiunas & Sharp (2005). Wenninger (1983) also discusses some issues on the way to deriving his infinite duals.**^**Grünbaum (2007), Theorem 3.1, p. 449.**^**Cundy & Rollett (1961), p. 117; Wenninger (1983), p. 30.**^**Wohlleben, Eva (2019), "Duality in Non-Polyhedral Bodies Part I: Polyliner", in Cocchiarella, Luigi (ed.),*ICGG 2018 - Proceedings of the 18th International Conference on Geometry and Graphics: 40th Anniversary - Milan, Italy, August 3-7, 2018*, Advances in Intelligent Systems and Computing, vol. 809, Springer, p. 485–486, doi:10.1007/978-3-319-95588-9, ISBN 978-3-319-95588-9**^**3D Java models at Symmetries of Canonical Self-Dual Polyhedra, based on paper by Gunnar Brinkmann, Brendan D. McKay,*Fast generation of planar graphs*PDF [1]**^**Anthony M. Cutler and Egon Schulte; "Regular Polyhedra of Index Two", I;*Beiträge zur Algebra und Geometrie*/*Contributions to Algebra and Geometry*April 2011, Volume 52, Issue 1, pp 133–161.**^**N. J. Bridge; "Faceting the Dodecahedron",*Acta Crystallographica*, Vol. A 30, Part 4 July 1974, Fig. 3c and accompanying text.**^**Brückner, M.;*Vielecke und Vielflache: Theorie und Geschichte*, Teubner, Leipzig, 1900.

- Cundy, H. Martyn; Rollett, A. P. (1961),
*Mathematical Models*(2nd ed.), Oxford: Clarendon Press, MR 0124167. - Gailiunas, P.; Sharp, J. (2005), "Duality of polyhedra",
*International Journal of Mathematical Education in Science and Technology*,**36**(6): 617–642, doi:10.1080/00207390500064049, S2CID 120818796. - Grünbaum, Branko (2003), "Are your polyhedra the same as my polyhedra?", in Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.),
*Discrete and Computational Geometry: The Goodman–Pollack Festschrift*, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102.755, doi:10.1007/978-3-642-55566-4_21, ISBN 978-3-642-62442-1, MR 2038487. - Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs",
*Discrete Mathematics*,**307**(3–5): 445–463, doi:10.1016/j.disc.2005.09.037, hdl:1773/2276, MR 2287486. - Grünbaum, Branko; Shephard, G. C. (2013), "Duality of polyhedra", in Senechal, Marjorie (ed.),
*Shaping Space: Exploring polyhedra in nature, art, and the geometrical imagination*, New York: Springer, pp. 211–216, doi:10.1007/978-0-387-92714-5_15, ISBN 978-0-387-92713-8, MR 3077226. - Wenninger, Magnus (1983),
*Dual Models*, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208. - Barvinok, Alexander (2002),
*A course in convexity*, Providence: American Mathematical Soc., ISBN 0821829688.

- Weisstein, Eric W., "Dual polyhedron",
*MathWorld* - Weisstein, Eric W., "Dual tessellation",
*MathWorld* - Weisstein, Eric W., "Self-dual polyhedron",
*MathWorld*