WorksMathematics
The Koebe radius for univalent cubics
Abstract
Let be a polynomial univalent in the unit disk . We determine the largest disk centered at the origin that is contained in the image of every such polynomial. Its squared radius is the unique real root of We also find the extremal polynomial .
Let denote the class of functions that are analytic and univalent (one-to-one) in the unit disk of the complex plane, normalized by the conditions , . Thus
In his 1907 paper on the uniformization of analytic curves, Koebe proved that there is a number , independent of , such that
is contained in for every [9]. This estimate was needed to prevent normalized univalent maps from degenerating in a limiting construction for the general uniformization problem [9]. Koebe conjectured that the exact value is and that an extremal function is
which maps conformally onto the slit plane .
Bieberbach proved this result in 1916 by deriving it from the sharp coefficient estimate [2] (see also [8 Chapter 2]). In the same paper, Bieberbach formulated his celebrated conjecture , , for every function in , with the Koebe function as an extremal function.
This conjecture shaped much of the subsequent development of univalent function theory in the twentieth century and was finally proved by Louis de Branges. His proof was published in 1985 [5].
To the best of our knowledge, univalent polynomials were first studied systematically by Alexander in his fascinating 1915 paper [1]. He related univalence to the locations of the zeros of a polynomial and its derivative and established several sufficient conditions for univalence.
Much of the subsequent work on normalized univalent polynomials concentrated on the coefficient problem, in the spirit of the Bieberbach conjecture. In particular, in 1969 Suffridge [11] constructed a family of polynomials from whose coefficients tend to those of the Koebe function (2).
The general problem of describing the coefficient regions of univalent polynomials appears to be extremely difficult and seems unlikely to admit a tractable description. For polynomials of low degree, however, such a description is possible. In particular, Brannan in 1967 [3], and independently Cowling and Royster in 1968 [4], described all complex pairs for which
is univalent; see also the later account of Rahman and Waniurski [10 Introduction].
A normalized rotation of is the polynomial , where is real. We have and , so the largest origin-centered disk in the image has the same radius. The cubic coefficient becomes . Choosing so that this coefficient equals , we may write
where and are real. Then Brannan’s criterion [3] says that is univalent in if and only if
and, for every with omitted when ,

Figure 1. The coefficient body of normalized univalent cubic polynomials.
For each satisfying (4), let be the region of admissible coefficients . It is the intersection of the ellipses in (5) for , with omitted when . At the inequality holds identically. A direct calculation shows that, for , this intersection is itself an ellipse; when , it is a circle. For , no single ellipse determines the intersection: its boundary consists of an arc of the ellipse corresponding to and the envelope of a nontrivial subfamily of (5), as in Figure 2. When , letting forces ; the remaining inequalities give the segment .

Figure 2. One half of the section of the coefficient body at .
Brannan’s criterion immediately gives
and the cubic Suffridge polynomial
maximizes both coefficient moduli [3, 4, 11]. Thus the coefficient problem for cubic polynomials was completely solved.
To the best of our knowledge, Dimitrov first posed a polynomial analogue of Koebe’s one-quarter theorem in 2002 [6]. Namely, for each , determine the largest disk centered at the origin that is contained in for every polynomial of degree . He suggested that the Suffridge polynomials might be extremal. We call the extremizers in Dimitrov’s problem Koebe polynomials.
For a Suffridge polynomial , let denote the radius of the largest origin-centered disk contained in . For the cubic Suffridge polynomial above, a direct calculation gives

Figure 3. The image of the cubic Suffridge polynomial and a magnification of the boxed region.
In 2019, Dmitrishin, Dyakonov and Stokolos proved [7 Theorem 5.1] that the Koebe radius for cubic polynomials from with real coefficients is
and that a Koebe polynomial in this subclass is

Figure 4. The image of the real Koebe polynomial and a magnification of the boxed region.
Since , this result shows that the cubic Suffridge polynomial is not a Koebe polynomial even within the subclass of polynomials with real coefficients. The Koebe problem for the full class of univalent cubic polynomials with complex coefficients remained open.
In this paper we determine the Koebe radius for cubic polynomials from and construct a cubic polynomial attaining it.

Figure 5. The image and a magnification of the boxed region.
The exact value of is given in Theorem 1. In particular, , where is the Koebe radius for univalent cubic polynomials. One critical point of lies on , while the other lies outside . The image of the boundary critical point is a cusp of and lies on .
Before stating and proving the theorem, we describe the main ideas that lead to the solution. For each univalent cubic , the largest disk centered at the origin and contained in has radius
For in the form (3), we have on the unit circle. The curve traced by is centrally symmetric, so
Since , as ranges over the unit circle, describes the boundary of the ellipse
we obtain
For fixed , we therefore seek the point of nearest to , and then minimize the resulting distance over .
Thus finding the sharp Koebe radius and the extremal polynomial reduces to minimizing the distance between the region of admissible second coefficients and the boundary of the ellipse determined by the third coefficient .
For , the ellipse corresponding to in Brannan’s family contains . Comparing with gives the uniform estimate
This lower bound already exceeds the Koebe radius attained in the second range.
For , we obtain the exact distance. Both estimates apply at . Two ellipses in Brannan’s family, corresponding to and , meet at a corner of . A positive linear combination of their defining quadratic forms gives an ellipse that contains and passes through . The shortest segment from to can be taken to start at , so
The case follows by a limit. Minimizing the distance over gives the extremal parameter and the radius .
Theorem 1. Let
be univalent in . Then
where is the unique real root of
Namely,
The radius is sharp: there exists an extremizer such that for every . Up to normalized rotations and complex conjugation, this extremizer is unique and is given by
where
Proof. By (8), it suffices to estimate the distance from to for each . First suppose that . The inequality at gives , where
as illustrated in Figure 6.

Figure 6. The coefficient region and its containing ellipse for , together with a magnification of the boxed region.
We now have to estimate the distance from to . The ellipses and are concentric and have the same axes, but they are not confocal when . Consequently, a shortest segment joining them need not lie on the -axis. In fact, it lies on this axis precisely when (see Figure 7).

Figure 7. The three nested ellipses for and . The middle ellipse is , while is the level region . The double arrow from has length .
This distance can be studied in two ways. The first is to construct parallel supporting lines to the two ellipses and minimize the distance between them over the direction of their common normal. We take the second route and introduce an intermediate family of auxiliary ellipses . This method gives the required uniform estimate directly and will also be useful in the second case, where .
Denote the semiaxes of by
Then every point of can be written as
Fix a point . We now use the completion-of-squares argument underlying the Lagrange multiplier equations for this constrained nearest-point problem. For every different from both and , and every , the identity
holds, where
The two squares in (11) vanish simultaneously precisely when
In this case, is the corresponding Lagrange multiplier. If , then both coefficients of the squares in (11) are positive. Hence
Equality holds precisely when (13) holds. Thus, for every and every satisfying ,
The identity (11), together with the equality condition (13), will be used not only to estimate this distance from below but also later to identify the critical point.
Our task is now to obtain a uniform lower bound for the distance in (15) as ranges over the ellipse . For this purpose, we choose and so that
In other words, a level ellipse of must coincide with . Matching the semiaxes requires
For , these equations give
and the same choice works when . Thus, for the chosen , every satisfies . Hence, by (15),
Now let . We seek a sharp bound for this fixed . The point where the arc of the ellipse meets the envelope of Brannan’s family is a natural candidate for the minimum; see Figure 8.

Figure 8. The coefficient region , the two members of Brannan’s family corresponding to and , and the auxiliary ellipse constructed below. Their boundaries meet at the corner point .
Our next task is to find the two ellipses in Brannan’s family whose boundaries meet at the corner point . One ellipse is already known: it corresponds to . The second is unknown; denote its parameter by . This second ellipse must not merely pass through , but must generate the envelope of the family at that point. Writing , put
Thus is the boundary of the ellipse with parameter . We must therefore find , , satisfying the three conditions
We first solve the two envelope equations
Since
solving for and gives
We now impose the remaining condition . Direct substitution gives
The root gives the ellipse already known, whereas
when . Hence the only parameter of a distinct ellipse in Brannan’s family is
Here . Setting in the envelope formulas gives the first-quadrant intersection of the two ellipses:
Both radicals have positive arguments on the interval under consideration.
To check that satisfies every inequality in (5), put , and
This is a quartic with leading coefficient . By construction it vanishes at and has a double zero at . Since ,
where the last inequality follows from . Thus on . Since there, and is univalent.
We now determine the distance from to . We choose and so that both squares in (11) vanish. This gives equality in (15) at . We then show that for every , so minimizes the distance over .
The equality shows that
satisfy . Thus lies on . We choose so that the Lagrange equations (13) hold for and . The first equation gives
and the second gives the same value. Indeed,
Both quantities are positive when . Hence the two squares in (11) vanish at .
It remains to prove that is largest on at . For , denote the left-hand side of Brannan’s inequality by
Every point of satisfies , while . We shall express as a positive linear combination of and . Such a representation immediately gives the desired maximum at .
Write . Both coefficients of each form are positive, so the required combination exists precisely when
Substituting from (17) gives
The first difference is positive for . The numerator of the second equals at and increases for . Thus for we can choose positive such that
The lower threshold for both weights to be positive is , just below . At this value and the weight of vanishes.
Set . Since both Brannan inequalities are equalities at , we have . Hence
and equality forces both Brannan inequalities to be equalities. Thus the ellipse
contains and touches it at , as shown in Figure 8. Combining this inclusion with (15) gives
At , the two squares in (11) vanish at , so equality holds. Hence is extremal for this fixed value of .
It remains to compute the distance. Since ,
Recalling that and substituting from (18), we obtain the exact squared radius for this fixed :
At , apply the bound to , whose third coefficient is . Uniform convergence on the unit circle as gives , with equality for .
It remains to minimize for . Differentiation gives
The polynomial in the numerator is strictly increasing for and has opposite signs at and . Hence it has a unique zero in this interval, determined by
The sign of shows that decreases before and increases after it. Thus is the unique minimum.
Put . Reducing this expression by (20) gives
Substitution in (20), followed by clearing the denominator, gives
Moreover,
so is the unique real zero of . Consequently,
Thus . For , the preceding lower bound is strictly larger than , since
The inequality is also strict at , since . Writing , the identity
then gives
Putting reduces to
which yields (10).
Finally, if , the strict bounds at and and the unique minimum of force . At a nearest point of , both squares in (11) must vanish and . Hence
These two equations are linear in , . Their coefficient ratios and are distinct, so their only solution is , . The normalized rotation changes to ; conjugation changes to . Together they give all four choices of signs.
To locate the cusp of , take and put . Then , and the formulas for give . It follows that . The product of the two zeros of is , so the other critical point has modulus . Moreover, , hence . Write and . Then , , and . Since , (18) gives
Thus the quadratic and cubic terms in the Taylor expansion point in linearly independent directions, and has an ordinary cusp at .
Acknowledgement
The author is grateful to Dmitry Dmitrishin for drawing his attention to this problem. The author has also freely used results of mathematicians published in open sources, as well as various large language models.
Odesa Polytechnic National University, Odesa, Ukraine
Email address: [email protected]
References
- [1]J. W. Alexander, Functions which map the interior of the unit circle upon simple regions, Ann. of Math. (2) 17 (1915), no. 1, 12–22.DOI
- [2]L. Bieberbach, Über die Koeffizienten derjenigen Potenzreihen, welche eine schlichte Abbildung des Einheitskreises vermitteln, Sitzungsber. Preuss. Akad. Wiss. Berlin (1916), 940–955.
- [3]D. A. Brannan, Coefficient regions for univalent polynomials of small degree, Mathematika 14 (1967), 165–169.DOI
- [4]V. F. Cowling and W. C. Royster, Domains of variability for univalent polynomials, Proc. Amer. Math. Soc. 19 (1968), 767–772.DOI
- [5]L. de Branges, A proof of the Bieberbach conjecture, Acta Math. 154 (1985), 137–152.DOI
- [6]D. K. Dimitrov, Extremal positive trigonometric polynomials, in Approximation Theory: A Volume Dedicated to Blagovest Sendov, B. Bojanov, ed., DARBA, Sofia, 2002, 136–157.
- [7]D. Dmitrishin, K. Dyakonov and A. Stokolos, Univalent polynomials and Koebe’s one-quarter theorem, Anal. Math. Phys. 9 (2019), 991–1004.DOI
- [8]P. L. Duren, Univalent Functions, Grundlagen der mathematischen Wissenschaften 259, Springer-Verlag, New York, 1983.
- [9]P. Koebe, Über die Uniformisierung beliebiger analytischer Kurven, Nachr. Kgl. Ges. Wiss. Göttingen, Math.-Phys. Kl. (1907), 191–210.
- [10]Q. I. Rahman and J. Waniurski, Coefficient regions for univalent trinomials, Canad. J. Math. 32 (1980), 1–20.DOI
- [11]T. J. Suffridge, On univalent polynomials, J. London Math. Soc. 44 (1969), 496–504.DOI