I am looking for a geometric realization of a 4-polytope with 7 vertices. A list can be found in "An Enumeration of Simplicial 4-Polytopes with 8 vertices" by Grünbaum and V. P. Sreedharan. For an example we have a 4 polytope called $P_1^7$ with a list of facets: 1256, 1245, 1234, 1237, 1345, 1356, 1267, 1367, 2367, 2345, 2356, where a digit represents a vertex of $P_1^7$. My question would be: how should I choose 7 arbitrary, but indexed (what I mean is that I know which one is 1 for example) points on the sphere, so that the 4-polytope given by the convex hull of these points have the same combinatorial type as listed above? Is there any intelligent way to do this?
2026-03-29 04:11:10.1774757470
A geometric realization of a 4-polytope with 7 vertices
152 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GEOMETRY
- Point in, on or out of a circle
- Find all the triangles $ABC$ for which the perpendicular line to AB halves a line segment
- How to see line bundle on $\mathbb P^1$ intuitively?
- An underdetermined system derived for rotated coordinate system
- Asymptotes of hyperbola
- Finding the range of product of two distances.
- Constrain coordinates of a point into a circle
- Position of point with respect to hyperbola
- Length of Shadow from a lamp?
- Show that the asymptotes of an hyperbola are its tangents at infinity points
Related Questions in POLYHEDRA
- Dimension of Flow Polytope
- Algorithm to find the convex polyhedron
- What is the name of the polyhedral shape of the Humanity Star?
- Number of congruences for given polyhedron
- How to find the "interior boundary" for a set of points?
- Do the second differences of the fifth powers count the sphere packing of a polyhedron?
- PORTA software and Polyhedron theory
- Convex polyhedron given its vertices
- Name of irregular convex octahedron
- Coordinates of a tetrahedron containing a cube
Related Questions in POLYTOPES
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Can we really move disks around a compact surface like this?
- The permutations of (1,1,0,0), (-1,1,0,0), (-1,-1,0,0) are vertices of a polytope.
- Smoothness of a polytope
- Schlegel diagram and d-diagram
- How to find the "interior boundary" for a set of points?
- Simplicial polytope in $\mathbb{R}^n$ with $n+2$ vertices
- What are some examples of 2-polytope/3-polytope that are not simple?
- Contraction of oriented matroid as related to polytope?
- Finding the vertices of linear image of the $n$-simplex
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
For a general approach, you can use the technique of Gale diagrams to transform a $d$-dimensional polytope with $n$ vertices into an $(n-d-2)$-dimensional arrangement of (signed) points with $n$ vertices. In your case, your have $n-d-2=1$, so the arrangement is of a very low dimension and can be handled with geoemtric intuition. The process also works the other way around too, and so to construct your $4$-dimensional polytope with seven vertices we can start from a 1-dimensional Gale diagram.
This is a rather technical approach, but I will lay out the general approach (the details can be found in Chapter 6 of Ziegler's "Lectures on Polytopes"). You will need to find a 1-dimensional arrangement of seven signed points:
The complements of your facets are
$$145,\;147,\;167,\;245,\;247,\;267,\;345,\;347,\;367,\;456,\;567.$$
You can check that the following diagram has the desired properties:
Technically, the diagram has to satisfy some further properties, and this one does, so I will not talk about them.
Now, there is a sequence of steps we have to perform to obtain the vertices of the polytope. I will not explain them but just perform them here:
We have to choose some actual coordinates for the shown points. Since the arrangement is 1-dimensional, each position is described by a single number. In the order of the indexing we can choose the coordinates $6,7,1,2,3,4,5$.
Now we lift the arrangement by one dimension and get rid of the signs: a black point at position $x$ is replaced by a vector $(x,1)\in\Bbb R^2$, and a white point is replaced by $(-x,-1)\in\Bbb R^2$. If we put all these vectors as columns into a matrix, we get
$$M:=\begin{bmatrix} 6 & 7 & -1 & 2 & -3 & 4 & -5 \\ 1 & 1 & -1 & 1 & -1 & 1 & -1 \end{bmatrix}\in\Bbb R^{2\times 7}.$$
Let $U:=\mathrm{span}(M^\top)\subseteq\Bbb R^7$ be the column span of the transpose $M^\top\in\Bbb R^{7\times 2}$. This is a $2$-dimensional subspace of $\smash{\Bbb R^7}$. Thus, if $U^\bot$ denotes its orthogonal complement, then $U^\bot$ is a $5$-dimensional subspace of $\Bbb R^7$ (this is the crucial "duality step"; we transitioned from an arrangement of dimension $2=1+1$ to an arrangement of dimension $5=4+1$).
Determine a basis of $U^\bot$. For example \begin{align} u_1 &= [-5,\phantom+6,1,0,0,0,0],\\ u_2 &= [\phantom+4,-5,0,1,0,0,0],\\ u_3 &= [-3,\phantom+4,0,0,1,0,0],\\ u_4 &= [\phantom+2,-3,0,0,0,1,0],\\ u_5 &= [-1,\phantom+2,0,0,0,0,1]. \end{align} We put these as rows into a matrix: $$ \bar M = \begin{bmatrix} -5 & \phantom+6&1&0&0&0&0\\ \phantom+4&-5&0&1&0&0&0\\ -3&\phantom+4&0&0&1&0&0\\ \phantom+2&-3&0&0&0&1&0\\ -1&\phantom+2&0&0&0&0&1 \end{bmatrix}\in\Bbb R^{5\times 7}.$$
Read out the columns of that matrix, that is $$v_1=[-5,4,-3,2,-1],\;v_2=[6,-5,4,-3,2]\;\text{and}\;v_i=e_{j-2}\;\text{for $3\le i\le 7$}.$$
This set of vectors is "acyclic", that is, there is a vector $c\in\Bbb R^5$ with $\langle c,v_i\rangle >0$ for all $i\in\{1,...,7\}$. This follows from a property of the Gale diagram that I have not mentioned (namely, being totally cyclic). One choice of such a vector is
$$c=(1,7,1,1,17)\in\Bbb R^5.$$
$$ p_1=\begin{bmatrix} -112\\-14\\0\\-56 \end{bmatrix},\; p_2=\begin{bmatrix} -184\\-16\\-4\\-86 \end{bmatrix},\; p_3=\begin{bmatrix} 7 \\ 0\\ 0 \\ 0 \end{bmatrix},\; p_4=\begin{bmatrix} 0\\7\\0\\0 \end{bmatrix}, $$ $$ p_5=\begin{bmatrix} 0 \\ 0\\7\\0 \end{bmatrix},\; p_6=\begin{bmatrix} 0\\0\\0\\7 \end{bmatrix},\; p_7=\begin{bmatrix} -119\\-7\\-7\\-49 \end{bmatrix}. $$
It is likely that you can find nicer coordinates if you make a better choice in any of the steps above (other coordinates for the diagram or a different basis for $U^\bot$). But at least all of the coordinates here are integers.
Here is Mathematica code that automates the Gale transformation: