1. Introduction
This article concerns solid angles measured in a Euclidean space of a dimension of at least three. For , the -dimensional solid angle subtended by as measured at a point is defined as follows: Radially project the set onto an -dimensional sphere centered at p and measure the -dimensional area of that projection, then normalize the result by dividing by the st power of the radius of the sphere (this general definition can also be applied in case , and it gives the value one expects (in radians), but it sounds and feels awkward to say “solid angle” when dealing with an angle in the plane). The unit of measurement for a solid angle in 3-space is the steradian (symbol “sr”)—a derived unit in the International System of Units. There does not seem to be a standard unit of measurement for solid angles where , although hypersteradian is sometimes used. The range of possible values for the measure of solid angles in is from 0 up to the -dimensional area of the unit sphere in .
It was known in antiquity that the sum of the three angles of a triangle equals
, but it was not until 1952 that the corresponding question for a tetrahedron was addressed. In that year, J.W. Gaddum [
1] proved that the sum of the four solid angles in a tetrahedron lies within the interval of
and those lower and upper bounds are the best possible. In 2020, H. Katsuura [
2] showed that
was unachievable.
An n-simplex, , equals the set of all convex combinations of its vertices, . The simplex is said to be degenerate if all the vertices, and hence all of , lie in an -dimensional hyperplane; otherwise the simplex is non-degenerate.
The purpose of this article is to show that, for a non-degenerate n-simplex in , , if we measure the solid angle of the simplex at each of its vertices and then add those values, that sum will always be strictly less than one-half the area of the unit -sphere. Indeed, we will show that that sum can come arbitrarily close to zero. Finally, to address the other end of the range of possibilities, we will show that the sum can come arbitrarily close to one-half the area of the unit -sphere.
Notation 1. We will have occasion to use both and in the following notation.
- 1.
The origin in will be denoted by and the standard unit basis vectors will be denoted by .
- 2.
We will measure the -dimensional area of sets in using the -dimensional Hausdorff measure denoted as .
- 3.
We will use to denote the -dimensional sphere of radius r centered at .
- 4.
We let denote the -dimensional area of the unit sphere in , i.e., . It is known (Section 3.2.13 of [3] gives a derivation) that - 5.
For and , we will write
Remark 1. For those studying geometric analysis, the Hausdorff measure is a standard choice for a lower-dimensional measure in Euclidean space (though it is not the only possible choice). One can find its definition in §2.1 of [4]. The essential fact that we need is that if is a set for which there is a classical value for its -dimensional area, then equals that value. It will be convenient to always translate to the origin the point at which we wish to measure a solid angle. With that completed, the radial projection of the set on a sphere about the origin coincides with the intersection of the sphere and the cone generated by the set. We will also further simplify by making the chosen sphere the unit sphere.
Definition 1. Suppose that .
- 1.
Following [5] , S is called a cone
if it is closed under positive scalar multiplication, that is, whenever and .
- 2.
We define the cone generated by
S, denoted as , by settingBecause we will be dealing with sets that contain the origin, we note the following fact: if and only if .
- 3.
If S is a Borel set, then the solid angle
subtended by S as measured at; will be denoted as . (The right-hand side of (1) begs the question of measurability. This is where it is convenient to note that because is a Borel regular measure, is well-defined for any Borel set . See §1.7 of [4]).
Recall that an
n-simplex,
, equals the set of all convex combinations of its
vertices,
. That is,
It is a routine exercise to prove the following lemma.
Lemma 1. Let be the vertices of the simplex Δ,
and let be an integer. Then, Δ
is non-degenerate if and only if the n vectorsare linearly independent. To form the sum of the solid angles at the vertices of , we will translate each vertex in turn to the origin and measure the solid angle subtended by the translated simplex as measured at the origin. The formal statement of our main result is the following.
Theorem 1. Let be the vertices of a non-degenerate n-simplex Δ, and let be the solid angle of Δ measured at .
- 1.
It holds that
- 2.
For any , there exists a non-degenerate n-simplex such that - 3.
For any , there exists a non-degenerate n-simplex such that
2. Theorem 1 Part 1
Let be a non-degenerate n-simplex with vertices . In this section, it will be convenient to assume that . This leads to no loss of generality.
When the vertex
is translated to the origin, we obtain the congruent
n-simplex
and we have
Note that the term
is included in the summation (
2). The interior of the cone generated by
will be denoted by
(see
Figure 1).
is given by
Because the boundary of the cone generated by
is contained in the union of
n hyperplanes, we have
Lemma 2. There exist linearly independent vectors such that Proof. Because
is non-degenerate and because of our assumption that
, we know from Lemma 1 that the set
is linearly independent. Let
P be the matrix, the
ith column of which is
. Letting
be the
jth column of the transpose of
, we see that (
5) holds. The linear independence of
then follows from (
5). □
Notation 2. Set . Let the vectors be as in Lemma 2. For , let be the set of such that If x satisfies the conditions in (6) and , then also satisfies the conditions in (6). Therefore, is a cone. For a fixed j, the condition defines a half-space. Likewise, the condition defines a half-space. Thus, is the intersection of n half-spaces. Lemma 3. - 1.
Let be subsets of . If , then and are disjoint open sets.
- 2.
For each , holds.
- 3.
The complement of the union of the sets is the union of n linear subspaces each of dimension .
- 4.
It holds that .
Proof. Part 1 in Lemma 3. It is immediate that each is an open set. Assume that . Arguing by contradiction, we suppose that . Since , there is either a j with and or a j with and . In the first case, we have because and because , a contradiction. The second case is handled similarly.
Part 2 in Lemma 3. For
,
is a cone, so
holds. Since
is open, to show that
, we need only show that
. To see this, set
. By (
5), we have
. Since
is a cone, we have
.
Part 3 in Lemma 3. From (
6), we see that the complement of the union of the
equals
which is the union of
n linear subspaces of dimension
.
Part 4 in Lemma 3. The set
Z exhibited in (
7) is a cone, because
holds if and only if
, when
. Observe that the intersection of a linear subspace of dimension
with
is an
-dimensional sphere of radius 1 centered at the origin, and thus that intersection has
-measure 0. So by Part 3, we have
. Finally, using Part 1, we have
□
Lemma 4. The following hold:
- 1.
and .
- 2.
For ,
- 3.
is a family of distinct pairwise disjoint sets.
Proof. Part 1 in Lemma 4. Let
. Then by (
3),
for some
, with
for
For j with , we have . Thus we have and . Since was arbitrary, we have and .
We see the converse as follows: Since the vectors
are linearly independent, any
can be written
. If
y is in
, then for each
j,
holds. Thus for
, we have
with all the
being positive. We conclude that
. Arguing similarly, we see that
.
Part 2 in Lemma 4. Let
. Then by (
3),
for some
, with
, for
For any integer
j with
and
, we have
Thus we have and .
Part 3 in Lemma 4. Through Part 1 and Part 2, we know that
So it suffices to show that (
8) exhibits
pairwise disjoint sets. Through Lemma 3, the sets in (
8) will be disjointed provided that the following subsets of
are distinct:
Because
, the set
has more elements than the singleton set
, so (
9) does represent
distinct sets.
□
We can now prove Part 1 of our main result when . The case will require more work.
Proof of Theorem 1 Part 1 when n = 4 .
By (
4) and the fact that
, we have
Each of the cones in is contained in a distinct open cone , . Since implies , there are more cones than there are ’s and ’s, so there must be some solid angle not accounted for by the ’s and ’s.
Through Lemma 3, Part 2, we have
, for each
. Through Lemma 4, Part 1, we have
and
. Thus we know
, and we have
□
When
, there are four
’s and four
’s. Since there are eight cones
,
, we have no left-over
to create the strict inequality that we obtained in (
10). Instead, we will need to use the fact that there is yet another non-empty open cone
, disjointed from
and also contained in
. That cone is what we exhibit in Lemma 5 (see
Figure 1).
Lemma 5. Suppose that and let Σ denote the open cone generated by the n-simplex with vertices , , , and . Then the following hold:
- 1.
,
- 2.
.
Proof. Part 1 in Lemma 5. Let
. Then
x can be written as
for some positive numbers
,
, and
. Hence,
is non-empty. We then see that
,
, and
, so we have
.
Part 2 in Lemma 5. By (
3), any point
, as defined in Notation 1, Part 5, can be written in the form
for some choice of positive numbers
. If
, then comparing (
11) and (
12), we see that
So we have
and thus
contradicting the fact that all the
’s and
’s are positive. □
Proof of Theorem 1 Part 1 when n = 3 .
Arguing similarly to the proof of Theorem 1 part 1 when
, we use Lemmas 3–5 to obtain
□
3. Theorem 1 Part 2
In order to make all the solid angles of an n-simplex small, we will split the vertices into two tightly clustered groups in widely separated orthogonal planes.
In this section, it will no longer be convenient to assume that the origin is one of the vertices. Also, in order to avoid confusion, we will not use the index 0 on any of the vertices. When , the orthogonal planes are actually orthogonal lines.
Figure 2 illustrates such an arrangement when
.
In the figure, one line is the horizontal line passing through p and the other line is the vertical line through q. The points p and q are chosen so that the distance between the lines is . Two points, and , are chosen on the line through p. Similarly, two points, and , are chosen on the line through q. We let d be an upper bound for and .
It would be laborious to make an exact computation of the solid angles in the simplices we will construct. Instead we will show that the cone generated at any vertex lies in the part of
contained between a plane through the origin and another parallel plane (The part of
between two parallel planes is called a
zone of two bases). The next lemma will provide an estimate, (
13), for the area of that region.
Lemma 6. Suppose that . For , it holds that Proof. If we write
, where
,
, and
, what we need to prove is that
Let
be given by
. Then the quantity on the left-hand side of (
14) is given by the integral
where
and
is that Lebesgue measure on
. Because the integrand in (
15) is constant for constant values of
, we can use what is essentially the “method of cylindrical shells” from first-year calculus. We see that
□
As indicated in the opening paragraph of this section, our plan for constructing a simplex with a small total solid angle involves separating the vertices into two groups.
We follow that plan in the notation below. The key parameter in estimating the solid angle is the ratio , so to simplify the example, we will vary only . We also simplify by letting the smaller group have two vertices.
Notation 3. Suppose that . Set .
- 1.
Set and .
- 2.
Set and , for .
Proof of Theorem 1 Part 2.
Let be given. With the notation above, if we choose a positive so that , then we will show below that the sum of the solid angles of measured at its vertices is less than .
We estimate the solid angle of measured at , the other cases are similar, but simpler, and yield the same estimate.
A generic point of the open cone generated by
is
where the
and
are all positive. Observe then that
Since reflection through an
-dimensional plane preserves area, Lemma 6 gives us the estimate
and the result follows. □
4. Theorem 1 Part 3
We identify
with
. Start with an
-simplex,
D, in
that contains the unit sphere in
. Appending
to the set of vertices of
D would create a degenerate
n-simplex—something we have been avoiding. So first we lift the vertices of
D slightly in the direction of
, then we append
. Since
D contains the unit ball in
, the lifted simplex will have almost an entire hemisphere above it and the angle subtended at
by the lifted simplex can be made as close to
as we wish (see
Figure 3). The remainder of this section seeks to make the preceding intuition precise.
Proof of Theorem 1 Part 3.
First, we need to construct an -simplex containing . To that end, consider the -simplex in , , for its first vertices and with the origin, , for its nth vertex. It is a routine exercise to check that the distance from to each of the faces of equals 1. Thus .
We then translate by , to define the simplex with , , for its first vertices and with for its nth vertex. We see that contains .
Let
be given. Choose a positive
t with
. Let
be the
n-simplex with vertices
and
The cone generated by
contains
so
holds. Using the estimate
from Lemma 6, we see that
as required. □
Author Contributions
Conceptualization, methodology, software, validation, formal analysis, investigation, resources, data curation, writing—original draft preparation, writing—review and editing, visualization, supervision, and project administration were performed jointly by H.R.P. and D.C.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Conflicts of Interest
Dean C. Wills is an employee of Splunk. The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
References
- Gaddum, J.W. The sums of the dihedral and trihedral angles in a tetrahedron. Amer. Math. Mon. 1952, 59, 370–371. [Google Scholar] [CrossRef]
- Katsuura, H. Solid angle sum of a tetrahedron. J. Geom. Graph. 2020, 24, 29–34. [Google Scholar]
- Federer, H. Geometric Measure Theory. In Die Grundlehren der Mathematischen Wissenschaften; Springer: New York, NY, USA, 1969; Volume 153, pp. xiv+676. [Google Scholar]
- Krantz, S.G.; Parks, H.R. Geometric Integration Theory; Cornerstones; Birkhäuser Boston, Inc.: Boston, MA, USA, 2008; pp. xvi+339. [Google Scholar] [CrossRef]
- Rockafellar, R.T. Convex Analysis; Princeton Mathematical Series; Princeton University Press: Princeton, NJ, USA, 1970; Volume 28, pp. xviii+451. [Google Scholar]
| Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).