Dual polyhedron¶

In geometry, every polyhedron is associated with a second dual structure, wherein 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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9082
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Polyhedral Geometry → Mathematics

Core Idea¶

Dual polyhedron is treated here as the recurring polyhedral geometry identity summarized by this source-grounded definition: In geometry, every polyhedron is associated with a second dual structure, wherein 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. In geometry, every polyhedron is associated with a second dual structure, wherein the vertices of one correspond to the faces of the other and the edges between pairs of vertices of one correspond to the edges.

How would you explain it like I'm…

Faces Become Corners

Take a cube and put a dot in the middle of each of its six flat sides. Connect dots on sides that touch, and you get a new shape with points where the cube had flat sides. That new shape is the cube's dual. Every corner of one shape matches a flat side of the other.

Swapping Faces and Corners

Every polyhedron, a 3D shape with flat faces, has a partner shape called its dual. In the dual, each face of the first shape becomes a corner, and each corner becomes a face. Whenever two faces meet at an edge in the original, the matching corners are joined by an edge in the dual. If you take the dual of the dual, you get back the shape you started with. For example, the cube and the octahedron are partners, and the tetrahedron is its own partner.

Vertex–Face Duality of Solids

A dual polyhedron is a partner structure where the vertices of one correspond to the faces of the other, and edges between vertices in one correspond to edges between faces in the other. Taking the dual twice returns the original polyhedron. Duality preserves symmetry, so polyhedra defined by symmetry have duals in a matching symmetry class. For example, the Platonic solids form dual pairs (cube with octahedron, dodecahedron with icosahedron), and the regular tetrahedron is self-dual. The same holds for the star-shaped Kepler–Poinsot polyhedra. One subtlety: every polyhedron has a dual as a combinatorial or abstract structure, but not every such dual can actually be built as a geometric solid.

A dual polyhedron is the structure associated with a given polyhedron by exchanging vertices and faces: each vertex of one corresponds to a face of the other, and each edge joining two vertices of one corresponds to an edge between two faces of the other, so incidence relations are reversed. The operation is an involution, since the dual of the dual is the original. The dual always exists as a combinatorial or abstract polyhedron, but not every such dual can be realized as a geometric polyhedron. Duality preserves symmetry, so for many classes defined by symmetry the duals fall into a corresponding class. The regular polyhedra illustrate this: the convex Platonic solids and the star Kepler-Poinsot polyhedra form dual pairs, with the regular tetrahedron self-dual. The defining requirement is the vertex-face and edge-edge correspondence, not merely a visual resemblance or a shape built by some other construction.

Scope of Application¶

Polar reciprocation. Typically when no sphere is specified in the construction of the dual, then the unit sphere is used, meaning r=1 in the above definitions.
Polar reciprocation. Failing that, for a polyhedron with a circumscribed sphere, inscribed sphere, or midsphere (one with all edges as tangents), this can be used.
Kinds of duality. The kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality.
Polar reciprocation. In Euclidean space, the dual of a polyhedron P is often defined in terms of polar reciprocation about a sphere.
Polar reciprocation. When the sphere has radius r and is centered at the origin (so that it is defined by the equation x^2 + y^2 + z^2 = r^2 ), then the polar.

Clarity¶

A clear use of Dual polyhedron names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In geometry, every polyhedron is associated with a second dual structure, wherein 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.

Manages Complexity¶

Dual polyhedron compresses multiple polyhedral geometry details into a stable diagnostic relation. The source shows both the central mechanism—the graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph.—and the practical consequence—if the poset is visualized as a Hasse diagram, the dual poset can be visualized simply by turning the Hasse diagram upside down.

Abstract Reasoning¶

Type the carrier. Identify the polyhedral geometry entities to which the claim applies.
State the relation. Use the source-grounded identity: In geometry, every polyhedron is associated with a second dual structure, wherein 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.
Check operation and conditions. Every such poset has a dual poset, formed by reversing all of the order relations. 4.

Knowledge Transfer¶

Within the home domain. Knowledge about Dual polyhedron transfers literally when a new case preserves the same carrier type, relation, and recognition test. Typically when no sphere is specified in the construction of the dual, then the unit sphere is used, meaning r=1 in the above definitions. Failing that, for a polyhedron with a circumscribed sphere, inscribed sphere, or midsphere (one with all edges as tangents), this can be used. Beyond the home domain. No canonical parent is asserted for Dual polyhedron.

Relationships to Other Abstractions¶

Current abstraction Dual polyhedron Domain-specific

Parents (1) — more general patterns this builds on

Dual polyhedron is a kind of, conditional Polyhedron Domain-specific

A dual polyhedron is a polyhedron defined through reversed face-vertex incidence when a valid realization is produced.

Condition / exception A dual polyhedron is a polyhedron defined through reversed face-vertex incidence when a valid realization is produced.

Hierarchy path (1) — routes to 1 parentless root

Dual polyhedron → Polyhedron

Neighborhood in Abstraction Space¶

Dual polyhedron sits in a moderately populated region (58^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Geometric Figures & Constructions (32 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08