1 Introduction
The concept of reducedness was introduced by Heil [Reference Heil8] in 1978 motivated by some volume minimizing problems. A convex body (i.e., a convex compact set of non-empty interior) K is called reduced if an arbitrary convex body strictly contained in K has smaller minimal width than K. Pál [Reference Pál26] proved in 1921 that for fixed minimal width, the regular triangle has minimal area among convex bodies in the Euclidean plane. This result of his is also known as the isominwidth inequality. The same problem in higher dimensions remains unsolved, as there are no reduced simplices in
${\mathbb R}^n$
for
$n\geq 3$
(see [Reference Martini and Wenzel23, Reference Martini and Swanepoel24]), therefore there are no really good candidates for the volume minimizing problems—so far the best one in
${\mathbb R}^3$
is the so-called Heil body, which has a smaller volume than any rotationally symmetric body of the same minimal width. The problem can be naturally generalized to other spaces, a natural approach is to study the problem in spaces of constant curvature. Bezdek and Blekherman [Reference Bezdek and Blekherman1] proved that, if the minimal width is at most
$\frac {\pi }{2}$
, the regular triangle minimizes the area in
$S^2$
. However, for spherical bodies of larger minimal width, the minimizers of the isominwidth problem are polars of Reuleaux triangles. Surprisingly enough, there is no solution of the isominwidth problem in the hyperbolic space for arbitrary dimension (see Böröczky, Freyer, Sagmeister [Reference Böröczky, Freyer and Sagmeister3]).
A reverse isominwidth problem is about finding the maximal volume if the minimal width is fixed. Naturally, this problem does not have a maximizer in general, but for reduced bodies we can ask for the convex body that maximizes the volume. However, in
${\mathbb R}^3$
, the diameter of a reduced body of a given minimal width can be arbitrarily large, and hence the Euclidean problem is only interesting on the plane. It is conjectured, that the unique planar reduced bodies maximizing the area and of minimal width
$w>0$
in
${\mathbb R}^2$
are the circular disk of radius
$\frac {w}{2}$
and the quarter of the disk of radius w. A big step towards the proof of this conjecture was made by Lassak, who proved that among reduced k-gons, regular ones maximize the area, and as a consequence, all reduced polygons have smaller area than the circle. Following Lassak’s footsteps, the same conclusion was derived in
$S^2$
by Liu, Chan, and Su [Reference Liu, Chang and Su22]. Interestingly enough, the characterization of hyperbolic reduced polygons is still unclear, but clearly it must be different from the Euclidean and spherical ones; there exist reduced rhombi on the hyperbolic plane, while Euclidean and spherical reduced polygons are all odd-gons (see Lassak [Reference Lassak12, Reference Lassak14]). However, the so-called ordinary reduced polygons can be examined the same way (these are odd-gons whose vertices have distance equal to the minimal width of the polygon from the opposite sides such that the projection of the vertices to these sides are in the relative interior of the sides). In fact, it was shown by the author [Reference Sagmeister27] that, among ordinary reduced n-gons of a fixed width, regular n-gons maximize the area. This answers one of Lassak’s questions posed in [Reference Lassak13]. One of his other questions was about the extremality of the perimeter, which is addressed in Section 4 where we give an explicit perimeter formula. However, the extremality of the perimeter remains open, but based on the given formula in Theorem 4.1, we propose a conjecture that is surprising given the Euclidean and spherical analogs. Lassak also proposed to find the infimum of the circumradii of ordinary reduced polygons of minimal width w. In order to obtain the best bound for the circumradius, we need the following result.
Theorem 1.1 If
$P\subset H^2$
is an ordinary reduced polygon of minimal width w, then its diameter is at most

with equality if and only if P is the regular triangle.
With this diameter bound, we obtain the following bound for the circumradius.
Theorem 1.2 Let P be an ordinary reduced polygon in
$H^2$
of minimal width w. Then its circumradius is at most

with equality if and only if P is a regular triangle.
Finally, we also have the following result which is analogous to the results of Fabińska [Reference Fabińska6] and Musielak [Reference Musielak25].
Theorem 1.3 Every ordinary reduced hyperbolic polygon of minimal width w is contained in a circular disk of radius w centered at one of its boundary points.
The article is structured as follows. In Section 2, we describe the fundamental concepts and notations about hyperbolic width and reducedness. In Section 3, we introduce ordinary reduced polygons and explain some of their basic properties, including a few of the key ideas that will be used to obtain some of the main results. In Section 4, we give a perimeter formula for ordinary reduced n-gons. In Section 5, we prove Theorem 1.1, while in Section 6 we prove Theorems 1.2 and 1.3.
2 Preliminaries
We use the notation
$H^2$
for the hyperbolic plane, which is equipped with the geodesic metric. The geodesic distance of two points
$x,y\in H^2$
will be denoted as
$d\left (x,y\right )$
. In this section, we introduce hyperbolic convexity. Many of the concepts are identical with their Euclidean analogs, but as we will soon see, there are exceptions.
For a subset X of the hyperbolic plane
$H^2$
, we say that X is convex, if for any pair of points x and y, the unique geodesic segment
$\left [x,y\right ]$
connecting x and y is a subset of X (where
$\left [x,x\right ]=\left \{x\right \}$
). A convex body is a convex compact set of non-empty interior. It is clear, that similarly to Euclidean convexity, the intersection of an arbitrary family of convex sets in the hyperbolic plane is also convex, so we define the convex hull of a set
$X\subseteq H^2$
as the intersection of all convex sets in
$H^2$
containing X as a subset, and we will use the notation
$\operatorname {{\mathrm {conv}}}\left (X\right )$
for the convex hull of X. The convex body obtained as the convex hull of the finite set
$X=\left \{x_1,\ldots ,x_n\right \}$
is called a polygon, and we use the notation
$\left [x_1,\ldots ,x_n\right ]$
for
$\operatorname {{\mathrm {conv}}}\left (X\right )$
. A point
$x_j\in X$
is a vertex of the polygon X if
$x_j\not \in \operatorname {{\mathrm {conv}}}\left (X\setminus \left \{x_j\right \}\right )$
; a k-gon in the hyperbolic plane is a polygon of k vertices.
For convex bodies, width is an important concept. On the hyperbolic plane there are many different notions of width (see Santaló [Reference Santaló28], Fillmore [Reference Fillmore7], Leichtweiss [Reference Leichtweiss20], Jerónimo-Castro–Jimenez-Lopez [Reference Jerónimo-Castro and Jimenez-Lopez10], G. Horváth [Reference Horváth9], Böröczky, Csépai, and Sagmeister [Reference Böröczky, Csépai and Sagmeister2], Lassak [Reference Lassak15]). We will use the width function introduced by Lassak, but we note that it is identical with the extended Leichtweiss width defined by Böröczky, Csépai, and Sagmeister [Reference Böröczky, Csépai and Sagmeister2] on supporting lines. A hyperbolic line
$\ell $
is called a supporting line of the convex body K if
$K\cap \ell \neq \emptyset $
, and K is contained in one of the closed half-spaces bounded by
$\ell $
. The width of the convex body K with respect to the supporting line
$\ell $
is the distance of
$\ell $
and
$\ell '$
, where
$\ell '$
is a (not necessarily unique) most distant supporting line from
$\ell $
. It is known that this width function is continuous, and its maximal value coincides with the diameter of the convex body, which will be denoted as
$\operatorname {{\mathrm {diam}}}\left (K\right )$
. The minimal width (i.e., the minimal value of the width function on the set of all supporting lines, also known as the thickness) of K is denoted by
$w\left (K\right )$
. This notion of minimal width is a monotonic function, that is for arbitrary convex bodies
$K,L$
such that
$K\subseteq L$
, we have
$w\left (K\right )\leq w\left (L\right )$
. Hence, the concept of hyperbolic reducedness makes perfect sense. A convex body K is called reduced, if for any convex body
$K'\subsetneq K$
,
$w\left (K'\right )<w\left (K\right )$
. Reduced bodies are well-studied (see Heil [Reference Heil8], Lassak–Martini [Reference Lassak and Martini16–Reference Lassak and Martini18], Lassak–Musielak [Reference Lassak and Musielak19]), as they are often extremizers of volume minimizing problems, and bodies of constant width are also reduced.
If we consider the Poincaré disk model of the hyperbolic plane
$H^2$
, hyperbolic lines are either diameters of the unit disk, or circular arcs intersecting the unit circle orthogonally. The boundary points of the unit disk are the ideal points of the hyperbolic plane, and hence there is a natural bijection between hyperbolic lines and pairs of ideal points. Besides the identity, there are three types of orientation preserving isometries of the hyperbolic plane depending the number of fixed points. If there is one fixed point, the isometry is called an elliptic isometry (or rotation). We call an isometry with exactly one fixed ideal point, it is called a parabolic isometry. Finally, isometries with exactly two fixed ideal points are called hyperbolic isometries, which maps the line corresponding to the two fixed ideal points to itself.
3 Ordinary reduced polygons
Lassak proved that hyperpolic convex odd-gons of thickness w are reduced if all vertices are of distance w from the opposite sides, and the orthogonal projections of these vertices onto the opposite sides are in the relative interior of these sides (see [Reference Lassak13]). Such polygons are called ordinary reduced polygons, since this property characterizes reducedness both in
${\mathbb R}^2$
and in
$S^2$
(see Lassak [Reference Lassak12, Reference Lassak14]), but not in the hyperbolic plane. In Böröczky, Freyer, Sagmeister [Reference Böröczky, Freyer and Sagmeister3] it is shown that, for each
$w>0$
there are reduced rhombi, whose diameters are unbounded. The characterization of hyperbolic reduced polygons is therefore unclear, so we focus on ordinary reduced polygons in this article. For the diameter of an ordinary reduced polygon of thickness w, we have the following by Lassak [Reference Lassak13].
Theorem 3.1 Let
$P\subset H^2$
be an ordinary reduced polygon of thickness w and diameter d. Then,

As a consequence, for each n we can expect an n-gon of extremal area among ordinary reduced n-gons of thickness w by Blaschke’s Selection Theorem. In the remainder of the section, we will discuss the area of hyperbolic reduced n-gons based on the arguments of Lassak [Reference Lassak11] and Liu–Chang–Su [Reference Liu, Chang and Su22].
From now on, P denotes an ordinary reduced n-gon in
$H^2$
whose vertices are
$v_1,\ldots ,v_n$
in cyclic order with respect to the positive orientation. For each i, let
$t_i$
be the orthogonal projection of
$v_i$
on the line through
$v_{i+\frac {n-1}{2}}$
and
$v_{i+\frac {n+1}{2}}$
, where the indices are taken mod n. By definition,
$t_i$
is in the relative interior of
$\left [v_{i+\frac {n-1}{2}},v_{i+\frac {n+1}{2}}\right ]$
, and hence the geodesic segments
$\left [v_i,t_i\right ]$
and
$\left [v_{i+\frac {n+1}{2}},t_{i+\frac {n+1}{2}}\right ]$
intersect in a point
$p_i$
. Let
$B_i$
be the union of the two triangles:

we will call
$B_i$
a butterfly. We observe that these butterflies cover the polygon (see Sagmeister [Reference Sagmeister27]).

Lemma 3.2 Let
$P\subset H^2$
be an ordinary reduced n-gon, and
$B_i$
be its
$i^{\mathrm {th}}$
butterfly. Then,

We introduce a few additional notations for some angles of the butterflies. Let

and

The following lemma from Sagmeister [Reference Sagmeister27] shows that the two triangles involved in the butterfly
$B_i$
are congruent.
Lemma 3.3 The two triangles
$\left [v_i,p_i,t_{i+\frac {n+1}{2}}\right ]$
and
$\left [v_{i+\frac {n+1}{2}},p_i,t_i\right ]$
defining
$B_i$
are congruent.
Another observation from Sagmeister [Reference Sagmeister27] provides an upper bound for the sum of the vertical angles of the butterflies.
Lemma 3.4 For an ordinary reduced n-gon P with the notations from above,

We note that for regular n-gons we have equality in the previous lemma. Also, in the Euclidean plane, the angle sum is always
$\pi $
.
Let
$\beta _i$
be the angle
$\angle \left (v_{i+\frac {n+1}{2}},v_i,p_i\right )=\angle \left (p_i,v_{i+\frac {n+1}{2}},v_i\right )$
. Also, let
$\gamma $
denote half of the inner angle of a regular triangle of minimal width w. We have the following.
Lemma 3.5 Let P be an ordinary reduced n-gon of minimal width w. With the notations introduced above, we have
$\beta _i\leq \gamma \leq \alpha _i$
with equality if and only if P is a regular triangle.
Proof First, we calculate the side length a of the regular triangle in terms of w. By the hyperbolic Pythagorean theorem, we have

The identity

combined with (1) leads to a quadratic equation for
$\cosh \frac {a}{2}$
, whose positive solution is

Now we apply the hyperbolic law of sines for half of the regular triangle:

From the hyperbolic law of cosines applied for the right triangle
$\left [v_i,t_i,v_{i+\frac {n+1}{2}}\right ]$
and also for the half of the regular triangle, we have

We know that
$\beta _i\leq \alpha _i$
(this is Theorem 2 (iii) in Lassak’s paper [Reference Lassak13]), so from (3) we imply

Finally, we observe that

and that the function
$\frac {1-2x^2}{x}$
strictly monotonically decreases. Hence,
$\sin \beta _i\leq \sin \gamma \leq \sin \alpha _i$
, which in turn concludes the proof as all of these angles are acute. The case of equality is clear.
Lassak also proved [Reference Lassak13] the following.
Lemma 3.6 Let D be the diameter of an ordinary reduced n-gon in
$H^2$
. Then, the endpoints of a chord of length D are vertices of the polygon, where if
$v_i$
is one of the endpoints of the chord, the other endpoint is either
$v_{i+\frac {n-1}{2}}$
or
$v_{i+\frac {n+1}{2}}$
.
4 The perimeter of ordinary reduced polygons
With the same method that was used in Sagmeister [Reference Sagmeister27], we can also investigate the extremality of the perimeter. With the notations introduced in the previous sections, let

and

Then, we have the following formula for the perimeter.
Theorem 4.1 Let P be an ordinary reduced n-gon of thickness w described as above. Then,

Proof By the definition of ordinary reduced polygons,
$t_i$
is in the relative interior of the side
$\left [v_{i+\frac {n-1}{2}},v_{i+\frac {n-1}{2}}\right ]$
, so

On the other hand,
$d\left (v_i,t_{i+\frac {n+1}{2}}\right )=d\left (t_i,v_{i+\frac {n+1}{2}}\right )$
by Lemma 3.3, so

If
$b_i=d\left (p_i,t_i\right )$
and
$c_i=d\left (p_i,v_{i+\frac {n+1}{2}}\right )$
,
$\tanh c_i$
can be expressed as

where we refer to Sagmeister [Reference Sagmeister27]. Hence,

Using the identity

and the hyperbolic Pythagorean theorem, we get

concluding the proof.
Now we are ready to prove the following.
Theorem 4.2 The function
$p_w$
is strictly monotonically increasing and strictly convex on the interval
$\left (0,\pi \right )$
.
Proof It is convenient to use the notation
$r_w\left (x\right )=\sqrt {\left (1+\cos x\right )^2-4\tanh ^2 w \cos x}$
, so

and

We deduce

To calculate the second derivative, we use (4) to substitute
$r_w'\left (x\right )$
, and we get to a common denominator. We also write
$\sin x=2\sin \frac {x}{2}$
and
$2\cos ^2\frac {x}{2}=1+\cos x$
. Thus, we obtain

It is not too difficult to verify that this is positive; otherwise we can reorganize
$\cos ^2\frac {x}{2}r_w\left (x\right )+2\cos ^2\frac {x}{2}\cos x-2\tanh ^2 w$
as an inequality that is quadratic in
$\tanh ^2 w$
, and we get that if
$p_w"$
is not positive,
$\tanh ^2 w$
is either negative, or greater than 1, but both are impossible. Hence,
$p_w$
is strictly convex.
The usual argument used on the Euclidean and spherical planes to find the reduced polygon with the minimal perimeter (see Lassak [Reference Lassak12] and Liu–Chang [Reference Liu and Chang21]) uses Jensen’s inequality after deriving a similar formula for the perimeter as in Theorem 4.1. However, if we consider the results of Lemma 3.4 and Theorem 4.2, we find that this approach does not work on the hyperbolic plane. Considering the perimeter of random ordinary reduced polygons given by Theorem 4.1, we have the following conjecture.
Conjecture 4.3 Let
$P\subset H^2$
be an ordinary reduced n-gon of minimal width w. Then,

with equality if and only if P is regular.
We note that contrary to the Euclidean and spherical planes, the perimeter of the regular n-gons of minimal width w is not necessarily monotone in n. Depending on w, even the regular triangle can have a larger perimeter than the circle of the same minimal width.
In a recent work of Chen, Hou, and Jin [Reference Chen, Hou and Jin4], a consequence of the minimality of the perimeter of the regular n-gon of reduced n-gons of minimal width less than
$\frac {\pi }{2}$
on the sphere is that the diameter and the circumradius of reduced spherical n-gons is minimized by the regular ones. Their argument gives the same result on the Euclidean plane. However, as we have seen, on the hyperbolic plane, we do not have the same result on the perimeter of ordinary reduced polygons. We propose the following question regarding the diameter and circumradius of ordinary reduced n-gons.
Question. Is the diameter and the circumradius of the regular n-gon extremal among ordinary reduced n-gons of the same minimal width on the hyperbolic plane?
5 The diameter of ordinary reduced polygons
In this section, we strengthen Lassak’s Theorem 3.1 by using Lemma 3.5 in order to find the infimum of the circumradii of ordinary reduced polygons of a prescribed width. We have the following result.
Theorem 5.1 Let P be an ordinary reduced polygon in
$H^2$
. Then,

with equality if and only if P is a regular triangle.
Proof Lemma 3.6 allows us to assume that
$\operatorname {{\mathrm {diam}}} P=d\left (v_i,v_{i+\frac {n-1}{2}}\right )$
for some i, and we consider the right triangle
$\left [v_i,t_i,v_{i+\frac {n+1}{2}}\right ]$
. Recall the notations
$\alpha _i=\angle \left (t_i,v_{i+\frac {n+1}{2}},t_{i+\frac {n+1}{2}}\right )$
and
$\beta _i=\angle \left (v_{i+\frac {n+1}{2}},v_i,t_i\right )$
, and that
$\angle \left (t_i,v_{i+\frac {n+1}{2}},v_i\right )=\alpha _i+\beta _i$
as a consequence of Lemma 3.3. Since
$d\left (v_i,t_i\right )=w$
, we get

from the hyperbolic law of sines, and using the inequality
$\alpha _i\geq \beta _i$
(cf. Lassak [Reference Lassak13]), the monotonicity of the
$\sin $
function on the interval
$\left (0,\frac {\pi }{2}\right )$
and the identity
$\sin 2x=2\sin x\cos x$
. From Lemma 3.5, we also have
$\beta _i\leq \gamma $
where
$\gamma $
denotes half the angle of a regular triangle of minimal width w, so we obtain

from (5). Now we use (6) and the identity
$\cosh ^2 x-\sinh ^2 x=1$
to obtain

We now use the hyperbolic Pythagorean theorem with the assumption
$d\left (v_i,v_{i+\frac {n+1}{2}}\right )=\operatorname {{\mathrm {diam}}} P$
:

Clearly, from the equality case of Lemma 3.5 we imply that equality holds if and only if P is a regular triangle. On the other hand, if P is a regular triangle centered at p, in the right triangle
$\left [p,t_1,v_3\right ]$
, the angles are
$\frac {\pi }{3}$
,
$\frac {\pi }{2}$
and
$\gamma $
, respectively, while the length of leg opposite to the
$\frac {\pi }{3}$
angle is
$\frac {\operatorname {{\mathrm {diam}}} P}{2}$
, so using the well-know identity
$\cosh b=\frac {\cos B}{\sin A}$
for hyperbolic right triangles of acute angles A and B and legs a and b respectively, we obtain

This together with (7) gives

Finally, (2) concludes the proof.
From this sharp upper bound we can see that Lassak’s following conjecture is true.
Corollary 5.2 Let P be an ordinary reduced polygon in
$H^2$
. Then,

Proof The first inequality trivially holds as
$\operatorname {{\mathrm {diam}}} P$
is the maximal width of P, and equality holds exactly for bodies of constant width, which are h-convex, so no polygon is of constant width (see Böröczky, Csépai, and Sagmeister [Reference Böröczky, Csépai and Sagmeister2] for further details).
The second inequality is an easy consequence of Theorem 1.1 and the strict monotonicity of
$\cosh $
for
$w>0$
.
We can also observe, that both of these constant bounds are the optimal ones: on one hand, regular
$\left (2k+1\right )$
-gons are ordinary reduced polygons that approximate a disk as
$k\to \infty $
, while on the other hand we also have

6 The circumradius of ordinary reduced polygons
Now we answer another question of Lassak proposed in [Reference Lassak13] with the following upper bound for the circumradius.
Theorem 6.1 Let P be an ordinary reduced polygon in
$H^2$
of width w. Then,

with equality if and only if P is a regular triangle.
Proof The hyperbolic Jung theorem (see Dekster [Reference Dekster5]) says that

Theorem 1.1, and the identity

concludes the proof. The case of the equality is clear form the equality case of Theorem 1.1.
As a consequence, we have the following.
Corollary 6.2 Let P be an ordinary reduced polygon in the hyperbolic plane. Then,

Proof The first inequality follows from the monotonicity of the minimal width: the minimal width of the circumcircle is
$2R\left (P\right )$
, but the circumcircle is reduced, so
$w<2R\left (P\right )$
.
The second inequality is equivalent with

After taking the square of both sides, and applying the identity
$\sinh ^2 x=\cosh ^2 x-1$
, the inequality we want to verify takes the form

With a few simple steps, we can reorganize this inequality as

which clearly holds.
Let us observe that these constants provide the best possible bounds for the ratio of the circumradius and the minimal width. The sharpness of the first inequality comes from considering a convergent sequence
$P_k$
of regular
$\left (2k+1\right )$
-gons of minimal width w, whose limit is a disk of width w and radius
$2w$
. As for the second inequality, we can see that

In the Euclidean plane, Fabińska [Reference Fabińska6] proved that for an arbitrary reduced polygon of width w there is some boundary point, such that the circular disk of radius w centered at that boundary point covers the disk. Musielak [Reference Musielak25] showed that the same holds for spherical reduced polygons. The remainder of this section is dedicated to the proof of the same statement for ordinary reduced polygons in the hyperbolic plane. In most of the steps we can repeat Musielak’s spherical argument, but we also apply a few minor adjustments. First, we will need a few lemmas.
Lemma 6.3 For a compact set
$X\subseteq H^n$
and a point
$z\in \operatorname {{\mathrm {conv}}} X$
, we have

for any positive radius r.
Proof If
$z\in X$
, the statement trivially holds, so we assume
$z\in \operatorname {{\mathrm {conv}}} X\setminus X$
. If we consider the Beltrami–Cayley–Klein model, Euclidean and hyperbolic lie segments coincide, so it is easy to see that Minkowski’s theorem holds, that is,
$\operatorname {{\mathrm {conv}}} X=\operatorname {{\mathrm {conv}}} E\left (X\right )$
where
$E\left (X\right )$
denotes the extreme points of
$\operatorname {{\mathrm {conv}}} X$
We also have
$E\left (X\right )\subseteq X$
, so clearly it is sufficient to prove

for some set
$E\subseteq E\left (X\right )$
.
Considering again the linearity preserving properties of the Beltrami–Cayley–Klein model, by Carathéodory’s theorem there are
$k\leq n+1$
points
$e_1,\ldots ,e_k$
in
$E\left (X\right )$
such that
$z\in \left [e_1,\ldots ,e_k\right ]$
. Naturally, we can assume that
$\bigcap _{i=1}^k B\left (e_i,r\right )$
is not empty, otherwise the statement is trivial.
It is easy to see that for a compact set Y, the function
$d\left (y,\,\cdot \,\right )$
restricted to Y attains its maximum for some point
$e\in E\left (Y\right )$
. Therefore, if we choose some point
$y\in \bigcap _{i=1}^k B\left (e_i,r\right )$
, and we set
$Y=\left \{e_1,\ldots ,e_k,z\right \}$
, then

so
$y\in B\left (z,r\right )$
, and that concludes the proof.
For a convex body
$K\subset H^n$
and a positive number r, let us introduce the notation
$C\left (K,r\right )$
for the set of centers such that the closed balls of radius r centered at points in this set contain K, i.e.,

Musielak’s following spherical characterization [Reference Musielak25] still holds in
$H^n$
. We will omit the proof, as his argument only uses metric considerations, and hence it remains true in
$H^n$
.
Lemma 6.4 For a convex body
$K\subset H^n$
and a positive number r,

Similarly, the following lemma of Musielak [Reference Musielak25] remains true in the hyperbolic plane as well. His inductive proof can be repeated to the letter, as hyperbolic balls of radius r are also r-spindle convex (e.g., this is a trivial corollary of Theorem 1.2 in Böröczky, Csépai, and Sagmeister [Reference Böröczky, Csépai and Sagmeister2]).
Lemma 6.5 If
$K\subset H^n$
is a convex body obtained as the intersection of finitely many circular disks of radius r, then the boundary of K is the union of finitely many shorter circular arcs of radius r such that they all have different centers.
For a convex body K, we also introduce the notation
$E^*\left (K\right )$
as

where
$\partial X$
stands for the boundary of X and
$\left |X\right |$
for its cardinality. Then, from Lemmas 6.4 and 6.5 we can immediately derive the following.
Corollary 6.6 Let
$P\subset H^2$
be a convex polygon. Then,

Finally, we have all the tools to prove the following.
Theorem 6.7 Let
$P\in H^2$
be an ordinary reduced polygon of minimal width w. Then, there is a boundary point
$z\in \partial P$
, such that
$P\subset B\left (z,w\right )$
.
Proof Assuming that P is an n-gon, we use the same notations as in Section 3. We consider the set
$C\left (P,w\right )$
, and we aim to show that the intersection
$C\left (P,w\right )\cap \partial P$
is not empty. We prove this by contradiction.
Corollary 6.2 and the hyperbolic Jung theorem (cf. Dekster [Reference Dekster5]) implies that
$C\left (P,w\right )$
intersects the interior of P. If
$C\left (P,w\right )$
also contains some point in the exterior of P, then the proof is complete by the convexity of
$C\left (P,w\right )$
(see Lemma 6.4). So let us assume that
$C\left (P,w\right )$
is a subset of the interior of P.
Let
$e_1,\ldots ,e_m$
be the points of
$E^*\left (P\right )$
in a positive orientation, where we understand the indices modulo m. By the assumption that
$C\left (P,w\right )$
lies in the interior of P, it is easy to see from the definition of ordinary reduced polygons that
$3\leq m\leq n$
. By Lemma 6.5, to each vertex
$e_i$
in
$E^*\left (P\right )$
, there is a shorter circular arc
$\mathcal {C}_i$
of
$B\left (e_i,r\right )$
on the boundary. Let
$q_i$
be the intersection of
$\mathcal {C}_i$
and
$\mathcal {C}_{i+1}$
. Lemma 6.5 and Corollary 6.6 implies that the boundary of
$C\left (P,w\right )$
is the union of short circular arcs of radius r connecting
$q_i$
and
$q_{i+1}$
for
$1\leq i\leq m$
; let us denote these arcs by
.
Each point
$e_i$
of
$E^*\left (P\right )$
is a vertex
$v_{\sigma \left (i\right )}$
for an injective map
$\sigma \colon \left \{1,\ldots ,m\right \}\to \left \{1,\ldots ,n\right \}$
. We set
$s_i=t_{\sigma \left (i\right )}$
for
$i\in \left \{1,\ldots ,m\right \}$
. By our assumption,
$s_i\in \partial B\left (e_i,r\right )$
is not in
$C\left (P,w\right )$
, and hence it is not contained in the arc
.
Clearly, the points
$e_1$
,
$q_2$
and
$s_1$
are not collinear, since
$B\left (e_1,w\right )\supset P$
, both
$q_2$
and
$s_1$
are boundary points of the circle
$B\left (e_1,w\right )$
, on the other hand, while
$s_1$
is a boundary point of P,
$q_2$
lies in the interior. Hence,
$s_1$
is either in the same open hemisphere bound by the line through
$e_1$
and
$q_2$
as
$q_3$
, or as
$q_m$
(or equivalently as
$e_2$
). By symmetry, we can assume without loss of generality that the first case occurs.
We also consider a diametral chord
$\left [x,y\right ]$
of P. We note that
$x=v_i$
and
$y=v_{i+\frac {n\pm 1}{2}}$
for some
$1\leq i\leq n$
where in this case the indices are understood modulo n (cf. Lassak [Reference Lassak13]). Let
$x'$
and
$y'$
be the orthogonal projections of x and y to the opposite sides, respectively (i.e.,
$x'=t_i$
and
$y'=t_{i+\frac {n\pm 1}{2}}$
). Let
$m_1$
be the midpoint of
$\left [x,y'\right ]$
and
$m_2$
be the midpoint of
$\left [x',y\right ]$
. Then, if we consider the boundary of P, one of the triples
$\left (x,m_1,y'\right )$
and
$\left (x',m_2,y\right )$
are on the boundary in this order with the same orientation, we assume without loss of generality that this is the positive orientation.
We can also assume that the triple
$\left (e_1,x,e_2\right )$
are on the boundary of P in this order with respect to the positive orientation, where we allow the case
$x=e_1$
. This implies that
$\left (s_1,x',s_2\right )$
also have the same order in the positive orientation, as all chords
$\left [v_i,t_i\right ]$
half the perimeter (see Lassak [Reference Lassak13] or Sagmeister [Reference Sagmeister27]).
By our assumption that
$C\left (P,w\right )$
is in the interior of P, so
$x'$
is not contained in
$B\left (e_k,r\right )$
for some
$2\leq k\leq m$
(by the assumption on the position of
$p_3$
and
$s_1$
, we deduce
$d\left (e_1,x'\right )\leq d\left (x,x'\right )=w$
). We can also observe that there is such
$e_k$
on the opposite half-plane of the line through
$e_1$
and
$p_2$
as
$x'$
. Let z be the interior point of the segment
$\left [x',e_k\right ]$
such that
$d\left (x',z\right )=d\left (x',x\right )=w$
. In particular,
$z\in P$
. Considering the two triangles
$\left [z,x',y\right ]$
and
$\left [x,x',y\right ]$
, they have two equal sides with different enclosed angle. This implies

which is clearly a contradiction.