Proving the Facet Property of Dual Polytopes with a Vertex in the Interior

In summary, the problem states that given a d-polytope P with a vertex v such that 0 is in the interior of P, we need to prove that the intersection of P* with the set {y in R^d|<y, v>=1} is a facet of P*. The definitions for P* and a facet are provided. The attempt at a solution involves trying to show that if the intersection is not a facet, we can delete one of the vertices of P* but this approach has not been successful.
  • #1
Combinatorics
36
5

Homework Statement



Let v be a vertex of a d-polytope P such that [itex] 0 \in intP [/itex] .

Prove that [itex] P^* \cap \{y \in \mathbb{R}^d \mid\left < y, v\right>=1\ \} [/itex] is a facet of [itex] P^{*} [/itex].

Thanks


Homework Equations



The definitions are:

[itex] P^*=\{ y\in\mathbb{R}^{d}\mid\left < x, y\right>\leq 1\ \forall x\in P\} [/itex]

and a face of P is the empty set, P itself, or an intersection of P with a supporting hyperplane (i.e.- a hyperplane, such that P is located in one of the halfspaces it determines).

A facet is a face of maximal degree


The Attempt at a Solution


I tried showing that if it isn't a facet (the fact that it's a face is obvious), we can delete one of the vertices that form [itex] P^{*} [/itex] but without any success.
 
Physics news on Phys.org
  • #2
I also tried using the fact that 0\in intP in order to find a contradiction. Any help would be appreciated.
 

FAQ: Proving the Facet Property of Dual Polytopes with a Vertex in the Interior

What is the dual mapping of a polytope?

The dual mapping of a polytope is a mathematical operation that transforms a polytope (a geometric figure with straight sides and flat faces) into another polytope with certain properties. In the dual mapping, the vertices of the original polytope become the faces of the dual polytope, and vice versa.

What are the properties of a dual polytope?

A dual polytope has the following properties:

  • It has the same number of faces as the original polytope has vertices.
  • The number of edges in the dual polytope is the same as the number of edges in the original polytope.
  • For every face in the original polytope, there is a vertex in the dual polytope that is connected to all the vertices of that face.
  • The dual of a dual polytope is the original polytope.

What is the significance of the dual mapping in mathematics?

The dual mapping is important in many areas of mathematics, including geometry, topology, and graph theory. It allows us to study the properties of a polytope by looking at its dual, and vice versa. It also helps us understand the relationship between different polytopes and their geometric structures.

How is the dual mapping used in computer graphics?

In computer graphics, the dual mapping is used to create 3D models of polytopes. By representing a polytope as a set of vertices and faces, and then applying the dual mapping, we can generate a wireframe model of the dual polytope. This can then be used to create a solid 3D model for visualization or simulation purposes.

Are there any real-world applications of the dual mapping?

Yes, the dual mapping has several real-world applications, including in crystallography, architecture, and chemistry. In crystallography, the dual mapping is used to study the structures of crystals. In architecture, it can be used to design complex structures such as domes and arches. In chemistry, it is used to understand the structures of molecules and their bonding patterns.

Back
Top