Shigeki Akiyama and Teturo Kamae
Institute of Mathematics, University of Tsukuba (akiyama@math.tsukuba.ac.jp)Advanced Mathematical Institute, Osaka City University (kamae@apost.plala.or.jp)
Abstract
We consider the
width of a convex -gon in the plane along the random direction
and study its deviation rate:
We prove that the maximum is attained if and only if
degenerates to a -gon.
Let be an integer which is not a power of .
We show that
is the minimum of among all -gons and determine completely the shapes of ’s which attain this minimum.
They are characterized as polygonal approximations
of equi-Reuleaux bodies, found and studied by K. Reinhardt [9].
In particular, if is odd, then the
regular -gon is one of the minimum shapes.
When is even, we see that regular -gon is far from optimal.
We also observe an unexpected property of the deviation rate on the truncation of the regular triangle.
1 Introduction
The width of an image along various directions is basic information in the
Image Processing Technique. We are interested in the deviation of the
widths of compact convex sets in the plane along a random direction.
Although it is an important and useful quantity both practically and theoretically,
as long as we know, there is no serious study on it.
Figure 1:
Let and be the normalized
Lebesgue measure on .
Consider the probability space ; we write for short.
Let a compact convex set in the complex plane be given.
We identify with its boundary.
We discuss the length of the orthogonally projected shadow of
by the light from a random direction , say .
It is also interpreted as the width of along the orthogonal direction of ,
that is, .
We are interested in the uniformity (or its contrary) of the deviation of
with respect to .
For this purpose, we consider the deviation rate of the random variable ,
say , defined by
(1)
where is the expectation of the random variables.
Clearly, is invariant among the similarity images of .
It is also clear that if and only if is a closed curve of constant
width (c.f. [5]). Hence, measures the degree how far is from convex bodies of constant width.
For the ellipse
with the perimeter , it is not difficult
to see that
In this paper, we study the deviation rate of the
convex -gons with . We decompose as the sum
of random variables coming from its edges, say
.
Throughout this paper, the branch of the argument of a complex number is chosen to be .
For a complex number with , define a random
variable on by
where . In other words,
is the length of the orthogonally
projected shadow of the right side of the vector
by the light from the direction (the left side of the vector is permeable and
makes no shadow).
Let be a sequence of distinct complex
numbers. They are arranged in the counter clockwise order forming a convex -gon
if and only if
where we always consider the suffix related to the -gon
in modulo , so that , etc.
In this case, the convex -gon with vertices
is denoted by .
The above is non-degenerate (i.e. all
the vertices are extremal points) if and only if “” holds everywhere
in the above inequalities. If this is not the case, then we identify
with ,
where
are the set of extremal points among arranged in the
counter clockwise order.
Define a random variable by
which agrees with the former explanation as to the length of the shadow of (see Figure 1).
The set of convex -gons can be identified
with the sequence of distinct complex numbers
satisfying . We denote the space consisting of these
by . We consider the
usual structures coming from on .
Then, is considered as the boundary of
in the above sense.
Denote the factor space of divided by the similarity equivalence
by . Then it is a compact space.
Most of our notions like the regular -gon are notions in
rather than . The deviation rate
can be considered as a continuous and piecewise smooth functional on .
Hence, it has the minimum and the maximum in .
It turned out that
the solution of the minimization problem of is related to
the convex bodies of constant width.
A Reuleaux body111In literature, it is often referred to Reuleaux ”polygon”,
though its boundary is not linear.
In this paper, we use the word ”body” to distinguish it from a genuine polygon. is
a convex body of constant width whose boundary consists of a finite number of circular arcs with the center in it and the radius equal to the width.
The reader can consult [5, 6], but for
the self-containedness, we review the Reuleaux body here briefly.
Let be a Reuleaux body with width . Then, consists of
a finite number of circular arcs, say , of radius .
The endpoints of the circular arcs are called essential if the 2 neighboring circular
arcs have different centers, and hence cannot be joined into a single circular arc.
We assume that the circular arcs are arranged in the
counter clockwise order and all the endpoints are essential.
Let be the endpoints of ; be the endpoints of ,
; be the endpoints of (the suffices of or are
considered modulo so that ).
Note that a center of any one of
the circular arcs is an essential endpoint of some other circular arcs on ,
since otherwise, we have 2 points in with a distance larger than .
Conversely
any endpoint is a center of some circular arc since
there must be the same number of circular arcs and centers.
Hence, the center of is one of . Let it be .
Since is strictly convex, the tangent vector of at
to the counter clockwise direction rotates counter clockwise as moves.
The center of the circular arc containing is the other intersection of the
normal line to the tangent vector at with . This intersection moves at the endpoints of the circular arcs to the counter clockwise direction since the normal lines from the same point rotate to the counter clockwise direction. Hence, the center
of this circular arc is the next end point to that before.
This means that the center of is , the center of is ,
.
On the other hand, the center of the circular arc must be since
otherwise, either it is or there is such that
. The latter is impossible since if so, by the convexity and the assumption on , the circular arc can be extended to contradicting
the assumption that both and are essential end points. The former is impossible since if so, then we have a contradiction that .
Thus, we have
and hence, . This implies that is odd.
Consider the diagonals connecting 2 points in , one of the center and
an interior point of the circular arc centered by it. Any of 2 diagonals with different
centers always intersect just at one point.
Let be the set of angles from to the points in the circular arc
centered by . We always consider the angles in modulo .
Then, by the above argument, and with
are essentially disjoint. The same thing holds for and .
Let . Then, the union is essentially disjoint.
Moreover, and is also essentially disjoint.
It also holds that .
This is because the Lebesgue measure of is , since
the integration of the exterior angle of is , which counts the
angles in twice, once at , once at its center,
where the exterior angle jumps just the amount of angles in .
Thus, it holds that the circular arcs can be embedded by parallel
translations by
into a circle of radius so that
satisfies that
(2)
where is the rotation on by angle , and “” implies the number
of elements in a set.
We write a Reuleaux -body to indicate the number of circular
arcs with different centers. In particular, a Reuleaux -body is called
regular if all the circular arcs have the same length. A regular Reuleaux 3-body
is well known as “Reuleaux triangle”.
A Reinhardt -gon ([3], [9]) is an equilateral convex
-gon that can be inscribed in a Reuleaux body, containing all the essential
endpoints of the circular arcs.
It is referred to as a Reinhalt polygon
if is not necessarily specified.
If the lengths of the circular arcs of a Reuleaux -body
have ratio with integer ’s,
we can divide the circular arcs into parts of equal length
and take the convex-hull of all the division points to get a Reinhardt -gon,
where , which is specially called a Reinhardt -gon.
In particular, let be an odd integer and take a regular Reuleaux
-body .
We divide all the circular arcs of into parts of equal length.
Then, the convex hull of all the division points forms a Reinhardt -gon,
which is specially a Reinhardt -gon,
see Figure 2. Denote for short.
Note that Reinhardt -gon is the regular
-gon.
Figure 2: Reinhardt -gon for
A Reinhardt polygon gives the solution of three optimization problems
on convex -gons when is not a power of :
Given a cyclic integer vector , there exists a unique way
to construct a Reinhardt -gon when this is possible.
We reproduce a necessary and sufficient condition of Reinhardt [9]
that a given integer
cyclic vector
forms a Reinhardt -gon as a byproduct of our result
(Theorem 6 and 7). In particular,
when is not a power of , we have
a Reinhardt -gon
for any odd divisor .
Many interesting properties on Reinhardt polygons
are discussed in [6, 7, 3, 4].
When is odd, the regular -gon is one of the Reinhardt polygons but it is not unique when is a composite. Reinhardt -gon
is unique if and only if or with a prime .
A Reinhardt polygon may have no symmetry at all (see Figures in [3]).
In this paper, we prove the following results.
(1) The deviation rate for the compact convex sets attains the maximum
if and only if is the 2-gon (Theorem 2).
(2) For the integer which is not a power of ,
the minimum of for is
(3)
Theorem 6 gives a complete characterization of
the shapes that attain the minimum value .
As a consequence, we show that the minimum shape is nothing but
a Reinhardt -gon (Theorem 7).
The minimum values for odd is strictly decreasing in .
(3) For even , regular -gon is far from the minimum shape.
Let be the odd number such that either
or . If , then
holds,
and if , then holds, where
are the regular -gon and -gon, respectively
(Theorem 4).
Figure 3: parallel truncation (left) and non-parallel truncation (right)
(4) Let be the regular triangle. We call a truncation of it a quadrangle obtained
by cutting off a vertex by a line near it. It is called a parallel truncation if
the line is parallel to the opposite side, otherwise a non-parallel truncation
(Figure 3). We prove that a parallel truncation of the regular triangle increases the deviation rate, while a non-parallel truncation decreases it (Theorem 8).
2 Maximum of the deviation rate
Theorem 1.
For any with ,
the following statements hold:
,
,
where is a periodic function of period such that
Figure 4: Function
Proof Let . Then, we have
We have
Therefore, if , then
If , then
Theorem 2.
The maximum of for the compact convex sets
is attained by a -gon.
Proof Since all 2-gons are similar, they have the same -value.
Let be a 2-gon. Then by Theorem 1, we have
Hence, .
Take any convex polygon .
We prove that , and that
the equality holds only when is 2-gon. Let
and let satisfies that
It is sufficient to prove that
.
Hence, it is sufficient to
prove that .
Then by Theorem 1, we have
Since is the inner product between
and , we have
This implies that in the above equality , the constant in the coefficient
of can be changed anyway keeping the equality. Hence, we have
Thus, to prove , it is sufficient to prove that
for any , which can be verified easily.
Moreover, the equality holds if and only if or , which implies
that is 2-gon.
For a general compact convex set with ,
replacing the above by
where is the angle between the tangent lines of at and ,
we have the same statement, which completes the proof.
3 Symmetrization and asymmetrization of -gons
Let
be the upper half plane endowed with the quotient topology of by identifying and . For , we define
For a finite set of nonzero complex numbers ,
define
by
where is the set of complex numbers
obtained by replacing any of with
by .
A nonzero element in is sometimes called a pre-edge.
A sequence of pre-edges , say
is called a pre-edge bundle
(of size ) if
Denote by the set of pre-edge bundles of size .
For a convex -gon , we define
its asymmetrization as the pre-edge bundle
such that
In this case, is called a realization of .
Let be a convex -gon and
be its asymmetrization. Then,
is another realization of than , where
.
We call the symmetrization of (or ).
In this case, is symmetric, that is,
with even size and
holds. For a symmetric , it holds that
(4)
This representation of is called the diagonal representation.
Figure 5: (left), (center) and (right)
Example 1.
Let . Then, its asymmetrization is
and its symmetrization is
See Figure 3.
Let be a pre-edge with .
Define a random variable as
and for a pre-edge bundle , let
.
Theorem 3.
If is a realization of , then we have .
Proof Since is a convex polygon, we have
for any . Hence,
4 Minimum of deviation rate among the pre-edge bundles of fixed size
A regular -gon is denoted by .
A pre-edge bundle is said to be regular if
Theorem 4.
It holds that
for , and hence,
.
If is even, then let be the odd number such that either
or .
If , then holds,
and if , then
holds.
Proof
holds since both of and are realizations of if
is odd, and by Theorem 3. If , then by the monotonicity
in , .
By Theorem 3, to prove , it is sufficient to prove that
for .
Using the diagonal representation (4), we have
Hence,
Let and be the term inside the root in the above formula.
Then, we have
We show that is an increasing function of .
We have
Since
which is positive on .
Thus, is strictly increasing in , and hence, is strictly
decreasing in .
By a numerical calculation, we have as follows.
Theorem 5.
The deviation rate attains the minimum among
if and only if .
Proof We use the induction on . If , the statement is clear since
is essentially the only element in .
Let and assume that the statement holds for
. The boundary of the closure of consists of
, and the -values there are
larger than since the assumption of the induction and
Theorem 4. Hence, there is attaining the minimum of
in . We prove that .
For this purpose, we take the
symmetrization of . Then,
is minimum among for symmetric . This is equivalent
to say that is minimum among for symmetric
, where .
We’ll conclude from this that is the regular -gon.
Let .
Consider the diagonal representation (4) of .
Then, for any , we have
where
For a fixed and a real number near 0, let
By the minimality, we must have
.
Let
Then, we have
Therefore, we have
and hence,
Denoting
it holds that
Figure 6:
For , let
Then, the above and have another representation (see Figure 6) that
(5)
and we have
(6)
For a fixed and a real number near 0, let
Then, we have
where
Therefore, we have
and hence, either or .
If holds, then
by (6), we have
Hence,
Since and if , then ,
we have a contradiction that .
Therefore, and
the exterior angle of is larger than . By the symmetry,
the exterior angle of for is smaller than .
Therefore, for these , is impossible, and hence,
holds. Thus, . This implies
for any .
Any case, we have except for .
This implies that there are 2 classes
By symmetry, the values of these 2 classes coincide.
Thus, , which implies that
has a inscribed circle with radius . Hence,
.
Then by (6),
It follows from this that is the same for .
Since the correspondence for is one-to-one,
we have . Thus, has the same exterior angle
at vertex for . Together with that has a inscribed circle,
is a regular -gon, which completes the proof.
5 Minimum of deviation rate among -gons
Lemma 2.
If , then the set
is empty if and only if is a power of .
Proof If is not a power of , then take an odd factor of .
Denote as
Given arbitrary, define
Then, we have
Therefore contains a non-empty subset
with . Thus we see that is non-empty.
Next assume that with . Since
is the minimum polynomial of ,
cannot be 0 for any .
Hence, .
Theorem 6.
Let be an integer which is not a power of . Then we have
The minimum is attained if and only if the asymmetrization of is ,
and hence, if and only if is similar to the
polygon with
Proof In light of Theorem 5,
attains the minimum of
among if is a realization of the pre-edge bundle .
A realization of , say , may have more than edges
but this number is reduced to if and only if there exists a one-to-one correspondence between the set of pre-edges
of and the set of edges of ,
i.e., there exists
such that
is the set of edges of .
Since we may assume for ,
this condition is satisfied if and only if
(7)
is solvable in , i.e. is non-empty.
Hereafter is always assumed to be an integer which is not a power of .
There is a natural map and from to itself defined by
and
which corresponds to the symmetry of dihedral group :
the rotation of angle and the reflexion.
Two elements and
of give congruent realizations if and only if
or
for some .
Lemma 2 and Theorem 6 can be restated in a geometric form.
Theorem 7.
If is not a power of , then the minimum polygon in is a Reinhardt -gon and vice versa.
A Reinhardt -gon exists if and only if is not a power of .
Though it is not stated in this manner, the latter statement follows from the characterization of Reinhardt [9], see the discussion after the proof.
Proof Assume that is not a power of .
By Theorem 6, the minimum -polygon can be considered, without
generality, to have the asymmetrization
for some appropriate , so that its symmetrization is
Let .
Since and by (4), is a periodic function of period such that if with
,
Therefore, for repeats its maximum 2 and
its minimum , times.
Since has the asymmetrization of the same size , there are no parallel edges
in . Hence, the endpoints of the minimum shadow of ,
say at come from a vertex, say ,
and an edge, say . Those of the 2 neighboring maximum shadows come
from the vertices and from the vertices , respectively.
Hence,
holds. Replace the edge by the circular arc centered at
having the endpoints at and . Repeating this replacement
for , we get a convex body of constant width.
It is easy to see that this convex body is a Reuleaux -body for
some . Hence, is a Reinhardt -gon.
We prove the converse.
Let be a Reinhardt -gon coming from a Reuleaux
-body of width .
By (2), we can rearrange the circular arc of by parallel translations
into a circle of radius so that the circular arcs are essentially
disjoint and cover just a half part of , and by the rotation of
angle , they moved to the other half part of . The edges of
correspond to the chord of the circular arcs. By the above property,
it is easy to see that the asymmetrization of is a regular
pre-edge bundle of size . Hence, and is
the minimum polygon.
The “if” part of the last statement follows from the first part.
To prove the “only if” part,
suppose that a Reinhardt -polygon exists for .
Then by the above argument, has the asymmetrization which
has a realization of the same size. This contradicts Lemma 2.
Let us describe the correspondence between
and cyclic integer vector.
Choose that
with .
Count number of runs of
and in , i.e.,
we write like or . Then is the desired cyclic vector.
For the converse direction, we choose either
or .
Reinhardt [9] gave an alternative
characterization of the cyclic vector with :
it is a cyclic vector if and only if
is odd and the polynomial
is divisible by , the -th cyclotomic polynomial. For completeness, we show that this characterization is equivalent to ours.
As above, we assume that .
From (7) we have
We consider that is a variable and
multiply . Then we see
(8)
Dividing by , we see the condition of Reinhardt. To get the converse, we just go backwards. Note that the polynomial (8)
is divisible by as is odd. By Lemma 2, the second statement of Theorem 7 is derived from the Reinhardt criterion.
The subset in the proof of Lemma 2
corresponds to -fold rotational symmetry. We can find
Reinhardt polygons without
any symmetry [3, 4].
6 Truncation of the regular triangle
Let be general -valued, square integrable random variables on the
probability space . Assume further that everywhere and
. Recall that
It holds for any with sufficiently small modulus that
If , then we have
Hence, the following Lemma holds.
Lemma 3.
if and only if
, respectively.
Assume that “” holds in . Then, there exists
such that
for any if
, respectively.
Proof follows since
follows since is a monotone increasing function of .
Lemma 4.
Let and be triangles in . Then, (a.s.)
holds if and only if there exists such that either or
.
Proof holds since they have the same asymmetrization. Hence, the “if” part holds.
Let us prove the “only if” part. Let .
Consider as a function of .
Then, it is locally minimal if and only if is equal to either of
modulo . If (a.s.), then they should have the same set of
as this. Also, at any of these , they should have the same height. This implies
that either or for some .
Lemma 5.
Let and be triangles in . Then,
The equality holds if and only if there exist and such that
either or .
Proof This is the Cauchy-Schwartz inequality for
the inner product .
The equality holds if and only if there exists
such that (a.s.).
Hence, by Lemma 4, if and only if or
for some .
Lemma 6.
Let be a regular triangle.
Let . Then,
The equality holds if and only if is parallel to
one of the edges of , that is, is equal to one of
modulo .
Proof Without loss of generality, we assume that the length of the edges of is 1.
It holds that for any
with .
Moreover, since , we have
Hence,
with the regular triangle .
Therefore by Lemma 5,
The equality holds if and only if is parallel to
one of the edges of . Thus, we have
with the equality if and only if is parallel to one of the edges of .
Theorem 8.
A parallel truncation of the regular triangle increases the deviation rate, while
a non-parallel truncation decreases it.
Parallel truncation:
Let be a regular triangle of the edge length 1.
We also assume that it is of the counter clockwise order.
Let be sufficiently small. Let
Let
be a parallel truncation of at .
Then, we have
with ,
where we denote .
Since , we have by Lemma 6,
and hence,
Now, we prove that
so that for sufficiently small by Lemma 3.
We have
and complete the proof that for sufficiently small
in the case of parallel truncation.
Non-parallel truncation:
Let be a regular triangle of the edge length 1.
We also assume that it is of the counter clockwise order.
Let and be sufficiently small. Let
Let
be a non-parallel truncation of at .
Then, we have
When is a power of , the method in this paper
does not apply because by Lemma 2,
there is no -gon realization of the regular pre-edge bundle .
The case may be of special interest.
Figure 7: Left: -minimum, Center: Problem 1 & 2, Right: Problem 3
By numerical calculation, a possible
minimum of in is attained by the
kite-shape with vertices
having the deviation rate .
This is not a solution to any of three optimization problems for
in the introduction.
See Figure 7 for a comparison of solutions having the same horizontal width.
Indeed from , we see that this shape is not optimal for Problems 1 and 2. The optimizers for these problems are the same, which is
based on the regular triangle with an additional vertex similar to the
construction of
Reinhardt polygon, see [6, 2]. The kite is not optimal for Problem 3 either.
Indeed [1]
showed that the maximum width of quadrangles with the unit perimeter is
close to , possibly attained by
while the kite shape gives the value 0.288. For Problem 1,2 and 3, the solutions have algebraic expressions. We do not know if our kite has such an algebraic expression.
In the next paper, we will discuss the minimality of -values and
the minimal shapes under all infinitesimal deformations
including the cases when is a power of .
References
[1]
C. Audet, P. Hansen, F. Messine, Isoperimetric polygons of maximum width. Discrete Comput. Geom. 41(1), 45–60 (2009)
[2]
A. Bezdek, F. Fodor, On convex polygons of maximal width. Arch. Math. (Basel) 74(1), 75–80 (2000)
[3]
K. G. Hare, M. J. Mossinghoff, Sporadic Reinhardt Polygons, Discrete Comp. Geom.
49, 540-557 (2013)
[4]
K. G. Hare, M. J. Mossinghoff,
Most Reinhardt polygons are sporadic. Geom. Dedicata 198 (2019), 1–18.
[5]
H. Martini, L. Montejano, D. Oliveros,
Bodies of constant width.
An introduction to convex geometry with applications. Birkhäuser/Springer, Cham, 2019. xi+486 pp.
[6]
M. J. Mossinghoff, A $1 problem,
Amer. Math. Monthly 113 (2006), no. 5, 385–402.
[7]
M. J. Mossinghoff, Enumerating isodiametric and isoperimetric polygons,
Journal of Combinatorial Theory, Series A 118 (2011) 1801–1815.
[8]
H. Rademacher, O. Toeplitz,
The enjoyment of math, Princeton Science Library. Princeton University Press, Princeton, NJ, 1994. iv+205 pp. ISBN: 0-691-02351-4
[9]
Von K. Reinhardt, Extremale Polygone gegebenen Durchmessers, Jahresber. Deutsh. Math.
Verein. 31, 251-270 (1922)