Perimeter approximation of convex discs in the hyperbolic plane and on the sphere
Ferenc Fodor

TL;DR
This paper extends Eggleston's perimeter approximation results from Euclidean geometry to hyperbolic geometry, showing inscribed polygons are optimal in the hyperbolic plane but not on the sphere.
Contribution
It proves the hyperbolic analogue of Eggleston's theorem and provides a counterexample demonstrating the failure on the sphere.
Findings
Inscribed convex polygons minimize perimeter deviation in hyperbolic plane.
The same property does not hold on the sphere, as shown by a counterexample.
Abstract
Eggleston (1957) proved that in the Euclidean plane the best approximating convex -gon to a convex disc is always inscribed in if we measure the distance by perimeter deviation. We prove that the analogue of Eggleston's statement holds in the hyperbolic plane, and we give an example showing that it fails on the sphere.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Perimeter approximation of convex discs in the hyperbolic plane and on the sphere
Ferenc Fodor
Department of Geometry, Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, 6720 Szeged, Hungary
Abstract.
Eggleston [Eggleston-1957] proved that in the Euclidean plane the best approximating convex -gon to a convex disc is always inscribed in if we measure the distance by perimeter deviation. We prove that the analogue of Eggleston’s statement holds in the hyperbolic plane, and we give an example showing that it fails on the sphere.
Key words and phrases:
Convex discs in hyperbolic plane and sphere, approximation with respect to perimeter deviation, Dowker type theorems
2010 Mathematics Subject Classification:
Primary 52A55, Secondary 52A27, 52A40
1. Introduction and main results
We call a compact, convex set whose interior is non-empty a convex disc. The perimeter of is denoted by . Let and be both convex discs. The perimeter deviation of and is defined as
[TABLE]
We note that although the perimeter deviation is often used to measure the distance of convex figures, it does not define a proper metric on the set of all convex discs. For another notion of perimeter deviation, which is in fact a metric, see, for example, Florian [Florian] and the references therein.
Eggleston [Eggleston-1957], among other questions, investigated how well a convex disc can be approximated by convex polygons of a given number of vertices in the sense of perimeter deviation. For a positive integer , let denote the set of convex polygons with at most vertices. Let
[TABLE]
A simple compactness argument shows that for each convex disc and positive integer , there exists a which minimizes the perimeter deviation from , that is, .
Eggleston proved the following beautiful statement, cf. [Eggleston-1957, Lemma 4 on p. 353].
Theorem 1.1** (Eggleston, 1957).**
Let be a convex disc and a positive integer. If is such that , then is inscribed in , that is, and the vertices of are on the boundary of .
According to a classical result of Dowker [Dowker-1944], the minimum area of convex -gons containing a given convex disc is a convex function of , and the maximum area of convex -gons contained in is a concave function of . This result was later extended for perimeter in place of area by L. Fejes Tóth [LFT-1955], Eggleston [Eggleston-1957], and Molnár [Molnar-1955], independently from each other. Thus, it follows from Theorem 1.1 that for a fixed convex disc , the minimum perimeter deviation of convex -gons from is also a concave function of .
Let denote the hyperbolic plane, and for two points let denote the (hyperbolic) segment with endpoints and . The hyperbolic distance of and is the length of .
Let denote the set of all convex polygons in with at most vertices for . Similarly to the Euclidean case, we define
[TABLE]
For any fixed and positive integer , there exits a convex polygon such that . In this paper we extend Theorem 1.1 to the hyperbolic plane as follows.
Theorem 1.2**.**
Let be a convex disc in and a positive integer. If is such that , then is inscribed in , that is, and the vertices of are on the boundary of .
The analogues of Dowker’s theorem both for area and perimeter also hold on the sphere and the hyperbolic plane . These were proved by Molnár [Molnar-1955] and L. Fejes Tóth [LFT-1958]. Thus, Theorem 1.2, combined with the hyperbolic version of Dowker’s theorem for the maximum perimeter of convex (hyperbolic) -gons contained in a given convex disc , implies the following statement.
Corollary 1.3**.**
The minimum perimeter deviation of convex -gons from a given convex disc is a concave function of in the hyperbolic plane .
On the unit sphere , the distance of two non-antipodal points is the length of the shorter arc of the unique great circle through and . The distance of two antipodal points is . We call a closed set on (spherically) convex if it is contained in an open hemisphere and for any , the shorter arc of the unique great circle connecting and is also contained in . One may naturally define the perimeter deviation of two convex discs on the unit sphere as in the Euclidean plane and hyperbolic plane. Again, for a convex disc and , there exists a convex spherical polygon with at most vertices such that . However, may not necessarily be contained in (or contain ) as shown by an example in Section 3.
2. Proof of Theorem 1.2
In this section we work in the hyperbolic plane , thus all notions, such as distance, convexity, perimeter, perimeter deviation, etc. are always understood in the hyperbolic sense without mentioning this fact explicitly. We think of as a -dimensional Riemannian manifold of constant curvature , such as the Beltrami-Klein model, see more on this below. By the curvature of a curve in we mean its geodesic curvature. A compact set is (geodesically) convex, if for any , the geodesic segment is contained in . We note that there are other forms of convexity in , for example, -convexity where we require that the whole region bounded by the two horocyclic arcs connecting and is contained in , or -convexity where one requires that contains the region bounded by two congruent hypercyclic arcs of radius through and . For more information we refer to [GR99].
We essentially follow a similar but somewhat more complicated argument to that of Eggleston in [Eggleston-1957].
First, note that the set of all compact, convex sets forms a complete metric space with respect to the Hausdorff distance in . Furthermore, the perimeter deviation function is continuous on this space. Thus, it is enough to prove the theorem on a suitable dense subspace of convex discs. We select this dense subspace the following way: We assume that the boundary of is smooth, meaning that it is twice continuously differentiable at every point and the geodesic curvature is strictly positive everywhere.
We start the proof by examining the difference between the length of a chord and the corresponding arc of cut off by the chord.
In the following argument, we will work in the Beltrami-Klein model of the hyperbolic plane whose points are the interior points of the unit radius circular disc centred at the origin, and whose lines (geodesics) are the Euclidean open line segments with endpoints on the boundary of . We define the distance of two points as
[TABLE]
where and are the intersection points of the line with such that is on the side of and is on the side of . The symbol denotes the cross-ratio of the points in this order. It is well-known that the Gaussian curvature of this model is constant , with this particular metric. Now, if is a point of , where and are its Euclidean coordinates in a Cartesian coordinate system centred at the origin, then the hyperbolic coordinates of are the following
[TABLE]
The first fundamental form of is
[TABLE]
see, for example, [Cannon].
Let be a (geodesically) convex disc in whose boundary is smooth. Since geodesic segments in are exactly the Euclidean segments, the disc is convex in the hyperbolic sense exactly if it is convex in the Euclidean sense. Assume that and that the -axis supports at . Then, in a suitably small neighbourhood of , the boundary of can be represented by a convex function such that as , and . A standard calculation shows that the geodesic curvature of at is .
For sufficiently small , let denote the arc-length of between and the point . Then
[TABLE]
After substituting the Taylor series of around and that of around in (1), we obtain
[TABLE]
First, let be the line with Euclidean equation . For sufficiently small , the line intersects at () such that (). Due to the definition of , () as .
Thus, by (2), the arc of between and the positive intersection point of and has length
[TABLE]
Clearly, a similar formula holds for the length of the arc of between the intersection point with (negative) -coordinate and .
The (hyperbolic) length of the segment between the -axis and the (positive) intersection point with is the following
[TABLE]
and, again, a similar formula holds for the length of the segment between the negative intersection point of and and the -axis.
From (3) and (4), and the expressions of and , we obtain that the difference of the arc of and the chord at height is
[TABLE]
Second, we assume that the Euclidean equation of the line is , meaning that passes through and makes an angle with the positive part of the -axis. If is sufficiently small, then for the -coordinate of the intersection point of and , different from , the following holds
[TABLE]
from which we obtain that
[TABLE]
Substituting in (2), we get that the arc-length of between and the other intersection point of and is
[TABLE]
At the same time, the length of the segment is
[TABLE]
Now, by (6) and (7), the difference between the chord of and the corresponding part of is
[TABLE]
The observations (5) and (8) are elementary and probably well-known. We only included their detailed proofs because we could not find an explicit argument in the literature.
Now, we turn to the actual proof of Theorem 1.2. Let be an -gon which minimizes the perimeter deviation from , that is, . We will denote the vertices of by in a counter-clockwise cyclic order along . It is clear that each side has a common point with , otherwise we could move it inwards and decrease the perimeter deviation using the monotonicity of perimeter in the hyperbolic plane, cf. [Klain, Proposition 1.3]. The assumption that is yields that is strictly convex, that is, contains no geodesic segment, and that has a unique supporting line at each point, and therefore it cannot have vertices.
The proof of Theorem 1.2 is indirect: we assume, on the contrary, that is not inscribed in and seek a contradiction. It is clear that if , then the vertices of must be on , similarly to the Euclidean case, or otherwise we could increase the perimeter of by moving the vertices out to the boundary of . Therefore, the indirect assumption yields that has a side with at least one endpoint outside of . There are several possibilities how this may happen. We treat each such case and show that they all contradict to the best approximation property of .
We use the following notation, similar to [Eggleston-1957, Section 2]. Let the vertex be outside of . We denote the internal angle of at by . Let be the last common point of the side and , and let be the first common point of and in the counter-clockwise direction along . Let the angle of the tangent of at and be denoted by , and the angle of the tangent of at and be . Then, clearly, .
Let us first consider the case when has a side, say , such that both and are outside of . Let be small and let be the hypercycle that is the equidistant curve from the line at distance in the half-plane of containing . Let and be the intersection points of the sides and with , respectively. Assume that is so small that both and are outside of . Then the -gon with vertices , in this order, is contained in , and the intersection of the side and is of positive length. Let the feet of the perpendiculars from and to be and , respectively. Then is a Saccheri quadrilateral. It is known that the line through the midpoints of the segments , and is perpendicular to both lines and thus it cuts into two congruent Lambert quadrilaterals. Using known trigonometric relations for Lambert quadrilaterals, we obtain that
[TABLE]
from which it follows that
[TABLE]
By hyperbolic trigonometry, we obtain for that
[TABLE]
thus
[TABLE]
and
[TABLE]
thus
[TABLE]
If is tangent to at a relative interior point , then let and denote the intersection points of the segment with so that is closer to . Then . By the positivity of the geodesic curvature of at and by (5), it holds that the difference of the arc-length of between and and the length of the segment is as , and thus, by using the estimates obtained above, we get that
[TABLE]
Since for any , the coefficient of is negative in the above expression. This contradicts the minimality of , and thus cannot have such a side.
If the side cuts the boundary in two distinct points that are relatively interior to , then according to the previously introduced notation these intersection points are and , and the tangents to make an angle and with , respectively. We introduce the following notations, see Figure 1. Let the last intersection point of and be . Let be the perpendicular projection of onto . Let be the point on whose perpendicular projection onto is . Let be the intersection point of the tangent line of through and . Finally, let be the perpendicular projection of onto .
We first note that, using hyperbolic trigonometry, we can conclude that
[TABLE]
and similarly,
[TABLE]
Now, let . Clearly, . Similar as above, we obtain by hyperbolic trigonometry applied to the triangle that
[TABLE]
from where
[TABLE]
moreover,
[TABLE]
and
[TABLE]
From trigonometric formulas for the corresponding Lambert quadrilateral we get that
[TABLE]
Also, it is clear from the property of that
[TABLE]
and thus from all of the above,
[TABLE]
and
[TABLE]
Let denote the length of the arc of between and . From (2), we obtain that
[TABLE]
Finally, putting everything together, we obtain (similar to (19) in [Eggleston-1957]) that
[TABLE]
and thus, by the optimality of , it must hold that
[TABLE]
In the following case we do not give all small details of the calculations as those are very similar to the ones discussed above. We rather just point out the main conclusions of these calculations.
Next, assume that for the side it holds that and . Rotate the line around by a sufficiently small positive angle such that the intersection point of the rotated line with the side is still outside . Let be the polygon with vertices . Clearly, . Let be the last intersection point of the side with , as before.
If the line is not a supporting line of at , then we obtain by hyperbolic trigonometry that
[TABLE]
Due to the optimality of , it must hold that
[TABLE]
Note that , and thus by the strictly monotonically increasing property of the function it follows that the coefficient of in (10) is larger than .
If is a supporting line of , then, using (8), we get that
[TABLE]
As the coefficient of is negative, this clearly contradicts the minimality of , so cannot have such a side.
Now, the proof can be finished as in [Eggleston-1957, cf. (24)–(25) on p. 357]: For each , the angle appears in exactly two equations of type (9) or (10), and and in exactly one such equation. Thus, by adding the two equations in which appears, the coefficient of will be at least . If denotes the coefficient of , then summing all equations of type (9) and (10) yields that
[TABLE]
which is clearly a contradiction as all . This finishes the proof of Theorem 1.2.
3. Counterexample on the sphere
It is known that among spherical triangles contained in a (spherical) circle the inscribed regular triangle has the maximal perimeter, cf. L. Fejes Tóth [lagerungen]. Thus, among triangles contained in the circle, the inscribed regular one has the minimum perimeter deviation from the circle. However, below we show an example of a triangle and circle, where the triangle is neither inscribed nor circumscribed, and approximates the circle better than either the inscribed or the circumscribed regular triangle.
Let be the spherical circle with centre and radius . Consider the regular spherical triangle with centre and circumradius . Let denote the side length of and its inradius, see Figure 2.
Then
[TABLE]
and
[TABLE]
Let be the intersection point of the side with the circle that is closer to . Let be the intersection of the side and the great circle through perpendicular to . Then is the distance of and . Denote by the length of the arc between and . Furthermore, let be the central angle . Then
[TABLE]
and
[TABLE]
Thus
[TABLE]
The graph of over the interval is shown below, which clearly has its minimum inside the interval. We note that at the left endpoint of the interval the triangle is inscribed and at the right endpoint it is circumscribed. In fact, the circumscribed regular triangle approximates better than the inscribed one, and the minimum occurs for a triangle that is neither inscribed nor circumscribed. Since all of these triangles are contained in the open hemisphere centred at , they are convex in the spherical sense.
4. Acknowledgements
This research was partially supported by the National Research, Development and Innovation Office of Hungary grant NKFIH K116451.
The author is grateful to Professor Gábor Fejes Tóth (Budapest, Hungary) for the enlightening discussions. The author also wishes to thank the MTA Alfréd Rényi Mathematical Research Institute where part of this research was done.
References
