Here's my attempt at the proof. If possible please assess its validity. Thanks.
2026-02-22 19:35:12.1771788912
The permutations of (1,1,0,0), (-1,1,0,0), (-1,-1,0,0) are vertices of a polytope.
83 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2

Why this sort of argumentation? Consider this:
Cartesian coordinates are orthogonal. Thus the points (1,1,1,1) and all its sign changes define a tesseract of edge size 2. It has as its Dynkin symbol o3o3o4x.
Next consider therefrom the hull of its edge centers. This would be the set of vertices (1,1,1,0) and all permutations and sign changes. It is the rectified tesseract with Dynkin symbol o3o3x4o.
Now let's turn to the face centers instead (i.e. of its 2D boundaries). Then this polychoron would be the hull of (1,1,0,0) and all permutations and sign changes, i.e. your problem. By construction this is now the birectified tesseract with Dynkin symbol o3x3o4o.
Alternatively o3x3o4o also could be read as rectified 16-cell (by progression of the special node from the other end of the symbol). Or, as it would turn out, it also is equivalent to the 24-cell, showing up additional symmetry, Thus yielding as alternate Dynkin symbol x3o4o3o as well.
--- rk