Minimal area conics in the elliptic plane
Abstract.
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient conditions on the enclosed set that guarantee uniqueness without restrictions on the enclosing conics. Similar results are formulated for minimal enclosing conics of line sets as well.
Key words and phrases:
Minimal conic, sphero-conic, spherical ellipse, covering cone, elliptic geometry, spherical geometry, enclosing conic, uniqueness2010 Mathematics Subject Classification:
52A40; 52A55, 51M101. Introduction
It is well know that every compact subset of the Euclidean plane with inner points can be enclosed by a unique ellipse of minimal area. More generally, every compact subset of -dimensional Euclidean space with inner points defines a unique enclosing ellipsoid of minimal volume (see [2, 3] for the case and [8, 4] for general ).
These uniqueness results are generally considered as “easy”. The reason for the existence of simple proofs are illuminated by recent publications of the authors [15, 16]. We showed that numerous uniqueness results in Euclidean spaces are a consequence of a simple convexity property of the function that measures the ellipsoid’s size. Most notably, minimal enclosing ellipsoids with respect to quermass integrals are unique (see also [6, 7]).
In the present article we establish first uniqueness results in the elliptic plane. We provide sufficient conditions on the enclosed set that guarantee uniqueness of the minimal enclosing conic. To the best of our knowledge, these are the first uniqueness results in a non-Euclidean geometry. This is maybe the case because our uniqueness results are not easy in the sense described above. While uniqueness in the co-axial and concentric case can still be deduced from a convexity property of the area function, uniqueness in the general case requires extra work. The necessary calculations are rather involved and constitute the largest part of this article.
We mostly use the spherical model of the elliptic plane. It is easily obtained from the bundle model whose “points” are the one-dimensional subspaces of the vector space . The distance of two points in the bundle model is defined as the Euclidean angle between lines and is a bi-valued function. The straight lines in the bundle model are the two-dimensional subspaces. Their angle is the usual Euclidean angle.
In this setting, computational aspects of the minimal circular cone problem (where uniqueness is elementary) have already attracted the attention of applied mathematicians [12, 1]. We believe that the applications mentioned in [1] could profit from using minimal enclosing conics (or cones of second degree) instead of circles (or right circular cones).
The spherical model of the elliptic plane is obtained by intersecting the bundle model with the unit sphere . The metric is inherited from the ambient Euclidean space and the only difference to spherical geometry is the identification of antipodal points. This is merely a technical issue so that our uniqueness results can also be formulated for sphero-conics.
We continue this article by an introduction to conics in the elliptic plane. In Section 3 we derive some convexity properties of their area function which are used in Section 4.1 for proving uniqueness in the co-axial and concentric case. The general uniqueness result is presented in Section 4.2. In Section 5 we derive uniqueness results for minimal enclosing conics of line-sets, analogous to those of [14]. The duality between points and lines in the elliptic plane makes them simple corollaries. Most auxiliary results are collected in an appendix.
2. Preliminaries
A conic in the spherical model of the elliptic plane is the intersection of the unit sphere with a quadratic cone whose vertex is the center of :
(1) |
where is an indefinite symmetric matrix of full rank. Since proportional matrices describe the same conic, it is no loss of generality to assume that has eigenvalues and . Then the interior of the conic consists of all points that fulfill the inequality .

The transformation group of elliptic geometry is the rotation group . Thus, the matrix has the normal form
(2) |
where , . The values and are the conic’s semi-axis lengths (Figure 1).
Generally, the three points , , and are called the centers of . Any line through one of them is a diameter since its intersection points with the conic are at equal (possibly complex) distance to the center. Among the three centers the point is distinguished by the fact that it lies in the interior of . It has also a special meaning in the context of minimal enclosing conics so that we use the word center exclusively for the point . The three lines spanned by any two of the points , , and are lines of symmetry and are often called axes. We reserve this term for the two lines and . If , we call the major axis and the minor axis.
Note that elliptic geometry does not distinguish between different types of regular conics apart from circles and non-circular (general) conics. Indeed, the point set (1) satisfies the well-known focal definitions of both, ellipses and hyperbolas. This is possible because the distance in the elliptic plane is bi-valued.
If is not in normal form, semi-axis lengths, center, and axes can be obtained from the eigenvalues and eigenvectors of . Denote the vector of eigenvalues of , arranged in decreasing order, by ,
(3) |
and the corresponding eigenvectors by , , and . The function
(4) |
computes the tangents and of the semi-axis lengths and . The vector points to the center of . If , the conic is not a circle, the major axis exists and is incident with .
3. The area of a conic in the elliptic plane
Now we derive some properties of the area function of conics in the elliptic plane. The surface area of is a strictly monotone increasing function of and . For our purpose it is more convenient to view it as a strictly monotone decreasing function of the variables and .
3.1. The area function.
We compute the area for the normal form (2) of the matrix . The upper half of the unit sphere can be parametrized as
(5) |
The points inside belong to parameter values related by
(6) |
By integrating the area element of (5) we obtain the area of the conic as
(7) |
The integral representation (7) is perfectly suitable for our purposes so that we refrain from expressing the area in terms of elliptic integrals. Substituting and into (7) we obtain the area in terms of the eigenvalues of the matrix :
(8) |
The matrix is determined by the conic only up to a scalar factor. Thus, we may normalize it such that . Then the area becomes
(9) |
3.2. Convexity of the area function
We prove that the function (9) is strictly convex for , . The standard arguments of [15, 16] then imply uniqueness of the minimal enclosing conic among all conics with prescribed axes or prescribed center. These proofs are given later, in Section 4.
Lemma 1.
The area function (9) is strictly convex.
Proof.
We show that the Hessian of (9) is positive definite, that is, all its principal minors are positive. The upper left entry of equals
(10) |
where
(11) |
Clearly, the integral (10) is strictly positive. The determinant of equals
(12) |
By the Schwarz inequality we have
(13) |
with equality precisely if the integrands on the left are proportional. Since this is not the case, (12) is strictly positive as well. Hence, the Hessian of is positive definite and is strictly convex. ∎
4. Uniqueness results
We are aware of two essentially different methods for proving uniqueness of minimal circumscribed (or maximal inscribed) conics. One may consider the problem as an optimization task and derive sufficient conditions for the existence of a unique minimizer or maximizer. This is the approach of [8, 9, 10]. The second method of proof is indirect. Assuming existence of two minimizers (or maximizers in case of inscribed conics) and one shows existence of a further circumscribing (or inscribed) conic of smaller (or larger) size. This idea or variants of it can be found in [4, 11, 7, 15, 16]. In this article, we adopt it as well. In our setup, the equation of the conic is found as a convex combination of the respective equations of and :
Definition 2 (in-between conic).
Let and be two conics
(14) |
such that the matrices are indefinite and have precisely one negative eigenvalue . For we define the in-between conic to and as
(15) |
with
(16) |
We also use the symbolic notation . As long as and have a common interior, is a non-degenerate conic whose interior contains the common interior of and . In general, the unique negative eigenvalue of is different from (in fact larger than as the smallest eigenvalue is a concave function of ). This hinders the usage of (9) and accounts for most difficulties in the general proof of uniqueness. If the conics and have the same axes or the same center the situation is much simpler.
4.1. Coaxial and concentric conics
We call a subset of the elliptic plane bounded, if it is contained in a circle and we call it full-dimensional if it is not contained in a line. In this section we prove that any bounded, compact and full-dimensional subset of the elliptic plane can be enclosed by a unique conic of minimal area with prescribed axes or center. The proofs of uniqueness are simple and follow the general scheme outlined in [15]. Nonetheless, the concentric case constitutes the basis for the much deeper general uniqueness result in Section 4.2.
Theorem 3.
Let be a bounded, compact and full-dimensional subset of the elliptic plane. Among all conics with two given axes that contain there exists exactly one of minimal area.
Proof.
Existence is a direct consequence of compactness and boundedness of and continuity of the area function. In order to show uniqueness, assume and are two minimal conics with prescribed axes and circumscribing . Because is full-dimensional, both and are not degenerate. In a suitable coordinate frame we can describe them by diagonal matrices
(17) |
The in-between conic is then given by
(18) |
Because the area function (9) is strictly convex we have
(19) |
(the functions and are defined in (3) and (4), respectively). Hence, the area of is strictly smaller than that of and — a contradiction to the assumed minimality of and . ∎
Uniqueness of minimal enclosing conics among all conics with prescribed center follows again from the strict convexity of (9) and
Proposition 4 (Davis’ Convexity Theorem).
A convex, lower semi-continuous and symmetric function of the eigenvalues of a symmetric matrix is (essentially strict) convex on the set of symmetric matrices if and only if its restriction to the set of diagonal matrices is (essentially strict) convex.
A proof for the convex case is given in [5]. The extension to essentially strict convexity is due to [13]. We skip the technicalities related to the precise definition of “essentially strict convexity”. All prerequisites are met in our case and all necessary conclusions can be drawn.
Theorem 5.
Let be a bounded, compact and full-dimensional subset of the elliptic plane. Among all conics with given center that contain there exists exactly one of minimal area.
4.2. The general case
Now we come to the general case. Here, we cannot make use of Davis’ Convexity Theorem since the negative eigenvalue of the matrix is different from and the area can no longer be regarded as convex function in the positive eigenvalues of . In fact, there exist situations where
(21) |
for all in-between conics . We present an example of this:
Example 6.
Let and be two congruent conics described by
(22) |
where , , are the rotation matrices
(23) |
The two conics are congruent (hence of equal area) and have a non-empty common interior. Figure 3, left, displays them together with a few in-between conics. Figure 3, right, shows a plot of the area function of on the interval . We see that the area of any in-between conic is larger than .
Example 6 illustrates the difficulties we have to expect when proving uniqueness results for non concentric conics in the elliptic plane. Additional assumptions on the enclosed set are inevitable at least for our method of proof which is based on in-between conics of Definition 2.


The behaviour illustrated in Example 6 is in contrast to the situation in the Euclidean plane, where a convexity property of the size function similar to Lemma 1 guarantees that the in-between ellipsoids can be translated so that they are completely contained in or (the “Translation Lemma 6” of [15]). In particular, the size of every in-between ellipsoid is strictly smaller than the size of and (for any reasonable size function). An important observation is that the conics and in Example 6 are rather large and “far away” from a pair of Euclidean conics. Thus, one might hope that uniqueness via in-between conics can be shown for sufficiently small conics. This is indeed the case. A precise formulation is given below. It requires an auxiliary result:
Lemma 7.
The function
(24) |
is strictly monotone increasing in . In particular, it has precisely one zero in this interval.
Proof.
Denote the first integral in (24) by and the second by . Clearly, is strictly monotone increasing in because the integrand and the upper integration bound are strictly monotone increasing. The integrand of is negative. Thus, increasing the lower integration bound will also increase the integral. Moreover, the second integrand is strictly monotone increasing in as well. In order to see this, we compute its first derivative with respect to :
(25) |
The denominator is positive, the numerator is strictly monotone increasing in and, for , attains the positive value . Thus, the derivative is positive. This implies that the integrand of is strictly monotone increasing and the same is true for the function defined in (24). ∎
Theorem 8.
Denote the unique zero of in by and let . The enclosing conic of minimal area of a compact subset of the elliptic plane is unique if the following two conditions are met:
-
(1)
The elliptic convex hull of contains a circle of radius . In particular, is full-dimensional.
-
(2)
There exists an enclosing conic of whose area is less than , computed by means of Equation (7).
Note that the requirements of this theorem imply restrictions on the set and all candidates for enclosing conics of minimal area:
-
•
The diameter of is less than , that is, is bounded by a fixed value derived from the function .
-
•
Any enclosing conic has a minor semi-axis lengths and any minimal enclosing conic has a major semi-axis length . In other words, if we insert the value into the function , the result is positive.
The basic idea of the proof is not different from the proofs of Theorems 3 and 5 but the details are more involved. Existence of the minimal enclosing conic follows from the usual compactness argument. In order to prove uniqueness, we assume existence of two conics and of minimal area that contain . Note that their minor semi-axis length is not smaller than and their major semi-axis lengths is smaller than . We show existence of an in-between conic such that . This we do by proving that is strictly monotone decreasing in the vicinity of (possibly after interchanging and ). Thus, we obtain a contradiction to the assumed minimality of and . In order to show that is strictly monotone decreasing in the vicinity of , we compare the derivative of the area function with respect to to the derivative of the area function in a suitably constructed case with concentric conics (Lemma 9). The details of this proof span until the end of this section. Auxiliary results of technical nature are proved in the appendix.
4.2.1. Assumptions on the semi-axis lengths
For , we denote the matrix describing the conic by . Its eigenvalues are and . It is no loss of generality to make a few assumptions on these values:
If and , equality of areas of and implies . In this case both conics are congruent circles with two real intersection points , . There exists a circle with and as end-points of a diameter which also contains the common interior of and . It is smaller than and and thus contradicts the assumed minimality of these conics. Henceforth, we exclude equality of all four positive eigenvalues of and . Then equality of areas of and implies that these eigenvalues can be nested (possibly after interchanging and ) according to
(26) |
4.2.2. Derivative of the area function
As already mentioned, a contradiction to the assumed minimality of and arises if we can show that
(27) |
The advantage of this “local” approach is that the derivative (27) can be computed from the derivatives of the eigenvalues and with respect to and that these derivatives do not require explicit expressions of the eigenvalues as functions of .
We assume that is of the normal form (2) and is obtained from a conic in this normal form by a rotation about an axis through the center of , that is,
(28) |
with the rotation matrix
(29) |
and . The rotation angle is given by , the axis direction is . The matrix of the in-between conic is computed according to (16). Its ordered eigenvalues are functions of and in the vicinity of we have . The eigenvalues are implicitly defined as roots of the characteristic polynomial of , being the three by three identity matrix. We know the values of these roots for :
(30) |
By implicit derivation we have
(31) |
which gives us the derivatives of the three eigenvalues of at . Furthermore, we can compute
(32) |
and, using the chain rule
(33) |
we find
(34) |
where
(35) |
and are the entries of the rotation matrix (29). Equation (34) expresses the derivative of the area function with respect to at in terms of the two initially given conics and . It will be convenient to write (34) in terms of the first and second complete elliptic integrals
(36) |
Since we will evaluate them only at
(37) |
we use the abbreviations and . By (26), is always real.
Substituting into (34) and noting that we can express the derivative of the area function in terms of elliptic integrals:
(38) |
4.2.3. The half-turn lemma
From the proof of Theorem 5 we already know that (38) is negative if and are concentric. We show negativity in the general case by comparison with a concentric situation. This is a direct consequence of the “Half-Turn Lemma” below. The basic idea already occurred in [15] in form of a “Translation Lemma”.
Lemma 9 (Half-Turn Lemma).
Consider three conics , , of equal area and with major semi-axis lengths smaller than as defined in Theorem 8. Assume that
-
•
and are concentric, and
-
•
is obtained from by a half-turn, that is, a rotation through an angle of .
Then the area of is smaller than the area of , at least in the vicinity of .
In order to prove Lemma 9 it is sufficient to compare the derivatives of the area of and with respect to at . Computing these derivatives is easily accomplished by substituting appropriate values for the entries of the matrix (29) into (38):
The conic can be obtained from a conic in normal form (2) by a rotation about through an angle . We can compute the corresponding matrix as in (28) with suitable entries chosen for the matrix in (29). Substituting these values into Equation (38) yields
(39) |
where
(40) |
The conic is obtained by a half-turn from about the rotation axis defined by the unit vector . The point can be chosen as one of the two mid-points of the centers of and . It is no loss of generality to assume since otherwise we take the second mid-point. In particular, we can always assume
(41) |
The matrix in (29) is the product of the rotation matrix about through and a half-turn rotation matrix about the unit vector . Substituting according entries into Equation (34) yields
(42) |
with , , , and as in (40).
Now we are going to prove the inequality
(43) |
under the additional assumption
(44) |
This indeed holds true: follows from , is a consequence of (26), will be shown in Lemma 13 and in Lemma 14 and Lemma 15.
We substitute , that is, , , in
(45) |
to obtain a rational expression in . Clearing the (positive) denominator, we arrive at a polynomial of degree four in . We have to show that is strictly negative on . For that purpose we use a typical technique and write
(46) |
where is the -th Bernstein polynomial of degree four. Because of and , is a convex combination of the Bernstein coefficients , …, . Hence, the polynomial is certainly negative on if we can show that no Bernstein coefficient is positive and at least one is negative. The Bernstein coefficients are:
(47) |
Because of , , and it follows that is not positive. It equals zero if and only if which is only possible in the concentric case and therefore can be excluded. Thus, is negative.
(48) |
Because of , , and neither the first nor the second row of (48) is positive. In Lemma 16 we show that the third row is not positive either. Thus, , as required.
(49) |
The non-positivity of is shown similar to that of .
(50) |
The non-positivity of the last row is shown in Lemma 16. The non-positivity of the first and second row is shown in Lemma 17.
(51) |
We show the non-positivity of the second and third row in Lemma 17.
5. Minimal enclosing conics of line-sets
As a final result, we would like to present the elliptic counter-part of the uniqueness theorem of [14] for minimal enclosing hyperbolas in the Euclidean plane. The perfect duality between points and lines in the elliptic plane allows to derive this result without additional work as simple corollary to Theorems 3, 5, and 8.
The definition of a measure for a set of lines that is invariant with respect to elliptic transformations is straightforward. The key-ingredient is the absolute polarity. We describe it for the bundle model of the elliptic plane. Here, a straight line is a plane through the center of . The plane normal defines a point which is called the absolute pole of . Conversely, is the absolute polar of . We write and . The measure of a line-set is defined as the area of the absolute poles of lines in :
(52) |
A conic is said to contain a set of straight lines if every member has at most one real intersection point with . In this sense, one may ask for the enclosing conic of minimal size with respect to the measure (Figure 4). As corollary to Theorem 8 we can state
Corollary 10.
Let be a set of lines such that its polar set satisfies the requirements of Theorem 3. Among all conics with two given axes that contain there exists exactly one of minimal measure.
Corollary 11.
Let be a set of lines such that its polar set satisfies the requirements of Theorem 5. Among all conics with given center that contain there exists exactly one of minimal measure.
Corollary 12.
Let be a compact set of lines that is contained in a circle of radius . Assume there exists an enclosing conic of whose measure is larger than the measure for the set of lines contained in a conic of semi-axes lengths and . Then the enclosing conic of minimal measure to the line set is unique.



6. Conclusion
We have proved uniqueness of the enclosing conic of minimal area in the elliptic plane. If the minimizer is sought within a set of conics with prescribed axes or center, it is unique at any rate (Theorem 3 and Theorem 5). In the most general setting we can show uniqueness only under additional assumptions on the enclosed set (Theorems 8). In particular, must be contained in a circle of radius . Given the fact that the diameter of the elliptic plane is , the bounds on the size of seem acceptable for many applications. The question whether the conditions on can be relaxed remains open. Example 6 on Page 6 shows that the method of in-between conics is not capable of proving uniqueness without additional constraints on .
Open questions in the area of extremal quadrics are numerous. Starting from this article it would be natural to consider uniqueness results for size functions different from the area and uniqueness of maximal inscribed conics, generalizations to higher dimensions and other non-Euclidean geometries, for example the hyperbolic plane.
Appendix A Proofs of auxiliary results
In this appendix we prove technical results which are needed in the proofs of our main theorems but are probably of little interest otherwise.
Lemma 13.
For as defined in (40) we have .
Proof.
Lemma 14.
For as defined in (40) we have .
Proof.
We view and as functions of and and show that the inequality holds for every -parameter line. For (which we generally exclude, see Subsection 4.2.1) we have . Therefore, the function vanishes for . The same is true for its derivative with respect to which can be computed as
(54) |
If we can show that is strictly concave in on we may also conclude for . The second partial derivative with respect to reads
(55) |
We have to show that it is negative for . Because of we have
(56) |
By subtracting (56) from (55) we see that
(57) |
is sufficient for the negativity of (55). Moreover, we have so that it enough to show
(58) |
Clearly the inequality
(59) |
holds true. Subtracting (59) from (58), we arrive at
(60) |
We write in its integral form
(61) |
and observe that the factor before the integral is negative while the denominator of the integrand is positive. Moreover, the numerator of the integrand is linear in . For it equals and for it equals . Thus, it is positive for . We conclude that (57) holds true. Hence, the -parameter lines of are strictly concave so that indeed . ∎
Lemma 15.
If (this is implied by the assumptions of Theorem 8) we have .
Proof.
We show that . Because of this implies . We have
(62) |
This expression is not negative if and only if
(63) |
Writing and in their integral forms we get
(64) |
where is given by (37). We have to show that is not negative. This is obviously true for because then the integrand is positive for . But we can do even better. Assume and denote by the unique root of the integrand. We split the integral (64) into a positive and a negative part where
(65) |
and
(66) |
Since is monotone increasing in we have
(67) |
Using this we find
(68) |
Thus, we can estimate
(69) | ||||
This allows to discuss the non-negativity of
(70) |
instead of . But this is guaranteed by the Theorem’s assumptions (compare with Equation (24)). ∎
Lemma 16.
Under the assumptions and (41) () we have
(71) |
Proof.
Lemma 17.
Under the assumptions and (41) () we have
(73) |
Proof.
Acknowledgments
The authors gratefully acknowledge support of this research by the Austrian Science Foundation FWF under grant P21032 (Uniqueness Results for Extremal Quadrics).
References
- Barequet and Elber [2005] G. Barequet and G. Elber. Optimal bounding cones of vectors in three dimensions. Inform. Process. Lett., 93(2):83–89, 2005.
- Behrend [1937] F. Behrend. Über einige Affininvarianten konvexer Bereiche. Math. Ann., 113:712–747, 1937.
- Behrend [1938] F. Behrend. Über die kleinste umbeschriebene und die größte einbeschriebene Ellipse eines konvexen Bereiches. Math. Ann., 115:397–411, 1938.
- Danzer et al. [1957] L. Danzer, D. Laugwitz, and H. Lenz. Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden. Arch. Math., 8(3):214–219, 1957.
- Davis [1957] Ch. Davis. All convex invariant functions of Hermitian matrices. Arch. Math., 8(4):276–278, 1957.
- Firey [1964] W. J. Firey. Some applications of means of convex bodies. Pacific J. Math., 14(1):53–60, 1964.
- Gruber [2008] P. M. Gruber. Application of an idea of Voronoi to John type problems. Adv. in Math., 218(2):309–351, 2008.
- John [1948] F. John. Studies and essays. Courant anniversary volume, chapter Extremum problems with inequalities as subsidary conditions, pages 187–204. Interscience Publ. Inc., New York, 1948.
- Juhnke [1990] F. Juhnke. Volumenminimale Ellipsoidüberdeckungen. Beitr. Algebra Geom., 30:143–153, 1990.
- Juhnke [1994] F. Juhnke. Embedded maximal ellipsoids and semi-infinite optimization. Beitr. Algebra Geom., 35(2):163–171, 1994.
- Klartag [2004] B. Klartag. On John-type ellipsoids. In Geometric Aspects of Functional Analysis, Lecture Notes in Mathematics, pages 149–158. Springer, Berlin, Heidelberg, 2004.
- Lawson [1965] C. Lawson. The smallest covering cone or sphere. SIAM Rev., 7(3):415–417, 1965.
- Lewis [1996] A. S. Lewis. Convex analysis on the Hermitian matrices. SIAM J. Optim., 6(1):164–177, 1996.
- Schröcker [2007] H.-P. Schröcker. Minimal enclosing hyperbolas of line sets. Beitr. Algebra Geom., 48(2):367–381, 2007.
- Schröcker [2008] H.-P. Schröcker. Uniqueness results for minimal enclosing ellipsoids. Comput. Aided Geom. Design, 25(9):756–762, 2008.
- Weber and Schröcker [2010] M. J. Weber and H.-P. Schröcker. Davis’ convexity theorem and extremal ellipsoids. Beitr. Algebra Geom., 51(1):263–274, 2010.