A couple of years ago, I came up with the following question, to which I have no answer to this day. I have asked a few people about this, most of my teachers and some friends, but no one had ever heard of the question before, and no one knew the answer.
I hope this is an original question, but seeing how natural it is, I doubt this is the first time someone has asked it.
First, some motivation. Take P any nonzero complex polynomial. It is an easy and classical exercise to show that the roots of its derivative P′ lie in the convex hull of its own roots (I know this as the Gauss-Lucas property). To show this, you simply write P=a⋅∏ri=1(X−αi)mi where the αi (i=1,…,r) are the different roots of P, and mi the corresponding multiplicities, and evaluate P′P=∑imiX−αi on a root β of P′ which is not also a root of P. You'll end up with an expression of β as a convex combination of α1,…,αr. It is worth mentioning that all the convex coefficients are >0, so the new root cannot lie on the edge of the convex hull of P's roots.
Now fix P a certain nonzero complex polynomial, and consider Π, its primitive (antiderivative) that vanishes at 0: Π(0)=0 and Π′=P. For each complex ω, write Πω=Π−ω, so that you get all the primitives of P. Also, define for any polynomial Q, Conv(Q), the convex hull of Q's roots.
MAIN QUESTION: describe Hull(P)=⋂ω∈CConv(Πω).
By the property cited above, Hull(P) is a convex compact subset of the complex plane that contains Conv(P), but I strongly suspect that it is in general larger.
Here are some easy observations:
replacing P (resp. Π) by λP (resp. λΠ) will not change the result, and considering P(aX+b) will change Hull(P) accordingly. Hence we can suppose both P and Π to be monic. The fact that Π is no longer a primitive of P is of no consequence.
the intersection defining Hull(P) can be taken for ω ranging in a compact subset of C: as |ω|→∞, the roots of Πω will tend to become close to the (deg(P)+1)-th roots of ω, so for large enough ω, their convex hull will always contain, say, Conv(Π).
Hull(P) can be explicitly calculated in the following cases: P=Xn, P of degree 1 or 2. There are only 2 kinds of degree 2 polynomials: two simple roots or a double root. Using z→az+b, one only has to consider P=X2 and P=X(X−1). The first one yields {0}, which equals Conv(X2), the second one gives [0,1]=Conv(X(X−1)).
Also, if Π is a real polynomial of odd degree n+1 that has all its roots real and simple, say λ1<μ1<λ2<⋯<μn<λn+1, where I have also placed P's roots μ1,…,μn, and if you further assume that Π(μ2j)≤Π(μn)≤Π(μ1)≤Π(μ2j+1) for all suitable j (a condition that is best understood with a picture), then Hull(P)=Conv(P)=[μ1,μn]: just vary ω between [Π(μn),Π(μ1)]; the resulting polynomial Πω is always split over the real numbers and you get
[μ1,μn]=Conv(P)⊂Hull(P)⊂Conv(ΠΠ(μ1))∩Conv(ΠΠ(μn))==[μ1,…]∩[…,μn]=[μ1,μn]
- The equation Πω(z)=Π(z)−ω=0 defines a Riemann surface, but I don't see how that could be of any use.
Computing Hull(P) for the next most simple polynomial P=X3−1 has proven a challenge, and I can only conjecture what it might be.
Computing Hull(X3−1) requires factorizing degree 4 polynomials, so one naturally tries to look for good values of ω, the ω that allow for easy factorization of Πω=X4−4X−ω---for instance, the ω that produces a double root. All that remains to be done afterwards is to factor a quadratic polynomial. The problem is symmetric, and you can focus on the case where 1 is the double root (i.e., ω=−3). Plugging in the result in the intersection, and rotating twice, you obtain the following superset of Hull(X3−1): a hexagon that is the intersection of three similar isoceles triangles with their main vertex located on the three third roots of unity 1,j,j2
QUESTION: is this hexagon equal to Hull(X3−1)?
Here's why I think this might be.
Consider the question of how the convex hulls of the roots of Πω vary as ω varies. When ω0 is such that all roots of Πω0 are simple, then the inverse function theorem shows that the roots of Πω with ω in a small neighborhood of ω0 vary holomorphically ∼ linearly in ω−ω0: z(ω)−z(ω0)∼ω−ω0. If however ω0 is such that Πω0 has a multiple root z0 of multiplicity m>1, then a small variation of ω about ω0 will split the multiple root z0 into m distinct roots of Πω that will spread out roughly as z0+c(ω−ω0)1m, where c is some nonzero coefficient. This means that for small variations, these roots will move at much higher velocities than the simple roots, and they will constitute the major contribution to the variation of Conv(Πω); also, they spread out evenly, and (at least if the multiplicity is greater or equal to 3) they will tend to increase the convex hull around z0. Thus it seems not too unreasonable to conjecture that the convex hull Conv(Πω) has what one can only describe as critical points at the ω0 that produce roots with multiplicities. I'm fairly certain there is a sort of calculus on convex sets that would allow one to make this statement precise, but I don't know see what it could be.
Back to X3−1: explicit calculations suggest that up to second order, the double root 1 of X4−4X+3−h for |h|<<1 splits in half nicely (here ω=−3+h), and the convex hull will continue to contain the aforementioned hexagon.
QUESTION (Conjecture): is it true that Hull(P)=⋂ω∈MRConv(Πω), where MR is the set of all ω0 such that Πω0 has a multiple root, i.e., the set of all Π(αi) where the αi are the roots of P?
All previous examples of calculations agree with this, and I have tried as best I can to justify this guess heuristically.
Are you aware of a solution? Is this a classical problem? Is anybody brave enough to make a computer program that would compute some intersections of convex hulls obtained from the roots to see if my conjecture is valid?