Sufficiency of simplex inequalities

DOI10.1090/PROC12756MaRDI QIDQ2790206zbMATH OpenOpenAlexFDO

Authors Shuzo Izumi

Publication date 3 March 2016

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.4534

zbMATH Keywords

contentconverse of the triangle inequalityfacetsimplextriangle inequalityvolume

Mathematics Subject Classification ID

Elementary problems in Euclidean geometries (51M04) Geometric constructions in real or complex geometry (51M15) Inequalities and extremum problems in real or complex geometry (51M16) Length, area and volume in real or complex geometry (51M25) Inequalities and extremum problems involving convexity in convex geometry (52A40) (n)-dimensional polytopes (52B11)

Abstract: Let z_0,...,z_n be the (n-1)-dimensional volumes of facets of an n-simplex. Then we have the simplex inequalities: z_p < z_0+...+check{z}_p+...+z_n (0 =< p =< n), generalizations of triangle inequalities. Conversely, suppose that numbers z_0,...,z_n > 0 satisfy these inequalities. Does there exist an n-simplex the volumes of whose facets are them? Kakeya solved this problem affirmatively in the case n = 3 and conjectured that the assertion is affirmative also for all n >= 4. We prove that his conjecture is affirmative. To do this, we define three kinds of spaces of loops associated to n-simplices and study relations among them systematically. In particular, we show that the space of edge loops corresponds to the space of facet loops bijectively under a certain condition of positivity.

Review text

The paper under review proves that if \(z_0 \geq z_1 \geq \dots \geq z_n\) are given positive numbers, then there exists an \(n\)-dimensional simplex \(S\) such that \(z_0, z_1, \dots, z_n\) are the contents (i.e., the \((n-1)\)-dimensional volumes) of the facets (i.e., the \((n-1)\)-dimensional faces) of \(S\) if and only if \(z_1 + \dots + z_n > z_0\). This generalizes Propositions 20 and 22 of Book I of Euclid's \textit{Elements} which, when combined, state that the positive numbers \(x \geq y \geq z\) can serve as the side lengths of a triangle if and only if \(y+z > x\).NEWLINENEWLINEThe author of the paper under review is apparently unaware that the same result has already been proved (as Theorem 5.1) by \textit{L. Gerber} [Pac. J. Math. 56, 97--111 (1975; Zbl 0303.52004)].

Recommendations

• scientific article; zbMATH DE number 810374
• Inequalities for volumes of simplices in terms of their faces
• Refinements of inequalities for a simplex
• Three geometric inequalities for a simplex
• scientific article; zbMATH DE number 562321

Cites work

• Convex Bodies The Brunn-MinkowskiTheory
• The Minkowski problem for polytopes

Cited in

(7)

• The median triangle theorem as an entrance to certain issues in higher-dimensional geometry
• Recovering a circumscriptible tetrahedron from its face areas
• Characterization of simplices via the Bezout inequality for mixed volumes
• scientific article; zbMATH DE number 1159584 (Why is no real title available?)
• Anothern-Dimensional Generalization of Pompeiu’s Theorem
• Pompeiu-like theorems for the medians of a simplex
• The existence of triangles, tetrahedra, and higher-dimensional simplices with prescribed exradii

This page was built for publication: Sufficiency of simplex inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790206)