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 between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. 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 polyhedrathe (convex) Platonic solids and (star) Kepler–Poinsot polyhedraform dual pairs, where the regular tetrahedron is self-dual.

For Dual polyhedron, the abstraction is narrower than the article's general subject matter: a positive case must preserve 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. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in polyhedral geometry, which is why this identity is domain-specific rather than prime.

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.

Structural Signature¶

Sig role-phrases:

Defining carrier — Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required 'plane at infinity'.
Constitutive relation — The graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph.
Operating condition — Every such poset has a dual poset, formed by reversing all of the order relations.
Recognition evidence — 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 dual of a convex polyhedron P is defined as.
Admissible variation — 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.
Characteristic consequence — If the poset is visualized as a Hasse diagram, the dual poset can be visualized simply by turning the Hasse diagram upside down.
Failure boundary — For example, the dual of a regular tetrahedron is another regular tetrahedron, reflected through the origin.

What It Is Not¶

Not the whole field of polyhedral geometry. The node requires the specific identity stated by 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.
Not an over-broad reading. However, for some types of non-convex geometric polyhedra, the dual polyhedra may not be realizable geometrically.
Not an over-broad reading. 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.
Not an over-broad reading. Geometrically, it is not only topologically self-dual, but its polar reciprocal about a certain point, typically its centroid, is a similar figure.
Not automatically Uniform polyhedron. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Dual polyhedron applies literally inside polyhedral geometry wherever the source-defined carrier and relation can be established. Its documented habitats include:

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 dual of a convex polyhedron P is defined as.
Polar reciprocation. where q \cdot p denotes the standard dot product of q and p .

Outside polyhedral geometry, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

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 other. The strongest recognition evidence in the frozen account is: 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 dual of a convex polyhedron P is defined as. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification However, for some types of non-convex geometric polyhedra, the dual polyhedra may not be realizable geometrically. so that a reader can reproduce the classification rather than infer it from topical resemblance.

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. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

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.
Demand recognition evidence. 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 dual of a convex polyhedron P is defined as.
Test variation. Change an implementation or setting while preserving 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.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

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. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

For example, if an edge of P contains a vertex, the corresponding edge of P^\circ will be contained in the corresponding face. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → 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; recognition evidence → 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 dual of a convex polyhedron P is defined as

Applied / In Practice¶

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. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Polar reciprocation; invariant → 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; boundary → the case exits the class when however, for some types of non-convex geometric polyhedra, the dual polyhedra may not be realizable geometrically

Structural Tensions¶

T1 — Stable identity versus admissible variation. However, for some types of non-convex geometric polyhedra, the dual polyhedra may not be realizable geometrically. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. 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 tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. Geometrically, it is not only topologically self-dual, but its polar reciprocal about a certain point, typically its centroid, is a similar figure. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. But it is not necessarily self-dual (up to rigid motion, for instance). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required 'plane at infinity'. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Dual polyhedron literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. The graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Dual polyhedron distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Dual polyhedron is mixed or framed-leaning. Its structural side is the repeatable organization summarized by 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. Its framed side is the polyhedral geometry vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: Every such poset has a dual poset, formed by reversing all of the order relations. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. 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. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required 'plane at infinity'. The graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph. It further constrains recognition and variation through: Every such poset has a dual poset, formed by reversing all of the order relations. 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 dual of a convex polyhedron P is defined as.

What is domain-bound. polyhedral geometry supplies the operative entities, technical vocabulary, warrants, and exceptions that make Dual polyhedron literal. Its documented scope includes the condition that 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. Another bounded application condition is that Failing that, for a polyhedron with a circumscribed sphere, inscribed sphere, or midsphere (one with all edges as tangents), this can be used. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—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.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry under conditions is a kind of Polyhedron.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Dual polyhedron. The reviewed identity 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 other. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

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

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish 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?
Uniform polyhedron. A polyhedron with regular polygonal faces and a symmetry group transitive on vertices, including convex, star and self-intersecting examples. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Star polyhedron. A nonconvex polyhedron with systematic star-like self-intersection or alternating salient and reentrant geometry. Tell: Which entry's carrier, operation, and failure condition are satisfied?
0/1-polytope. A convex polytope whose vertices are selected binary vectors from a finite-dimensional hypercube. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Dual polyhedron remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside polyhedral geometry lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Dual_polyhedron (revision 1370728380).
Preserved source candidate: https://www.georgehart.com/canonical/canonical-supplement.html
Preserved source candidate: https://books.google.com/books?id=rEpjDwAAQBAJ&pg=PA485
Preserved source candidate: http://dmccooey.com/polyhedra/SymmetricSelfDuals.html
Preserved source candidate: http://cs.anu.edu.au/~bdm/papers/plantri-full.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.