Editing Dual polyhedron

{{Short description|Polyhedron associated with another by swapping vertices for faces}}
[[File:Polyhedron pair 6-8.png|thumb|right|upright=1.35|The dual of a [[cube]] is an [[octahedron]]. Vertices of one correspond to faces of the other, and edges correspond to each other.]]

In [[geometry]], every [[polyhedron]] is associated with a second '''dual''' structure, where the [[Vertex (geometry)|vertices]] of one correspond to the [[Face (geometry)|faces]] of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other.<ref>{{harvtxt|Wenninger|1983}}, "Basic notions about stellation and duality", p.&nbsp;1.</ref> Such dual figures remain combinatorial or [[Abstract polytope|abstract polyhedra]], but not all can also be constructed as geometric polyhedra.<ref>{{harvtxt|Grünbaum|2003}}</ref> Starting with any given polyhedron, the dual of its dual is the original polyhedron.

Duality preserves the [[Symmetry|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{{snd}}the (convex) [[Platonic solid]]s and (star) [[Kepler–Poinsot polyhedra]]{{snd}}form dual pairs, where the regular [[tetrahedron]] is [[#Self-dual polyhedra|self-dual]]. The dual of an [[Isogonal figure|isogonal]] polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an [[Isohedral figure|isohedral]] polyhedron (one in which any two faces are equivalent [...]), and vice versa. The dual of an [[Isotoxal figure|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.

==Kinds of duality==
[[File:Ioanniskepplerih00kepl 0271 crop.jpg|thumb|400px|The dual of a [[Platonic solid]] can be constructed by connecting the face centers. In general this creates only a [[#Topological duality|topological dual]].<br>Images from [[Kepler]]'s [[Harmonices Mundi]] (1619)]]

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

===Polar reciprocation===
{{See also|Polar reciprocation}}

In [[Euclidean space]], the dual of a polyhedron <math>P</math> 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.<ref>{{harvtxt|Cundy|Rollett|1961}}, 3.2 Duality, pp.&nbsp;78–79; {{harvtxt|Wenninger|1983}}, Pages 3-5. (Note, Wenninger's discussion includes nonconvex polyhedra.)</ref>

When the sphere has radius <math>r</math> and is centered at the origin (so that it is defined by the equation <math>x^2 + y^2 + z^2 = r^2</math>), then the polar dual of a convex polyhedron <math>P</math> is defined as
{{Block indent|left=1.6|<math>P^\circ = \{ q~\big|~q \cdot p \leq r^2</math> for all <math>p</math> in <math>P \} ,</math>}}
where <math>q \cdot p</math> denotes the standard [[dot product]] of <math>q</math> and <math>p</math>.

Typically when no sphere is specified in the construction of the dual, then the unit sphere is used, meaning <math>r=1</math> in the above definitions.<ref>{{harvtxt|Barvinok|2002}}, Page 143.</ref>

For each face plane of <math>P</math> described by the linear equation
<math display=block>x_0x + y_0y + z_0z = r^2,</math>
the corresponding vertex of the dual polyhedron <math>P^\circ</math> will have coordinates <math>(x_0,y_0,z_0)</math>. Similarly, each vertex of <math>P</math> corresponds to a face plane of <math>P^\circ</math>, and each edge line of <math>P</math> corresponds to an edge line of <math>P^\circ</math>. The correspondence between the vertices, edges, and faces of <math>P</math> and <math>P^\circ</math> reverses inclusion. For example, if an edge of <math>P</math> contains a vertex, the corresponding edge of <math>P^\circ</math> 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 [[Dual uniform polyhedron#Dorman Luke construction|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, {{harvtxt|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 (projective geometry)|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.<ref>See for example {{harvtxt|Grünbaum|Shephard|2013}}, and {{harvtxt|Gailiunas|Sharp|2005}}. {{harvtxt|Wenninger|1983}} also discusses some issues on the way to deriving his infinite duals.</ref>
Because of the definitional issues for geometric duality of non-convex polyhedra, {{harvtxt|Grünbaum|2007}} argues that any proper definition of a non-convex polyhedron should include a notion of a dual polyhedron.

====Canonical duals====
[[File:Dual compound 6-8 max.png|thumb|Canonical [[dual compound]] of cuboctahedron (light) and rhombic dodecahedron (dark). Pairs of edges meet on their common [[midsphere]].]]

Any convex polyhedron can be distorted into a [[Canonical polyhedron|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.<ref>{{harvtxt|Grünbaum|2007}}, Theorem 3.1, p.&nbsp;449.</ref>

====Dorman Luke construction====
For a [[uniform polyhedron]], each face of the dual polyhedron may be derived from the original polyhedron's corresponding [[vertex figure]] by using the [[Uniform dual polyhedron#Dorman Luke construction|Dorman Luke construction]].<ref>{{harvtxt|Cundy|Rollett|1961}}, p.&nbsp; 117; {{harvtxt|Wenninger|1983}}, p.&nbsp;30.</ref>

===Topological duality===
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 theory|graph]] (the [[n-skeleton|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 polytope|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.

==Self-dual polyhedra==
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, [[reflection through the origin|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 polygon|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 [[Pyramid (geometry)|pyramids]].<ref name="wohlleben">{{citation
 | last = Wohlleben | first = Eva
 | editor-last = Cocchiarella | editor-first = Luigi
 | year = 2019
 | contribution = Duality in Non-Polyhedral Bodies Part I: Polyliner
 | title = ICGG 2018 - Proceedings of the 18th International Conference on Geometry and Graphics: 40th Anniversary - Milan, Italy, August 3-7, 2018
 | series = Advances in Intelligent Systems and Computing
 | volume = 809
 | url = https://books.google.com/books?id=rEpjDwAAQBAJ&pg=PA485
 | publisher = Springer
 | page = 485&ndash;486
 | isbn = 978-3-319-95588-9
 | doi = 10.1007/978-3-319-95588-9
}}</ref> Another infinite family, [[elongated pyramid]]s, consists of polyhedra that can be roughly described as a pyramid sitting on top of a [[prism (geometry)|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.<ref>3D [[Java (programming language)|Java]] models at [http://dmccooey.com/polyhedra/SymmetricSelfDuals.html Symmetries of Canonical Self-Dual Polyhedra], based on paper by Gunnar Brinkmann, Brendan D. McKay, ''Fast generation of planar graphs'' [[PDF]] [http://cs.anu.edu.au/~bdm/papers/plantri-full.pdf]</ref>

A self-dual non-convex icosahedron with hexagonal faces was identified by Brückner in 1900.<ref>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.</ref><ref>N. J. Bridge; "Faceting the Dodecahedron", ''Acta Crystallographica'', Vol. A 30, Part 4 July 1974, Fig. 3c and accompanying text.</ref><ref>Brückner, M.; ''Vielecke und Vielflache: Theorie und Geschichte'', Teubner, Leipzig, 1900.</ref> Other non-convex self-dual polyhedra have been found, under certain definitions of non-convex polyhedra and their duals.

==Dual polytopes and tessellations==
Duality can be generalized to ''n''-dimensional space and '''dual [[polytope]]s;''' in two dimensions these are called [[dual polygon]]s.

The vertices of one polytope correspond to the (''n'' &minus; 1)-dimensional elements, or facets, of the other, and the ''j'' points that define a (''j'' &minus; 1)-dimensional element will correspond to ''j'' hyperplanes that intersect to give a (''n'' &minus; ''j'')-dimensional element. The dual of an ''n''-dimensional tessellation or [[Honeycomb (geometry)|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 polytope|regular]] and [[Uniform polytope|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 [[Regular icosahedron|icosahedron]];  the dual of the 600-cell is the [[120-cell]], whose facets are [[dodecahedron|dodecahedra]], which are the dual of the icosahedron.

===Self-dual polytopes and tessellations===
[[File:Kah 4 4.png|thumb|The [[square tiling]], {4,4}, is self-dual, as shown by these red and blue tilings]]
[[File:Infinite-order apeirogonal tiling and dual.png|thumb|The [[Infinite-order apeirogonal tiling]], {&infin;,&infin;} in red, and its dual position in blue]]
The primary class of self-dual polytopes are [[regular polytope]]s with [[palindromic]] [[Schläfli symbol]]s. All regular polygons, {a} are self-dual, [[polyhedron|polyhedra]] of the form {a,a}, [[4-polytope]]s of the form {a,b,a}, [[5-polytope]]s of the form {a,b,b,a}, etc.

The self-dual regular polytopes are:

* All [[regular polygon]]s, {a}.
* Regular [[tetrahedron]]: {3,3}
* In general, all regular ''n''-[[simplex]]es, {3,3,...,3}
* The regular [[24-cell]] in 4&nbsp;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 [[Honeycomb (geometry)|honeycombs]] are:
* [[Apeirogon]]: {&infin;}
* [[Square tiling]]: {4,4}
* [[Cubic honeycomb]]: {4,3,4}
* In general, all regular ''n''-dimensional Euclidean [[hypercubic honeycomb]]s: {4,3,...,3,4}.
The self-dual (infinite) regular [[Coxeter diagram#Hyperbolic Coxeter groups|hyperbolic]] honeycombs are:
* Compact hyperbolic tilings: [[Order-5 pentagonal tiling|{5,5}]], [[Order-6 hexagonal tiling|{6,6}]], ... {p,p}.
* Paracompact hyperbolic tiling: [[Infinite-order apeirogonal tiling|{&infin;,&infin;}]]
* Compact hyperbolic honeycombs: [[Icosahedral honeycomb|{3,5,3}]], [[Order-5 dodecahedral honeycomb|{5,3,5}]], and [[Order-5 120-cell honeycomb|{5,3,3,5}]]
* Paracompact hyperbolic honeycombs: [[Triangular tiling honeycomb|{3,6,3}]], [[Order-6 hexagonal tiling honeycomb|{6,3,6}]], [[Order-4 square tiling honeycomb|{4,4,4}]], and [[16-cell honeycomb honeycomb|{3,3,4,3,3}]]

==See also==
* [[Conway polyhedron notation]]
* [[Dual polygon]]
* [[Self-dual graph]]
* [[Self-dual polygon]]

==References==

===Notes===
{{reflist|30em}}

===Bibliography===
{{refbegin|30em}}
*{{citation
 | last1 = Cundy | first1 = H. Martyn | author1-link = Martyn Cundy
 | last2 = Rollett | first2 = A. P.
 | edition = 2nd
 | location = Oxford
 | mr = 0124167
 | publisher = Clarendon Press
 | title = Mathematical Models
 | title-link = Mathematical Models (Cundy and Rollett)
 | year = 1961}}.
*{{citation
 | last1 = Gailiunas | first1 = P.
 | last2 = Sharp | first2 = J.
 | doi = 10.1080/00207390500064049
 | issue = 6
 | journal = International Journal of Mathematical Education in Science and Technology
 | pages = 617–642
 | title = Duality of polyhedra
 | volume = 36
 | year = 2005| s2cid = 120818796
 }}.
*{{citation
 | last = Grünbaum | first = Branko | author-link = Branko Grünbaum
 | editor1-last = Aronov | editor1-first = Boris | editor1-link = Boris Aronov
 | editor2-last = Basu | editor2-first = Saugata
 | editor3-last = Pach | editor3-first = János | editor3-link = János Pach
 | editor4-last = Sharir | editor4-first = Micha | editor4-link = Micha Sharir
 | contribution = Are your polyhedra the same as my polyhedra?
 | doi = 10.1007/978-3-642-55566-4_21
 | mr = 2038487
 | pages = 461–488
 | publisher = Springer | location = Berlin
 | series = Algorithms and Combinatorics
 | title = Discrete and Computational Geometry: The Goodman–Pollack Festschrift
 | volume = 25
 | year = 2003| citeseerx = 10.1.1.102.755| isbn = 978-3-642-62442-1 }}.
*{{citation
 | last = Grünbaum | first = Branko | author-link = Branko Grünbaum
 | doi = 10.1016/j.disc.2005.09.037
 | issue = 3–5
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 2287486
 | pages = 445–463
 | title = Graphs of polyhedra; polyhedra as graphs
 | volume = 307
 | year = 2007| hdl = 1773/2276
 | hdl-access = free
 }}.
*{{citation
 | last1 = Grünbaum | first1 = Branko | author1-link = Branko Grünbaum
 | last2 = Shephard | first2 = G. C. | author2-link = Geoffrey Colin Shephard
 | editor-last = Senechal | editor-first = Marjorie | editor-link = Marjorie Senechal
 | contribution = Duality of polyhedra
 | doi = 10.1007/978-0-387-92714-5_15
 | isbn = 978-0-387-92713-8
 | mr = 3077226
 | pages = 211–216
 | publisher = Springer | location = New York
 | title = Shaping Space: Exploring polyhedra in nature, art, and the geometrical imagination
 | year = 2013}}.
*{{citation| first=Magnus | last=Wenninger | author-link=Magnus Wenninger | title=Dual Models | publisher=Cambridge University Press | year=1983 | isbn=0-521-54325-8 | mr = 0730208}}.
*{{citation
 | last1 = Barvinok | first1 = Alexander
 | isbn = 0821829688
 | publisher = American Mathematical Soc. | location = Providence
 | title = A course in convexity
 | year = 2002}}.
{{refend}}

==External links==
* {{mathworld | urlname = DualPolyhedron | title = Dual polyhedron | mode=cs2}}
* {{MathWorld|urlname=DualTessellation|title=Dual tessellation | mode=cs2}}
* {{mathworld | urlname = Self-DualPolyhedron | title = Self-dual polyhedron | mode=cs2}}

{{DEFAULTSORT:Dual Polyhedron}}
[[Category:Polyhedra]]
[[Category:Duality theories|Polyhedron]]
[[Category:Self-dual polyhedra| ]]
[[Category:Polytopes]]