The Sum of the Solid Angles of an n-Simplex

It was known in antiquity that the sum of the three angles of a triangle equals π. Surprisingly, it was not until 1952 that the corresponding question for a tetrahedron was addressed. In that year, J.W. Gaddum proved that the sum of the four solid angles in a tetrahedron lies within the interval of [0,2π] and those lower and upper bounds are the best possible. In 2020, H. Katsuura showed that 2π was unachievable. In this paper, we generalize these results to show that for a non-degenerate n-simplex in Rn with n≥3, the solid angles at the vertices add up to a positive number that is less than one-half the (n−1)-dimensional area of the unit sphere in Rn. We also show that there are examples for which the sum can be made arbitrarily close to the extreme values of 0 and one-half the (n−1)-dimensional area of the unit sphere in Rn.

Authors

Institutions

Publication Details

Journal
Geometry
Published
2025-09-19
DOI
https://doi.org/10.3390/geometry2030015
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Sum of the Solid Angles of an n-Simplex

Dean C. Wills, Harold R. Parks
Geometry
Matrix Theory and Algorithms
article

The Sum of the Solid Angles of an n-Simplex

Dean C. Wills, Harold R. Parks
article en

Abstract

It was known in antiquity that the sum of the three angles of a triangle equals π. Surprisingly, it was not until 1952 that the corresponding question for a tetrahedron was addressed. In that year, J.W. Gaddum proved that the sum of the four solid angles in a tetrahedron lies within the interval of [0,2π] and those lower and upper bounds are the best possible. In 2020, H. Katsuura showed that 2π was unachievable. In this paper, we generalize these results to show that for a non-degenerate n-simplex in Rn with n≥3, the solid angles at the vertices add up to a positive number that is less than one-half the (n−1)-dimensional area of the unit sphere in Rn. We also show that there are examples for which the sum can be made arbitrarily close to the extreme values of 0 and one-half the (n−1)-dimensional area of the unit sphere in Rn.

GeometryVol. 2(3)
Oregon State University (US), Splunk (United States) (US)
Openalex Percentile: Top 73%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.